lua.stx 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771
  1. %{
  2. char *rcs_luastx = "$Id: $";
  3. #include <stdio.h>
  4. #include <stdlib.h>
  5. #include <string.h>
  6. #include "opcode.h"
  7. #include "hash.h"
  8. #include "inout.h"
  9. #include "table.h"
  10. #include "lua.h"
  11. #ifndef ALIGNMENT
  12. #define ALIGNMENT (sizeof(void *))
  13. #endif
  14. #ifndef MAXCODE
  15. #define MAXCODE 1024
  16. #endif
  17. static long buffer[MAXCODE];
  18. static Byte *code = (Byte *)buffer;
  19. static long mainbuffer[MAXCODE];
  20. static Byte *maincode = (Byte *)mainbuffer;
  21. static Byte *basepc;
  22. static Byte *pc;
  23. #define MAXVAR 32
  24. static long varbuffer[MAXVAR];
  25. static Byte nvarbuffer=0; /* number of variables at a list */
  26. static Word localvar[STACKGAP];
  27. static Byte nlocalvar=0; /* number of local variables */
  28. static int ntemp; /* number of temporary var into stack */
  29. static int err; /* flag to indicate error */
  30. /* Internal functions */
  31. #define align(n) align_n(sizeof(n))
  32. static void code_byte (Byte c)
  33. {
  34. if (pc-basepc>MAXCODE-1)
  35. {
  36. lua_error ("code buffer overflow");
  37. err = 1;
  38. }
  39. *pc++ = c;
  40. }
  41. static void code_word (Word n)
  42. {
  43. if (pc-basepc>MAXCODE-sizeof(Word))
  44. {
  45. lua_error ("code buffer overflow");
  46. err = 1;
  47. }
  48. *((Word *)pc) = n;
  49. pc += sizeof(Word);
  50. }
  51. static void code_float (float n)
  52. {
  53. if (pc-basepc>MAXCODE-sizeof(float))
  54. {
  55. lua_error ("code buffer overflow");
  56. err = 1;
  57. }
  58. *((float *)pc) = n;
  59. pc += sizeof(float);
  60. }
  61. static void incr_ntemp (void)
  62. {
  63. if (ntemp+nlocalvar+MAXVAR+1 < STACKGAP)
  64. ntemp++;
  65. else
  66. {
  67. lua_error ("stack overflow");
  68. err = 1;
  69. }
  70. }
  71. static void add_nlocalvar (int n)
  72. {
  73. if (ntemp+nlocalvar+MAXVAR+n < STACKGAP)
  74. nlocalvar += n;
  75. else
  76. {
  77. lua_error ("too many local variables or expression too complicate");
  78. err = 1;
  79. }
  80. }
  81. static void incr_nvarbuffer (void)
  82. {
  83. if (nvarbuffer < MAXVAR-1)
  84. nvarbuffer++;
  85. else
  86. {
  87. lua_error ("variable buffer overflow");
  88. err = 1;
  89. }
  90. }
  91. static void align_n (unsigned size)
  92. {
  93. if (size > ALIGNMENT) size = ALIGNMENT;
  94. while (((pc+1-code)%size) != 0) /* +1 to include BYTECODE */
  95. code_byte (NOP);
  96. }
  97. static void code_number (float f)
  98. { int i = f;
  99. if (f == i) /* f has an integer value */
  100. {
  101. if (i <= 2) code_byte(PUSH0 + i);
  102. else if (i <= 255)
  103. {
  104. code_byte(PUSHBYTE);
  105. code_byte(i);
  106. }
  107. else
  108. {
  109. align(Word);
  110. code_byte(PUSHWORD);
  111. code_word(i);
  112. }
  113. }
  114. else
  115. {
  116. align(float);
  117. code_byte(PUSHFLOAT);
  118. code_float(f);
  119. }
  120. incr_ntemp();
  121. }
  122. %}
  123. %union
  124. {
  125. int vInt;
  126. long vLong;
  127. float vFloat;
  128. Word vWord;
  129. Byte *pByte;
  130. }
  131. %start functionlist
  132. %token NIL
  133. %token IF THEN ELSE ELSEIF WHILE DO REPEAT UNTIL END
  134. %token RETURN
  135. %token LOCAL
  136. %token <vFloat> NUMBER
  137. %token <vWord> FUNCTION NAME STRING
  138. %token <vInt> DEBUG
  139. %type <pByte> PrepJump
  140. %type <vInt> expr, exprlist, exprlist1, varlist1, typeconstructor
  141. %type <vInt> fieldlist, localdeclist
  142. %type <vInt> ffieldlist, ffieldlist1
  143. %type <vInt> lfieldlist, lfieldlist1
  144. %type <vLong> var, objectname
  145. %left AND OR
  146. %left '=' NE '>' '<' LE GE
  147. %left CONC
  148. %left '+' '-'
  149. %left '*' '/'
  150. %left UNARY NOT
  151. %% /* beginning of rules section */
  152. functionlist : /* empty */
  153. | functionlist {pc=basepc=maincode; nlocalvar=0;} stat sc {maincode=pc;}
  154. | functionlist function
  155. | functionlist setdebug
  156. ;
  157. function : FUNCTION NAME {pc=basepc=code; nlocalvar=0;} '(' parlist ')'
  158. {
  159. if (lua_debug)
  160. {
  161. align(Word);
  162. code_byte(SETFUNCTION);
  163. code_word($1);
  164. code_word($2);
  165. }
  166. lua_codeadjust (0);
  167. }
  168. block
  169. END
  170. {
  171. if (lua_debug) code_byte(RESET);
  172. code_byte(RETCODE); code_byte(nlocalvar);
  173. s_tag($2) = T_FUNCTION;
  174. s_bvalue($2) = calloc (pc-code, sizeof(Byte));
  175. memcpy (s_bvalue($2), code, (pc-code)*sizeof(Byte));
  176. }
  177. ;
  178. statlist : /* empty */
  179. | statlist stat sc
  180. ;
  181. stat : {
  182. ntemp = 0;
  183. if (lua_debug)
  184. {
  185. align(Word); code_byte(SETLINE); code_word(lua_linenumber);
  186. }
  187. }
  188. stat1
  189. sc : /* empty */ | ';' ;
  190. stat1 : IF expr1 THEN PrepJump block PrepJump elsepart END
  191. {
  192. {
  193. Byte *elseinit = $6 + sizeof(Word)+1;
  194. if (pc - elseinit == 0) /* no else */
  195. {
  196. pc -= sizeof(Word)+1;
  197. /* if (*(pc-1) == NOP) --pc; */
  198. elseinit = pc;
  199. }
  200. else
  201. {
  202. *($6) = JMP;
  203. *((Word *)($6+1)) = pc - elseinit;
  204. }
  205. *($4) = IFFJMP;
  206. *((Word *)($4+1)) = elseinit - ($4 + sizeof(Word)+1);
  207. }
  208. }
  209. | WHILE {$<pByte>$ = pc;} expr1 DO PrepJump block PrepJump END
  210. {
  211. *($5) = IFFJMP;
  212. *((Word *)($5+1)) = pc - ($5 + sizeof(Word)+1);
  213. *($7) = UPJMP;
  214. *((Word *)($7+1)) = pc - $<pByte>2;
  215. }
  216. | REPEAT {$<pByte>$ = pc;} block UNTIL expr1 PrepJump
  217. {
  218. *($6) = IFFUPJMP;
  219. *((Word *)($6+1)) = pc - $<pByte>2;
  220. }
  221. | varlist1 '=' exprlist1
  222. {
  223. {
  224. int i;
  225. if ($3 == 0 || nvarbuffer != ntemp - $1 * 2)
  226. lua_codeadjust ($1 * 2 + nvarbuffer);
  227. for (i=nvarbuffer-1; i>=0; i--)
  228. lua_codestore (i);
  229. if ($1 > 1 || ($1 == 1 && varbuffer[0] != 0))
  230. lua_codeadjust (0);
  231. }
  232. }
  233. | functioncall { lua_codeadjust (0); }
  234. | typeconstructor { lua_codeadjust (0); }
  235. | LOCAL localdeclist decinit { add_nlocalvar($2); lua_codeadjust (0); }
  236. ;
  237. elsepart : /* empty */
  238. | ELSE block
  239. | ELSEIF expr1 THEN PrepJump block PrepJump elsepart
  240. {
  241. {
  242. Byte *elseinit = $6 + sizeof(Word)+1;
  243. if (pc - elseinit == 0) /* no else */
  244. {
  245. pc -= sizeof(Word)+1;
  246. /* if (*(pc-1) == NOP) --pc; */
  247. elseinit = pc;
  248. }
  249. else
  250. {
  251. *($6) = JMP;
  252. *((Word *)($6+1)) = pc - elseinit;
  253. }
  254. *($4) = IFFJMP;
  255. *((Word *)($4+1)) = elseinit - ($4 + sizeof(Word)+1);
  256. }
  257. }
  258. ;
  259. block : {$<vInt>$ = nlocalvar;} statlist {ntemp = 0;} ret
  260. {
  261. if (nlocalvar != $<vInt>1)
  262. {
  263. nlocalvar = $<vInt>1;
  264. lua_codeadjust (0);
  265. }
  266. }
  267. ;
  268. ret : /* empty */
  269. | { if (lua_debug){align(Word);code_byte(SETLINE);code_word(lua_linenumber);}}
  270. RETURN exprlist sc
  271. {
  272. if (lua_debug) code_byte(RESET);
  273. code_byte(RETCODE); code_byte(nlocalvar);
  274. }
  275. ;
  276. PrepJump : /* empty */
  277. {
  278. align(Word);
  279. $$ = pc;
  280. code_byte(0); /* open space */
  281. code_word (0);
  282. }
  283. expr1 : expr { if ($1 == 0) {lua_codeadjust (ntemp+1); incr_ntemp();}}
  284. ;
  285. expr : '(' expr ')' { $$ = $2; }
  286. | expr1 '=' expr1 { code_byte(EQOP); $$ = 1; ntemp--;}
  287. | expr1 '<' expr1 { code_byte(LTOP); $$ = 1; ntemp--;}
  288. | expr1 '>' expr1 { code_byte(LEOP); code_byte(NOTOP); $$ = 1; ntemp--;}
  289. | expr1 NE expr1 { code_byte(EQOP); code_byte(NOTOP); $$ = 1; ntemp--;}
  290. | expr1 LE expr1 { code_byte(LEOP); $$ = 1; ntemp--;}
  291. | expr1 GE expr1 { code_byte(LTOP); code_byte(NOTOP); $$ = 1; ntemp--;}
  292. | expr1 '+' expr1 { code_byte(ADDOP); $$ = 1; ntemp--;}
  293. | expr1 '-' expr1 { code_byte(SUBOP); $$ = 1; ntemp--;}
  294. | expr1 '*' expr1 { code_byte(MULTOP); $$ = 1; ntemp--;}
  295. | expr1 '/' expr1 { code_byte(DIVOP); $$ = 1; ntemp--;}
  296. | expr1 CONC expr1 { code_byte(CONCOP); $$ = 1; ntemp--;}
  297. | '+' expr1 %prec UNARY { $$ = 1; }
  298. | '-' expr1 %prec UNARY { code_byte(MINUSOP); $$ = 1;}
  299. | typeconstructor { $$ = $1; }
  300. | '@' '(' dimension ')'
  301. {
  302. code_byte(CREATEARRAY);
  303. $$ = 1;
  304. }
  305. | var { lua_pushvar ($1); $$ = 1;}
  306. | NUMBER { code_number($1); $$ = 1; }
  307. | STRING
  308. {
  309. align(Word);
  310. code_byte(PUSHSTRING);
  311. code_word($1);
  312. $$ = 1;
  313. incr_ntemp();
  314. }
  315. | NIL {code_byte(PUSHNIL); $$ = 1; incr_ntemp();}
  316. | functioncall
  317. {
  318. $$ = 0;
  319. if (lua_debug)
  320. {
  321. align(Word); code_byte(SETLINE); code_word(lua_linenumber);
  322. }
  323. }
  324. | NOT expr1 { code_byte(NOTOP); $$ = 1;}
  325. | expr1 AND PrepJump {code_byte(POP); ntemp--;} expr1
  326. {
  327. *($3) = ONFJMP;
  328. *((Word *)($3+1)) = pc - ($3 + sizeof(Word)+1);
  329. $$ = 1;
  330. }
  331. | expr1 OR PrepJump {code_byte(POP); ntemp--;} expr1
  332. {
  333. *($3) = ONTJMP;
  334. *((Word *)($3+1)) = pc - ($3 + sizeof(Word)+1);
  335. $$ = 1;
  336. }
  337. ;
  338. typeconstructor: '@'
  339. {
  340. code_byte(PUSHBYTE);
  341. $<pByte>$ = pc; code_byte(0);
  342. incr_ntemp();
  343. code_byte(CREATEARRAY);
  344. }
  345. objectname fieldlist
  346. {
  347. *($<pByte>2) = $4;
  348. if ($3 < 0) /* there is no function to be called */
  349. {
  350. $$ = 1;
  351. }
  352. else
  353. {
  354. lua_pushvar ($3+1);
  355. code_byte(PUSHMARK);
  356. incr_ntemp();
  357. code_byte(PUSHOBJECT);
  358. incr_ntemp();
  359. code_byte(CALLFUNC);
  360. ntemp -= 4;
  361. $$ = 0;
  362. if (lua_debug)
  363. {
  364. align(Word); code_byte(SETLINE); code_word(lua_linenumber);
  365. }
  366. }
  367. }
  368. ;
  369. dimension : /* empty */ { code_byte(PUSHNIL); incr_ntemp();}
  370. | expr1
  371. ;
  372. functioncall : functionvalue {code_byte(PUSHMARK); $<vInt>$ = ntemp; incr_ntemp();}
  373. '(' exprlist ')' { code_byte(CALLFUNC); ntemp = $<vInt>2-1;}
  374. functionvalue : var {lua_pushvar ($1); }
  375. ;
  376. exprlist : /* empty */ { $$ = 1; }
  377. | exprlist1 { $$ = $1; }
  378. ;
  379. exprlist1 : expr { $$ = $1; }
  380. | exprlist1 ',' {if (!$1){lua_codeadjust (ntemp+1); incr_ntemp();}}
  381. expr {$$ = $4;}
  382. ;
  383. parlist : /* empty */
  384. | parlist1
  385. ;
  386. parlist1 : NAME {localvar[nlocalvar]=$1; add_nlocalvar(1);}
  387. | parlist1 ',' NAME {localvar[nlocalvar]=$3; add_nlocalvar(1);}
  388. ;
  389. objectname : /* empty */ {$$=-1;}
  390. | NAME {$$=$1;}
  391. ;
  392. fieldlist : '{' ffieldlist '}' { $$ = $2; }
  393. | '[' lfieldlist ']' { $$ = $2; }
  394. ;
  395. ffieldlist : /* empty */ { $$ = 0; }
  396. | ffieldlist1 { $$ = $1; }
  397. ;
  398. ffieldlist1 : ffield {$$=1;}
  399. | ffieldlist1 ',' ffield {$$=$1+1;}
  400. ;
  401. ffield : NAME
  402. {
  403. align(Word);
  404. code_byte(PUSHSTRING);
  405. code_word(lua_findconstant (s_name($1)));
  406. incr_ntemp();
  407. }
  408. '=' expr1
  409. {
  410. code_byte(STOREFIELD);
  411. ntemp-=2;
  412. }
  413. ;
  414. lfieldlist : /* empty */ { $$ = 0; }
  415. | lfieldlist1 { $$ = $1; }
  416. ;
  417. lfieldlist1 : { code_number(1); } lfield {$$=1;}
  418. | lfieldlist1 ',' { code_number($1+1); } lfield
  419. {$$=$1+1;}
  420. ;
  421. lfield : expr1
  422. {
  423. code_byte(STOREFIELD);
  424. ntemp-=2;
  425. }
  426. ;
  427. varlist1 : var
  428. {
  429. nvarbuffer = 0;
  430. varbuffer[nvarbuffer] = $1; incr_nvarbuffer();
  431. $$ = ($1 == 0) ? 1 : 0;
  432. }
  433. | varlist1 ',' var
  434. {
  435. varbuffer[nvarbuffer] = $3; incr_nvarbuffer();
  436. $$ = ($3 == 0) ? $1 + 1 : $1;
  437. }
  438. ;
  439. var : NAME
  440. {
  441. int local = lua_localname ($1);
  442. if (local == -1) /* global var */
  443. $$ = $1 + 1; /* return positive value */
  444. else
  445. $$ = -(local+1); /* return negative value */
  446. }
  447. | var {lua_pushvar ($1);} '[' expr1 ']'
  448. {
  449. $$ = 0; /* indexed variable */
  450. }
  451. | var {lua_pushvar ($1);} '.' NAME
  452. {
  453. align(Word);
  454. code_byte(PUSHSTRING);
  455. code_word(lua_findconstant (s_name($4))); incr_ntemp();
  456. $$ = 0; /* indexed variable */
  457. }
  458. ;
  459. localdeclist : NAME {localvar[nlocalvar]=$1; $$ = 1;}
  460. | localdeclist ',' NAME {localvar[nlocalvar+$1]=$3; $$ = $1+1;}
  461. ;
  462. decinit : /* empty */
  463. | '=' exprlist1
  464. ;
  465. setdebug : DEBUG {lua_debug = $1;}
  466. %%
  467. /*
  468. ** Search a local name and if find return its index. If do not find return -1
  469. */
  470. static int lua_localname (Word n)
  471. {
  472. int i;
  473. for (i=nlocalvar-1; i >= 0; i--)
  474. if (n == localvar[i]) return i; /* local var */
  475. return -1; /* global var */
  476. }
  477. /*
  478. ** Push a variable given a number. If number is positive, push global variable
  479. ** indexed by (number -1). If negative, push local indexed by ABS(number)-1.
  480. ** Otherwise, if zero, push indexed variable (record).
  481. */
  482. static void lua_pushvar (long number)
  483. {
  484. if (number > 0) /* global var */
  485. {
  486. align(Word);
  487. code_byte(PUSHGLOBAL);
  488. code_word(number-1);
  489. incr_ntemp();
  490. }
  491. else if (number < 0) /* local var */
  492. {
  493. number = (-number) - 1;
  494. if (number < 10) code_byte(PUSHLOCAL0 + number);
  495. else
  496. {
  497. code_byte(PUSHLOCAL);
  498. code_byte(number);
  499. }
  500. incr_ntemp();
  501. }
  502. else
  503. {
  504. code_byte(PUSHINDEXED);
  505. ntemp--;
  506. }
  507. }
  508. static void lua_codeadjust (int n)
  509. {
  510. code_byte(ADJUST);
  511. code_byte(n + nlocalvar);
  512. }
  513. static void lua_codestore (int i)
  514. {
  515. if (varbuffer[i] > 0) /* global var */
  516. {
  517. align(Word);
  518. code_byte(STOREGLOBAL);
  519. code_word(varbuffer[i]-1);
  520. }
  521. else if (varbuffer[i] < 0) /* local var */
  522. {
  523. int number = (-varbuffer[i]) - 1;
  524. if (number < 10) code_byte(STORELOCAL0 + number);
  525. else
  526. {
  527. code_byte(STORELOCAL);
  528. code_byte(number);
  529. }
  530. }
  531. else /* indexed var */
  532. {
  533. int j;
  534. int upper=0; /* number of indexed variables upper */
  535. int param; /* number of itens until indexed expression */
  536. for (j=i+1; j <nvarbuffer; j++)
  537. if (varbuffer[j] == 0) upper++;
  538. param = upper*2 + i;
  539. if (param == 0)
  540. code_byte(STOREINDEXED0);
  541. else
  542. {
  543. code_byte(STOREINDEXED);
  544. code_byte(param);
  545. }
  546. }
  547. }
  548. void yyerror (char *s)
  549. {
  550. static char msg[256];
  551. sprintf (msg,"%s near \"%s\" at line %d in file \"%s\"",
  552. s, lua_lasttext (), lua_linenumber, lua_filename());
  553. lua_error (msg);
  554. err = 1;
  555. }
  556. int yywrap (void)
  557. {
  558. return 1;
  559. }
  560. /*
  561. ** Parse LUA code and execute global statement.
  562. ** Return 0 on success or 1 on error.
  563. */
  564. int lua_parse (void)
  565. {
  566. Byte *initcode = maincode;
  567. err = 0;
  568. if (yyparse () || (err==1)) return 1;
  569. *maincode++ = HALT;
  570. if (lua_execute (initcode)) return 1;
  571. maincode = initcode;
  572. return 0;
  573. }
  574. #if 0
  575. static void PrintCode (void)
  576. {
  577. Byte *p = code;
  578. printf ("\n\nCODE\n");
  579. while (p != pc)
  580. {
  581. switch ((OpCode)*p)
  582. {
  583. case NOP: printf ("%d NOP\n", (p++)-code); break;
  584. case PUSHNIL: printf ("%d PUSHNIL\n", (p++)-code); break;
  585. case PUSH0: case PUSH1: case PUSH2:
  586. printf ("%d PUSH%c\n", p-code, *p-PUSH0+'0');
  587. p++;
  588. break;
  589. case PUSHBYTE:
  590. printf ("%d PUSHBYTE %d\n", p-code, *(++p));
  591. p++;
  592. break;
  593. case PUSHWORD:
  594. printf ("%d PUSHWORD %d\n", p-code, *((Word *)(p+1)));
  595. p += 1 + sizeof(Word);
  596. break;
  597. case PUSHFLOAT:
  598. printf ("%d PUSHFLOAT %f\n", p-code, *((float *)(p+1)));
  599. p += 1 + sizeof(float);
  600. break;
  601. case PUSHSTRING:
  602. printf ("%d PUSHSTRING %d\n", p-code, *((Word *)(p+1)));
  603. p += 1 + sizeof(Word);
  604. break;
  605. case PUSHLOCAL0: case PUSHLOCAL1: case PUSHLOCAL2: case PUSHLOCAL3:
  606. case PUSHLOCAL4: case PUSHLOCAL5: case PUSHLOCAL6: case PUSHLOCAL7:
  607. case PUSHLOCAL8: case PUSHLOCAL9:
  608. printf ("%d PUSHLOCAL%c\n", p-code, *p-PUSHLOCAL0+'0');
  609. p++;
  610. break;
  611. case PUSHLOCAL: printf ("%d PUSHLOCAL %d\n", p-code, *(++p));
  612. p++;
  613. break;
  614. case PUSHGLOBAL:
  615. printf ("%d PUSHGLOBAL %d\n", p-code, *((Word *)(p+1)));
  616. p += 1 + sizeof(Word);
  617. break;
  618. case PUSHINDEXED: printf ("%d PUSHINDEXED\n", (p++)-code); break;
  619. case PUSHMARK: printf ("%d PUSHMARK\n", (p++)-code); break;
  620. case PUSHOBJECT: printf ("%d PUSHOBJECT\n", (p++)-code); break;
  621. case STORELOCAL0: case STORELOCAL1: case STORELOCAL2: case STORELOCAL3:
  622. case STORELOCAL4: case STORELOCAL5: case STORELOCAL6: case STORELOCAL7:
  623. case STORELOCAL8: case STORELOCAL9:
  624. printf ("%d STORELOCAL%c\n", p-code, *p-STORELOCAL0+'0');
  625. p++;
  626. break;
  627. case STORELOCAL:
  628. printf ("%d STORELOCAK %d\n", p-code, *(++p));
  629. p++;
  630. break;
  631. case STOREGLOBAL:
  632. printf ("%d STOREGLOBAL %d\n", p-code, *((Word *)(p+1)));
  633. p += 1 + sizeof(Word);
  634. break;
  635. case STOREINDEXED0: printf ("%d STOREINDEXED0\n", (p++)-code); break;
  636. case STOREINDEXED: printf ("%d STOREINDEXED %d\n", p-code, *(++p));
  637. p++;
  638. break;
  639. case STOREFIELD: printf ("%d STOREFIELD\n", (p++)-code); break;
  640. case ADJUST:
  641. printf ("%d ADJUST %d\n", p-code, *(++p));
  642. p++;
  643. break;
  644. case CREATEARRAY: printf ("%d CREATEARRAY\n", (p++)-code); break;
  645. case EQOP: printf ("%d EQOP\n", (p++)-code); break;
  646. case LTOP: printf ("%d LTOP\n", (p++)-code); break;
  647. case LEOP: printf ("%d LEOP\n", (p++)-code); break;
  648. case ADDOP: printf ("%d ADDOP\n", (p++)-code); break;
  649. case SUBOP: printf ("%d SUBOP\n", (p++)-code); break;
  650. case MULTOP: printf ("%d MULTOP\n", (p++)-code); break;
  651. case DIVOP: printf ("%d DIVOP\n", (p++)-code); break;
  652. case CONCOP: printf ("%d CONCOP\n", (p++)-code); break;
  653. case MINUSOP: printf ("%d MINUSOP\n", (p++)-code); break;
  654. case NOTOP: printf ("%d NOTOP\n", (p++)-code); break;
  655. case ONTJMP:
  656. printf ("%d ONTJMP %d\n", p-code, *((Word *)(p+1)));
  657. p += sizeof(Word) + 1;
  658. break;
  659. case ONFJMP:
  660. printf ("%d ONFJMP %d\n", p-code, *((Word *)(p+1)));
  661. p += sizeof(Word) + 1;
  662. break;
  663. case JMP:
  664. printf ("%d JMP %d\n", p-code, *((Word *)(p+1)));
  665. p += sizeof(Word) + 1;
  666. break;
  667. case UPJMP:
  668. printf ("%d UPJMP %d\n", p-code, *((Word *)(p+1)));
  669. p += sizeof(Word) + 1;
  670. break;
  671. case IFFJMP:
  672. printf ("%d IFFJMP %d\n", p-code, *((Word *)(p+1)));
  673. p += sizeof(Word) + 1;
  674. break;
  675. case IFFUPJMP:
  676. printf ("%d IFFUPJMP %d\n", p-code, *((Word *)(p+1)));
  677. p += sizeof(Word) + 1;
  678. break;
  679. case POP: printf ("%d POP\n", (p++)-code); break;
  680. case CALLFUNC: printf ("%d CALLFUNC\n", (p++)-code); break;
  681. case RETCODE:
  682. printf ("%d RETCODE %d\n", p-code, *(++p));
  683. p++;
  684. break;
  685. default: printf ("%d Cannot happen\n", (p++)-code); break;
  686. }
  687. }
  688. }
  689. #endif