Lines Matching refs:table
45 * free to avoid exponential performance degradation as the hash table fills
123 ht->table = rzalloc_array(ht, struct set_entry, ht->size);
127 if (ht->table == NULL) {
154 ralloc_free(ht->table);
172 struct set_entry *entry = ht->table + hash_address;
213 struct set_entry *table, *entry;
218 table = rzalloc_array(ht, struct set_entry,
220 if (table == NULL)
225 ht->table = table;
233 for (entry = old_ht.table;
234 entry != old_ht.table + old_ht.size;
241 ralloc_free(old_ht.table);
245 * Inserts the key with the given hash into the table.
247 * Note that insertion may rearrange the table on a resize or rehash,
264 struct set_entry *entry = ht->table + hash_address;
281 * Note that the hash table doesn't have a delete callback.
328 * This function deletes the given hash table entry.
330 * Note that deletion doesn't otherwise modify the table, so an iteration over
331 * the table deleting entries is safe.
345 * This function is an iterator over the hash table.
348 * an iteration over the table is O(table_size) not O(entries).
354 entry = ht->table;
358 for (; entry != ht->table + ht->size; entry++) {
377 for (entry = ht->table + i; entry != ht->table + ht->size; entry++) {
384 for (entry = ht->table; entry != ht->table + i; entry++) {
