Compiler.c 32 KB

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