Lines Matching refs:idx
153 size_t idx;
159 idx = hash;
161 if (table[idx].used)
163 if (table[idx].used == hval && table[idx].keylen == keylen
164 && memcmp (table[idx].key, key, keylen) == 0)
165 return idx;
172 if (idx <= hash)
173 idx = htab->size + idx - hash;
175 idx -= hash;
178 if (table[idx].used == hval && table[idx].keylen == keylen
179 && memcmp (table[idx].key, key, keylen) == 0)
180 return idx;
182 while (table[idx].used);
184 return idx;
195 size_t idx = lookup (htab, key, keylen, compute_hashval (key, keylen));
197 if (table[idx].used == 0)
200 *result = table[idx].data;
211 unsigned long int hval, size_t idx, void *data)
215 table[idx].used = hval;
216 table[idx].key = key;
217 table[idx].keylen = keylen;
218 table[idx].data = data;
223 table[idx].next = &table[idx];
224 htab->first = &table[idx];
228 table[idx].next = htab->first->next;
229 htab->first->next = &table[idx];
230 htab->first = &table[idx];
243 size_t idx;
250 for (idx = 1; idx <= old_size; ++idx)
251 if (table[idx].used)
252 insert_entry_2 (htab, table[idx].key, table[idx].keylen,
253 table[idx].used,
254 lookup (htab, table[idx].key, table[idx].keylen,
255 table[idx].used),
256 table[idx].data);
273 size_t idx = lookup (htab, key, keylen, hval);
275 if (table[idx].used)
282 insert_entry_2 (htab, keycopy, keylen, hval, idx, data);
300 size_t idx = lookup (htab, key, keylen, hval);
302 if (table[idx].used)
305 table[idx].data = data;
312 insert_entry_2 (htab, keycopy, keylen, hval, idx, data);