Lines Matching refs:idx
52 unsigned long int hval, size_t idx, void *data);
92 size_t idx = lookup (htab, key, keylen, hval);
94 if (table[idx].used)
101 keylen, hval, idx, data);
109 unsigned long int hval, size_t idx, void *data)
113 table[idx].used = hval;
114 table[idx].key = key;
115 table[idx].keylen = keylen;
116 table[idx].data = data;
121 table[idx].next = &table[idx];
122 *(hash_entry **) &htab->first = &table[idx];
126 table[idx].next = ((hash_entry *) htab->first)->next;
127 ((hash_entry *) htab->first)->next = &table[idx];
128 *(hash_entry **) &htab->first = &table[idx];
142 for (idx = 1; idx <= old_size; ++idx)
143 if (table[idx].used)
144 insert_entry_2 (htab, table[idx].key, table[idx].keylen,
145 table[idx].used,
146 lookup (htab, table[idx].key, table[idx].keylen,
147 table[idx].used),
148 table[idx].data);
159 size_t idx = lookup (htab, key, keylen, compute_hashval (key, keylen));
161 if (table[idx].used == 0)
164 *result = table[idx].data;
203 size_t idx;
209 idx = hash;
211 if (table[idx].used)
213 if (table[idx].used == hval && table[idx].keylen == keylen
214 && memcmp (table[idx].key, key, keylen) == 0)
215 return idx;
222 if (idx <= hash)
223 idx = htab->size + idx - hash;
225 idx -= hash;
228 if (table[idx].used == hval && table[idx].keylen == keylen
229 && memcmp (table[idx].key, key, keylen) == 0)
230 return idx;
232 while (table[idx].used);
234 return idx;