34   return (e->k == VKNUM && e->t == NO_JUMP && e->f == NO_JUMP);  in isnumeral()
63   fs->jpc = NO_JUMP;  in luaK_jump()
64   j = luaK_codeAsBx(fs, OP_JMP, 0, NO_JUMP);  in luaK_jump()
84   lua_assert(dest != NO_JUMP);  in fixjump()
103   if (offset == NO_JUMP)  /* point to itself represents end of list */  in getjump()
104     return NO_JUMP;  /* end of list */  in getjump()
124   for (; list != NO_JUMP; list = getjump(fs, list)) {  in need_value()
146   for (; list != NO_JUMP; list = getjump(fs, list))  in removevalues()
153   while (list != NO_JUMP) {  in patchlistaux()
166   fs->jpc = NO_JUMP;  in dischargejpc()
182   while (list != NO_JUMP) {  in luaK_patchclose()
200   if (l2 == NO_JUMP) return;  in luaK_concat()
201   else if (*l1 == NO_JUMP)  in luaK_concat()
206     while ((next = getjump(fs, list)) != NO_JUMP)  /* find last element */  in luaK_concat()
475     int p_f = NO_JUMP;  /* position of an eventual LOAD false */  in exp2reg()
476     int p_t = NO_JUMP;  /* position of an eventual LOAD true */  in exp2reg()
478       int fj = (e->k == VJMP) ? NO_JUMP : luaK_jump(fs);  in exp2reg()
487   e->f = e->t = NO_JUMP;  in exp2reg()
632       pc = NO_JUMP;  /* always true; do nothing */  in luaK_goiftrue()
642   e->t = NO_JUMP;  in luaK_goiftrue()
655       pc = NO_JUMP;  /* always false; do nothing */  in luaK_goiffalse()
665   e->f = NO_JUMP;  in luaK_goiffalse()
770   e2.t = e2.f = NO_JUMP; e2.k = VKNUM; e2.u.nval = 0;  in luaK_prefix()
823       lua_assert(e1->t == NO_JUMP);  /* list must be closed */  in luaK_posfix()
830       lua_assert(e1->f == NO_JUMP);  /* list must be closed */  in luaK_posfix()