Lines Matching refs:idx
74 size_t idx = 1 + hval % htab->size;
76 if (htab->table[idx].hashval != 0)
80 if (htab->table[idx].hashval == hval
81 && COMPARE (htab->table[idx].data, val) == 0)
82 return idx;
89 if (idx <= hash)
90 idx = htab->size + idx - hash;
92 idx -= hash;
95 if (htab->table[idx].hashval == hval
96 && COMPARE (htab->table[idx].data, val) == 0)
97 return idx;
99 while (htab->table[idx].hashval);
101 return idx;
106 insert_entry_2 (NAME *htab, HASHTYPE hval, size_t idx, TYPE data)
109 if (htab->table[idx].hashval == 0)
112 htab->table[idx].next = htab->first;
113 htab->first = &htab->table[idx];
117 htab->first = htab->table[idx].next = &htab->table[idx];
120 htab->table[idx].next = htab->first->next;
121 htab->first = htab->first->next = &htab->table[idx];
127 htab->table[idx].hashval = hval;
128 htab->table[idx].data = data;
183 for (idx = 1; idx <= old_size; ++idx)
184 if (table[idx].hashval != 0)
185 insert_entry_2 (htab, table[idx].hashval,
186 lookup (htab, table[idx].hashval, table[idx].data),
187 table[idx].data);
241 size_t idx;
246 idx = lookup (htab, hval, data);
248 if (htab->table[idx].hashval != 0)
253 insert_entry_2 (htab, hval, idx, data);
268 size_t idx;
273 idx = lookup (htab, hval, data);
276 insert_entry_2 (htab, hval, idx, data);
291 size_t idx;
296 idx = lookup (htab, hval, val);
298 if (htab->table[idx].hashval == 0)
301 return htab->table[idx].data;