Lines Matching refs:slot
214 ctf_helem_t **slot;
216 slot = ctf_hashtab_lookup (htab, key, INSERT);
218 if (!slot)
224 if (!*slot)
229 *slot = malloc (sizeof (ctf_helem_t));
233 *slot = p;
235 if (!*slot)
237 (*slot)->key = key;
244 value_free ((*slot)->value);
246 (*slot)->value = value;
247 return *slot;
253 ctf_helem_t *slot;
261 slot = ctf_hashtab_insert (hp->htab, key, value,
264 if (!slot)
272 slot->owner = hp;
299 ctf_helem_t **slot;
301 slot = ctf_hashtab_lookup (hp->htab, key, NO_INSERT);
303 if (slot)
304 return (*slot)->value;
314 ctf_helem_t **slot;
316 slot = ctf_hashtab_lookup (hp->htab, key, NO_INSERT);
318 if (slot)
321 *orig_key = (*slot)->key;
323 *value = (*slot)->value;
336 ctf_hashtab_traverse (void **slot, void *arg_)
338 ctf_helem_t *helem = *((ctf_helem_t **) slot);
360 ctf_hashtab_traverse_find (void **slot, void *arg_)
362 ctf_helem_t *helem = *((ctf_helem_t **) slot);
389 ctf_hashtab_traverse_remove (void **slot, void *arg_)
391 ctf_helem_t *helem = *((ctf_helem_t **) slot);
395 htab_clear_slot (arg->htab, slot);
422 ctf_helem_t *slot;
465 slot = *i->u.ctn_hash_slot;
468 *key = slot->key;
470 *value = slot->value;
605 can be much simpler, because without a value the slot can simply be the
658 void **slot;
660 slot = htab_find_slot (htab, key_to_internal (key), INSERT);
662 if (!slot)
668 if (*slot)
671 (*htab->del_f) (*slot);
674 *slot = key_to_internal (key);
701 void **slot = htab_find_slot ((struct htab *) hp,
704 if (slot)
705 return internal_to_key (*slot);
713 void **slot = htab_find_slot ((struct htab *) hp,
716 if (orig_key && slot)
717 *orig_key = internal_to_key (*slot);
718 return (slot != NULL);
727 void **slot = htab->entries;
728 void **limit = slot + htab_size (htab);
730 while (slot < limit
731 && (*slot == HTAB_EMPTY_ENTRY || *slot == HTAB_DELETED_ENTRY))
732 slot++;
734 if (slot < limit)
735 return internal_to_key (*slot);
747 void *slot;
791 slot = *i->u.ctn_hash_slot;
794 *key = internal_to_key (slot);
Indexes created Fri May 15 00:25:31 UTC 2026