Lines Matching refs:fs
36 void luaK_nil (FuncState *fs, int from, int n) {
39 if (fs->pc > fs->lasttarget) { /* no jumps to current position? */
40 previous = &fs->f->code[fs->pc-1];
54 luaK_codeABC(fs, OP_LOADNIL, from, n - 1, 0); /* else no optimization */
58 int luaK_jump (FuncState *fs) {
59 int jpc = fs->jpc; /* save list of jumps to here */
61 fs->jpc = NO_JUMP;
62 j = luaK_codeAsBx(fs, OP_JMP, 0, NO_JUMP);
63 luaK_concat(fs, &j, jpc); /* keep them on hold */
68 void luaK_ret (FuncState *fs, int first, int nret) {
69 luaK_codeABC(fs, OP_RETURN, first, nret+1, 0);
73 static int condjump (FuncState *fs, OpCode op, int A, int B, int C) {
74 luaK_codeABC(fs, op, A, B, C);
75 return luaK_jump(fs);
79 static void fixjump (FuncState *fs, int pc, int dest) {
80 Instruction *jmp = &fs->f->code[pc];
84 luaX_syntaxerror(fs->ls, "control structure too long");
93 int luaK_getlabel (FuncState *fs) {
94 fs->lasttarget = fs->pc;
95 return fs->pc;
99 static int getjump (FuncState *fs, int pc) {
100 int offset = GETARG_sBx(fs->f->code[pc]);
108 static Instruction *getjumpcontrol (FuncState *fs, int pc) {
109 Instruction *pi = &fs->f->code[pc];
121 static int need_value (FuncState *fs, int list) {
122 for (; list != NO_JUMP; list = getjump(fs, list)) {
123 Instruction i = *getjumpcontrol(fs, list);
130 static int patchtestreg (FuncState *fs, int node, int reg) {
131 Instruction *i = getjumpcontrol(fs, node);
143 static void removevalues (FuncState *fs, int list) {
144 for (; list != NO_JUMP; list = getjump(fs, list))
145 patchtestreg(fs, list, NO_REG);
149 static void patchlistaux (FuncState *fs, int list, int vtarget, int reg,
152 int next = getjump(fs, list);
153 if (patchtestreg(fs, list, reg))
154 fixjump(fs, list, vtarget);
156 fixjump(fs, list, dtarget); /* jump to default target */
162 static void dischargejpc (FuncState *fs) {
163 patchlistaux(fs, fs->jpc, fs->pc, NO_REG, fs->pc);
164 fs->jpc = NO_JUMP;
168 void luaK_patchlist (FuncState *fs, int list, int target) {
169 if (target == fs->pc)
170 luaK_patchtohere(fs, list);
172 lua_assert(target < fs->pc);
173 patchlistaux(fs, list, target, NO_REG, target);
178 LUAI_FUNC void luaK_patchclose (FuncState *fs, int list, int level) {
181 int next = getjump(fs, list);
182 lua_assert(GET_OPCODE(fs->f->code[list]) == OP_JMP &&
183 (GETARG_A(fs->f->code[list]) == 0 ||
184 GETARG_A(fs->f->code[list]) >= level));
185 SETARG_A(fs->f->code[list], level);
191 void luaK_patchtohere (FuncState *fs, int list) {
192 luaK_getlabel(fs);
193 luaK_concat(fs, &fs->jpc, list);
197 void luaK_concat (FuncState *fs, int *l1, int l2) {
204 while ((next = getjump(fs, list)) != NO_JUMP) /* find last element */
206 fixjump(fs, list, l2);
211 static int luaK_code (FuncState *fs, Instruction i) {
212 Proto *f = fs->f;
213 dischargejpc(fs); /* `pc' will change */
215 luaM_growvector(fs->ls->L, f->code, fs->pc, f->sizecode, Instruction,
217 f->code[fs->pc] = i;
219 luaM_growvector(fs->ls->L, f->lineinfo, fs->pc, f->sizelineinfo, int,
221 f->lineinfo[fs->pc] = fs->ls->lastline;
222 return fs->pc++;
226 int luaK_codeABC (FuncState *fs, OpCode o, int a, int b, int c) {
231 return luaK_code(fs, CREATE_ABC(o, a, b, c));
235 int luaK_codeABx (FuncState *fs, OpCode o, int a, unsigned int bc) {
239 return luaK_code(fs, CREATE_ABx(o, a, bc));
243 static int codeextraarg (FuncState *fs, int a) {
245 return luaK_code(fs, CREATE_Ax(OP_EXTRAARG, a));
249 int luaK_codek (FuncState *fs, int reg, int k) {
251 return luaK_codeABx(fs, OP_LOADK, reg, k);
253 int p = luaK_codeABx(fs, OP_LOADKX, reg, 0);
254 codeextraarg(fs, k);
260 void luaK_checkstack (FuncState *fs, int n) {
261 int newstack = fs->freereg + n;
262 if (newstack > fs->f->maxstacksize) {
264 luaX_syntaxerror(fs->ls, "function or expression too complex");
265 fs->f->maxstacksize = cast_byte(newstack);
270 void luaK_reserveregs (FuncState *fs, int n) {
271 luaK_checkstack(fs, n);
272 fs->freereg += n;
276 static void freereg (FuncState *fs, int reg) {
277 if (!ISK(reg) && reg >= fs->nactvar) {
278 fs->freereg--;
279 lua_assert(reg == fs->freereg);
284 static void freeexp (FuncState *fs, expdesc *e) {
286 freereg(fs, e->u.info);
290 static int addk (FuncState *fs, TValue *key, TValue *v) {
291 lua_State *L = fs->ls->L;
292 TValue *idx = luaH_set(L, fs->h, key);
293 Proto *f = fs->f;
305 k = fs->nk;
312 fs->nk++;
318 int luaK_stringK (FuncState *fs, TString *s) {
320 setsvalue(fs->ls->L, &o, s);
321 return addk(fs, &o, &o);
325 int luaK_numberK (FuncState *fs, lua_Number r) {
327 lua_State *L = fs->ls->L;
333 n = addk(fs, L->top - 1, &o);
337 n = addk(fs, &o, &o); /* regular case */
342 static int boolK (FuncState *fs, int b) {
345 return addk(fs, &o, &o);
349 static int nilK (FuncState *fs) {
353 sethvalue(fs->ls->L, &k, fs->h);
354 return addk(fs, &k, &v);
358 void luaK_setreturns (FuncState *fs, expdesc *e, int nresults) {
360 SETARG_C(getcode(fs, e), nresults+1);
363 SETARG_B(getcode(fs, e), nresults+1);
364 SETARG_A(getcode(fs, e), fs->freereg);
365 luaK_reserveregs(fs, 1);
370 void luaK_setoneret (FuncState *fs, expdesc *e) {
373 e->u.info = GETARG_A(getcode(fs, e));
376 SETARG_B(getcode(fs, e), 2);
382 void luaK_dischargevars (FuncState *fs, expdesc *e) {
389 e->u.info = luaK_codeABC(fs, OP_GETUPVAL, 0, e->u.info, 0);
395 freereg(fs, e->u.ind.idx);
397 freereg(fs, e->u.ind.t);
400 e->u.info = luaK_codeABC(fs, op, 0, e->u.ind.t, e->u.ind.idx);
406 luaK_setoneret(fs, e);
414 static int code_label (FuncState *fs, int A, int b, int jump) {
415 luaK_getlabel(fs); /* those instructions may be jump targets */
416 return luaK_codeABC(fs, OP_LOADBOOL, A, b, jump);
420 static void discharge2reg (FuncState *fs, expdesc *e, int reg) {
421 luaK_dischargevars(fs, e);
424 luaK_nil(fs, reg, 1);
428 luaK_codeABC(fs, OP_LOADBOOL, reg, e->k == VTRUE, 0);
432 luaK_codek(fs, reg, e->u.info);
436 luaK_codek(fs, reg, luaK_numberK(fs, e->u.nval));
440 Instruction *pc = &getcode(fs, e);
446 luaK_codeABC(fs, OP_MOVE, reg, e->u.info, 0);
459 static void discharge2anyreg (FuncState *fs, expdesc *e) {
461 luaK_reserveregs(fs, 1);
462 discharge2reg(fs, e, fs->freereg-1);
467 static void exp2reg (FuncState *fs, expdesc *e, int reg) {
468 discharge2reg(fs, e, reg);
470 luaK_concat(fs, &e->t, e->u.info); /* put this jump in `t' list */
475 if (need_value(fs, e->t) || need_value(fs, e->f)) {
476 int fj = (e->k == VJMP) ? NO_JUMP : luaK_jump(fs);
477 p_f = code_label(fs, reg, 0, 1);
478 p_t = code_label(fs, reg, 1, 0);
479 luaK_patchtohere(fs, fj);
481 final = luaK_getlabel(fs);
482 patchlistaux(fs, e->f, final, reg, p_f);
483 patchlistaux(fs, e->t, final, reg, p_t);
491 void luaK_exp2nextreg (FuncState *fs, expdesc *e) {
492 luaK_dischargevars(fs, e);
493 freeexp(fs, e);
494 luaK_reserveregs(fs, 1);
495 exp2reg(fs, e, fs->freereg - 1);
499 int luaK_exp2anyreg (FuncState *fs, expdesc *e) {
500 luaK_dischargevars(fs, e);
503 if (e->u.info >= fs->nactvar) { /* reg. is not a local? */
504 exp2reg(fs, e, e->u.info); /* put value on it */
508 luaK_exp2nextreg(fs, e); /* default */
513 void luaK_exp2anyregup (FuncState *fs, expdesc *e) {
515 luaK_exp2anyreg(fs, e);
519 void luaK_exp2val (FuncState *fs, expdesc *e) {
521 luaK_exp2anyreg(fs, e);
523 luaK_dischargevars(fs, e);
527 int luaK_exp2RK (FuncState *fs, expdesc *e) {
528 luaK_exp2val(fs, e);
533 if (fs->nk <= MAXINDEXRK) { /* constant fits in RK operand? */
534 e->u.info = (e->k == VNIL) ? nilK(fs) : boolK(fs, (e->k == VTRUE));
541 e->u.info = luaK_numberK(fs, e->u.nval);
553 return luaK_exp2anyreg(fs, e);
557 void luaK_storevar (FuncState *fs, expdesc *var, expdesc *ex) {
560 freeexp(fs, ex);
561 exp2reg(fs, ex, var->u.info);
565 int e = luaK_exp2anyreg(fs, ex);
566 luaK_codeABC(fs, OP_SETUPVAL, e, var->u.info, 0);
571 int e = luaK_exp2RK(fs, ex);
572 luaK_codeABC(fs, op, var->u.ind.t, var->u.ind.idx, e);
580 freeexp(fs, ex);
584 void luaK_self (FuncState *fs, expdesc *e, expdesc *key) {
586 luaK_exp2anyreg(fs, e);
588 freeexp(fs, e);
589 e->u.info = fs->freereg; /* base register for op_self */
591 luaK_reserveregs(fs, 2); /* function and 'self' produced by op_self */
592 luaK_codeABC(fs, OP_SELF, e->u.info, ereg, luaK_exp2RK(fs, key));
593 freeexp(fs, key);
597 static void invertjump (FuncState *fs, expdesc *e) {
598 Instruction *pc = getjumpcontrol(fs, e->u.info);
605 static int jumponcond (FuncState *fs, expdesc *e, int cond) {
607 Instruction ie = getcode(fs, e);
609 fs->pc--; /* remove previous OP_NOT */
610 return condjump(fs, OP_TEST, GETARG_B(ie), 0, !cond);
614 discharge2anyreg(fs, e);
615 freeexp(fs, e);
616 return condjump(fs, OP_TESTSET, NO_REG, e->u.info, cond);
620 void luaK_goiftrue (FuncState *fs, expdesc *e) {
622 luaK_dischargevars(fs, e);
625 invertjump(fs, e);
634 pc = jumponcond(fs, e, 0);
638 luaK_concat(fs, &e->f, pc); /* insert last jump in `f' list */
639 luaK_patchtohere(fs, e->t);
644 void luaK_goiffalse (FuncState *fs, expdesc *e) {
646 luaK_dischargevars(fs, e);
657 pc = jumponcond(fs, e, 1);
661 luaK_concat(fs, &e->t, pc); /* insert last jump in `t' list */
662 luaK_patchtohere(fs, e->f);
667 static void codenot (FuncState *fs, expdesc *e) {
668 luaK_dischargevars(fs, e);
679 invertjump(fs, e);
684 discharge2anyreg(fs, e);
685 freeexp(fs, e);
686 e->u.info = luaK_codeABC(fs, OP_NOT, 0, e->u.info, 0);
697 removevalues(fs, e->f);
698 removevalues(fs, e->t);
702 void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) {
705 t->u.ind.idx = luaK_exp2RK(fs, k);
728 static void codearith (FuncState *fs, OpCode op,
733 int o2 = (op != OP_UNM && op != OP_LEN) ? luaK_exp2RK(fs, e2) : 0;
734 int o1 = luaK_exp2RK(fs, e1);
736 freeexp(fs, e1);
737 freeexp(fs, e2);
740 freeexp(fs, e2);
741 freeexp(fs, e1);
743 e1->u.info = luaK_codeABC(fs, op, 0, o1, o2);
745 luaK_fixline(fs, line);
750 static void codecomp (FuncState *fs, OpCode op, int cond, expdesc *e1,
752 int o1 = luaK_exp2RK(fs, e1);
753 int o2 = luaK_exp2RK(fs, e2);
754 freeexp(fs, e2);
755 freeexp(fs, e1);
761 e1->u.info = condjump(fs, op, cond, o1, o2);
766 void luaK_prefix (FuncState *fs, UnOpr op, expdesc *e, int line) {
774 luaK_exp2anyreg(fs, e);
775 codearith(fs, OP_UNM, e, &e2, line);
779 case OPR_NOT: codenot(fs, e); break;
781 luaK_exp2anyreg(fs, e); /* cannot operate on constants */
782 codearith(fs, OP_LEN, e, &e2, line);
790 void luaK_infix (FuncState *fs, BinOpr op, expdesc *v) {
793 luaK_goiftrue(fs, v);
797 luaK_goiffalse(fs, v);
801 luaK_exp2nextreg(fs, v); /* operand must be on the `stack' */
806 if (!isnumeral(v)) luaK_exp2RK(fs, v);
810 luaK_exp2RK(fs, v);
817 void luaK_posfix (FuncState *fs, BinOpr op,
822 luaK_dischargevars(fs, e2);
823 luaK_concat(fs, &e2->f, e1->f);
829 luaK_dischargevars(fs, e2);
830 luaK_concat(fs, &e2->t, e1->t);
835 luaK_exp2val(fs, e2);
836 if (e2->k == VRELOCABLE && GET_OPCODE(getcode(fs, e2)) == OP_CONCAT) {
837 lua_assert(e1->u.info == GETARG_B(getcode(fs, e2))-1);
838 freeexp(fs, e1);
839 SETARG_B(getcode(fs, e2), e1->u.info);
843 luaK_exp2nextreg(fs, e2); /* operand must be on the 'stack' */
844 codearith(fs, OP_CONCAT, e1, e2, line);
850 codearith(fs, cast(OpCode, op - OPR_ADD + OP_ADD), e1, e2, line);
854 codecomp(fs, cast(OpCode, op - OPR_EQ + OP_EQ), 1, e1, e2);
858 codecomp(fs, cast(OpCode, op - OPR_NE + OP_EQ), 0, e1, e2);
866 void luaK_fixline (FuncState *fs, int line) {
867 fs->f->lineinfo[fs->pc - 1] = line;
871 void luaK_setlist (FuncState *fs, int base, int nelems, int tostore) {
876 luaK_codeABC(fs, OP_SETLIST, base, b, c);
878 luaK_codeABC(fs, OP_SETLIST, base, b, 0);
879 codeextraarg(fs, c);
882 luaX_syntaxerror(fs->ls, "constructor too long");
883 fs->freereg = base + 1; /* free registers with list values */