Compiler.c 36 KB

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