NO_JUMP
if (offset == NO_JUMP) /* point to itself represents end of list */
return NO_JUMP; /* end of list */
for (; list != NO_JUMP; list = getjump(fs, list)) {
for (; list != NO_JUMP; list = getjump(fs, list))
while (list != NO_JUMP) {
fs->jpc = NO_JUMP;
while (list != NO_JUMP) {
if (l2 == NO_JUMP) return;
else if (*l1 == NO_JUMP)
while ((next = getjump(fs, list)) != NO_JUMP) /* find last element */
return (e->k == VKNUM && e->t == NO_JUMP && e->f == NO_JUMP);
int p_f = NO_JUMP; /* position of an eventual LOAD false */
int p_t = NO_JUMP; /* position of an eventual LOAD true */
int fj = (e->k == VJMP) ? NO_JUMP : luaK_jump(fs);
e->f = e->t = NO_JUMP;
fs->jpc = NO_JUMP;
j = luaK_codeAsBx(fs, OP_JMP, 0, NO_JUMP);
pc = NO_JUMP; /* always true; do nothing */
e->t = NO_JUMP;
pc = NO_JUMP; /* always false; do nothing */
e->f = NO_JUMP;
e2.t = e2.f = NO_JUMP; e2.k = VKNUM; e2.u.nval = 0;
lua_assert(dest != NO_JUMP);
lua_assert(e1->t == NO_JUMP); /* list must be closed */
lua_assert(e1->f == NO_JUMP); /* list must be closed */
prep = isnum ? luaK_codeAsBx(fs, OP_FORPREP, base, NO_JUMP) : luaK_jump(fs);
endfor = luaK_codeAsBx(fs, OP_FORLOOP, base, NO_JUMP);
endfor = luaK_codeAsBx(fs, OP_TFORLOOP, base + 2, NO_JUMP);
int escapelist = NO_JUMP; /* exit list for finished parts */
e->f = e->t = NO_JUMP;
fs->jpc = NO_JUMP;