Home
last modified time | relevance | path

Searched refs:gnode (Results 1 – 10 of 10) sorted by relevance

/src/sys/contrib/openzfs/module/lua/
H A Dltable.c51 #define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t))))
61 #define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1))))
157 i = cast_int(n - gnode(t, 0)); /* key index in hash table */ in findindex()
179 if (!ttisnil(gval(gnode(t, i)))) { /* a non-nil value? */ in luaH_next()
180 setobj2s(L, key, gkey(gnode(t, i))); in luaH_next()
181 setobj2s(L, key+1, gval(gnode(t, i))); in luaH_next()
293 Node *n = gnode(t, i); in setnodevector()
300 t->lastfree = gnode(t, size); /* all positions are free */ in setnodevector()
H A Dltable.h14 #define gnode(t,i) ((Node *)&(t)->node[i]) macro
H A Dlgc.c93 #define gnodelast(h) gnode(h, cast(size_t, sizenode(h)))
359 for (n = gnode(h, 0); n < limit; n++) { in traverseweakvalue()
391 for (n = gnode(h, 0); n < limit; n++) { in traverseephemeron()
420 for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ in traversestrongtable()
628 for (n = gnode(h, 0); n < limit; n++) { in clearkeys()
652 for (n = gnode(h, 0); n < limit; n++) { in clearvalues()
/src/contrib/lua/src/
H A Dltable.c75 #define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t))))
81 #define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1))))
342 i = cast_int(nodefromval(n) - gnode(t, 0)); /* key index in hash table */ in findindex()
360 if (!isempty(gval(gnode(t, i)))) { /* a non-empty entry? */ in luaH_next()
361 Node *n = gnode(t, i); in luaH_next()
494 Node *n = gnode(t, i); in setnodevector()
500 t->lastfree = gnode(t, size); /* all positions are free */ in setnodevector()
512 Node *old = gnode(ot, j); in reinsert()
H A Dltable.h13 #define gnode(t,i) (&(t)->node[i]) macro
H A Dlgc.c122 #define gnodelast(h) gnode(h, cast_sizet(sizenode(h)))
451 for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ in traverseweakvalue()
497 Node *n = inv ? gnode(h, nsize - 1 - i) : gnode(h, i); in traverseephemeron()
529 for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ in traversestrongtable()
730 for (n = gnode(h, 0); n < limit; n++) { in clearbykeys()
755 for (n = gnode(h, 0); n < limit; n++) { in clearbyvalues()
H A Dltests.c362 Node *n, *limit = gnode(h, sizenode(h)); in checktable()
367 for (n = gnode(h, 0); n < limit; n++) { in checktable()
1013 getnodekey(L, &k, gnode(t, i)); in table_query()
1014 if (!isempty(gval(gnode(t, i))) || in table_query()
1021 pushobject(L, gval(gnode(t, i))); in table_query()
/src/contrib/bmake/unit-tests/
H A DMakefile221 TESTS+= gnode-submake
680 POSTPROC.gnode-submake= awk '/Begin input graph/, /^$$/'
/src/usr.bin/bmake/unit-tests/
H A DMakefile224 TESTS+= gnode-submake
683 POSTPROC.gnode-submake= awk '/Begin input graph/, /^$$/'
/src/contrib/bmake/
H A DFILES400 unit-tests/gnode-submake.exp
401 unit-tests/gnode-submake.mk