Compiler.c 31 KB

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