Lines Matching refs:slot
34 potentially hit every slot in the table during collision
80 /* Returns the address of the table slot matching `key'. If `key' is
81 not found, return the address of an empty slot suitable for
88 void **slot;
97 slot = &ht->ht_vec[hash_1];
99 if (*slot == 0)
100 return (deleted_slot ? deleted_slot : slot);
101 if (*slot == hash_deleted_item)
104 deleted_slot = slot;
108 if (key == *slot)
109 return slot;
110 if ((*ht->ht_compare) (key, *slot) == 0)
111 return slot;
123 void **slot = hash_find_slot (ht, key);
124 return ((HASH_VACANT (*slot)) ? 0 : *slot);
130 void **slot = hash_find_slot (ht, item);
131 const void *old_item = slot ? *slot : 0;
132 hash_insert_at (ht, item, slot);
137 hash_insert_at (struct hash_table *ht, const void *item, const void *slot)
139 const void *old_item = *(void **) slot;
147 *(void const **) slot = item;
154 return (void *) slot;
160 void **slot = hash_find_slot (ht, item);
161 return hash_delete_at (ht, slot);
165 hash_delete_at (struct hash_table *ht, const void *slot)
167 void *item = *(void **) slot;
170 *(void const **) slot = hash_deleted_item;
226 void **slot;
229 for (slot = ht->ht_vec; slot < end; slot++)
231 if (!HASH_VACANT (*slot))
232 (*map) (*slot);
239 void **slot;
242 for (slot = ht->ht_vec; slot < end; slot++)
244 if (!HASH_VACANT (*slot))
245 (*map) (*slot, arg);
270 void **slot = hash_find_slot (ht, *ovp);
271 *slot = *ovp;
298 void **slot;
305 for (slot = ht->ht_vec; slot < end; slot++)
306 if (!HASH_VACANT (*slot))
307 *vector++ = *slot;
