27 #define hasjumps(e)	((e)->t != (e)->f)
31   return (e->k == VKNUM && e->t == NO_JUMP && e->f == NO_JUMP);  in isnumeral()
43       previous = &fs->f->code[fs->pc-1];  in luaK_nil()
81   Instruction *jmp = &fs->f->code[pc];  in fixjump()
101   int offset = GETARG_sBx(fs->f->code[pc]);  in getjump()
110   Instruction *pi = &fs->f->code[pc];  in getjumpcontrol()
201   if (newstack > fs->f->maxstacksize) {  in luaK_checkstack()
204     fs->f->maxstacksize = cast_byte(newstack);  in luaK_checkstack()
232   Proto *f = fs->f;  in addk()  local
233   int oldsize = f->sizek;  in addk()
235     lua_assert(luaO_rawequalObj(&fs->f->k[cast_int(nvalue(idx))], v));  in addk()
240     luaM_growvector(L, f->k, fs->nk, f->sizek, TValue,  in addk()
242     while (oldsize < f->sizek) setnilvalue(&f->k[oldsize++]);  in addk()
243     setobj(L, &f->k[fs->nk], v);  in addk()
244     luaC_barrier(L, f, v);  in addk()
398     if (need_value(fs, e->t) || need_value(fs, e->f)) {  in exp2reg()
405     patchlistaux(fs, e->f, final, reg, p_f);  in exp2reg()
408   e->f = e->t = NO_JUMP;  in exp2reg()
557   luaK_concat(fs, &e->f, pc);  /* insert last jump in `f' list */  in luaK_goiftrue()
581   luaK_patchtohere(fs, e->f);  in luaK_goiffalse()
582   e->f = NO_JUMP;  in luaK_goiffalse()
615   { int temp = e->f; e->f = e->t; e->t = temp; }  in codenot()
616   removevalues(fs, e->f);  in codenot()
691   e2.t = e2.f = NO_JUMP; e2.k = VKNUM; e2.u.nval = 0;  in luaK_prefix()
742       luaK_concat(fs, &e2->f, e1->f);  in luaK_posfix()
747       lua_assert(e1->f == NO_JUMP);  /* list must be closed */  in luaK_posfix()
785   fs->f->lineinfo[fs->pc - 1] = line;  in luaK_fixline()
790   Proto *f = fs->f;  in luaK_code()  local
793   luaM_growvector(fs->L, f->code, fs->pc, f->sizecode, Instruction,  in luaK_code()
795   f->code[fs->pc] = i;  in luaK_code()
797   luaM_growvector(fs->L, f->lineinfo, fs->pc, f->sizelineinfo, int,  in luaK_code()
799   f->lineinfo[fs->pc] = line;  in luaK_code()