mirror of
https://sourceware.org/git/binutils-gdb.git
synced 2024-11-26 11:33:45 +08:00
1309c3165c
Only inline functions should be defined in hash.h, there's no benefit in having multiple copies of hash_string_tuple and eq_string_tuple. Also, use the table alloc_f when allocating tuples to be stored, so that these functions are usable with different memory allocation strategies. * hash.h (struct string_tuple, string_tuple_t): Move earlier. (string_tuple_alloc): Add table param, allocate using table alloc_f. (str_hash_insert): Adjust to suit. Call table->free_f when entry is not used. (hash_string_tuple, eq_string_tuple): Move to.. * hash.c: ..here.
76 lines
2.2 KiB
C
76 lines
2.2 KiB
C
/* hash.c -- gas hash table code
|
|
Copyright (C) 1987-2022 Free Software Foundation, Inc.
|
|
|
|
This file is part of GAS, the GNU Assembler.
|
|
|
|
GAS is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 3, or (at your option)
|
|
any later version.
|
|
|
|
GAS is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with GAS; see the file COPYING. If not, write to the Free
|
|
Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA
|
|
02110-1301, USA. */
|
|
|
|
#include "as.h"
|
|
|
|
/* Hash function for a string_tuple. */
|
|
|
|
hashval_t
|
|
hash_string_tuple (const void *e)
|
|
{
|
|
string_tuple_t *tuple = (string_tuple_t *) e;
|
|
return htab_hash_string (tuple->key);
|
|
}
|
|
|
|
/* Equality function for a string_tuple. */
|
|
|
|
int
|
|
eq_string_tuple (const void *a, const void *b)
|
|
{
|
|
const string_tuple_t *ea = (const string_tuple_t *) a;
|
|
const string_tuple_t *eb = (const string_tuple_t *) b;
|
|
|
|
return strcmp (ea->key, eb->key) == 0;
|
|
}
|
|
|
|
/* Insert ELEMENT into HTAB. If REPLACE is non-zero existing elements
|
|
are overwritten. If ELEMENT already exists, a pointer to the slot
|
|
is returned. Otherwise NULL is returned. */
|
|
|
|
void **
|
|
htab_insert (htab_t htab, void *element, int replace)
|
|
{
|
|
void **slot = htab_find_slot (htab, element, INSERT);
|
|
if (*slot != NULL)
|
|
{
|
|
if (replace)
|
|
{
|
|
if (htab->del_f)
|
|
(*htab->del_f) (*slot);
|
|
*slot = element;
|
|
}
|
|
return slot;
|
|
}
|
|
*slot = element;
|
|
return NULL;
|
|
}
|
|
|
|
/* Print statistics about a hash table. */
|
|
|
|
void
|
|
htab_print_statistics (FILE *f, const char *name, htab_t table)
|
|
{
|
|
fprintf (f, "%s hash statistics:\n", name);
|
|
fprintf (f, "\t%u searches\n", table->searches);
|
|
fprintf (f, "\t%u collisions\n", table->collisions);
|
|
fprintf (f, "\t%lu elements\n", (unsigned long) htab_elements (table));
|
|
fprintf (f, "\t%lu table size\n", (unsigned long) htab_size (table));
|
|
}
|