1 /* Copyright (C) 2000-2010 Red Hat, Inc.
2 This file is part of Red Hat elfutils.
3 Written by Ulrich Drepper <drepper@redhat.com>, 2000.
5 Red Hat elfutils is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by the
7 Free Software Foundation; version 2 of the License.
9 Red Hat elfutils is distributed in the hope that it will be useful, but
10 WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 General Public License for more details.
14 You should have received a copy of the GNU General Public License along
15 with Red Hat elfutils; if not, write to the Free Software Foundation,
16 Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301 USA.
18 In addition, as a special exception, Red Hat, Inc. gives You the
19 additional right to link the code of Red Hat elfutils with code licensed
20 under any Open Source Initiative certified open source license
21 (http://www.opensource.org/licenses/index.php) which requires the
22 distribution of source code with any binary distribution and to
23 distribute linked combinations of the two. Non-GPL Code permitted under
24 this exception must only link to the code of Red Hat elfutils through
25 those well defined interfaces identified in the file named EXCEPTION
26 found in the source code files (the "Approved Interfaces"). The files
27 of Non-GPL Code may instantiate templates or use macros or inline
28 functions from the Approved Interfaces without causing the resulting
29 work to be covered by the GNU General Public License. Only Red Hat,
30 Inc. may make changes or additions to the list of Approved Interfaces.
31 Red Hat's grant of this exception is conditioned upon your not adding
32 any new exceptions. If you wish to add a new Approved Interface or
33 exception, please contact Red Hat. You must obey the GNU General Public
34 License in all respects for all of the Red Hat elfutils code and other
35 code used in conjunction with Red Hat elfutils except the Non-GPL Code
36 covered by this exception. If you modify this file, you may extend this
37 exception to your version of the file, but you are not obligated to do
38 so. If you do not wish to provide this exception without modification,
39 you must delete this exception statement from your version and license
40 this file solely under the GPL without exception.
42 Red Hat elfutils is an included package of the Open Invention Network.
43 An included package of the Open Invention Network is a package for which
44 Open Invention Network licensees cross-license their patents. No patent
45 license is granted, either expressly or impliedly, by designation as an
46 included package. Should you wish to participate in the Open Invention
47 Network licensing program, please visit www.openinventionnetwork.com
48 <http://www.openinventionnetwork.com>. */
54 /* Before including this file the following macros must be defined:
56 NAME name of the hash table structure.
57 TYPE data type of the hash table entries
58 COMPARE comparison function taking two pointers to TYPE objects
60 The following macros if present select features:
62 ITERATE iterating over the table entries is possible
63 REVERSE iterate in reverse order of insert
68 lookup (htab, hval, val)
71 TYPE val __attribute__ ((unused));
73 /* First hash function: simply take the modul but prevent zero. */
74 size_t idx = 1 + hval % htab->size;
76 if (htab->table[idx].hashval != 0)
80 if (htab->table[idx].hashval == hval
81 && COMPARE (htab->table[idx].data, val) == 0)
84 /* Second hash function as suggested in [Knuth]. */
85 hash = 1 + hval % (htab->size - 2);
90 idx = htab->size + idx - hash;
94 /* If entry is found use it. */
95 if (htab->table[idx].hashval == hval
96 && COMPARE (htab->table[idx].data, val) == 0)
99 while (htab->table[idx].hashval);
106 insert_entry_2 (NAME *htab, HASHTYPE hval, size_t idx, TYPE data)
109 if (htab->table[idx].hashval == 0)
112 htab->table[idx].next = htab->first;
113 htab->first = &htab->table[idx];
115 /* Add the new value to the list. */
116 if (htab->first == NULL)
117 htab->first = htab->table[idx].next = &htab->table[idx];
120 htab->table[idx].next = htab->first->next;
121 htab->first = htab->first->next = &htab->table[idx];
127 htab->table[idx].hashval = hval;
128 htab->table[idx].data = data;
131 if (100 * htab->filled > 90 * htab->size)
133 /* Table is filled more than 90%. Resize the table. */
135 __typeof__ (htab->first) first;
137 __typeof__ (htab->first) runp;
140 size_t old_size = htab->size;
142 #define _TABLE(name) \
143 name##_ent *table = htab->table
144 #define TABLE(name) _TABLE (name)
147 htab->size = next_prime (htab->size * 2);
153 htab->table = calloc ((1 + htab->size), sizeof (htab->table[0]));
154 if (htab->table == NULL)
156 /* We cannot enlarge the table. Live with what we got. This
157 might lead to an infinite loop at some point, though. */
162 /* Add the old entries to the new table. When iteration is
163 supported we maintain the order. */
166 while (first != NULL)
168 insert_entry_2 (htab, first->hashval,
169 lookup (htab, first->hashval, first->data),
175 assert (first != NULL);
176 runp = first = first->next;
178 insert_entry_2 (htab, runp->hashval,
179 lookup (htab, runp->hashval, runp->data), runp->data);
180 while ((runp = runp->next) != first);
183 for (idx = 1; idx <= old_size; ++idx)
184 if (table[idx].hashval != 0)
185 insert_entry_2 (htab, table[idx].hashval,
186 lookup (htab, table[idx].hashval, table[idx].data),
196 #define INIT(name) _INIT (name)
197 #define _INIT(name) \
199 INIT(NAME) (htab, init_size)
203 /* We need the size to be a prime. */
204 init_size = next_prime (init_size);
206 /* Initialize the data structure. */
207 htab->size = init_size;
212 htab->table = (void *) calloc ((init_size + 1), sizeof (htab->table[0]));
213 if (htab->table == NULL)
221 #define FREE(name) _FREE (name)
222 #define _FREE(name) \
233 #define INSERT(name) _INSERT (name)
234 #define _INSERT(name) \
236 INSERT(NAME) (htab, hval, data)
243 /* Make the hash value nonzero. */
246 idx = lookup (htab, hval, data);
248 if (htab->table[idx].hashval != 0)
249 /* We don't want to overwrite the old value. */
252 /* An empty bucket has been found. */
253 insert_entry_2 (htab, hval, idx, data);
260 #define INSERT(name) _INSERT (name)
261 #define _INSERT(name) \
263 INSERT(NAME) (htab, hval, data)
270 /* Make the hash value nonzero. */
273 idx = lookup (htab, hval, data);
275 /* The correct bucket has been found. */
276 insert_entry_2 (htab, hval, idx, data);
283 #define FIND(name) _FIND (name)
284 #define _FIND(name) \
286 FIND(NAME) (htab, hval, val)
293 /* Make the hash value nonzero. */
296 idx = lookup (htab, hval, val);
298 if (htab->table[idx].hashval == 0)
301 return htab->table[idx].data;
306 # define ITERATEFCT(name) _ITERATEFCT (name)
307 # define _ITERATEFCT(name) \
310 ITERATEFCT(NAME) (htab, ptr)
316 # define TYPENAME(name) _TYPENAME (name)
317 # define _TYPENAME(name) name##_ent
323 p = ((TYPENAME(NAME) *) p)->next;
333 if (htab->first == NULL)
335 p = htab->first->next;
339 if (p == htab->first)
342 p = ((TYPENAME(NAME) *) p)->next;
346 /* Prepare the next element. If possible this will pull the data
347 into the cache, for reading. */
348 __builtin_prefetch (((TYPENAME(NAME) *) p)->next, 0, 2);
350 return ((TYPENAME(NAME) *) (*ptr = p))->data;