isdummy
n->isdummy = TRUE;
n->isdummy = TRUE;
n->isdummy = TRUE;
n->isdummy = FALSE;
while ((n != NULL) && ((n->isdummy) || (n->id != id)))
if ((!(kl->notice)->isdummy) &&
} else if ((!(k->notice)->isdummy) &&
while ((n != NULL) && (n->isdummy)) n = n->right;
while ((fn != NULL) && (fn->isdummy))
short int isdummy;
int isdummy;
n->isdummy = 1;
n->isdummy = 1;
n->isdummy = 1;
x->isdummy = 0;
if (!n->isdummy && ev_match(n->event, id1) != 0) {
if (!kl->notice->isdummy &&
} else if (!k->notice->isdummy &&
while (n2 != NULL && n2->isdummy) {
while (n != NULL && n->isdummy) {
if (!isdummy(nold))
int nsize = isdummy(t->node) ? 0 : sizenode(t);
if (!isdummy(t->node))
if (!ttisnil(gval(mp)) || isdummy(mp)) { /* main position is taken? */
lua_assert(!isdummy(n));
else if (isdummy(t->node)) /* hash part is empty? */
int luaH_isdummy (Node *n) { return isdummy(n); }