Compiler.c 30 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107
  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)) {
  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 DataType cLoadVariable(Variable* v) {
  180. if(dtCompare(v->type, dtToReference(dtInt()))) {
  181. cAddOperation(OP_LOAD_INT);
  182. cAddInt(v->address);
  183. cAddOperation(OP_LOAD_INT_REF);
  184. return dtInt();
  185. }
  186. switch(dtAsInt(v->type)) {
  187. case DT_INT: cAddOperation(OP_LOAD_INT); break;
  188. case DT_BOOL: cAddOperation(OP_LOAD_BOOL); break;
  189. case DT_FLOAT: cAddOperation(OP_LOAD_FLOAT); break;
  190. default: cError("cannot load type %s", cGetName(v->type));
  191. }
  192. cAddInt(v->address);
  193. return v->type;
  194. }
  195. static void cStoreVariable(Variable* v, DataType dt, const char* name) {
  196. if(dtCompare(v->type, dtToReference(dtInt())) && dtCompare(dt, dtInt())) {
  197. cAddOperation(OP_LOAD_INT);
  198. cAddInt(v->address);
  199. cAddOperation(OP_STORE_INT_REF);
  200. return;
  201. }
  202. if(!dtCompare(v->type, dt)) {
  203. cInvalidOperation(v->type, dt, name);
  204. }
  205. if(v->type.reference) {
  206. cAddOperation(OP_STORE_INT);
  207. cAddInt(v->address);
  208. return;
  209. }
  210. switch(dtAsInt(v->type)) {
  211. case DT_INT: cAddOperation(OP_STORE_INT); break;
  212. case DT_BOOL: cAddOperation(OP_STORE_BOOL); break;
  213. case DT_FLOAT: cAddOperation(OP_STORE_FLOAT); break;
  214. default:
  215. if(dtIsArray(v->type)) {
  216. cAddOperation(OP_STORE_ARRAY);
  217. } else {
  218. cError("cannot store type %s", cGetName(v->type));
  219. }
  220. }
  221. cAddInt(v->address);
  222. }
  223. static DataType cPostChange(Variable* v, int change, const char* name) {
  224. if(!dtCompare(v->type, dtInt())) {
  225. cError("%s needs an int", name);
  226. }
  227. cAddOperation(OP_LOAD_INT);
  228. cAddInt(v->address);
  229. cAddOperation(OP_LOAD_INT);
  230. cAddInt(v->address);
  231. cAddOperation(OP_PUSH_INT);
  232. cAddInt(change);
  233. cAddOperation(OP_ADD_INT);
  234. cAddOperation(OP_STORE_INT);
  235. cAddInt(v->address);
  236. return dtInt();
  237. }
  238. static DataType cLiteral() {
  239. const char* literal = cReadString();
  240. if(cConsumeTokenIf(T_OPEN_BRACKET)) {
  241. DataType dt = cCallFunction(literal);
  242. if(dtCompare(dt, dtVoid())) {
  243. cError("function returns void");
  244. }
  245. return dt;
  246. }
  247. Variable* v = vSearch(&vars, literal);
  248. if(v == NULL) {
  249. cNotDeclared(literal);
  250. }
  251. if(cConsumeTokenIf(T_INCREMENT)) {
  252. return cPostChange(v, 1, "++");
  253. } else if(cConsumeTokenIf(T_DECREMENT)) {
  254. return cPostChange(v, -1, "--");
  255. }
  256. return cLoadVariable(v);
  257. }
  258. static DataType cBracketPrimary() {
  259. DataType result = cExpression();
  260. cConsumeToken(T_CLOSE_BRACKET);
  261. return result;
  262. }
  263. static DataType cAllocArray(DataType dt, Operation op) {
  264. cConsumeToken(T_OPEN_SQUARE_BRACKET);
  265. DataType index = cExpression();
  266. if(!dtCompare(index, dtInt())) {
  267. cError("array size must be an int");
  268. }
  269. cConsumeToken(T_CLOSE_SQUARE_BRACKET);
  270. cAddOperation(op);
  271. return dtToArray(dt, 1);
  272. }
  273. static DataType cPrimary() {
  274. Token t = cReadTokenAndLine();
  275. switch(t) {
  276. case T_CONST_INT: cConstantInt(); return dtInt();
  277. case T_CONST_FLOAT: cConstantFloat(); return dtFloat();
  278. case T_TRUE: cAddOperation(OP_PUSH_TRUE); return dtBool();
  279. case T_FALSE: cAddOperation(OP_PUSH_FALSE); return dtBool();
  280. case T_OPEN_BRACKET: return cBracketPrimary();
  281. case T_LITERAL: return cLiteral();
  282. case T_INT: return cAllocArray(dtInt(), OP_INT_ARRAY);
  283. default: cUnexpectedToken(t); return dtVoid();
  284. }
  285. }
  286. static DataType cPreChange(int change, const char* name) {
  287. cConsumeToken(T_LITERAL);
  288. const char* literal = cReadString();
  289. Variable* v = vSearch(&vars, literal);
  290. if(v == NULL) {
  291. cNotDeclared(literal);
  292. } else if(!dtCompare(v->type, dtInt())) {
  293. cError("%s needs an int", name);
  294. }
  295. cAddOperation(OP_LOAD_INT);
  296. cAddInt(v->address);
  297. cAddOperation(OP_PUSH_INT);
  298. cAddInt(change);
  299. cAddOperation(OP_ADD_INT);
  300. cAddOperation(OP_STORE_INT);
  301. cAddInt(v->address);
  302. cAddOperation(OP_LOAD_INT);
  303. cAddInt(v->address);
  304. return dtInt();
  305. }
  306. static DataType cPreUnary() {
  307. if(cConsumeTokenIf(T_SUB)) {
  308. DataType result = cPrimary();
  309. switch(dtAsInt(result)) {
  310. case DT_INT: cAddOperation(OP_INVERT_SIGN_INT); break;
  311. case DT_FLOAT: cAddOperation(OP_INVERT_SIGN_FLOAT); break;
  312. default: cError("cannot invert sign of %s", cGetName(result));
  313. }
  314. return result;
  315. } else if(cConsumeTokenIf(T_INCREMENT)) {
  316. return cPreChange(1, "++");
  317. } else if(cConsumeTokenIf(T_DECREMENT)) {
  318. return cPreChange(-1, "--");
  319. } else if(cConsumeTokenIf(T_NOT)) {
  320. int counter = 1;
  321. while(cConsumeTokenIf(T_NOT)) {
  322. counter++;
  323. }
  324. DataType result = cPrimary();
  325. if(!dtCompare(result, dtBool())) {
  326. cError("! needs a bool not %s", cGetName(result));
  327. }
  328. cAddOperation(OP_NOT);
  329. if((counter & 1) == 0) {
  330. cAddOperation(OP_NOT);
  331. }
  332. return dtBool();
  333. } else if(cConsumeTokenIf(T_BIT_NOT)) {
  334. DataType result = cPrimary();
  335. if(dtCompare(result, dtInt())) {
  336. cAddOperation(OP_BIT_NOT);
  337. } else {
  338. cError("~ needs an int not %s", cGetName(result));
  339. }
  340. return result;
  341. } else if(cConsumeTokenIf(T_BIT_AND)) {
  342. cConsumeToken(T_LITERAL);
  343. const char* literal = cReadString();
  344. Variable* v = vSearch(&vars, literal);
  345. if(v == NULL) {
  346. cNotDeclared(literal);
  347. }
  348. cAddOperation(OP_VAR_REF);
  349. cAddInt(v->address);
  350. return dtToReference(v->type);
  351. }
  352. return cPrimary();
  353. }
  354. static void cAddTypeOperation(DataType a, DataType b, const TypedOp* op) {
  355. if(dtCompare(a, dtInt()) && dtCompare(b, dtInt()) &&
  356. op->intOp != OP_NOTHING) {
  357. cAddOperation(op->intOp);
  358. } else if(dtCompare(a, dtFloat()) && dtCompare(b, dtFloat()) &&
  359. op->floatOp != OP_NOTHING) {
  360. cAddOperation(op->floatOp);
  361. } else if(dtCompare(a, dtBool()) && dtCompare(b, dtBool()) &&
  362. op->boolOp != OP_NOTHING) {
  363. cAddOperation(op->boolOp);
  364. } else {
  365. cInvalidOperation(a, b, op->name);
  366. }
  367. }
  368. static DataType cMul() {
  369. DataType a = cPreUnary();
  370. while(true) {
  371. if(cConsumeTokenIf(T_MUL)) {
  372. cAddTypeOperation(a, cPreUnary(), &TYPED_MUL);
  373. } else if(cConsumeTokenIf(T_DIV)) {
  374. cAddTypeOperation(a, cPreUnary(), &TYPED_DIV);
  375. } else if(cConsumeTokenIf(T_MOD)) {
  376. cAddTypeOperation(a, cPreUnary(), &TYPED_MOD);
  377. } else {
  378. break;
  379. }
  380. }
  381. return a;
  382. }
  383. static DataType cAdd() {
  384. DataType a = cMul();
  385. while(true) {
  386. if(cConsumeTokenIf(T_ADD)) {
  387. cAddTypeOperation(a, cMul(), &TYPED_ADD);
  388. } else if(cConsumeTokenIf(T_SUB)) {
  389. cAddTypeOperation(a, cMul(), &TYPED_SUB);
  390. } else {
  391. break;
  392. }
  393. }
  394. return a;
  395. }
  396. static DataType cShift() {
  397. DataType a = cAdd();
  398. while(true) {
  399. if(cConsumeTokenIf(T_LEFT_SHIFT)) {
  400. cAddTypeOperation(a, cAdd(), &TYPED_LEFT_SHIFT);
  401. } else if(cConsumeTokenIf(T_RIGHT_SHIFT)) {
  402. cAddTypeOperation(a, cAdd(), &TYPED_RIGHT_SHIFT);
  403. } else {
  404. break;
  405. }
  406. }
  407. return a;
  408. }
  409. static DataType cComparison() {
  410. DataType a = cShift();
  411. while(true) {
  412. if(cConsumeTokenIf(T_LESS)) {
  413. cAddTypeOperation(a, cShift(), &TYPED_LESS);
  414. a = dtBool();
  415. } else if(cConsumeTokenIf(T_LESS_EQUAL)) {
  416. cAddTypeOperation(a, cShift(), &TYPED_LESS_EQUAL);
  417. cAddOperation(OP_NOT);
  418. a = dtBool();
  419. } else if(cConsumeTokenIf(T_GREATER)) {
  420. cAddTypeOperation(a, cShift(), &TYPED_GREATER);
  421. a = dtBool();
  422. } else if(cConsumeTokenIf(T_GREATER_EQUAL)) {
  423. cAddTypeOperation(a, cShift(), &TYPED_GREATER_EQUAL);
  424. cAddOperation(OP_NOT);
  425. a = dtBool();
  426. } else {
  427. break;
  428. }
  429. }
  430. return a;
  431. }
  432. static DataType cEqual() {
  433. DataType a = cComparison();
  434. while(true) {
  435. if(cConsumeTokenIf(T_EQUAL)) {
  436. cAddTypeOperation(a, cComparison(), &TYPED_EQUAL);
  437. a = dtBool();
  438. } else if(cConsumeTokenIf(T_NOT_EQUAL)) {
  439. cAddTypeOperation(a, cComparison(), &TYPED_NOT_EQUAL);
  440. cAddOperation(OP_NOT);
  441. a = dtBool();
  442. } else {
  443. break;
  444. }
  445. }
  446. return a;
  447. }
  448. static DataType cBitAnd() {
  449. DataType a = cEqual();
  450. while(cConsumeTokenIf(T_BIT_AND)) {
  451. DataType b = cEqual();
  452. cAddTypeOperation(a, b, &TYPED_BIT_AND);
  453. }
  454. return a;
  455. }
  456. static DataType cBitXor() {
  457. DataType a = cBitAnd();
  458. while(cConsumeTokenIf(T_BIT_XOR)) {
  459. DataType b = cBitAnd();
  460. cAddTypeOperation(a, b, &TYPED_BIT_XOR);
  461. }
  462. return a;
  463. }
  464. static DataType cBitOr() {
  465. DataType a = cBitXor();
  466. while(cConsumeTokenIf(T_BIT_OR)) {
  467. DataType b = cBitXor();
  468. cAddTypeOperation(a, b, &TYPED_BIT_OR);
  469. }
  470. return a;
  471. }
  472. static DataType cAnd() {
  473. DataType a = cBitOr();
  474. while(cConsumeTokenIf(T_AND)) {
  475. cAddOperation(OP_PEEK_FALSE_GOTO);
  476. int p = cReserveInt();
  477. DataType b = cBitOr();
  478. if(!dtCompare(a, dtBool()) || !dtCompare(b, dtBool())) {
  479. cInvalidOperation(a, b, "&&");
  480. }
  481. cAddOperation(OP_AND);
  482. cSetInt(p, code->length);
  483. }
  484. return a;
  485. }
  486. static DataType cOr() {
  487. DataType a = cAnd();
  488. while(cConsumeTokenIf(T_OR)) {
  489. cAddOperation(OP_PEEK_TRUE_GOTO);
  490. int p = cReserveInt();
  491. DataType b = cAnd();
  492. if(!dtCompare(a, dtBool()) || !dtCompare(b, dtBool())) {
  493. cInvalidOperation(a, b, "||");
  494. }
  495. cAddOperation(OP_OR);
  496. cSetInt(p, code->length);
  497. }
  498. return a;
  499. }
  500. static DataType cExpression() {
  501. return cOr();
  502. }
  503. static void cOperationSet(Variable* v, const TypedOp* op) {
  504. DataType a = cLoadVariable(v);
  505. DataType b = cExpression();
  506. cAddTypeOperation(a, b, op);
  507. cStoreVariable(v, b, "=");
  508. }
  509. static void cAddPostLineChange(Variable* v, int change, const char* name) {
  510. if(!dtCompare(v->type, dtInt())) {
  511. cError("%s needs an int", name);
  512. }
  513. cAddOperation(OP_LOAD_INT);
  514. cAddInt(v->address);
  515. cAddOperation(OP_PUSH_INT);
  516. cAddInt(change);
  517. cAddOperation(OP_ADD_INT);
  518. cAddOperation(OP_STORE_INT);
  519. cAddInt(v->address);
  520. }
  521. static void cDeclareStruct(Struct* st) {
  522. cConsumeToken(T_LITERAL);
  523. const char* var = cReadString();
  524. Variable* v = vSearchScope(&vars, var);
  525. if(v != NULL) {
  526. cDeclared(var);
  527. }
  528. vAdd(&vars, var, dtStruct(st));
  529. int varLength = strlen(var);
  530. for(int i = 0; i < st->amount; i++) {
  531. int length = strlen(st->vars[i].name);
  532. char* fullName = malloc(varLength + length + 2);
  533. memcpy(fullName, var, varLength);
  534. fullName[varLength] = '.';
  535. memcpy(fullName + varLength + 1, st->vars[i].name, length + 1);
  536. vAdd(&vars, fullName, st->vars[i].type);
  537. free(fullName);
  538. }
  539. }
  540. static void cLineLiteral() {
  541. const char* literal = cReadString();
  542. if(cConsumeTokenIf(T_OPEN_BRACKET)) {
  543. DataType dt = cCallFunction(literal);
  544. if(!dtCompare(dt, dtVoid())) {
  545. cError("function returns %s not void", cGetName(dt));
  546. }
  547. return;
  548. }
  549. Struct* st = stsSearch(&structs, literal);
  550. if(st != NULL) {
  551. cDeclareStruct(st);
  552. return;
  553. }
  554. Variable* v = vSearch(&vars, literal);
  555. if(v == NULL) {
  556. cNotDeclared(literal);
  557. }
  558. Token t = cReadTokenAndLine();
  559. switch(t) {
  560. case T_SET: cStoreVariable(v, cExpression(), "="); break;
  561. case T_ADD_SET: cOperationSet(v, &TYPED_ADD); break;
  562. case T_SUB_SET: cOperationSet(v, &TYPED_SUB); break;
  563. case T_MUL_SET: cOperationSet(v, &TYPED_MUL); break;
  564. case T_DIV_SET: cOperationSet(v, &TYPED_DIV); break;
  565. case T_MOD_SET: cOperationSet(v, &TYPED_MOD); break;
  566. case T_BIT_AND_SET: cOperationSet(v, &TYPED_BIT_AND); break;
  567. case T_BIT_OR_SET: cOperationSet(v, &TYPED_BIT_OR); break;
  568. case T_BIT_XOR_SET: cOperationSet(v, &TYPED_BIT_XOR); break;
  569. case T_LEFT_SHIFT_SET: cOperationSet(v, &TYPED_LEFT_SHIFT); break;
  570. case T_RIGHT_SHIFT_SET: cOperationSet(v, &TYPED_RIGHT_SHIFT); break;
  571. case T_INCREMENT: cAddPostLineChange(v, 1, "++"); break;
  572. case T_DECREMENT: cAddPostLineChange(v, -1, "--"); break;
  573. default: cUnexpectedToken(t);
  574. }
  575. }
  576. static void cLine(Token t);
  577. static void cConsumeBody() {
  578. int oldLine = line;
  579. while(!cConsumeTokenIf(T_CLOSE_CURVED_BRACKET)) {
  580. Token t = cReadTokenAndLine();
  581. if(t == T_END) {
  582. line = oldLine;
  583. cError("unexpected end of file: non closed curved bracket");
  584. }
  585. cLine(t);
  586. }
  587. }
  588. static void cConsumeScope() {
  589. Scope scope;
  590. vEnterScope(&vars, &scope);
  591. cConsumeBody();
  592. vLeaveScope(&vars, &scope);
  593. }
  594. static void cAddReturn(Operation op) {
  595. cAddOperation(op);
  596. returns[returnIndex++] = cReserveInt();
  597. }
  598. static void cReturn() {
  599. if(returnIndex >= RETURN_BUFFER) {
  600. cError("too much returns in function");
  601. }
  602. hasReturn = true;
  603. if(dtCompare(returnType, dtVoid())) {
  604. cConsumeToken(T_SEMICOLON);
  605. cAddReturn(OP_RETURN);
  606. return;
  607. }
  608. DataType dt = cExpression();
  609. if(!dtCompare(dt, returnType)) {
  610. cError("wrong return type, should be %s", cGetName(returnType));
  611. }
  612. switch(dtAsInt(dt)) {
  613. case DT_INT: cAddReturn(OP_RETURN_INT); break;
  614. case DT_BOOL: cAddReturn(OP_RETURN_BOOL); break;
  615. case DT_FLOAT: cAddReturn(OP_RETURN_FLOAT); break;
  616. default: cError("cannot return %s", cGetName(dt));
  617. }
  618. cConsumeToken(T_SEMICOLON);
  619. }
  620. static void cPrint() {
  621. DataType dt = cExpression();
  622. switch(dtAsInt(dt)) {
  623. case DT_INT: cAddOperation(OP_PRINT_INT); break;
  624. case DT_FLOAT: cAddOperation(OP_PRINT_FLOAT); break;
  625. case DT_BOOL: cAddOperation(OP_PRINT_BOOL); break;
  626. default: cError("cannot print type %s", cGetName(dt));
  627. }
  628. cConsumeToken(T_SEMICOLON);
  629. }
  630. static void cIf() {
  631. cConsumeToken(T_OPEN_BRACKET);
  632. DataType dt = cExpression();
  633. if(!dtCompare(dt, dtBool())) {
  634. cError("if expects a bool not %s", cGetName(dt));
  635. }
  636. cConsumeToken(T_CLOSE_BRACKET);
  637. cAddOperation(OP_IF_GOTO);
  638. int ifP = cReserveInt();
  639. cConsumeToken(T_OPEN_CURVED_BRACKET);
  640. cConsumeScope();
  641. cSetInt(ifP, code->length);
  642. if(cConsumeTokenIf(T_ELSE)) {
  643. cAddOperation(OP_GOTO);
  644. int elseP = cReserveInt();
  645. cSetInt(ifP, code->length);
  646. if(cConsumeTokenIf(T_IF)) {
  647. cIf();
  648. } else {
  649. cConsumeToken(T_OPEN_CURVED_BRACKET);
  650. cConsumeScope();
  651. }
  652. cSetInt(elseP, code->length);
  653. }
  654. }
  655. static void cConsumeBreaks(int start, int address) {
  656. for(int i = start; i < breakIndex; i++) {
  657. cSetInt(breaks[i], address);
  658. }
  659. breakIndex = start;
  660. }
  661. static void cWhile() {
  662. int start = code->length;
  663. cConsumeToken(T_OPEN_BRACKET);
  664. DataType dt = cExpression();
  665. if(!dtCompare(dt, dtBool())) {
  666. cError("while expects a bool not %s", cGetName(dt));
  667. }
  668. cConsumeToken(T_CLOSE_BRACKET);
  669. cAddOperation(OP_IF_GOTO);
  670. int ifP = cReserveInt();
  671. int breakStart = breakIndex;
  672. forWhileStack++;
  673. int oldContinue = continueAt;
  674. continueAt = start;
  675. cConsumeToken(T_OPEN_CURVED_BRACKET);
  676. cConsumeScope();
  677. continueAt = oldContinue;
  678. forWhileStack--;
  679. cAddOperation(OP_GOTO);
  680. cAddInt(start);
  681. cSetInt(ifP, code->length);
  682. cConsumeBreaks(breakStart, code->length);
  683. }
  684. static DataType cExtendType(DataType dt) {
  685. int dimension = 0;
  686. while(cConsumeTokenIf(T_MUL)) {
  687. dimension++;
  688. }
  689. if(dimension > 0) {
  690. dt = dtToArray(dt, dimension);
  691. }
  692. if(cConsumeTokenIf(T_BIT_AND)) {
  693. dt = dtToReference(dt);
  694. }
  695. return dt;
  696. }
  697. static void cDeclare(DataType dt) {
  698. dt = cExtendType(dt);
  699. cConsumeToken(T_LITERAL);
  700. const char* var = cReadString();
  701. Variable* v = vSearchScope(&vars, var);
  702. if(v != NULL) {
  703. cDeclared(var);
  704. }
  705. v = vAdd(&vars, var, dt);
  706. cConsumeToken(T_SET);
  707. cStoreVariable(v, cExpression(), "=");
  708. }
  709. static void cAddPreLineChange(int change, const char* name) {
  710. cConsumeToken(T_LITERAL);
  711. const char* literal = cReadString();
  712. Variable* v = vSearch(&vars, literal);
  713. if(v == NULL) {
  714. cNotDeclared(literal);
  715. }
  716. cAddPostLineChange(v, change, name);
  717. }
  718. static void cLineExpression(Token t) {
  719. switch(t) {
  720. case T_LITERAL: cLineLiteral(); break;
  721. case T_INT: cDeclare(dtInt()); break;
  722. case T_BOOL: cDeclare(dtBool()); break;
  723. case T_FLOAT: cDeclare(dtFloat()); break;
  724. case T_INCREMENT: cAddPreLineChange(1, "++"); break;
  725. case T_DECREMENT: cAddPreLineChange(-1, "--"); break;
  726. default: cUnexpectedToken(t);
  727. }
  728. }
  729. static void cFor() {
  730. Scope scope;
  731. vEnterScope(&vars, &scope);
  732. cConsumeToken(T_OPEN_BRACKET);
  733. cLineExpression(cReadTokenAndLine());
  734. cConsumeToken(T_SEMICOLON);
  735. int startCheck = code->length;
  736. DataType dt = cExpression();
  737. if(!dtCompare(dt, dtBool())) {
  738. cError("for expects a bool not %s", cGetName(dt));
  739. }
  740. cConsumeToken(T_SEMICOLON);
  741. cAddOperation(OP_IF_GOTO);
  742. int end = cReserveInt();
  743. cAddOperation(OP_GOTO);
  744. int beginBody = cReserveInt();
  745. int startPerLoop = code->length;
  746. cLineExpression(cReadTokenAndLine());
  747. cAddOperation(OP_GOTO);
  748. cAddInt(startCheck);
  749. cConsumeToken(T_CLOSE_BRACKET);
  750. cSetInt(beginBody, code->length);
  751. int breakStart = breakIndex;
  752. forWhileStack++;
  753. int oldContinue = continueAt;
  754. continueAt = startPerLoop;
  755. cConsumeToken(T_OPEN_CURVED_BRACKET);
  756. cConsumeBody();
  757. continueAt = oldContinue;
  758. forWhileStack--;
  759. cAddOperation(OP_GOTO);
  760. cAddInt(startPerLoop);
  761. cSetInt(end, code->length);
  762. cConsumeBreaks(breakStart, code->length);
  763. vLeaveScope(&vars, &scope);
  764. }
  765. static void cBreak() {
  766. if(forWhileStack == 0) {
  767. cError("break without for or while on line %d", line);
  768. } else if(breakIndex >= BREAK_BUFFER) {
  769. cError("too much breaks around line %d", line);
  770. }
  771. cAddOperation(OP_GOTO);
  772. breaks[breakIndex++] = cReserveInt();
  773. cConsumeToken(T_SEMICOLON);
  774. }
  775. static void cContinue() {
  776. if(forWhileStack == 0) {
  777. cError("continue without for or while on line %d", line);
  778. }
  779. cAddOperation(OP_GOTO);
  780. cAddInt(continueAt);
  781. cConsumeToken(T_SEMICOLON);
  782. }
  783. static void cLine(Token t) {
  784. hasReturn = false;
  785. cAddOperation(OP_LINE);
  786. cAddInt16(line);
  787. switch(t) {
  788. case T_OPEN_CURVED_BRACKET: cConsumeScope(); break;
  789. case T_PRINT: cPrint(); break;
  790. case T_RETURN: cReturn(); break;
  791. case T_IF: cIf(); break;
  792. case T_WHILE: cWhile(); break;
  793. case T_FOR: cFor(); break;
  794. case T_BREAK: cBreak(); break;
  795. case T_CONTINUE: cContinue(); break;
  796. default: cLineExpression(t); cConsumeToken(T_SEMICOLON);
  797. }
  798. }
  799. static void cFunctionArgument(Function* f);
  800. static void cFunctionCommaOrEnd(Function* f) {
  801. if(cConsumeTokenIf(T_CLOSE_BRACKET)) {
  802. return;
  803. }
  804. cConsumeToken(T_COMMA);
  805. cFunctionArgument(f);
  806. }
  807. static void cFunctionAddArgument(Function* f, DataType dt) {
  808. if(cConsumeTokenIf(T_BIT_AND)) {
  809. dt = dtToReference(dt);
  810. }
  811. cConsumeToken(T_LITERAL);
  812. const char* name = cReadString();
  813. Variable* v = vSearchScope(&vars, name);
  814. if(v != NULL) {
  815. cDeclared(name);
  816. }
  817. vAdd(&vars, name, dt);
  818. if(fAddArgument(f, dt)) {
  819. cTooMuchArguments();
  820. }
  821. cFunctionCommaOrEnd(f);
  822. }
  823. static void cFunctionArgument(Function* f) {
  824. Token t = cReadTokenAndLine();
  825. switch(t) {
  826. case T_INT: cFunctionAddArgument(f, dtInt()); break;
  827. case T_FLOAT: cFunctionAddArgument(f, dtFloat()); break;
  828. case T_BOOL: cFunctionAddArgument(f, dtBool()); break;
  829. default: cUnexpectedToken(t);
  830. }
  831. }
  832. static void cFunctionArguments(Function* f) {
  833. cConsumeToken(T_OPEN_BRACKET);
  834. if(!cConsumeTokenIf(T_CLOSE_BRACKET)) {
  835. cFunctionArgument(f);
  836. }
  837. }
  838. static int cReserve(int offset) {
  839. cAddOperation(OP_RESERVE);
  840. int p = cReserveInt();
  841. cAddInt(offset);
  842. return p;
  843. }
  844. static void cFree(int p, int bytes) {
  845. cAddOperation(OP_RETURN);
  846. cAddInt(bytes);
  847. cSetInt(p, bytes);
  848. }
  849. static void cLinkReturns(int bytes) {
  850. for(int i = 0; i < returnIndex; i++) {
  851. cSetInt(returns[i], bytes);
  852. }
  853. returnIndex = 0;
  854. }
  855. static void cInnerFunction(Function* f) {
  856. cConsumeToken(T_OPEN_CURVED_BRACKET);
  857. int p = cReserve(f->size);
  858. returnIndex = 0;
  859. hasReturn = false;
  860. cConsumeScope();
  861. if(!dtCompare(returnType, dtVoid()) && !hasReturn) {
  862. cError("missing return");
  863. }
  864. cFree(p, vars.maxAddress);
  865. cLinkReturns(vars.maxAddress);
  866. }
  867. static bool cForwardFunction(Function* found, Function* f) {
  868. if(!cConsumeTokenIf(T_SEMICOLON)) {
  869. return false;
  870. } else if(found != NULL) {
  871. cError("function registered twice");
  872. }
  873. f->address = -1;
  874. fsAdd(&functions, f);
  875. return true;
  876. }
  877. static void cBuildFunction(Function* f, DataType rType) {
  878. cConsumeToken(T_LITERAL);
  879. fInit(f, cReadString(), line);
  880. f->returnType = rType;
  881. vReset(&vars);
  882. cFunctionArguments(f);
  883. }
  884. static void cFunction(DataType rType) {
  885. Function f;
  886. cBuildFunction(&f, rType);
  887. Function* found = fsSearch(&functions, &f);
  888. if(cForwardFunction(found, &f)) {
  889. return;
  890. }
  891. cAddOperation(OP_LINE);
  892. cAddInt16(line);
  893. cAddOperation(OP_GOTO);
  894. int end = cReserveInt();
  895. f.address = code->length;
  896. if(found != NULL) {
  897. if(found->address == -1) {
  898. found->address = f.address;
  899. } else {
  900. cError("function registered twice");
  901. }
  902. } else {
  903. fsAdd(&functions, &f);
  904. }
  905. returnType = rType;
  906. cInnerFunction(&f);
  907. cSetInt(end, code->length);
  908. }
  909. static void cStruct() {
  910. cConsumeToken(T_LITERAL);
  911. const char* name = cReadString();
  912. if(stsSearch(&structs, name) != NULL) {
  913. cError("struct registered twice");
  914. }
  915. Struct* st = stsAdd(&structs, name);
  916. cConsumeToken(T_OPEN_CURVED_BRACKET);
  917. while(!cConsumeTokenIf(T_CLOSE_CURVED_BRACKET)) {
  918. Token t = cReadTokenAndLine();
  919. DataType dt = dtVoid();
  920. switch(t) {
  921. case T_INT: dt = dtInt(); break;
  922. case T_BOOL: dt = dtBool(); break;
  923. case T_FLOAT: dt = dtFloat(); break;
  924. default: cUnexpectedToken(t);
  925. }
  926. dt = cExtendType(dt);
  927. cConsumeToken(T_LITERAL);
  928. const char* name = cReadString();
  929. stAddVariable(st, name, dt);
  930. cConsumeToken(T_SEMICOLON);
  931. }
  932. cConsumeToken(T_SEMICOLON);
  933. }
  934. static void cGlobalScope(Token t) {
  935. switch(t) {
  936. case T_VOID: cFunction(dtVoid()); break;
  937. case T_INT: cFunction(dtInt()); break;
  938. case T_BOOL: cFunction(dtBool()); break;
  939. case T_FLOAT: cFunction(dtFloat()); break;
  940. case T_STRUCT: cStruct(); break;
  941. default: cUnexpectedToken(t);
  942. }
  943. }
  944. static void cCallMain() {
  945. Function f;
  946. fInit(&f, "main", line);
  947. Function* found = fsSearch(&functions, &f);
  948. if(found != NULL && dtCompare(found->returnType, dtVoid())) {
  949. cAddOperation(OP_PUSH_INT);
  950. cAddInt(0);
  951. cAddOperation(OP_GOSUB);
  952. cAddInt(found->address);
  953. cAddInt(found->size);
  954. }
  955. }
  956. static void cForEachLine() {
  957. Token t = cReadTokenAndLine();
  958. while(t != T_END) {
  959. cGlobalScope(t);
  960. t = cReadTokenAndLine();
  961. }
  962. cCallMain();
  963. }
  964. static void cLinkQueuedFunctions() {
  965. for(int i = 0; i < functionQueue.entries; i++) {
  966. Function* f = functionQueue.data + i;
  967. Function* found = fsSearch(&functions, f);
  968. if(found == NULL) {
  969. line = f->line;
  970. cError("unknown function");
  971. } else if(!dtCompare(f->returnType, found->returnType)) {
  972. line = f->line;
  973. cError("function return type is not %s", cGetName(f->returnType));
  974. }
  975. cSetInt(f->address, found->address);
  976. }
  977. }
  978. static void cAllocAndCompile() {
  979. forWhileStack = 0;
  980. breakIndex = 0;
  981. returnType = dtVoid();
  982. vInit(&vars);
  983. fsInit(&functions);
  984. fsInit(&functionQueue);
  985. stsInit(&structs);
  986. if(!setjmp(errorJump)) {
  987. cForEachLine();
  988. cLinkQueuedFunctions();
  989. }
  990. stsDelete(&structs);
  991. fsDelete(&functionQueue);
  992. fsDelete(&functions);
  993. vDelete(&vars);
  994. }
  995. ByteCode* cCompile() {
  996. error[0] = '\0';
  997. code = bcInit();
  998. cAllocAndCompile();
  999. if(error[0] != '\0') {
  1000. bcDelete(code);
  1001. return NULL;
  1002. }
  1003. return code;
  1004. }
  1005. const char* cGetError() {
  1006. return error;
  1007. }
  1008. int cGetLine() {
  1009. return line;
  1010. }