86   int i;  in hashnum()  local
90   for (i = 1; i < numints; i++) a[0] += a[i];  in hashnum()
138   int i;  in findindex()  local
140   i = arrayindex(key);  in findindex()
141   if (0 < i && i <= t->sizearray)  /* is `key' inside array part? */  in findindex()
142     return i-1;  /* yes; that's the index (corrected to C) */  in findindex()
150         i = cast_int(n - gnode(t, 0));  /* key index in hash table */  in findindex()
152         return i + t->sizearray;  in findindex()
163   int i = findindex(L, t, key);  /* find original element */  in luaH_next()  local
164   for (i++; i < t->sizearray; i++) {  /* try first array part */  in luaH_next()
165     if (!ttisnil(&t->array[i])) {  /* a non-nil value? */  in luaH_next()
166       setnvalue(key, cast_num(i+1));  in luaH_next()
167       setobj2s(L, key+1, &t->array[i]);  in luaH_next()
171   for (i -= t->sizearray; i < sizenode(t); i++) {  /* then hash part */  in luaH_next()
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()
190   int i;  in computesizes()  local
195   for (i = 0, twotoi = 1; twotoi/2 < *narray; i++, twotoi *= 2) {  in computesizes()
196     if (nums[i] > 0) {  in computesizes()
197       a += nums[i];  in computesizes()
226   int i = 1;  /* count to traverse all array keys */  in numusearray()  local
232       if (i > lim)  in numusearray()
236     for (; i <= lim; i++) {  in numusearray()
237       if (!ttisnil(&t->array[i-1]))  in numusearray()
250   int i = sizenode(t);  in numusehash()  local
251   while (i--) {  in numusehash()
252     Node *n = &t->node[i];  in numusehash()
264   int i;  in setarrayvector()  local
266   for (i=t->sizearray; i<size; i++)  in setarrayvector()
267      setnilvalue(&t->array[i]);  in setarrayvector()
279     int i;  in setnodevector()  local
285     for (i=0; i<size; i++) {  in setnodevector()
286       Node *n = gnode(t, i);  in setnodevector()
298   int i;  in resize()  local
309     for (i=nasize; i<oldasize; i++) {  in resize()
310       if (!ttisnil(&t->array[i]))  in resize()
311         setobjt2t(L, luaH_setnum(L, t, i+1), &t->array[i]);  in resize()
317   for (i = twoto(oldhsize) - 1; i >= 0; i--) {  in resize()
318     Node *old = nold+i;  in resize()
336   int i;  in rehash()  local
338   for (i=0; i<=MAXBITS; i++) nums[i] = 0;  /* reset counts */  in rehash()
533   unsigned int i = j;  /* i is zero or a present index */  in unbound_search()  local
537     i = j;  in unbound_search()
541       i = 1;  in unbound_search()
542       while (!ttisnil(luaH_getnum(t, i))) i++;  in unbound_search()
543       return i - 1;  in unbound_search()
547   while (j - i > 1) {  in unbound_search()
548     unsigned int m = (i+j)/2;  in unbound_search()
550     else i = m;  in unbound_search()
552   return i;  in unbound_search()
564     unsigned int i = 0;  in luaH_getn()  local
565     while (j - i > 1) {  in luaH_getn()
566       unsigned int m = (i+j)/2;  in luaH_getn()
568       else i = m;  in luaH_getn()
570     return i;  in luaH_getn()