Lines Matching full:hash
392 /* Hash table routines. There is no way to free up a hash table. */
394 /* An element in the hash table. Most uses will actually use a larger
399 /* Next entry for this hash code. */
403 /* Hash code. This is the full hash code, not the index into the
405 unsigned long hash;
408 /* A hash table. */
412 /* The hash array. */
414 /* The number of slots in the hash table. */
416 /* The number of entries in the hash table. */
420 /* A function used to create new elements in the hash table. The
429 /* An objalloc for this hash table. This is a struct objalloc *,
434 /* Initialize a hash table. */
442 /* Initialize a hash table specifying a size. */
450 /* Free up a hash table. */
454 /* Look up a string in a hash table. If CREATE is TRUE, a new entry
462 /* Replace an entry in a hash table. */
467 /* Base method for creating a hash table entry. */
471 /* Grab some space for a hash table entry. */
475 hash table in a random order, calling a function on each
483 /* Allows the default size of a hash table to be configured. New hash
493 /* A hash table used to hold stabs strings. */
495 /* The header file hash table. */
4541 /* A hash table for section names. */
4770 #define bfd_link_hash_table_free(abfd, hash) \
4771 BFD_SEND (abfd, _bfd_link_hash_table_free, (hash))
5178 /* Create a hash table for the linker. Different backends store
5183 /* Release the memory associated with the linker hash table. */
5186 /* Add symbols from this object file into the hash table. */
