31   return (e->k == VKNUM && e->t == NO_JUMP && e->f == NO_JUMP);  in isnumeral()
62   fs->jpc = NO_JUMP;  in luaK_jump()
63   j = luaK_codeAsBx(fs, OP_JMP, 0, NO_JUMP);  in luaK_jump()
83   lua_assert(dest != NO_JUMP);  in fixjump()
102   if (offset == NO_JUMP)  /* point to itself represents end of list */  in getjump()
103     return NO_JUMP;  /* end of list */  in getjump()
123   for (; list != NO_JUMP; list = getjump(fs, list)) {  in need_value()
145   for (; list != NO_JUMP; list = getjump(fs, list))  in removevalues()
152   while (list != NO_JUMP) {  in patchlistaux()
165   fs->jpc = NO_JUMP;  in dischargejpc()
186   if (l2 == NO_JUMP) return;  in luaK_concat()
187   else if (*l1 == NO_JUMP)  in luaK_concat()
192     while ((next = getjump(fs, list)) != NO_JUMP)  /* find last element */  in luaK_concat()
396     int p_f = NO_JUMP;  /* position of an eventual LOAD false */  in exp2reg()
397     int p_t = NO_JUMP;  /* position of an eventual LOAD true */  in exp2reg()
399       int fj = (e->k == VJMP) ? NO_JUMP : luaK_jump(fs);  in exp2reg()
408   e->f = e->t = NO_JUMP;  in exp2reg()
544       pc = NO_JUMP;  /* always true; do nothing */  in luaK_goiftrue()
559   e->t = NO_JUMP;  in luaK_goiftrue()
568       pc = NO_JUMP;  /* always false; do nothing */  in luaK_goiffalse()
582   e->f = NO_JUMP;  in luaK_goiffalse()
691   e2.t = e2.f = NO_JUMP; e2.k = VKNUM; e2.u.nval = 0;  in luaK_prefix()
740       lua_assert(e1->t == NO_JUMP);  /* list must be closed */  in luaK_posfix()
747       lua_assert(e1->f == NO_JUMP);  /* list must be closed */  in luaK_posfix()