50 #define hashpow2(t,n)      (gnode(t, lmod((n), sizenode(t))))  argument
60 #define hashmod(t,n)	(gnode(t, ((n) % ((sizenode(t)-1)|1))))  argument
84 static Node *hashnum (const Table *t, lua_Number n) {  in hashnum()  argument
87   if (luai_numeq(n, 0))  /* avoid problems with -0 */  in hashnum()
89   memcpy(a, &n, sizeof(a));  in hashnum()
122     lua_Number n = nvalue(key);  in arrayindex()  local
124     lua_number2int(k, n);  in arrayindex()
125     if (luai_numeq(cast_num(k), n))  in arrayindex()
144     Node *n = mainposition(t, key);  in findindex()  local
147       if (luaO_rawequalObj(key2tval(n), key) ||  in findindex()
148             (ttype(gkey(n)) == LUA_TDEADKEY && iscollectable(key) &&  in findindex()
149              gcvalue(gkey(n)) == gcvalue(key))) {  in findindex()
150         i = cast_int(n - gnode(t, 0));  /* key index in hash table */  in findindex()
154       else n = gnext(n);  in findindex()
155     } while (n);  in findindex()
194   int n = 0;  /* optimal size for array part */  in computesizes()  local
199         n = twotoi;  /* optimal size (till now) */  in computesizes()
205   *narray = n;  in computesizes()
252     Node *n = &t->node[i];  in numusehash()  local
253     if (!ttisnil(gval(n))) {  in numusehash()
254       ause += countint(key2tval(n), nums);  in numusehash()
286       Node *n = gnode(t, i);  in setnodevector()  local
287       gnext(n) = NULL;  in setnodevector()
288       setnilvalue(gkey(n));  in setnodevector()
289       setnilvalue(gval(n));  in setnodevector()
403     Node *n = getfreepos(t);  /* get a free place */  in newkey()  local
404     if (n == NULL) {  /* cannot find a free place? */  in newkey()
408     lua_assert(n != dummynode);  in newkey()
413       gnext(othern) = n;  /* redo the chain with `n' in place of `mp' */  in newkey()
414       *n = *mp;  /* copy colliding node into free pos. (mp->next also goes) */  in newkey()
420       gnext(n) = gnext(mp);  /* chain new position */  in newkey()
421       gnext(mp) = n;  in newkey()
422       mp = n;  in newkey()
441     Node *n = hashnum(t, nk);  in luaH_getnum()  local
443       if (ttisnumber(gkey(n)) && luai_numeq(nvalue(gkey(n)), nk))  in luaH_getnum()
444         return gval(n);  /* that's it */  in luaH_getnum()
445       else n = gnext(n);  in luaH_getnum()
446     } while (n);  in luaH_getnum()
456   Node *n = hashstr(t, key);  in luaH_getstr()  local
458     if (ttisstring(gkey(n)) && rawtsvalue(gkey(n)) == key)  in luaH_getstr()
459       return gval(n);  /* that's it */  in luaH_getstr()
460     else n = gnext(n);  in luaH_getstr()
461   } while (n);  in luaH_getstr()
475       lua_Number n = nvalue(key);  in luaH_get()  local
476       lua_number2int(k, n);  in luaH_get()
482       Node *n = mainposition(t, key);  in luaH_get()  local
484         if (luaO_rawequalObj(key2tval(n), key))  in luaH_get()
485           return gval(n);  /* that's it */  in luaH_get()
486         else n = gnext(n);  in luaH_get()
487       } while (n);  in luaH_get()
586 int luaH_isdummy (Node *n) { return n == dummynode; }  in luaH_isdummy()  argument