51 #define hashpow2(t,n)		(gnode(t, lmod((n), sizenode(t))))  argument
61 #define hashmod(t,n)	(gnode(t, ((n) % ((sizenode(t)-1)|1))))  argument
69 #define isdummy(n)		((n) == dummynode)  argument
80 static Node *hashnum (const Table *t, lua_Number n) {  in hashnum()
81   int i;  in hashnum()  local
129     lua_Number n = nvalue(key);  in arrayindex()  local
145   int i;  in findindex()  local
151     Node *n = mainposition(t, key);  in findindex()  local
170   int i = findindex(L, t, key);  /* find original element */  in luaH_next()  local
197   int i;  in computesizes()  local
201   int n = 0;  /* optimal size for array part */  in computesizes()  local
233   int i = 1;  /* count to traverse all array keys */  in numusearray()  local
257   int i = sizenode(t);  in numusehash()  local
259     Node *n = &t->node[i];  in numusehash()  local
271   int i;  in setarrayvector()  local
286     int i;  in setnodevector()  local
293       Node *n = gnode(t, i);  in setnodevector()  local
305   int i;  in luaH_resize()  local
346   int i;  in rehash()  local
413     Node *n = getfreepos(t);  /* get a free place */  in luaH_newkey()  local
452     Node *n = hashnum(t, nk);  in luaH_getint()  local
467   Node *n = hashstr(t, key);  in luaH_getstr()  local
487       lua_Number n = nvalue(key);  in luaH_get()  local
495       Node *n = mainposition(t, key);  in luaH_get()  local
534   unsigned int i = j;  /* i is zero or a present index */  in unbound_search()  local
565     unsigned int i = 0;  in luaH_getn()  local
587 int luaH_isdummy (Node *n) { return isdummy(n); }  in luaH_isdummy()