Compiler.c 32 KB

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