Home
last modified time | relevance | path

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

/f-stack/app/redis-5.0.5/deps/lua/src/
H A Dltable.c50 #define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t))))
60 #define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1))))
88 return gnode(t, 0); in hashnum()
150 i = cast_int(n - gnode(t, 0)); /* key index in hash table */ in findindex()
172 if (!ttisnil(gval(gnode(t, i)))) { /* a non-nil value? */ in luaH_next()
173 setobj2s(L, key, key2tval(gnode(t, i))); in luaH_next()
174 setobj2s(L, key+1, gval(gnode(t, i))); in luaH_next()
286 Node *n = gnode(t, i); in setnodevector()
293 t->lastfree = gnode(t, size); /* all positions are free */ in setnodevector()
H A Dltable.h13 #define gnode(t,i) (&(t)->node[i]) macro
H A Dlgc.c185 Node *n = gnode(h, i); in traversetable()
366 Node *n = gnode(h, i); in cleartable()
/f-stack/freebsd/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()