Compiler.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715
  1. #include <setjmp.h>
  2. #include <stdarg.h>
  3. #include <stdio.h>
  4. #include "Compiler.h"
  5. #include "FunctionMap.h"
  6. #include "Operation.h"
  7. #include "StringIntMap.h"
  8. #include "Tokenizer.h"
  9. #define ERROR_LENGTH 256
  10. #define RETURN_BUFFER 16
  11. #define BREAK_BUFFER 32
  12. static jmp_buf errorJump;
  13. static char error[ERROR_LENGTH] = {'\0'};
  14. static ByteCode* code;
  15. static int16 line = 1;
  16. static int varIndex = 0;
  17. static StringIntMap vars[2];
  18. static FunctionMap functions;
  19. static int returns[RETURN_BUFFER];
  20. static int returnIndex = 0;
  21. static int returnState = 0;
  22. static int breaks[BREAK_BUFFER];
  23. static int breakIndex = 0;
  24. static int forWhileStack = 0;
  25. static void cError(const char* format, ...) {
  26. va_list args;
  27. va_start(args, format);
  28. vsnprintf(error, ERROR_LENGTH, format, args);
  29. va_end(args);
  30. longjmp(errorJump, 0);
  31. }
  32. static int cAddVar(const char* var) {
  33. int index = vars[varIndex].entries;
  34. simAdd(vars + varIndex, var, &index);
  35. return index;
  36. }
  37. static void cUnexpectedToken(Token t) {
  38. cError("unexpected token on line %d: %s", line, tGetTokenName(t));
  39. }
  40. static void cAddOperation(Operation token) {
  41. unsigned char c = token;
  42. bcAddBytes(code, &c, 1);
  43. }
  44. static int cReserveInt() {
  45. return bcReserveBytes(code, sizeof(int));
  46. }
  47. static void cSetInt(int p, int i) {
  48. bcSetBytes(code, p, &i, sizeof(int));
  49. }
  50. static void cAddInt(int i) {
  51. bcAddBytes(code, &i, sizeof(int));
  52. }
  53. static void cAddInt16(int16 i) {
  54. bcAddBytes(code, &i, sizeof(int16));
  55. }
  56. static void cAddFloat(float f) {
  57. bcAddBytes(code, &f, sizeof(float));
  58. }
  59. static int cAddPush(int offset) {
  60. cAddOperation(OP_PUSH_VARS);
  61. int p = cReserveInt();
  62. cAddInt(offset);
  63. return p;
  64. }
  65. static void cAddPop(int p, int vars) {
  66. cAddOperation(OP_POP_VARS);
  67. cAddInt(vars);
  68. cSetInt(p, vars);
  69. }
  70. static Token cReadTokenAndLine() {
  71. Token t = tReadToken();
  72. if(tReadInt16(&line)) {
  73. return t;
  74. }
  75. return T_END;
  76. }
  77. static void cConsumeToken(Token wanted) {
  78. Token t = cReadTokenAndLine();
  79. if(wanted != t) {
  80. cError("unexpected token on line %d: expected '%s' got '%s'", line, tGetTokenName(wanted), tGetTokenName(t));
  81. }
  82. }
  83. static bool cConsumeTokenIf(Token t) {
  84. if(tPeekToken() == t) {
  85. cReadTokenAndLine();
  86. return true;
  87. }
  88. return false;
  89. }
  90. static void cConstantInt() {
  91. int value;
  92. if(!tReadInt(&value)) {
  93. cError("int token without an int on line %d", line);
  94. }
  95. cAddOperation(OP_PUSH_INT);
  96. cAddInt(value);
  97. }
  98. static void cConstantFloat() {
  99. float value;
  100. if(!tReadFloat(&value)) {
  101. cError("float token without a float on line %d", line);
  102. }
  103. cAddOperation(OP_PUSH_FLOAT);
  104. cAddFloat(value);
  105. }
  106. static const char* cReadString() {
  107. const char* literal = tReadString();
  108. if(literal == NULL) {
  109. cError("literal without string on line %d", line);
  110. }
  111. return literal;
  112. }
  113. static void cGetVar(const char* var) {
  114. cAddOperation(OP_GET);
  115. cAddInt(cAddVar(var));
  116. }
  117. static void cExpression();
  118. static int cCallFunctionArguments() {
  119. int arguments = 0;
  120. while(!cConsumeTokenIf(T_CLOSE_BRACKET)) {
  121. arguments++;
  122. cExpression();
  123. if(cConsumeTokenIf(T_COMMA) && tPeekToken() == T_CLOSE_BRACKET) {
  124. cUnexpectedToken(tPeekToken());
  125. }
  126. }
  127. return arguments;
  128. }
  129. static void cCallFunction(const char* literal, bool noReturn) {
  130. cAddOperation(OP_PUSH_INT);
  131. cAddInt(0);
  132. int arguments = cCallFunctionArguments();
  133. Function* f = fmSearch(&functions, literal, arguments);
  134. cAddOperation(OP_GOSUB);
  135. if(f == NULL) {
  136. fmEnqueue(&functions, literal, arguments, line, cReserveInt(), noReturn);
  137. cAddInt(arguments);
  138. cAddOperation(OP_NOTHING);
  139. } else {
  140. if(!noReturn && !f->returns) {
  141. cError("function '%s' needs a return value on line %d", f->name, line);
  142. }
  143. cAddInt(f->address);
  144. cAddInt(arguments);
  145. if(f->returns && noReturn) {
  146. cAddOperation(OP_POP);
  147. }
  148. }
  149. }
  150. static void cPostIncrement(const char* literal) {
  151. cAddOperation(OP_POST_INCREMENT);
  152. cAddInt(cAddVar(literal));
  153. }
  154. static void cPostDecrement(const char* literal) {
  155. cAddOperation(OP_POST_DECREMENT);
  156. cAddInt(cAddVar(literal));
  157. }
  158. static void cLiteral() {
  159. const char* literal = cReadString();
  160. if(cConsumeTokenIf(T_OPEN_BRACKET)) {
  161. cCallFunction(literal, false);
  162. } else if(cConsumeTokenIf(T_INCREMENT)) {
  163. cPostIncrement(literal);
  164. } else if(cConsumeTokenIf(T_DECREMENT)) {
  165. cPostDecrement(literal);
  166. } else {
  167. cGetVar(literal);
  168. }
  169. }
  170. static void cPrimary() {
  171. Token t = cReadTokenAndLine();
  172. switch(t) {
  173. case T_INT: cConstantInt(); break;
  174. case T_FLOAT: cConstantFloat(); break;
  175. case T_NULL: cAddOperation(OP_PUSH_NULL); break;
  176. case T_TRUE: cAddOperation(OP_PUSH_TRUE); break;
  177. case T_FALSE: cAddOperation(OP_PUSH_FALSE); break;
  178. case T_OPEN_BRACKET:
  179. cExpression();
  180. cConsumeToken(T_CLOSE_BRACKET);
  181. break;
  182. case T_LITERAL: cLiteral(); break;
  183. default: cUnexpectedToken(t); break;
  184. }
  185. }
  186. static void cPreIncrement() {
  187. cConsumeToken(T_LITERAL);
  188. cAddOperation(OP_PRE_INCREMENT);
  189. cAddInt(cAddVar(cReadString()));
  190. }
  191. static void cPreDecrement() {
  192. cConsumeToken(T_LITERAL);
  193. cAddOperation(OP_PRE_DECREMENT);
  194. cAddInt(cAddVar(cReadString()));
  195. }
  196. static void cPreUnary() {
  197. if(cConsumeTokenIf(T_SUB)) {
  198. cPrimary();
  199. cAddOperation(OP_INVERT_SIGN);
  200. } else if(cConsumeTokenIf(T_INCREMENT)) {
  201. cPreIncrement();
  202. } else if(cConsumeTokenIf(T_DECREMENT)) {
  203. cPreDecrement();
  204. } else if(cConsumeTokenIf(T_NOT)) {
  205. int counter = 1;
  206. while(cConsumeTokenIf(T_NOT)) {
  207. counter++;
  208. }
  209. cPrimary();
  210. cAddOperation(OP_NOT);
  211. if((counter & 1) == 0) {
  212. cAddOperation(OP_NOT);
  213. }
  214. } else if(cConsumeTokenIf(T_BIT_NOT)) {
  215. cPrimary();
  216. cAddOperation(OP_BIT_NOT);
  217. } else {
  218. cPrimary();
  219. }
  220. }
  221. static void cMul() {
  222. cPreUnary();
  223. while(true) {
  224. if(cConsumeTokenIf(T_MUL)) {
  225. cPreUnary();
  226. cAddOperation(OP_MUL);
  227. } else if(cConsumeTokenIf(T_DIV)) {
  228. cPreUnary();
  229. cAddOperation(OP_DIV);
  230. } else if(cConsumeTokenIf(T_MOD)) {
  231. cPreUnary();
  232. cAddOperation(OP_MOD);
  233. } else {
  234. break;
  235. }
  236. }
  237. }
  238. static void cAdd() {
  239. cMul();
  240. while(true) {
  241. if(cConsumeTokenIf(T_ADD)) {
  242. cMul();
  243. cAddOperation(OP_ADD);
  244. } else if(cConsumeTokenIf(T_SUB)) {
  245. cMul();
  246. cAddOperation(OP_SUB);
  247. } else {
  248. break;
  249. }
  250. }
  251. }
  252. static void cShift() {
  253. cAdd();
  254. while(true) {
  255. if(cConsumeTokenIf(T_LEFT_SHIFT)) {
  256. cAdd();
  257. cAddOperation(OP_LEFT_SHIFT);
  258. } else if(cConsumeTokenIf(T_RIGHT_SHIFT)) {
  259. cAdd();
  260. cAddOperation(OP_RIGHT_SHIFT);
  261. } else {
  262. break;
  263. }
  264. }
  265. }
  266. static void cComparison() {
  267. cShift();
  268. while(true) {
  269. if(cConsumeTokenIf(T_LESS)) {
  270. cShift();
  271. cAddOperation(OP_LESS);
  272. } else if(cConsumeTokenIf(T_LESS_EQUAL)) {
  273. cShift();
  274. cAddOperation(OP_GREATER);
  275. cAddOperation(OP_NOT);
  276. } else if(cConsumeTokenIf(T_GREATER)) {
  277. cShift();
  278. cAddOperation(OP_GREATER);
  279. } else if(cConsumeTokenIf(T_GREATER_EQUAL)) {
  280. cShift();
  281. cAddOperation(OP_LESS);
  282. cAddOperation(OP_NOT);
  283. } else {
  284. break;
  285. }
  286. }
  287. }
  288. static void cEqual() {
  289. cComparison();
  290. while(true) {
  291. if(cConsumeTokenIf(T_EQUAL)) {
  292. cComparison();
  293. cAddOperation(OP_EQUAL);
  294. } else if(cConsumeTokenIf(T_NOT_EQUAL)) {
  295. cComparison();
  296. cAddOperation(OP_EQUAL);
  297. cAddOperation(OP_NOT);
  298. } else {
  299. break;
  300. }
  301. }
  302. }
  303. static void cBitAnd() {
  304. cEqual();
  305. while(cConsumeTokenIf(T_BIT_AND)) {
  306. cEqual();
  307. cAddOperation(OP_BIT_AND);
  308. }
  309. }
  310. static void cBitXor() {
  311. cBitAnd();
  312. while(cConsumeTokenIf(T_BIT_XOR)) {
  313. cBitAnd();
  314. cAddOperation(OP_BIT_XOR);
  315. }
  316. }
  317. static void cBitOr() {
  318. cBitXor();
  319. while(cConsumeTokenIf(T_BIT_OR)) {
  320. cBitXor();
  321. cAddOperation(OP_BIT_OR);
  322. }
  323. }
  324. static void cAnd() {
  325. cBitOr();
  326. while(cConsumeTokenIf(T_AND)) {
  327. cAddOperation(OP_DUPLICATE);
  328. cAddOperation(OP_IF_GOTO);
  329. int p = cReserveInt();
  330. cBitOr();
  331. cAddOperation(OP_AND);
  332. cSetInt(p, code->length);
  333. }
  334. }
  335. static void cOr() {
  336. cAnd();
  337. while(cConsumeTokenIf(T_OR)) {
  338. cAddOperation(OP_DUPLICATE);
  339. cAddOperation(OP_NOT);
  340. cAddOperation(OP_IF_GOTO);
  341. int p = cReserveInt();
  342. cAnd();
  343. cAddOperation(OP_OR);
  344. cSetInt(p, code->length);
  345. }
  346. }
  347. static void cExpression() {
  348. cOr();
  349. }
  350. static void cSetVar(const char* literal) {
  351. cExpression();
  352. cAddOperation(OP_SET);
  353. cAddInt(cAddVar(literal));
  354. }
  355. static void cOperationSetVar(const char* literal, Operation op) {
  356. cGetVar(literal);
  357. cExpression();
  358. cAddOperation(op);
  359. cAddOperation(OP_SET);
  360. cAddInt(cAddVar(literal));
  361. }
  362. static void cLineLiteral() {
  363. const char* literal = cReadString();
  364. Token t = cReadTokenAndLine();
  365. switch(t) {
  366. case T_SET: cSetVar(literal); break;
  367. case T_ADD_SET: cOperationSetVar(literal, OP_ADD); break;
  368. case T_SUB_SET: cOperationSetVar(literal, OP_SUB); break;
  369. case T_MUL_SET: cOperationSetVar(literal, OP_MUL); break;
  370. case T_DIV_SET: cOperationSetVar(literal, OP_DIV); break;
  371. case T_MOD_SET: cOperationSetVar(literal, OP_MOD); break;
  372. case T_BIT_AND_SET: cOperationSetVar(literal, OP_BIT_AND); break;
  373. case T_BIT_OR_SET: cOperationSetVar(literal, OP_BIT_OR); break;
  374. case T_BIT_XOR_SET: cOperationSetVar(literal, OP_BIT_XOR); break;
  375. case T_LEFT_SHIFT_SET: cOperationSetVar(literal, OP_LEFT_SHIFT); break;
  376. case T_RIGHT_SHIFT_SET: cOperationSetVar(literal, OP_RIGHT_SHIFT); break;
  377. case T_OPEN_BRACKET: cCallFunction(literal, true); break;
  378. case T_INCREMENT:
  379. cPostIncrement(literal);
  380. cAddOperation(OP_POP);
  381. break;
  382. case T_DECREMENT:
  383. cPostDecrement(literal);
  384. cAddOperation(OP_POP);
  385. break;
  386. default: cUnexpectedToken(t);
  387. }
  388. }
  389. static int cFunctionArguments() {
  390. int arguments = 0;
  391. while(!cConsumeTokenIf(T_CLOSE_BRACKET)) {
  392. cConsumeToken(T_LITERAL);
  393. arguments++;
  394. cAddVar(cReadString());
  395. if(cConsumeTokenIf(T_COMMA) && tPeekToken() != T_LITERAL) {
  396. cUnexpectedToken(tPeekToken());
  397. }
  398. }
  399. return arguments;
  400. }
  401. static void cLine(Token t);
  402. static void cConsumeBody() {
  403. cConsumeToken(T_OPEN_CURVED_BRACKET);
  404. int oldLine = line;
  405. while(!cConsumeTokenIf(T_CLOSE_CURVED_BRACKET)) {
  406. Token t = cReadTokenAndLine();
  407. if(t == T_END) {
  408. cError("unexpected end of file: non closed curved bracket on line %d", oldLine);
  409. }
  410. cLine(t);
  411. }
  412. }
  413. static void cLinkReturns() {
  414. for(int i = 0; i < returnIndex; i++) {
  415. cSetInt(returns[i], vars[1].entries);
  416. }
  417. returnIndex = 0;
  418. }
  419. static void cFunctionBody(const char* name, int arguments) {
  420. int oldLine = line;
  421. cAddOperation(OP_GOTO);
  422. int gotoIndex = cReserveInt();
  423. int address = code->length;
  424. returnState = 0;
  425. int p = cAddPush(arguments);
  426. cConsumeBody(false);
  427. cAddPop(p, vars[1].entries);
  428. cLinkReturns();
  429. if(!fmAdd(&functions, name, arguments, address, returnState == 2)) {
  430. cError("function registered twice on line %d", oldLine);
  431. }
  432. cAddOperation(OP_RETURN);
  433. cSetInt(gotoIndex, code->length);
  434. }
  435. static void cFunction() {
  436. if(varIndex == 1) {
  437. cError("function inside function on line %d", line);
  438. }
  439. cConsumeToken(T_LITERAL);
  440. const char* name = cReadString();
  441. cConsumeToken(T_OPEN_BRACKET);
  442. varIndex = 1;
  443. vars[1].entries = 0;
  444. cFunctionBody(name, cFunctionArguments());
  445. varIndex = 0;
  446. }
  447. static void cAddReturn() {
  448. cAddOperation(OP_POP_VARS);
  449. returns[returnIndex++] = cReserveInt(vars);
  450. cAddOperation(OP_RETURN);
  451. }
  452. static void cReturn() {
  453. if(varIndex == 0) {
  454. cError("return without a function on line %d", line);
  455. } else if(returnIndex >= RETURN_BUFFER) {
  456. cError("too much returns in function around line %d", line);
  457. }
  458. if(cConsumeTokenIf(T_SEMICOLON)) {
  459. if(returnState == 2) {
  460. cError("mixed return type on line %d", line);
  461. }
  462. returnState = 1;
  463. cAddReturn();
  464. } else {
  465. if(returnState == 1) {
  466. cError("mixed return type on line %d", line);
  467. }
  468. returnState = 2;
  469. cExpression();
  470. cAddOperation(OP_SET_RETURN);
  471. cAddReturn();
  472. cConsumeToken(T_SEMICOLON);
  473. }
  474. }
  475. static void cPrint() {
  476. cExpression();
  477. cConsumeToken(T_SEMICOLON);
  478. cAddOperation(OP_PRINT);
  479. }
  480. static void cIf() {
  481. cConsumeToken(T_OPEN_BRACKET);
  482. cExpression();
  483. cConsumeToken(T_CLOSE_BRACKET);
  484. cAddOperation(OP_IF_GOTO);
  485. int ifP = cReserveInt();
  486. cConsumeBody(false);
  487. cSetInt(ifP, code->length);
  488. if(cConsumeTokenIf(T_ELSE)) {
  489. cAddOperation(OP_GOTO);
  490. int elseP = cReserveInt();
  491. cSetInt(ifP, code->length);
  492. if(cConsumeTokenIf(T_IF)) {
  493. cIf();
  494. } else {
  495. cConsumeBody(false);
  496. }
  497. cSetInt(elseP, code->length);
  498. }
  499. }
  500. static void cConsumeBreaks(int start, int address) {
  501. for(int i = start; i < breakIndex; i++) {
  502. cSetInt(breaks[i], address);
  503. }
  504. breakIndex = start;
  505. }
  506. static void cWhile() {
  507. int start = code->length;
  508. cConsumeToken(T_OPEN_BRACKET);
  509. cExpression();
  510. cConsumeToken(T_CLOSE_BRACKET);
  511. cAddOperation(OP_IF_GOTO);
  512. int ifP = cReserveInt();
  513. int breakStart = breakIndex;
  514. forWhileStack++;
  515. cConsumeBody(true);
  516. forWhileStack--;
  517. cAddOperation(OP_GOTO);
  518. cAddInt(start);
  519. cSetInt(ifP, code->length);
  520. cConsumeBreaks(breakStart, code->length);
  521. }
  522. static void cLineExpression(Token t) {
  523. switch(t) {
  524. case T_LITERAL: cLineLiteral(); break;
  525. case T_INCREMENT:
  526. cPreIncrement();
  527. cAddOperation(OP_POP);
  528. break;
  529. case T_DECREMENT:
  530. cPreDecrement();
  531. cAddOperation(OP_POP);
  532. break;
  533. default: cUnexpectedToken(t);
  534. }
  535. }
  536. static void cFor() {
  537. cConsumeToken(T_OPEN_BRACKET);
  538. cLineExpression(cReadTokenAndLine());
  539. cConsumeToken(T_SEMICOLON);
  540. int startCheck = code->length;
  541. cExpression();
  542. cConsumeToken(T_SEMICOLON);
  543. cAddOperation(OP_IF_GOTO);
  544. int end = cReserveInt();
  545. cAddOperation(OP_GOTO);
  546. int beginBody = cReserveInt();
  547. int startPerLoop = code->length;
  548. cLineExpression(cReadTokenAndLine());
  549. cAddOperation(OP_GOTO);
  550. cAddInt(startCheck);
  551. cConsumeToken(T_CLOSE_BRACKET);
  552. cSetInt(beginBody, code->length);
  553. int breakStart = breakIndex;
  554. forWhileStack++;
  555. cConsumeBody(true);
  556. forWhileStack--;
  557. cAddOperation(OP_GOTO);
  558. cAddInt(startPerLoop);
  559. cSetInt(end, code->length);
  560. cConsumeBreaks(breakStart, code->length);
  561. }
  562. static void cBreak() {
  563. if(forWhileStack == 0) {
  564. cError("break without for or while on line %d", line);
  565. } else if(breakIndex >= BREAK_BUFFER) {
  566. cError("too much breaks around line %d", line);
  567. }
  568. cAddOperation(OP_GOTO);
  569. breaks[breakIndex++] = cReserveInt();
  570. cConsumeToken(T_SEMICOLON);
  571. }
  572. static void cLine(Token t) {
  573. cAddOperation(OP_LINE);
  574. cAddInt16(line);
  575. switch(t) {
  576. case T_PRINT: cPrint(); break;
  577. case T_FUNCTION: cFunction(); break;
  578. case T_RETURN: cReturn(); break;
  579. case T_IF: cIf(); break;
  580. case T_WHILE: cWhile(); break;
  581. case T_FOR: cFor(); break;
  582. case T_BREAK: cBreak(); break;
  583. default: cLineExpression(t); cConsumeToken(T_SEMICOLON);
  584. }
  585. }
  586. static void cForEachLine() {
  587. Token t = cReadTokenAndLine();
  588. while(t != T_END) {
  589. cLine(t);
  590. t = cReadTokenAndLine();
  591. }
  592. }
  593. static void cLinkQueuedFunctions() {
  594. for(int i = 0; i < functions.queueEntries; i++) {
  595. Function* f = fmSearch(&functions, functions.queue[i].name, functions.queue[i].arguments);
  596. if(f == NULL) {
  597. cError("unknown function on line %d", functions.queue[i].line);
  598. } else if(!functions.queue[i].noReturn && !f->returns) {
  599. cError("function '%s' needs a return value on line %d", f->name, functions.queue[i].line);
  600. }
  601. cSetInt(functions.queue[i].reserved, f->address);
  602. if(functions.queue[i].noReturn && f->returns) {
  603. code->code[functions.queue[i].reserved + sizeof(int) * 2] = OP_POP;
  604. }
  605. }
  606. }
  607. static void cAllocAndCompile() {
  608. varIndex = 0;
  609. returnIndex = 0;
  610. returnState = 0;
  611. forWhileStack = 0;
  612. breakIndex = 0;
  613. simInit(vars);
  614. simInit(vars + 1);
  615. fmInit(&functions);
  616. if(!setjmp(errorJump)) {
  617. int p = cAddPush(0);
  618. cForEachLine();
  619. cAddPop(p, vars[varIndex].entries);
  620. cLinkQueuedFunctions();
  621. }
  622. fmDelete(&functions);
  623. simDelete(vars + 1);
  624. simDelete(vars);
  625. }
  626. ByteCode* cCompile() {
  627. error[0] = '\0';
  628. code = bcInit();
  629. cAllocAndCompile();
  630. if(error[0] != '\0') {
  631. bcDelete(code);
  632. return NULL;
  633. }
  634. return code;
  635. }
  636. const char* cGetError() {
  637. return error;
  638. }