Searched refs:gnode (Results 1 – 3 of 3) sorted by relevance
| /l4re-core-master/lua/lib/contrib/src/ |
| A D | ltable.c | 75 #define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t))))
81 #define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1))))
331 i = cast_int(nodefromval(n) - gnode(t, 0)); /* key index in hash table */ in findindex()
349 if (!isempty(gval(gnode(t, i)))) { /* a non-empty entry? */ in luaH_next()
350 Node *n = gnode(t, i); in luaH_next()
483 Node *n = gnode(t, i); in setnodevector()
489 t->lastfree = gnode(t, size); /* all positions are free */ in setnodevector()
501 Node *old = gnode(ot, j); in reinsert()
|
| A D | ltable.h | 13 #define gnode(t,i) (&(t)->node[i]) macro
|
| A D | lgc.c | 122 #define gnodelast(h) gnode(h, cast_sizet(sizenode(h)))
445 for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ in traverseweakvalue()
491 Node *n = inv ? gnode(h, nsize - 1 - i) : gnode(h, i); in traverseephemeron()
523 for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ in traversestrongtable()
722 for (n = gnode(h, 0); n < limit; n++) { in clearbykeys()
747 for (n = gnode(h, 0); n < limit; n++) { in clearbyvalues()
|
Completed in 8 milliseconds