Node 62 lib/lua/lgc.c static void removeentry (Node *n) { Node 185 lib/lua/lgc.c Node *n = gnode(h, i); Node 288 lib/lua/lgc.c sizeof(Node) * sizenode(h); Node 366 lib/lua/lgc.c Node *n = gnode(h, i); Node 326 lib/lua/lobject.h struct Node *next; /* for chaining */ Node 344 lib/lua/lobject.h Node *node; Node 345 lib/lua/lobject.h Node *lastfree; /* any free position is before this position */ Node 75 lib/lua/ltable.c static const Node dummynode_ = { Node 84 lib/lua/ltable.c static Node *hashnum (const Table *t, lua_Number n) { Node 100 lib/lua/ltable.c static Node *mainposition (const Table *t, const TValue *key) { Node 144 lib/lua/ltable.c Node *n = mainposition(t, key); Node 252 lib/lua/ltable.c Node *n = &t->node[i]; Node 275 lib/lua/ltable.c t->node = cast(Node *, dummynode); /* use common `dummynode' */ Node 284 lib/lua/ltable.c t->node = luaM_newvector(L, size, Node); Node 286 lib/lua/ltable.c Node *n = gnode(t, i); Node 301 lib/lua/ltable.c Node *nold = t->node; /* save old hash ... */ Node 318 lib/lua/ltable.c Node *old = nold+i; Node 323 lib/lua/ltable.c luaM_freearray(L, nold, twoto(oldhsize), Node); /* free old array */ Node 367 lib/lua/ltable.c t->node = cast(Node *, dummynode); Node 376 lib/lua/ltable.c luaM_freearray(L, t->node, sizenode(t), Node); Node 382 lib/lua/ltable.c static Node *getfreepos (Table *t) { Node 400 lib/lua/ltable.c Node *mp = mainposition(t, key); Node 402 lib/lua/ltable.c Node *othern; Node 403 lib/lua/ltable.c Node *n = getfreepos(t); /* get a free place */ Node 441 lib/lua/ltable.c Node *n = hashnum(t, nk); Node 456 lib/lua/ltable.c Node *n = hashstr(t, key); Node 482 lib/lua/ltable.c Node *n = mainposition(t, key); Node 582 lib/lua/ltable.c Node *luaH_mainposition (const Table *t, const TValue *key) { Node 586 lib/lua/ltable.c int luaH_isdummy (Node *n) { return n == dummynode; } Node 35 lib/lua/ltable.h LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key); Node 36 lib/lua/ltable.h LUAI_FUNC int luaH_isdummy (Node *n);