binutils/libiberty/hashtab.c

284    hash table entries are HTAB_EMPTY_ENTRY).  The function returns the
300   result->entries = (PTR *) (*alloc_f) (size, sizeof (PTR));
301   if (result->entries == NULL)
335   result->entries = (PTR *) (*alloc_f) (alloc_arg, size, sizeof (PTR));
336   if (result->entries == NULL)
390   PTR *entries = htab->entries;
395       if (entries[i] != HTAB_EMPTY_ENTRY && entries[i] != HTAB_DELETED_ENTRY)
396 	(*htab->del_f) (entries[i]);
400       (*htab->free_f) (entries);
405       (*htab->free_with_arg_f) (htab->alloc_arg, entries);
410 /* This function clears all entries in the given hash table.  */
416   PTR *entries = htab->entries;
421       if (entries[i] != HTAB_EMPTY_ENTRY && entries[i] != HTAB_DELETED_ENTRY)
422 	(*htab->del_f) (entries[i]);
431 	(*htab->free_f) (htab->entries);
433 	(*htab->free_with_arg_f) (htab->alloc_arg, htab->entries);
435 	htab->entries = (PTR *) (*htab->alloc_with_arg_f) (htab->alloc_arg, nsize,
438 	htab->entries = (PTR *) (*htab->alloc_f) (nsize, sizeof (PTR *));
443     memset (entries, 0, size * sizeof (PTR));
452    This function also assumes there are no deleted entries in the table.
460   PTR *slot = htab->entries + index;
475       slot = htab->entries + index;
484    entries and repeatedly inserts the table elements.  The occupancy
487    table entries is changed.  If memory allocation failures are allowed,
501   oentries = htab->entries;
527   htab->entries = nentries;
570   entry = htab->entries[index];
583       entry = htab->entries[index];
629   entry = htab->entries[index];
633     first_deleted_slot = &htab->entries[index];
635     return &htab->entries[index];
645       entry = htab->entries[index];
651 	    first_deleted_slot = &htab->entries[index];
654 	return &htab->entries[index];
669   return &htab->entries[index];
720   if (slot < htab->entries || slot >= htab->entries + htab_size (htab)
742   slot = htab->entries;