Compiler.c 33 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207
  1. #include <setjmp.h>
  2. #include <stdarg.h>
  3. #include <stdio.h>
  4. #include <stdlib.h>
  5. #include <string.h>
  6. #include "Compiler.h"
  7. #include "DataType.h"
  8. #include "tokenizer/Tokenizer.h"
  9. #include "utils/Functions.h"
  10. #include "utils/Variables.h"
  11. #include "vm/Operation.h"
  12. #define ERROR_LENGTH 256
  13. #define RETURN_BUFFER 16
  14. #define BREAK_BUFFER 32
  15. static jmp_buf errorJump;
  16. static char error[ERROR_LENGTH] = {'\0'};
  17. static ByteCode* code;
  18. static int16 line = 1;
  19. static Variables vars;
  20. static Functions functions;
  21. static Functions functionQueue;
  22. static Structs structs;
  23. static int returns[RETURN_BUFFER];
  24. static int returnIndex = 0;
  25. static bool hasReturn = false;
  26. static DataType returnType;
  27. static int breaks[BREAK_BUFFER];
  28. static int breakIndex = 0;
  29. static int forWhileStack = 0;
  30. static int continueAt = 0;
  31. typedef struct {
  32. Operation intOp;
  33. Operation floatOp;
  34. Operation boolOp;
  35. const char* name;
  36. } TypedOp;
  37. static const TypedOp TYPED_MUL = {OP_MUL_INT, OP_MUL_FLOAT, OP_NOTHING, "*"};
  38. static const TypedOp TYPED_DIV = {OP_DIV_INT, OP_DIV_FLOAT, OP_NOTHING, "/"};
  39. static const TypedOp TYPED_MOD = {OP_MOD_INT, OP_NOTHING, OP_NOTHING, "%"};
  40. static const TypedOp TYPED_ADD = {OP_ADD_INT, OP_ADD_FLOAT, OP_NOTHING, "+"};
  41. static const TypedOp TYPED_SUB = {OP_SUB_INT, OP_SUB_FLOAT, OP_NOTHING, "-"};
  42. static const TypedOp TYPED_LESS = {OP_LESS_INT, OP_LESS_FLOAT, OP_NOTHING, "<"};
  43. static const TypedOp TYPED_LESS_EQUAL = {OP_GREATER_INT, OP_GREATER_FLOAT,
  44. OP_NOTHING, "<="};
  45. static const TypedOp TYPED_GREATER = {OP_GREATER_INT, OP_GREATER_FLOAT,
  46. OP_NOTHING, ">"};
  47. static const TypedOp TYPED_GREATER_EQUAL = {OP_LESS_INT, OP_LESS_FLOAT,
  48. OP_NOTHING, ">="};
  49. static const TypedOp TYPED_EQUAL = {OP_EQUAL_INT, OP_EQUAL_FLOAT, OP_EQUAL_BOOL,
  50. "=="};
  51. static const TypedOp TYPED_NOT_EQUAL = {OP_EQUAL_INT, OP_EQUAL_FLOAT,
  52. OP_EQUAL_BOOL, "!="};
  53. static const TypedOp TYPED_BIT_OR = {OP_BIT_OR, OP_NOTHING, OP_NOTHING, "|"};
  54. static const TypedOp TYPED_BIT_XOR = {OP_BIT_XOR, OP_NOTHING, OP_NOTHING, "^"};
  55. static const TypedOp TYPED_BIT_AND = {OP_BIT_AND, OP_NOTHING, OP_NOTHING, "&"};
  56. static const TypedOp TYPED_LEFT_SHIFT = {OP_LEFT_SHIFT, OP_NOTHING, OP_NOTHING,
  57. "<<"};
  58. static const TypedOp TYPED_RIGHT_SHIFT = {OP_RIGHT_SHIFT, OP_NOTHING,
  59. OP_NOTHING, ">>"};
  60. static void cError(const char* format, ...) {
  61. va_list args;
  62. va_start(args, format);
  63. vsnprintf(error, ERROR_LENGTH, format, args);
  64. va_end(args);
  65. longjmp(errorJump, 0);
  66. }
  67. static const char* cGetName(DataType dt) {
  68. return dtGetName(&structs, dt);
  69. }
  70. static void cInvalidOperation(DataType a, DataType b, const char* op) {
  71. cError("invalid operation: %s %s %s", cGetName(a), op, cGetName(b));
  72. }
  73. static void cNotDeclared(const char* name) {
  74. cError("variable %s has not been declared", name);
  75. }
  76. static void cDeclared(const char* name) {
  77. cError("%s has already been declared", name);
  78. }
  79. static void cTooMuchArguments() {
  80. cError("too much function arguments");
  81. }
  82. static void cUnexpectedToken(Token t) {
  83. cError("unexpected token on line %d: %s", line, tGetName(t));
  84. }
  85. static void cAddOperation(Operation token) {
  86. unsigned char c = token;
  87. bcAddBytes(code, &c, 1);
  88. }
  89. static int cReserveInt() {
  90. return bcReserveBytes(code, sizeof(int));
  91. }
  92. static void cSetInt(int p, int i) {
  93. bcSetBytes(code, p, &i, sizeof(int));
  94. }
  95. static void cAddInt(int i) {
  96. bcAddBytes(code, &i, sizeof(int));
  97. }
  98. static void cAddInt16(int16 i) {
  99. bcAddBytes(code, &i, sizeof(int16));
  100. }
  101. static Token cReadTokenAndLine() {
  102. Token t = tReadToken();
  103. if(tReadInt16(&line)) {
  104. return t;
  105. }
  106. return T_END;
  107. }
  108. static void cConsumeToken(Token wanted) {
  109. Token t = cReadTokenAndLine();
  110. if(wanted != t) {
  111. cError("unexpected token on line %d: expected '%s' got '%s'", line,
  112. tGetName(wanted), tGetName(t));
  113. }
  114. }
  115. static bool cConsumeTokenIf(Token t) {
  116. if(tPeekToken() == t) {
  117. cReadTokenAndLine();
  118. return true;
  119. }
  120. return false;
  121. }
  122. static void cConstantInt() {
  123. int value;
  124. if(!tReadInt(&value)) {
  125. cError("int token without an int on line %d", line);
  126. }
  127. cAddOperation(OP_PUSH_INT);
  128. cAddInt(value);
  129. }
  130. static void cConstantFloat() {
  131. float value;
  132. if(!tReadFloat(&value)) {
  133. cError("float token without a float on line %d", line);
  134. }
  135. cAddOperation(OP_PUSH_FLOAT);
  136. bcAddBytes(code, &value, sizeof(float));
  137. }
  138. static const char* cReadString() {
  139. int length;
  140. const char* literal = tReadString(&length);
  141. if(literal == NULL) {
  142. cError("literal without string on line %d", line);
  143. }
  144. return literal;
  145. }
  146. static DataType cExpression();
  147. static void cCallFunctionArguments(Function* f) {
  148. while(!cConsumeTokenIf(T_CLOSE_BRACKET)) {
  149. DataType dt = cExpression();
  150. if(fAddArgument(f, dt, &structs)) {
  151. cTooMuchArguments();
  152. }
  153. if(cConsumeTokenIf(T_COMMA) && tPeekToken() == T_CLOSE_BRACKET) {
  154. cUnexpectedToken(tPeekToken());
  155. }
  156. }
  157. }
  158. static DataType cCallFunction(const char* name) {
  159. cAddOperation(OP_PUSH_INT);
  160. cAddInt(0);
  161. Function f;
  162. fInit(&f, name, line);
  163. cCallFunctionArguments(&f);
  164. cAddOperation(OP_GOSUB);
  165. Function* found = fsSearch(&functions, &f);
  166. if(found == NULL) {
  167. cError("unknown function");
  168. }
  169. if(found->address == -1) {
  170. f.returnType = found->returnType;
  171. f.address = cReserveInt();
  172. fsAdd(&functionQueue, &f);
  173. } else {
  174. cAddInt(found->address);
  175. }
  176. cAddInt(found->size);
  177. return found->returnType;
  178. }
  179. static void cAddOffset(int offset) {
  180. if(offset > 0) {
  181. cAddOperation(OP_PUSH_INT);
  182. cAddInt(offset);
  183. cAddOperation(OP_ADD_INT);
  184. }
  185. }
  186. static DataType cLoadRef(Variable* v, Operation op, DataType dt, int offset) {
  187. cAddOperation(OP_LOAD_INT);
  188. cAddInt(v->address);
  189. cAddOffset(offset);
  190. cAddOperation(op);
  191. return dt;
  192. }
  193. static DataType cAddVariable(Operation op, Variable* v) {
  194. cAddOperation(op);
  195. cAddInt(v->address);
  196. return v->type;
  197. }
  198. static DataType cLoadVariable(Variable* v, Variable* sv) {
  199. DataType type = v->type;
  200. int offset = 0;
  201. if(dtIsStruct(type) && sv->type.type != DT_VOID) {
  202. sv->address += v->address;
  203. return cLoadVariable(sv, sv);
  204. } else if(dtIsStructRef(type)) {
  205. type = dtToReference(sv->type);
  206. offset = sv->address;
  207. }
  208. if(dtCompare(type, dtToReference(dtInt()))) {
  209. return cLoadRef(v, OP_REF_LOAD_INT, dtInt(), offset);
  210. } else if(dtCompare(type, dtToReference(dtFloat()))) {
  211. return cLoadRef(v, OP_REF_LOAD_FLOAT, dtFloat(), offset);
  212. } else if(dtCompare(type, dtToReference(dtBool()))) {
  213. return cLoadRef(v, OP_REF_LOAD_BOOL, dtBool(), offset);
  214. }
  215. switch(dtAsInt(v->type)) {
  216. case DT_INT: return cAddVariable(OP_LOAD_INT, v);
  217. case DT_BOOL: return cAddVariable(OP_LOAD_BOOL, v);
  218. case DT_FLOAT: return cAddVariable(OP_LOAD_FLOAT, v);
  219. case DT_STRUCT:
  220. {
  221. Struct* st = dtGetStruct(&structs, v->type);
  222. if(st == NULL) {
  223. cError("compiler struct error");
  224. }
  225. int address = v->address;
  226. for(int i = 0; i < st->amount; i++) {
  227. Variable v = {st->vars[i].name, st->vars[i].type, address};
  228. cLoadVariable(&v, sv);
  229. address += dtGetSize(v.type, &structs);
  230. }
  231. return v->type;
  232. }
  233. default:
  234. cError("cannot load type %s", cGetName(v->type));
  235. return dtVoid();
  236. }
  237. }
  238. static bool cStoreRef(Variable* v, Variable* sv, DataType should, DataType dt,
  239. Operation op) {
  240. DataType type = v->type;
  241. int offset = 0;
  242. if(dtIsStructRef(type)) {
  243. type = dtToReference(sv->type);
  244. offset = sv->address;
  245. }
  246. if(dtCompare(type, dtToReference(should)) && dtCompare(dt, should)) {
  247. cAddOperation(OP_LOAD_INT);
  248. cAddInt(v->address);
  249. cAddOffset(offset);
  250. cAddOperation(op);
  251. return true;
  252. }
  253. return false;
  254. }
  255. static void cStore(Variable* v, DataType dt, const char* name) {
  256. if(!dtCompare(v->type, dt)) {
  257. cInvalidOperation(v->type, dt, name);
  258. } else if(v->type.reference) {
  259. cAddOperation(OP_STORE_INT);
  260. cAddInt(v->address);
  261. return;
  262. }
  263. switch(dtAsInt(v->type)) {
  264. case DT_INT: cAddOperation(OP_STORE_INT); break;
  265. case DT_BOOL: cAddOperation(OP_STORE_BOOL); break;
  266. case DT_FLOAT: cAddOperation(OP_STORE_FLOAT); break;
  267. default:
  268. if(dtIsArray(v->type)) {
  269. cAddOperation(OP_STORE_ARRAY);
  270. } else {
  271. cError("cannot store type %s", cGetName(v->type));
  272. }
  273. }
  274. cAddInt(v->address);
  275. }
  276. static void cStoreVariable(Variable* v, Variable* sv, DataType dt,
  277. const char* name) {
  278. if(cStoreRef(v, sv, dtInt(), dt, OP_REF_STORE_INT) ||
  279. cStoreRef(v, sv, dtFloat(), dt, OP_REF_STORE_FLOAT) ||
  280. cStoreRef(v, sv, dtBool(), dt, OP_REF_STORE_BOOL)) {
  281. return;
  282. }
  283. if(dtIsStruct(v->type) && sv->type.type != DT_VOID) {
  284. sv->address += v->address;
  285. cStore(sv, dt, name);
  286. } else {
  287. cStore(v, dt, name);
  288. }
  289. }
  290. static DataType cPostChange(Variable* v, int change, const char* name) {
  291. if(!dtCompare(v->type, dtInt())) {
  292. cError("%s needs an int", name);
  293. }
  294. cAddOperation(OP_LOAD_INT);
  295. cAddInt(v->address);
  296. cAddOperation(OP_LOAD_INT);
  297. cAddInt(v->address);
  298. cAddOperation(OP_PUSH_INT);
  299. cAddInt(change);
  300. cAddOperation(OP_ADD_INT);
  301. cAddOperation(OP_STORE_INT);
  302. cAddInt(v->address);
  303. return dtInt();
  304. }
  305. static void cWalkStruct(Variable* v, Variable* sv) {
  306. sv->address = 0;
  307. sv->name = "";
  308. sv->type = dtVoid();
  309. if(!cConsumeTokenIf(T_POINT)) {
  310. return;
  311. }
  312. Struct* st = dtGetStruct(&structs, v->type);
  313. if(st == NULL) {
  314. cError("%s is not a struct but %s", v->name, cGetName(v->type));
  315. }
  316. cConsumeToken(T_LITERAL);
  317. const char* name = cReadString();
  318. if(vSearchStruct(sv, &structs, st, name)) {
  319. cError("%s has no member %s", v->name, name);
  320. }
  321. }
  322. static DataType cLiteral() {
  323. const char* literal = cReadString();
  324. if(cConsumeTokenIf(T_OPEN_BRACKET)) {
  325. DataType dt = cCallFunction(literal);
  326. if(dtCompare(dt, dtVoid())) {
  327. cError("function returns void");
  328. }
  329. return dt;
  330. }
  331. Variable* v = vSearch(&vars, literal);
  332. if(v == NULL) {
  333. cNotDeclared(literal);
  334. }
  335. Variable sv;
  336. cWalkStruct(v, &sv);
  337. if(cConsumeTokenIf(T_INCREMENT)) {
  338. return cPostChange(v, 1, "++");
  339. } else if(cConsumeTokenIf(T_DECREMENT)) {
  340. return cPostChange(v, -1, "--");
  341. }
  342. return cLoadVariable(v, &sv);
  343. }
  344. static DataType cBracketPrimary() {
  345. DataType result = cExpression();
  346. cConsumeToken(T_CLOSE_BRACKET);
  347. return result;
  348. }
  349. static DataType cAllocArray(DataType dt, Operation op) {
  350. cConsumeToken(T_OPEN_SQUARE_BRACKET);
  351. DataType index = cExpression();
  352. if(!dtCompare(index, dtInt())) {
  353. cError("array size must be an int");
  354. }
  355. cConsumeToken(T_CLOSE_SQUARE_BRACKET);
  356. cAddOperation(op);
  357. return dtToArray(dt, 1);
  358. }
  359. static DataType cPrimary() {
  360. Token t = cReadTokenAndLine();
  361. switch(t) {
  362. case T_CONST_INT: cConstantInt(); return dtInt();
  363. case T_CONST_FLOAT: cConstantFloat(); return dtFloat();
  364. case T_TRUE: cAddOperation(OP_PUSH_TRUE); return dtBool();
  365. case T_FALSE: cAddOperation(OP_PUSH_FALSE); return dtBool();
  366. case T_OPEN_BRACKET: return cBracketPrimary();
  367. case T_LITERAL: return cLiteral();
  368. case T_INT: return cAllocArray(dtInt(), OP_INT_ARRAY);
  369. default: cUnexpectedToken(t); return dtVoid();
  370. }
  371. }
  372. static DataType cPreChange(int change, const char* name) {
  373. cConsumeToken(T_LITERAL);
  374. const char* literal = cReadString();
  375. Variable* v = vSearch(&vars, literal);
  376. if(v == NULL) {
  377. cNotDeclared(literal);
  378. } else if(!dtCompare(v->type, dtInt())) {
  379. cError("%s needs an int", name);
  380. }
  381. cAddOperation(OP_LOAD_INT);
  382. cAddInt(v->address);
  383. cAddOperation(OP_PUSH_INT);
  384. cAddInt(change);
  385. cAddOperation(OP_ADD_INT);
  386. cAddOperation(OP_STORE_INT);
  387. cAddInt(v->address);
  388. cAddOperation(OP_LOAD_INT);
  389. cAddInt(v->address);
  390. return dtInt();
  391. }
  392. static DataType cPreUnary() {
  393. if(cConsumeTokenIf(T_SUB)) {
  394. DataType result = cPrimary();
  395. switch(dtAsInt(result)) {
  396. case DT_INT: cAddOperation(OP_INVERT_SIGN_INT); break;
  397. case DT_FLOAT: cAddOperation(OP_INVERT_SIGN_FLOAT); break;
  398. default: cError("cannot invert sign of %s", cGetName(result));
  399. }
  400. return result;
  401. } else if(cConsumeTokenIf(T_INCREMENT)) {
  402. return cPreChange(1, "++");
  403. } else if(cConsumeTokenIf(T_DECREMENT)) {
  404. return cPreChange(-1, "--");
  405. } else if(cConsumeTokenIf(T_NOT)) {
  406. int counter = 1;
  407. while(cConsumeTokenIf(T_NOT)) {
  408. counter++;
  409. }
  410. DataType result = cPrimary();
  411. if(!dtCompare(result, dtBool())) {
  412. cError("! needs a bool not %s", cGetName(result));
  413. }
  414. cAddOperation(OP_NOT);
  415. if((counter & 1) == 0) {
  416. cAddOperation(OP_NOT);
  417. }
  418. return dtBool();
  419. } else if(cConsumeTokenIf(T_BIT_NOT)) {
  420. DataType result = cPrimary();
  421. if(dtCompare(result, dtInt())) {
  422. cAddOperation(OP_BIT_NOT);
  423. } else {
  424. cError("~ needs an int not %s", cGetName(result));
  425. }
  426. return result;
  427. } else if(cConsumeTokenIf(T_BIT_AND)) {
  428. cConsumeToken(T_LITERAL);
  429. const char* literal = cReadString();
  430. Variable* v = vSearch(&vars, literal);
  431. if(v == NULL) {
  432. cNotDeclared(literal);
  433. }
  434. if(v->type.reference) {
  435. cAddOperation(OP_LOAD_INT);
  436. cAddInt(v->address);
  437. } else {
  438. cAddOperation(OP_VAR_REF);
  439. cAddInt(v->address);
  440. }
  441. return dtToReference(v->type);
  442. }
  443. return cPrimary();
  444. }
  445. static void cAddTypeOperation(DataType a, DataType b, const TypedOp* op) {
  446. if(dtCompare(a, dtInt()) && dtCompare(b, dtInt()) &&
  447. op->intOp != OP_NOTHING) {
  448. cAddOperation(op->intOp);
  449. } else if(dtCompare(a, dtFloat()) && dtCompare(b, dtFloat()) &&
  450. op->floatOp != OP_NOTHING) {
  451. cAddOperation(op->floatOp);
  452. } else if(dtCompare(a, dtBool()) && dtCompare(b, dtBool()) &&
  453. op->boolOp != OP_NOTHING) {
  454. cAddOperation(op->boolOp);
  455. } else {
  456. cInvalidOperation(a, b, op->name);
  457. }
  458. }
  459. static DataType cMul() {
  460. DataType a = cPreUnary();
  461. while(true) {
  462. if(cConsumeTokenIf(T_MUL)) {
  463. cAddTypeOperation(a, cPreUnary(), &TYPED_MUL);
  464. } else if(cConsumeTokenIf(T_DIV)) {
  465. cAddTypeOperation(a, cPreUnary(), &TYPED_DIV);
  466. } else if(cConsumeTokenIf(T_MOD)) {
  467. cAddTypeOperation(a, cPreUnary(), &TYPED_MOD);
  468. } else {
  469. break;
  470. }
  471. }
  472. return a;
  473. }
  474. static DataType cAdd() {
  475. DataType a = cMul();
  476. while(true) {
  477. if(cConsumeTokenIf(T_ADD)) {
  478. cAddTypeOperation(a, cMul(), &TYPED_ADD);
  479. } else if(cConsumeTokenIf(T_SUB)) {
  480. cAddTypeOperation(a, cMul(), &TYPED_SUB);
  481. } else {
  482. break;
  483. }
  484. }
  485. return a;
  486. }
  487. static DataType cShift() {
  488. DataType a = cAdd();
  489. while(true) {
  490. if(cConsumeTokenIf(T_LEFT_SHIFT)) {
  491. cAddTypeOperation(a, cAdd(), &TYPED_LEFT_SHIFT);
  492. } else if(cConsumeTokenIf(T_RIGHT_SHIFT)) {
  493. cAddTypeOperation(a, cAdd(), &TYPED_RIGHT_SHIFT);
  494. } else {
  495. break;
  496. }
  497. }
  498. return a;
  499. }
  500. static DataType cComparison() {
  501. DataType a = cShift();
  502. while(true) {
  503. if(cConsumeTokenIf(T_LESS)) {
  504. cAddTypeOperation(a, cShift(), &TYPED_LESS);
  505. a = dtBool();
  506. } else if(cConsumeTokenIf(T_LESS_EQUAL)) {
  507. cAddTypeOperation(a, cShift(), &TYPED_LESS_EQUAL);
  508. cAddOperation(OP_NOT);
  509. a = dtBool();
  510. } else if(cConsumeTokenIf(T_GREATER)) {
  511. cAddTypeOperation(a, cShift(), &TYPED_GREATER);
  512. a = dtBool();
  513. } else if(cConsumeTokenIf(T_GREATER_EQUAL)) {
  514. cAddTypeOperation(a, cShift(), &TYPED_GREATER_EQUAL);
  515. cAddOperation(OP_NOT);
  516. a = dtBool();
  517. } else {
  518. break;
  519. }
  520. }
  521. return a;
  522. }
  523. static DataType cEqual() {
  524. DataType a = cComparison();
  525. while(true) {
  526. if(cConsumeTokenIf(T_EQUAL)) {
  527. cAddTypeOperation(a, cComparison(), &TYPED_EQUAL);
  528. a = dtBool();
  529. } else if(cConsumeTokenIf(T_NOT_EQUAL)) {
  530. cAddTypeOperation(a, cComparison(), &TYPED_NOT_EQUAL);
  531. cAddOperation(OP_NOT);
  532. a = dtBool();
  533. } else {
  534. break;
  535. }
  536. }
  537. return a;
  538. }
  539. static DataType cBitAnd() {
  540. DataType a = cEqual();
  541. while(cConsumeTokenIf(T_BIT_AND)) {
  542. DataType b = cEqual();
  543. cAddTypeOperation(a, b, &TYPED_BIT_AND);
  544. }
  545. return a;
  546. }
  547. static DataType cBitXor() {
  548. DataType a = cBitAnd();
  549. while(cConsumeTokenIf(T_BIT_XOR)) {
  550. DataType b = cBitAnd();
  551. cAddTypeOperation(a, b, &TYPED_BIT_XOR);
  552. }
  553. return a;
  554. }
  555. static DataType cBitOr() {
  556. DataType a = cBitXor();
  557. while(cConsumeTokenIf(T_BIT_OR)) {
  558. DataType b = cBitXor();
  559. cAddTypeOperation(a, b, &TYPED_BIT_OR);
  560. }
  561. return a;
  562. }
  563. static DataType cAnd() {
  564. DataType a = cBitOr();
  565. while(cConsumeTokenIf(T_AND)) {
  566. cAddOperation(OP_PEEK_FALSE_GOTO);
  567. int p = cReserveInt();
  568. DataType b = cBitOr();
  569. if(!dtCompare(a, dtBool()) || !dtCompare(b, dtBool())) {
  570. cInvalidOperation(a, b, "&&");
  571. }
  572. cAddOperation(OP_AND);
  573. cSetInt(p, code->length);
  574. }
  575. return a;
  576. }
  577. static DataType cOr() {
  578. DataType a = cAnd();
  579. while(cConsumeTokenIf(T_OR)) {
  580. cAddOperation(OP_PEEK_TRUE_GOTO);
  581. int p = cReserveInt();
  582. DataType b = cAnd();
  583. if(!dtCompare(a, dtBool()) || !dtCompare(b, dtBool())) {
  584. cInvalidOperation(a, b, "||");
  585. }
  586. cAddOperation(OP_OR);
  587. cSetInt(p, code->length);
  588. }
  589. return a;
  590. }
  591. static DataType cExpression() {
  592. return cOr();
  593. }
  594. static void cOperationSet(Variable* v, Variable* sv, const TypedOp* op) {
  595. DataType a = cLoadVariable(v, sv);
  596. DataType b = cExpression();
  597. cAddTypeOperation(a, b, op);
  598. cStoreVariable(v, sv, b, "=");
  599. }
  600. static void cAddPostLineChange(Variable* v, int change, const char* name) {
  601. if(!dtCompare(v->type, dtInt())) {
  602. cError("%s needs an int", name);
  603. }
  604. cAddOperation(OP_LOAD_INT);
  605. cAddInt(v->address);
  606. cAddOperation(OP_PUSH_INT);
  607. cAddInt(change);
  608. cAddOperation(OP_ADD_INT);
  609. cAddOperation(OP_STORE_INT);
  610. cAddInt(v->address);
  611. }
  612. static void cDeclareStruct(Struct* st) {
  613. cConsumeToken(T_LITERAL);
  614. const char* var = cReadString();
  615. Variable* v = vSearchScope(&vars, var);
  616. if(v != NULL) {
  617. cDeclared(var);
  618. }
  619. vAdd(&vars, var, dtStruct(st), &structs);
  620. }
  621. static void cLineLiteral() {
  622. const char* literal = cReadString();
  623. if(cConsumeTokenIf(T_OPEN_BRACKET)) {
  624. DataType dt = cCallFunction(literal);
  625. if(!dtCompare(dt, dtVoid())) {
  626. cError("function returns %s not void", cGetName(dt));
  627. }
  628. return;
  629. }
  630. Struct* st = stsSearch(&structs, literal);
  631. if(st != NULL) {
  632. cDeclareStruct(st);
  633. return;
  634. }
  635. Variable* v = vSearch(&vars, literal);
  636. if(v == NULL) {
  637. cNotDeclared(literal);
  638. }
  639. Variable sv;
  640. sv.type = dtVoid();
  641. cWalkStruct(v, &sv);
  642. Token t = cReadTokenAndLine();
  643. switch(t) {
  644. case T_SET: cStoreVariable(v, &sv, cExpression(), "="); break;
  645. case T_ADD_SET: cOperationSet(v, &sv, &TYPED_ADD); break;
  646. case T_SUB_SET: cOperationSet(v, &sv, &TYPED_SUB); break;
  647. case T_MUL_SET: cOperationSet(v, &sv, &TYPED_MUL); break;
  648. case T_DIV_SET: cOperationSet(v, &sv, &TYPED_DIV); break;
  649. case T_MOD_SET: cOperationSet(v, &sv, &TYPED_MOD); break;
  650. case T_BIT_AND_SET: cOperationSet(v, &sv, &TYPED_BIT_AND); break;
  651. case T_BIT_OR_SET: cOperationSet(v, &sv, &TYPED_BIT_OR); break;
  652. case T_BIT_XOR_SET: cOperationSet(v, &sv, &TYPED_BIT_XOR); break;
  653. case T_LEFT_SHIFT_SET: cOperationSet(v, &sv, &TYPED_LEFT_SHIFT); break;
  654. case T_RIGHT_SHIFT_SET:
  655. cOperationSet(v, &sv, &TYPED_RIGHT_SHIFT);
  656. break;
  657. case T_INCREMENT: cAddPostLineChange(v, 1, "++"); break;
  658. case T_DECREMENT: cAddPostLineChange(v, -1, "--"); break;
  659. default: cUnexpectedToken(t);
  660. }
  661. }
  662. static void cLine(Token t);
  663. static void cConsumeBody() {
  664. int oldLine = line;
  665. while(!cConsumeTokenIf(T_CLOSE_CURVED_BRACKET)) {
  666. Token t = cReadTokenAndLine();
  667. if(t == T_END) {
  668. line = oldLine;
  669. cError("unexpected end of file: non closed curved bracket");
  670. }
  671. cLine(t);
  672. }
  673. }
  674. static void cConsumeScope() {
  675. Scope scope;
  676. vEnterScope(&vars, &scope);
  677. cConsumeBody();
  678. vLeaveScope(&vars, &scope);
  679. }
  680. static void cAddReturn(Operation op) {
  681. cAddOperation(op);
  682. returns[returnIndex++] = cReserveInt();
  683. }
  684. static void cReturn() {
  685. if(returnIndex >= RETURN_BUFFER) {
  686. cError("too much returns in function");
  687. }
  688. hasReturn = true;
  689. if(dtCompare(returnType, dtVoid())) {
  690. cConsumeToken(T_SEMICOLON);
  691. cAddReturn(OP_RETURN);
  692. return;
  693. }
  694. DataType dt = cExpression();
  695. if(!dtCompare(dt, returnType)) {
  696. cError("wrong return type, should be %s", cGetName(returnType));
  697. }
  698. switch(dtAsInt(dt)) {
  699. case DT_INT: cAddReturn(OP_RETURN_INT); break;
  700. case DT_BOOL: cAddReturn(OP_RETURN_BOOL); break;
  701. case DT_FLOAT: cAddReturn(OP_RETURN_FLOAT); break;
  702. default: cError("cannot return %s", cGetName(dt));
  703. }
  704. cConsumeToken(T_SEMICOLON);
  705. }
  706. static void cPrint() {
  707. DataType dt = cExpression();
  708. switch(dtAsInt(dt)) {
  709. case DT_INT: cAddOperation(OP_PRINT_INT); break;
  710. case DT_FLOAT: cAddOperation(OP_PRINT_FLOAT); break;
  711. case DT_BOOL: cAddOperation(OP_PRINT_BOOL); break;
  712. default: cError("cannot print type %s", cGetName(dt));
  713. }
  714. cConsumeToken(T_SEMICOLON);
  715. }
  716. static void cIf() {
  717. cConsumeToken(T_OPEN_BRACKET);
  718. DataType dt = cExpression();
  719. if(!dtCompare(dt, dtBool())) {
  720. cError("if expects a bool not %s", cGetName(dt));
  721. }
  722. cConsumeToken(T_CLOSE_BRACKET);
  723. cAddOperation(OP_IF_GOTO);
  724. int ifP = cReserveInt();
  725. cConsumeToken(T_OPEN_CURVED_BRACKET);
  726. cConsumeScope();
  727. cSetInt(ifP, code->length);
  728. if(cConsumeTokenIf(T_ELSE)) {
  729. cAddOperation(OP_GOTO);
  730. int elseP = cReserveInt();
  731. cSetInt(ifP, code->length);
  732. if(cConsumeTokenIf(T_IF)) {
  733. cIf();
  734. } else {
  735. cConsumeToken(T_OPEN_CURVED_BRACKET);
  736. cConsumeScope();
  737. }
  738. cSetInt(elseP, code->length);
  739. }
  740. }
  741. static void cConsumeBreaks(int start, int address) {
  742. for(int i = start; i < breakIndex; i++) {
  743. cSetInt(breaks[i], address);
  744. }
  745. breakIndex = start;
  746. }
  747. static void cWhile() {
  748. int start = code->length;
  749. cConsumeToken(T_OPEN_BRACKET);
  750. DataType dt = cExpression();
  751. if(!dtCompare(dt, dtBool())) {
  752. cError("while expects a bool not %s", cGetName(dt));
  753. }
  754. cConsumeToken(T_CLOSE_BRACKET);
  755. cAddOperation(OP_IF_GOTO);
  756. int ifP = cReserveInt();
  757. int breakStart = breakIndex;
  758. forWhileStack++;
  759. int oldContinue = continueAt;
  760. continueAt = start;
  761. cConsumeToken(T_OPEN_CURVED_BRACKET);
  762. cConsumeScope();
  763. continueAt = oldContinue;
  764. forWhileStack--;
  765. cAddOperation(OP_GOTO);
  766. cAddInt(start);
  767. cSetInt(ifP, code->length);
  768. cConsumeBreaks(breakStart, code->length);
  769. }
  770. static DataType cExtendType(DataType dt) {
  771. int dimension = 0;
  772. while(cConsumeTokenIf(T_MUL)) {
  773. dimension++;
  774. }
  775. if(dimension > 0) {
  776. dt = dtToArray(dt, dimension);
  777. }
  778. if(cConsumeTokenIf(T_BIT_AND)) {
  779. dt = dtToReference(dt);
  780. }
  781. return dt;
  782. }
  783. static void cDeclare(DataType dt) {
  784. dt = cExtendType(dt);
  785. cConsumeToken(T_LITERAL);
  786. const char* var = cReadString();
  787. Variable* v = vSearchScope(&vars, var);
  788. if(v != NULL) {
  789. cDeclared(var);
  790. }
  791. v = vAdd(&vars, var, dt, &structs);
  792. cConsumeToken(T_SET);
  793. cStore(v, cExpression(), "=");
  794. }
  795. static void cAddPreLineChange(int change, const char* name) {
  796. cConsumeToken(T_LITERAL);
  797. const char* literal = cReadString();
  798. Variable* v = vSearch(&vars, literal);
  799. if(v == NULL) {
  800. cNotDeclared(literal);
  801. }
  802. cAddPostLineChange(v, change, name);
  803. }
  804. static void cLineExpression(Token t) {
  805. switch(t) {
  806. case T_LITERAL: cLineLiteral(); break;
  807. case T_INT: cDeclare(dtInt()); break;
  808. case T_BOOL: cDeclare(dtBool()); break;
  809. case T_FLOAT: cDeclare(dtFloat()); break;
  810. case T_INCREMENT: cAddPreLineChange(1, "++"); break;
  811. case T_DECREMENT: cAddPreLineChange(-1, "--"); break;
  812. default: cUnexpectedToken(t);
  813. }
  814. }
  815. static void cFor() {
  816. Scope scope;
  817. vEnterScope(&vars, &scope);
  818. cConsumeToken(T_OPEN_BRACKET);
  819. cLineExpression(cReadTokenAndLine());
  820. cConsumeToken(T_SEMICOLON);
  821. int startCheck = code->length;
  822. DataType dt = cExpression();
  823. if(!dtCompare(dt, dtBool())) {
  824. cError("for expects a bool not %s", cGetName(dt));
  825. }
  826. cConsumeToken(T_SEMICOLON);
  827. cAddOperation(OP_IF_GOTO);
  828. int end = cReserveInt();
  829. cAddOperation(OP_GOTO);
  830. int beginBody = cReserveInt();
  831. int startPerLoop = code->length;
  832. cLineExpression(cReadTokenAndLine());
  833. cAddOperation(OP_GOTO);
  834. cAddInt(startCheck);
  835. cConsumeToken(T_CLOSE_BRACKET);
  836. cSetInt(beginBody, code->length);
  837. int breakStart = breakIndex;
  838. forWhileStack++;
  839. int oldContinue = continueAt;
  840. continueAt = startPerLoop;
  841. cConsumeToken(T_OPEN_CURVED_BRACKET);
  842. cConsumeBody();
  843. continueAt = oldContinue;
  844. forWhileStack--;
  845. cAddOperation(OP_GOTO);
  846. cAddInt(startPerLoop);
  847. cSetInt(end, code->length);
  848. cConsumeBreaks(breakStart, code->length);
  849. vLeaveScope(&vars, &scope);
  850. }
  851. static void cBreak() {
  852. if(forWhileStack == 0) {
  853. cError("break without for or while on line %d", line);
  854. } else if(breakIndex >= BREAK_BUFFER) {
  855. cError("too much breaks around line %d", line);
  856. }
  857. cAddOperation(OP_GOTO);
  858. breaks[breakIndex++] = cReserveInt();
  859. cConsumeToken(T_SEMICOLON);
  860. }
  861. static void cContinue() {
  862. if(forWhileStack == 0) {
  863. cError("continue without for or while on line %d", line);
  864. }
  865. cAddOperation(OP_GOTO);
  866. cAddInt(continueAt);
  867. cConsumeToken(T_SEMICOLON);
  868. }
  869. static void cLine(Token t) {
  870. hasReturn = false;
  871. cAddOperation(OP_LINE);
  872. cAddInt16(line);
  873. switch(t) {
  874. case T_OPEN_CURVED_BRACKET: cConsumeScope(); break;
  875. case T_PRINT: cPrint(); break;
  876. case T_RETURN: cReturn(); break;
  877. case T_IF: cIf(); break;
  878. case T_WHILE: cWhile(); break;
  879. case T_FOR: cFor(); break;
  880. case T_BREAK: cBreak(); break;
  881. case T_CONTINUE: cContinue(); break;
  882. default: cLineExpression(t); cConsumeToken(T_SEMICOLON);
  883. }
  884. }
  885. static void cFunctionArgument(Function* f);
  886. static void cFunctionCommaOrEnd(Function* f) {
  887. if(cConsumeTokenIf(T_CLOSE_BRACKET)) {
  888. return;
  889. }
  890. cConsumeToken(T_COMMA);
  891. cFunctionArgument(f);
  892. }
  893. static void cFunctionAddArgument(Function* f, DataType dt) {
  894. dt = cExtendType(dt);
  895. cConsumeToken(T_LITERAL);
  896. const char* name = cReadString();
  897. Variable* v = vSearchScope(&vars, name);
  898. if(v != NULL) {
  899. cDeclared(name);
  900. }
  901. vAdd(&vars, name, dt, &structs);
  902. if(fAddArgument(f, dt, &structs)) {
  903. cTooMuchArguments();
  904. }
  905. cFunctionCommaOrEnd(f);
  906. }
  907. static void cFunctionArgument(Function* f) {
  908. Token t = cReadTokenAndLine();
  909. switch(t) {
  910. case T_INT: cFunctionAddArgument(f, dtInt()); break;
  911. case T_FLOAT: cFunctionAddArgument(f, dtFloat()); break;
  912. case T_BOOL: cFunctionAddArgument(f, dtBool()); break;
  913. case T_LITERAL:
  914. {
  915. const char* structName = cReadString();
  916. Struct* st = stsSearch(&structs, structName);
  917. if(st == NULL) {
  918. cError("struct %s does not exist");
  919. }
  920. cFunctionAddArgument(f, dtStruct(st));
  921. break;
  922. }
  923. default: cUnexpectedToken(t);
  924. }
  925. }
  926. static void cFunctionArguments(Function* f) {
  927. cConsumeToken(T_OPEN_BRACKET);
  928. if(!cConsumeTokenIf(T_CLOSE_BRACKET)) {
  929. cFunctionArgument(f);
  930. }
  931. }
  932. static int cReserve(int offset) {
  933. cAddOperation(OP_RESERVE);
  934. int p = cReserveInt();
  935. cAddInt(offset);
  936. return p;
  937. }
  938. static void cFree(int p, int bytes) {
  939. cAddOperation(OP_RETURN);
  940. cAddInt(bytes);
  941. cSetInt(p, bytes);
  942. }
  943. static void cLinkReturns(int bytes) {
  944. for(int i = 0; i < returnIndex; i++) {
  945. cSetInt(returns[i], bytes);
  946. }
  947. returnIndex = 0;
  948. }
  949. static void cInnerFunction(Function* f) {
  950. cConsumeToken(T_OPEN_CURVED_BRACKET);
  951. int p = cReserve(f->size);
  952. returnIndex = 0;
  953. hasReturn = false;
  954. cConsumeScope();
  955. if(!dtCompare(returnType, dtVoid()) && !hasReturn) {
  956. cError("missing return");
  957. }
  958. cFree(p, vars.maxAddress);
  959. cLinkReturns(vars.maxAddress);
  960. }
  961. static bool cForwardFunction(Function* found, Function* f) {
  962. if(!cConsumeTokenIf(T_SEMICOLON)) {
  963. return false;
  964. } else if(found != NULL) {
  965. cError("function registered twice");
  966. }
  967. f->address = -1;
  968. fsAdd(&functions, f);
  969. return true;
  970. }
  971. static void cBuildFunction(Function* f, DataType rType) {
  972. cConsumeToken(T_LITERAL);
  973. fInit(f, cReadString(), line);
  974. f->returnType = rType;
  975. vReset(&vars);
  976. cFunctionArguments(f);
  977. }
  978. static void cFunction(DataType rType) {
  979. Function f;
  980. cBuildFunction(&f, rType);
  981. Function* found = fsSearch(&functions, &f);
  982. if(cForwardFunction(found, &f)) {
  983. return;
  984. }
  985. cAddOperation(OP_LINE);
  986. cAddInt16(line);
  987. cAddOperation(OP_GOTO);
  988. int end = cReserveInt();
  989. f.address = code->length;
  990. if(found != NULL) {
  991. if(found->address == -1) {
  992. found->address = f.address;
  993. } else {
  994. cError("function registered twice");
  995. }
  996. } else {
  997. fsAdd(&functions, &f);
  998. }
  999. returnType = rType;
  1000. cInnerFunction(&f);
  1001. cSetInt(end, code->length);
  1002. }
  1003. static void cStruct() {
  1004. cConsumeToken(T_LITERAL);
  1005. const char* name = cReadString();
  1006. if(stsSearch(&structs, name) != NULL) {
  1007. cError("struct registered twice");
  1008. }
  1009. Struct* st = stsAdd(&structs, name);
  1010. cConsumeToken(T_OPEN_CURVED_BRACKET);
  1011. while(!cConsumeTokenIf(T_CLOSE_CURVED_BRACKET)) {
  1012. Token t = cReadTokenAndLine();
  1013. DataType dt = dtVoid();
  1014. switch(t) {
  1015. case T_INT: dt = dtInt(); break;
  1016. case T_BOOL: dt = dtBool(); break;
  1017. case T_FLOAT: dt = dtFloat(); break;
  1018. default: cUnexpectedToken(t);
  1019. }
  1020. dt = cExtendType(dt);
  1021. cConsumeToken(T_LITERAL);
  1022. const char* name = cReadString();
  1023. stAddVariable(st, name, dt);
  1024. cConsumeToken(T_SEMICOLON);
  1025. }
  1026. cConsumeToken(T_SEMICOLON);
  1027. }
  1028. static void cGlobalScope(Token t) {
  1029. switch(t) {
  1030. case T_VOID: cFunction(dtVoid()); break;
  1031. case T_INT: cFunction(dtInt()); break;
  1032. case T_BOOL: cFunction(dtBool()); break;
  1033. case T_FLOAT: cFunction(dtFloat()); break;
  1034. case T_STRUCT: cStruct(); break;
  1035. default: cUnexpectedToken(t);
  1036. }
  1037. }
  1038. static void cCallMain() {
  1039. Function f;
  1040. fInit(&f, "main", line);
  1041. Function* found = fsSearch(&functions, &f);
  1042. if(found != NULL && dtCompare(found->returnType, dtVoid())) {
  1043. cAddOperation(OP_PUSH_INT);
  1044. cAddInt(0);
  1045. cAddOperation(OP_GOSUB);
  1046. cAddInt(found->address);
  1047. cAddInt(found->size);
  1048. }
  1049. }
  1050. static void cForEachLine() {
  1051. Token t = cReadTokenAndLine();
  1052. while(t != T_END) {
  1053. cGlobalScope(t);
  1054. t = cReadTokenAndLine();
  1055. }
  1056. cCallMain();
  1057. }
  1058. static void cLinkQueuedFunctions() {
  1059. for(int i = 0; i < functionQueue.entries; i++) {
  1060. Function* f = functionQueue.data + i;
  1061. Function* found = fsSearch(&functions, f);
  1062. if(found == NULL) {
  1063. line = f->line;
  1064. cError("unknown function");
  1065. } else if(!dtCompare(f->returnType, found->returnType)) {
  1066. line = f->line;
  1067. cError("function return type is not %s", cGetName(f->returnType));
  1068. }
  1069. cSetInt(f->address, found->address);
  1070. }
  1071. }
  1072. static void cAllocAndCompile() {
  1073. forWhileStack = 0;
  1074. breakIndex = 0;
  1075. returnType = dtVoid();
  1076. vInit(&vars);
  1077. fsInit(&functions);
  1078. fsInit(&functionQueue);
  1079. stsInit(&structs);
  1080. if(!setjmp(errorJump)) {
  1081. cForEachLine();
  1082. cLinkQueuedFunctions();
  1083. }
  1084. stsDelete(&structs);
  1085. fsDelete(&functionQueue);
  1086. fsDelete(&functions);
  1087. vDelete(&vars);
  1088. }
  1089. ByteCode* cCompile() {
  1090. error[0] = '\0';
  1091. code = bcInit();
  1092. cAllocAndCompile();
  1093. if(error[0] != '\0') {
  1094. bcDelete(code);
  1095. return NULL;
  1096. }
  1097. return code;
  1098. }
  1099. const char* cGetError() {
  1100. return error;
  1101. }
  1102. int cGetLine() {
  1103. return line;
  1104. }