diff options
| author | Roberto Ierusalimschy <roberto@inf.puc-rio.br> | 2000-04-04 17:48:44 -0300 |
|---|---|---|
| committer | Roberto Ierusalimschy <roberto@inf.puc-rio.br> | 2000-04-04 17:48:44 -0300 |
| commit | 4e7e9e8de5b9e50694e161653ef03b5c15a53054 (patch) | |
| tree | a908866ce0a34b591c92b67143ac581861aeb216 /lcode.c | |
| parent | 3e45496295bef65692f690d1633a9ce6ad9408b0 (diff) | |
| download | lua-4e7e9e8de5b9e50694e161653ef03b5c15a53054.tar.gz lua-4e7e9e8de5b9e50694e161653ef03b5c15a53054.tar.bz2 lua-4e7e9e8de5b9e50694e161653ef03b5c15a53054.zip | |
new opcode INCLOCAL.
Diffstat (limited to 'lcode.c')
| -rw-r--r-- | lcode.c | 89 |
1 files changed, 58 insertions, 31 deletions
| @@ -1,10 +1,12 @@ | |||
| 1 | /* | 1 | /* |
| 2 | ** $Id: lcode.c,v 1.17 2000/03/24 12:18:30 roberto Exp roberto $ | 2 | ** $Id: lcode.c,v 1.18 2000/03/24 17:26:08 roberto Exp roberto $ |
| 3 | ** Code generator for Lua | 3 | ** Code generator for Lua |
| 4 | ** See Copyright Notice in lua.h | 4 | ** See Copyright Notice in lua.h |
| 5 | */ | 5 | */ |
| 6 | 6 | ||
| 7 | 7 | ||
| 8 | #include "stdlib.h" | ||
| 9 | |||
| 8 | #define LUA_REENTRANT | 10 | #define LUA_REENTRANT |
| 9 | 11 | ||
| 10 | #include "lcode.h" | 12 | #include "lcode.h" |
| @@ -73,11 +75,12 @@ static void setprevious (FuncState *fs, Instruction i) { | |||
| 73 | 75 | ||
| 74 | 76 | ||
| 75 | static void luaK_minus (FuncState *fs) { | 77 | static void luaK_minus (FuncState *fs) { |
| 78 | /* PUSHINT s; MINUS -> PUSHINT -s (-k) */ | ||
| 79 | /* PUSHNUM u; MINUS -> PUSHNEGNUM u (-k) */ | ||
| 76 | Instruction previous = prepare(fs, CREATE_0(OP_MINUS), 0); | 80 | Instruction previous = prepare(fs, CREATE_0(OP_MINUS), 0); |
| 77 | switch(GET_OPCODE(previous)) { | 81 | switch(GET_OPCODE(previous)) { |
| 78 | case OP_PUSHINT: SETARG_S(previous, -GETARG_S(previous)); break; | 82 | case OP_PUSHINT: SETARG_S(previous, -GETARG_S(previous)); break; |
| 79 | case OP_PUSHNUM: SET_OPCODE(previous, OP_PUSHNEGNUM); break; | 83 | case OP_PUSHNUM: SET_OPCODE(previous, OP_PUSHNEGNUM); break; |
| 80 | case OP_PUSHNEGNUM: SET_OPCODE(previous, OP_PUSHNUM); break; | ||
| 81 | default: return; | 84 | default: return; |
| 82 | } | 85 | } |
| 83 | setprevious(fs, previous); | 86 | setprevious(fs, previous); |
| @@ -85,6 +88,7 @@ static void luaK_minus (FuncState *fs) { | |||
| 85 | 88 | ||
| 86 | 89 | ||
| 87 | static void luaK_gettable (FuncState *fs) { | 90 | static void luaK_gettable (FuncState *fs) { |
| 91 | /* PUSHSTRING u; GETTABLE -> GETDOTTED u (t.x) */ | ||
| 88 | Instruction previous = prepare(fs, CREATE_0(OP_GETTABLE), -1); | 92 | Instruction previous = prepare(fs, CREATE_0(OP_GETTABLE), -1); |
| 89 | switch(GET_OPCODE(previous)) { | 93 | switch(GET_OPCODE(previous)) { |
| 90 | case OP_PUSHSTRING: SET_OPCODE(previous, OP_GETDOTTED); break; | 94 | case OP_PUSHSTRING: SET_OPCODE(previous, OP_GETDOTTED); break; |
| @@ -95,6 +99,7 @@ static void luaK_gettable (FuncState *fs) { | |||
| 95 | 99 | ||
| 96 | 100 | ||
| 97 | static void luaK_add (FuncState *fs) { | 101 | static void luaK_add (FuncState *fs) { |
| 102 | /* PUSHINT s; ADD -> ADDI s (a+k) */ | ||
| 98 | Instruction previous = prepare(fs, CREATE_0(OP_ADD), -1); | 103 | Instruction previous = prepare(fs, CREATE_0(OP_ADD), -1); |
| 99 | switch(GET_OPCODE(previous)) { | 104 | switch(GET_OPCODE(previous)) { |
| 100 | case OP_PUSHINT: SET_OPCODE(previous, OP_ADDI); break; | 105 | case OP_PUSHINT: SET_OPCODE(previous, OP_ADDI); break; |
| @@ -105,6 +110,7 @@ static void luaK_add (FuncState *fs) { | |||
| 105 | 110 | ||
| 106 | 111 | ||
| 107 | static void luaK_sub (FuncState *fs) { | 112 | static void luaK_sub (FuncState *fs) { |
| 113 | /* PUSHINT s; SUB -> ADDI -s (a-k) */ | ||
| 108 | Instruction previous = prepare(fs, CREATE_0(OP_SUB), -1); | 114 | Instruction previous = prepare(fs, CREATE_0(OP_SUB), -1); |
| 109 | switch(GET_OPCODE(previous)) { | 115 | switch(GET_OPCODE(previous)) { |
| 110 | case OP_PUSHINT: | 116 | case OP_PUSHINT: |
| @@ -118,6 +124,7 @@ static void luaK_sub (FuncState *fs) { | |||
| 118 | 124 | ||
| 119 | 125 | ||
| 120 | static void luaK_conc (FuncState *fs) { | 126 | static void luaK_conc (FuncState *fs) { |
| 127 | /* CONC u; CONC 2 -> CONC u+1 (a..b..c) */ | ||
| 121 | Instruction previous = prepare(fs, CREATE_U(OP_CONC, 2), -1); | 128 | Instruction previous = prepare(fs, CREATE_U(OP_CONC, 2), -1); |
| 122 | switch(GET_OPCODE(previous)) { | 129 | switch(GET_OPCODE(previous)) { |
| 123 | case OP_CONC: SETARG_U(previous, GETARG_U(previous)+1); break; | 130 | case OP_CONC: SETARG_U(previous, GETARG_U(previous)+1); break; |
| @@ -127,8 +134,27 @@ static void luaK_conc (FuncState *fs) { | |||
| 127 | } | 134 | } |
| 128 | 135 | ||
| 129 | 136 | ||
| 137 | static void luaK_setlocal (FuncState *fs, int l) { | ||
| 138 | /* PUSHLOCAL l; ADDI k, SETLOCAL l -> INCLOCAL k, l ((local)a=a+k) */ | ||
| 139 | Instruction *code = fs->f->code; | ||
| 140 | int pc = fs->pc; | ||
| 141 | if (pc-1 > fs->lasttarget && /* no jumps in-between instructions? */ | ||
| 142 | code[pc-2] == CREATE_U(OP_PUSHLOCAL, l) && | ||
| 143 | GET_OPCODE(code[pc-1]) == OP_ADDI && | ||
| 144 | abs(GETARG_S(code[pc-1])) <= MAXARG_sA) { | ||
| 145 | int inc = GETARG_S(code[pc-1]); | ||
| 146 | fs->pc = pc-1; | ||
| 147 | code[pc-2] = CREATE_sAB(OP_INCLOCAL, inc, l); | ||
| 148 | luaK_deltastack(fs, -1); | ||
| 149 | } | ||
| 150 | else | ||
| 151 | luaK_U(fs, OP_SETLOCAL, l, -1); | ||
| 152 | } | ||
| 153 | |||
| 154 | |||
| 130 | static void luaK_eq (FuncState *fs) { | 155 | static void luaK_eq (FuncState *fs) { |
| 131 | Instruction previous = prepare(fs, CREATE_S(OP_IFEQJMP, 0), -2); | 156 | /* PUSHNIL 1; JMPEQ -> NOT (a==nil) */ |
| 157 | Instruction previous = prepare(fs, CREATE_S(OP_JMPEQ, 0), -2); | ||
| 132 | if (previous == CREATE_U(OP_PUSHNIL, 1)) { | 158 | if (previous == CREATE_U(OP_PUSHNIL, 1)) { |
| 133 | setprevious(fs, CREATE_0(OP_NOT)); | 159 | setprevious(fs, CREATE_0(OP_NOT)); |
| 134 | luaK_deltastack(fs, 1); /* undo delta from `prepare' */ | 160 | luaK_deltastack(fs, 1); /* undo delta from `prepare' */ |
| @@ -137,9 +163,10 @@ static void luaK_eq (FuncState *fs) { | |||
| 137 | 163 | ||
| 138 | 164 | ||
| 139 | static void luaK_neq (FuncState *fs) { | 165 | static void luaK_neq (FuncState *fs) { |
| 140 | Instruction previous = prepare(fs, CREATE_S(OP_IFNEQJMP, 0), -2); | 166 | /* PUSHNIL 1; JMPNEQ -> JMPT (a~=nil) */ |
| 167 | Instruction previous = prepare(fs, CREATE_S(OP_JMPNEQ, 0), -2); | ||
| 141 | if (previous == CREATE_U(OP_PUSHNIL, 1)) { | 168 | if (previous == CREATE_U(OP_PUSHNIL, 1)) { |
| 142 | setprevious(fs, CREATE_S(OP_IFTJMP, 0)); | 169 | setprevious(fs, CREATE_S(OP_JMPT, 0)); |
| 143 | } | 170 | } |
| 144 | } | 171 | } |
| 145 | 172 | ||
| @@ -171,7 +198,7 @@ void luaK_fixjump (FuncState *fs, int pc, int dest) { | |||
| 171 | SETARG_S(*jmp, 0); /* absolute value to represent end of list */ | 198 | SETARG_S(*jmp, 0); /* absolute value to represent end of list */ |
| 172 | else { /* jump is relative to position following jump instruction */ | 199 | else { /* jump is relative to position following jump instruction */ |
| 173 | int offset = dest-(pc+1); | 200 | int offset = dest-(pc+1); |
| 174 | if (offset < -MAXARG_S || offset > MAXARG_S) | 201 | if (abs(offset) > MAXARG_S) |
| 175 | luaK_error(fs->ls, "control structure too long"); | 202 | luaK_error(fs->ls, "control structure too long"); |
| 176 | SETARG_S(*jmp, offset); | 203 | SETARG_S(*jmp, offset); |
| 177 | } | 204 | } |
| @@ -298,7 +325,7 @@ void luaK_storevar (LexState *ls, const expdesc *var) { | |||
| 298 | FuncState *fs = ls->fs; | 325 | FuncState *fs = ls->fs; |
| 299 | switch (var->k) { | 326 | switch (var->k) { |
| 300 | case VLOCAL: | 327 | case VLOCAL: |
| 301 | luaK_U(fs, OP_SETLOCAL, var->u.index, -1); | 328 | luaK_setlocal(fs, var->u.index); |
| 302 | break; | 329 | break; |
| 303 | case VGLOBAL: | 330 | case VGLOBAL: |
| 304 | luaK_U(fs, OP_SETGLOBAL, var->u.index, -1); | 331 | luaK_U(fs, OP_SETGLOBAL, var->u.index, -1); |
| @@ -315,14 +342,14 @@ void luaK_storevar (LexState *ls, const expdesc *var) { | |||
| 315 | 342 | ||
| 316 | static OpCode invertjump (OpCode op) { | 343 | static OpCode invertjump (OpCode op) { |
| 317 | switch (op) { | 344 | switch (op) { |
| 318 | case OP_IFNEQJMP: return OP_IFEQJMP; | 345 | case OP_JMPNEQ: return OP_JMPEQ; |
| 319 | case OP_IFEQJMP: return OP_IFNEQJMP; | 346 | case OP_JMPEQ: return OP_JMPNEQ; |
| 320 | case OP_IFLTJMP: return OP_IFGEJMP; | 347 | case OP_JMPLT: return OP_JMPGE; |
| 321 | case OP_IFLEJMP: return OP_IFGTJMP; | 348 | case OP_JMPLE: return OP_JMPGT; |
| 322 | case OP_IFGTJMP: return OP_IFLEJMP; | 349 | case OP_JMPGT: return OP_JMPLE; |
| 323 | case OP_IFGEJMP: return OP_IFLTJMP; | 350 | case OP_JMPGE: return OP_JMPLT; |
| 324 | case OP_IFTJMP: case OP_ONTJMP: return OP_IFFJMP; | 351 | case OP_JMPT: case OP_JMPONT: return OP_JMPF; |
| 325 | case OP_IFFJMP: case OP_ONFJMP: return OP_IFTJMP; | 352 | case OP_JMPF: case OP_JMPONF: return OP_JMPT; |
| 326 | default: | 353 | default: |
| 327 | LUA_INTERNALERROR(NULL, "invalid jump instruction"); | 354 | LUA_INTERNALERROR(NULL, "invalid jump instruction"); |
| 328 | return OP_END; /* to avoid warnings */ | 355 | return OP_END; /* to avoid warnings */ |
| @@ -334,8 +361,8 @@ static void luaK_jump (FuncState *fs, OpCode jump) { | |||
| 334 | Instruction previous = prepare(fs, CREATE_S(jump, 0), -1); | 361 | Instruction previous = prepare(fs, CREATE_S(jump, 0), -1); |
| 335 | switch (GET_OPCODE(previous)) { | 362 | switch (GET_OPCODE(previous)) { |
| 336 | case OP_NOT: previous = CREATE_S(invertjump(jump), 0); break; | 363 | case OP_NOT: previous = CREATE_S(invertjump(jump), 0); break; |
| 337 | case OP_PUSHINT: | 364 | case OP_PUSHNIL: /* optimize `repeat until nil' */ |
| 338 | if (jump == OP_IFTJMP) { | 365 | if (GETARG_U(previous) == 1 && jump == OP_JMPF) { |
| 339 | previous = CREATE_S(OP_JMP, 0); | 366 | previous = CREATE_S(OP_JMP, 0); |
| 340 | break; | 367 | break; |
| 341 | } | 368 | } |
| @@ -364,10 +391,10 @@ static void luaK_patchlistaux (FuncState *fs, int list, int target, | |||
| 364 | luaK_fixjump(fs, list, special_target); | 391 | luaK_fixjump(fs, list, special_target); |
| 365 | else { | 392 | else { |
| 366 | luaK_fixjump(fs, list, target); /* do the patch */ | 393 | luaK_fixjump(fs, list, target); /* do the patch */ |
| 367 | if (op == OP_ONTJMP) /* remove eventual values */ | 394 | if (op == OP_JMPONT) /* remove eventual values */ |
| 368 | SET_OPCODE(*i, OP_IFTJMP); | 395 | SET_OPCODE(*i, OP_JMPT); |
| 369 | else if (op == OP_ONFJMP) | 396 | else if (op == OP_JMPONF) |
| 370 | SET_OPCODE(*i, OP_IFFJMP); | 397 | SET_OPCODE(*i, OP_JMPF); |
| 371 | } | 398 | } |
| 372 | list = next; | 399 | list = next; |
| 373 | } | 400 | } |
| @@ -427,12 +454,12 @@ static void luaK_testgo (FuncState *fs, expdesc *v, int invert, OpCode jump) { | |||
| 427 | 454 | ||
| 428 | 455 | ||
| 429 | void luaK_goiftrue (FuncState *fs, expdesc *v, int keepvalue) { | 456 | void luaK_goiftrue (FuncState *fs, expdesc *v, int keepvalue) { |
| 430 | luaK_testgo(fs, v, 1, keepvalue ? OP_ONFJMP : OP_IFFJMP); | 457 | luaK_testgo(fs, v, 1, keepvalue ? OP_JMPONF : OP_JMPF); |
| 431 | } | 458 | } |
| 432 | 459 | ||
| 433 | 460 | ||
| 434 | void luaK_goiffalse (FuncState *fs, expdesc *v, int keepvalue) { | 461 | void luaK_goiffalse (FuncState *fs, expdesc *v, int keepvalue) { |
| 435 | luaK_testgo(fs, v, 0, keepvalue ? OP_ONTJMP : OP_IFTJMP); | 462 | luaK_testgo(fs, v, 0, keepvalue ? OP_JMPONT : OP_JMPT); |
| 436 | } | 463 | } |
| 437 | 464 | ||
| 438 | 465 | ||
| @@ -456,8 +483,8 @@ void luaK_tostack (LexState *ls, expdesc *v, int onlyone) { | |||
| 456 | p_1 = luaK_S(fs, OP_PUSHINT, 1, 1); | 483 | p_1 = luaK_S(fs, OP_PUSHINT, 1, 1); |
| 457 | } | 484 | } |
| 458 | else { /* still may need a PUSHNIL or a PUSHINT */ | 485 | else { /* still may need a PUSHNIL or a PUSHINT */ |
| 459 | int need_nil = need_value(fs, v->u.l.f, OP_ONFJMP); | 486 | int need_nil = need_value(fs, v->u.l.f, OP_JMPONF); |
| 460 | int need_1 = need_value(fs, v->u.l.t, OP_ONTJMP); | 487 | int need_1 = need_value(fs, v->u.l.t, OP_JMPONT); |
| 461 | if (need_nil && need_1) { | 488 | if (need_nil && need_1) { |
| 462 | luaK_S(fs, OP_JMP, 2, 0); /* skip both pushes */ | 489 | luaK_S(fs, OP_JMP, 2, 0); /* skip both pushes */ |
| 463 | p_nil = luaK_0(fs, OP_PUSHNILJMP, 0); | 490 | p_nil = luaK_0(fs, OP_PUSHNILJMP, 0); |
| @@ -472,8 +499,8 @@ void luaK_tostack (LexState *ls, expdesc *v, int onlyone) { | |||
| 472 | } | 499 | } |
| 473 | } | 500 | } |
| 474 | final = luaK_getlabel(fs); | 501 | final = luaK_getlabel(fs); |
| 475 | luaK_patchlistaux(fs, v->u.l.f, p_nil, OP_ONFJMP, final); | 502 | luaK_patchlistaux(fs, v->u.l.f, p_nil, OP_JMPONF, final); |
| 476 | luaK_patchlistaux(fs, v->u.l.t, p_1, OP_ONTJMP, final); | 503 | luaK_patchlistaux(fs, v->u.l.t, p_1, OP_JMPONT, final); |
| 477 | v->u.l.f = v->u.l.t = NO_JUMP; | 504 | v->u.l.f = v->u.l.t = NO_JUMP; |
| 478 | } | 505 | } |
| 479 | } | 506 | } |
| @@ -536,10 +563,10 @@ void luaK_posfix (LexState *ls, int op, expdesc *v1, expdesc *v2) { | |||
| 536 | case TK_CONC: luaK_conc(fs); break; | 563 | case TK_CONC: luaK_conc(fs); break; |
| 537 | case TK_EQ: luaK_eq(fs); break; | 564 | case TK_EQ: luaK_eq(fs); break; |
| 538 | case TK_NE: luaK_neq(fs); break; | 565 | case TK_NE: luaK_neq(fs); break; |
| 539 | case '>': luaK_S(fs, OP_IFGTJMP, 0, -2); break; | 566 | case '>': luaK_S(fs, OP_JMPGT, 0, -2); break; |
| 540 | case '<': luaK_S(fs, OP_IFLTJMP, 0, -2); break; | 567 | case '<': luaK_S(fs, OP_JMPLT, 0, -2); break; |
| 541 | case TK_GE: luaK_S(fs, OP_IFGEJMP, 0, -2); break; | 568 | case TK_GE: luaK_S(fs, OP_JMPGE, 0, -2); break; |
| 542 | case TK_LE: luaK_S(fs, OP_IFLEJMP, 0, -2); break; | 569 | case TK_LE: luaK_S(fs, OP_JMPLE, 0, -2); break; |
| 543 | } | 570 | } |
| 544 | } | 571 | } |
| 545 | } | 572 | } |
