diff options
Diffstat (limited to 'lcode.c')
-rw-r--r-- | lcode.c | 16 |
1 files changed, 8 insertions, 8 deletions
@@ -1,5 +1,5 @@ | |||
1 | /* | 1 | /* |
2 | ** $Id: lcode.c,v 1.39 2000/06/26 19:28:31 roberto Exp roberto $ | 2 | ** $Id: lcode.c,v 1.40 2000/06/28 20:20:36 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 | */ |
@@ -191,7 +191,7 @@ void luaK_storevar (LexState *ls, const expdesc *var) { | |||
191 | luaK_code2(fs, OP_SETTABLE, 3, 3); | 191 | luaK_code2(fs, OP_SETTABLE, 3, 3); |
192 | break; | 192 | break; |
193 | default: | 193 | default: |
194 | LUA_INTERNALERROR(ls->L, "invalid var kind to store"); | 194 | LUA_INTERNALERROR("invalid var kind to store"); |
195 | } | 195 | } |
196 | } | 196 | } |
197 | 197 | ||
@@ -207,7 +207,7 @@ static OpCode invertjump (OpCode op) { | |||
207 | case OP_JMPT: case OP_JMPONT: return OP_JMPF; | 207 | case OP_JMPT: case OP_JMPONT: return OP_JMPF; |
208 | case OP_JMPF: case OP_JMPONF: return OP_JMPT; | 208 | case OP_JMPF: case OP_JMPONF: return OP_JMPT; |
209 | default: | 209 | default: |
210 | LUA_INTERNALERROR(NULL, "invalid jump instruction"); | 210 | LUA_INTERNALERROR("invalid jump instruction"); |
211 | return OP_END; /* to avoid warnings */ | 211 | return OP_END; /* to avoid warnings */ |
212 | } | 212 | } |
213 | } | 213 | } |
@@ -282,7 +282,7 @@ static void luaK_testgo (FuncState *fs, expdesc *v, int invert, OpCode jump) { | |||
282 | discharge1(fs, v); | 282 | discharge1(fs, v); |
283 | prevpos = fs->pc-1; | 283 | prevpos = fs->pc-1; |
284 | previous = &fs->f->code[prevpos]; | 284 | previous = &fs->f->code[prevpos]; |
285 | LUA_ASSERT(L, *previous==previous_instruction(fs), "no jump allowed here"); | 285 | LUA_ASSERT(*previous==previous_instruction(fs), "no jump allowed here"); |
286 | if (!ISJUMP(GET_OPCODE(*previous))) | 286 | if (!ISJUMP(GET_OPCODE(*previous))) |
287 | prevpos = luaK_code1(fs, jump, NO_JUMP); | 287 | prevpos = luaK_code1(fs, jump, NO_JUMP); |
288 | else { /* last instruction is already a jump */ | 288 | else { /* last instruction is already a jump */ |
@@ -382,13 +382,13 @@ void luaK_infix (LexState *ls, int op, expdesc *v) { | |||
382 | void luaK_posfix (LexState *ls, int op, expdesc *v1, expdesc *v2) { | 382 | void luaK_posfix (LexState *ls, int op, expdesc *v1, expdesc *v2) { |
383 | FuncState *fs = ls->fs; | 383 | FuncState *fs = ls->fs; |
384 | if (op == TK_AND) { | 384 | if (op == TK_AND) { |
385 | LUA_ASSERT(ls->L, v1->u.l.t == NO_JUMP, "list must be closed"); | 385 | LUA_ASSERT(v1->u.l.t == NO_JUMP, "list must be closed"); |
386 | discharge1(fs, v2); | 386 | discharge1(fs, v2); |
387 | v1->u.l.t = v2->u.l.t; | 387 | v1->u.l.t = v2->u.l.t; |
388 | luaK_concat(fs, &v1->u.l.f, v2->u.l.f); | 388 | luaK_concat(fs, &v1->u.l.f, v2->u.l.f); |
389 | } | 389 | } |
390 | else if (op == TK_OR) { | 390 | else if (op == TK_OR) { |
391 | LUA_ASSERT(ls->L, v1->u.l.f == NO_JUMP, "list must be closed"); | 391 | LUA_ASSERT(v1->u.l.f == NO_JUMP, "list must be closed"); |
392 | discharge1(fs, v2); | 392 | discharge1(fs, v2); |
393 | v1->u.l.f = v2->u.l.f; | 393 | v1->u.l.f = v2->u.l.f; |
394 | luaK_concat(fs, &v1->u.l.t, v2->u.l.t); | 394 | luaK_concat(fs, &v1->u.l.t, v2->u.l.t); |
@@ -598,11 +598,11 @@ int luaK_code2 (FuncState *fs, OpCode o, int arg1, int arg2) { | |||
598 | case OP_GETINDEXED: | 598 | case OP_GETINDEXED: |
599 | case OP_TAILCALL: | 599 | case OP_TAILCALL: |
600 | case OP_ADDI: { | 600 | case OP_ADDI: { |
601 | LUA_INTERNALERROR(L, "instruction used only for optimizations"); | 601 | LUA_INTERNALERROR("instruction used only for optimizations"); |
602 | break; | 602 | break; |
603 | } | 603 | } |
604 | default: { | 604 | default: { |
605 | LUA_ASSERT(L, delta != VD, "invalid delta"); | 605 | LUA_ASSERT(delta != VD, "invalid delta"); |
606 | break; | 606 | break; |
607 | } | 607 | } |
608 | } | 608 | } |