Compiler.c 32 KB

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