VirtualBox

source: kBuild/trunk/src/kmk/hash.h@ 2091

Last change on this file since 2091 was 1993, checked in by bird, 16 years ago

Merged in current GNU Make code (CVS from 2008-10-28). Ref #55.

  • Property svn:eol-style set to native
File size: 9.0 KB
Line 
1/* hash.h -- decls for hash table
2Copyright (C) 1995, 1999, 2002 Free Software Foundation, Inc.
3Written by Greg McGary <[email protected]> <[email protected]>
4
5GNU Make is free software; you can redistribute it and/or modify it under the
6terms of the GNU General Public License as published by the Free Software
7Foundation; either version 3 of the License, or (at your option) any later
8version.
9
10GNU Make is distributed in the hope that it will be useful, but WITHOUT ANY
11WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
12A PARTICULAR PURPOSE. See the GNU General Public License for more details.
13
14You should have received a copy of the GNU General Public License along with
15this program. If not, see <http://www.gnu.org/licenses/>. */
16
17#ifndef _hash_h_
18#define _hash_h_
19
20#include <stdio.h>
21#include <ctype.h>
22
23#if defined __cplusplus || (defined __STDC__ && __STDC__) || defined WINDOWS32
24# if !defined __GLIBC__ || !defined __P
25# undef __P
26# define __P(protos) protos
27# endif
28#else /* Not C++ or ANSI C. */
29# undef __P
30# define __P(protos) ()
31/* We can get away without defining `const' here only because in this file
32 it is used only inside the prototype for `fnmatch', which is elided in
33 non-ANSI C where `const' is problematical. */
34#endif /* C++ or ANSI C. */
35
36typedef unsigned long (*hash_func_t) __P((void const *key));
37typedef int (*hash_cmp_func_t) __P((void const *x, void const *y));
38typedef void (*hash_map_func_t) __P((void const *item));
39typedef void (*hash_map_arg_func_t) __P((void const *item, void *arg));
40
41struct hash_table
42{
43 void **ht_vec;
44 unsigned long ht_size; /* total number of slots (power of 2) */
45 unsigned long ht_capacity; /* usable slots, limited by loading-factor */
46 unsigned long ht_fill; /* items in table */
47 unsigned long ht_empty_slots; /* empty slots not including deleted slots */
48 unsigned long ht_collisions; /* # of failed calls to comparison function */
49 unsigned long ht_lookups; /* # of queries */
50 unsigned int ht_rehashes; /* # of times we've expanded table */
51 hash_func_t ht_hash_1; /* primary hash function */
52 hash_func_t ht_hash_2; /* secondary hash function */
53 hash_cmp_func_t ht_compare; /* comparison function */
54#ifdef CONFIG_WITH_STRCACHE2
55 struct strcache2 *ht_strcache; /* the string cache pointer. */
56 unsigned int ht_off_string; /* offsetof (struct key, string) */
57#endif
58};
59
60typedef int (*qsort_cmp_t) __P((void const *, void const *));
61
62void hash_init __P((struct hash_table *ht, unsigned long size,
63 hash_func_t hash_1, hash_func_t hash_2, hash_cmp_func_t hash_cmp));
64void hash_load __P((struct hash_table *ht, void *item_table,
65 unsigned long cardinality, unsigned long size));
66void **hash_find_slot __P((struct hash_table *ht, void const *key));
67void *hash_find_item __P((struct hash_table *ht, void const *key));
68void *hash_insert __P((struct hash_table *ht, const void *item));
69void *hash_insert_at __P((struct hash_table *ht, const void *item, void const *slot));
70void *hash_delete __P((struct hash_table *ht, void const *item));
71void *hash_delete_at __P((struct hash_table *ht, void const *slot));
72void hash_delete_items __P((struct hash_table *ht));
73void hash_free_items __P((struct hash_table *ht));
74void hash_free __P((struct hash_table *ht, int free_items));
75#ifdef CONFIG_WITH_ALLOC_CACHES
76void hash_free_items_cached __P((struct hash_table *ht, struct alloccache *cache));
77void hash_free_cached __P((struct hash_table *ht, int free_items, struct alloccache *cache));
78#endif
79void hash_map __P((struct hash_table *ht, hash_map_func_t map));
80void hash_map_arg __P((struct hash_table *ht, hash_map_arg_func_t map, void *arg));
81void hash_print_stats __P((struct hash_table *ht, FILE *out_FILE));
82void **hash_dump __P((struct hash_table *ht, void **vector_0, qsort_cmp_t compare));
83
84#ifdef CONFIG_WITH_STRCACHE2
85void hash_init_strcached __P((struct hash_table *ht, unsigned long size,
86 struct strcache2 *strcache, unsigned int off_strptr));
87void **hash_find_slot_strcached __P((struct hash_table *ht, const void *key));
88void *hash_find_item_strcached __P((struct hash_table *ht, void const *key));
89void *hash_insert_strcached __P((struct hash_table *ht, const void *item));
90void *hash_delete_strcached __P((struct hash_table *ht, void const *item));
91#endif /* CONFIG_WITH_STRCACHE2 */
92
93extern void *hash_deleted_item;
94#define HASH_VACANT(item) ((item) == 0 || (void *) (item) == hash_deleted_item)
95
96
97
98/* hash and comparison macros for case-sensitive string keys. */
99
100#define STRING_HASH_1(KEY, RESULT) do { \
101 unsigned char const *_key_ = (unsigned char const *) (KEY) - 1; \
102 while (*++_key_) \
103 (RESULT) += (*_key_ << (_key_[1] & 0xf)); \
104} while (0)
105#define return_STRING_HASH_1(KEY) do { \
106 unsigned long _result_ = 0; \
107 STRING_HASH_1 ((KEY), _result_); \
108 return _result_; \
109} while (0)
110
111#define STRING_HASH_2(KEY, RESULT) do { \
112 unsigned char const *_key_ = (unsigned char const *) (KEY) - 1; \
113 while (*++_key_) \
114 (RESULT) += (*_key_ << (_key_[1] & 0x7)); \
115} while (0)
116#define return_STRING_HASH_2(KEY) do { \
117 unsigned long _result_ = 0; \
118 STRING_HASH_2 ((KEY), _result_); \
119 return _result_; \
120} while (0)
121
122#define STRING_COMPARE(X, Y, RESULT) do { \
123 RESULT = strcmp ((X), (Y)); \
124} while (0)
125#define return_STRING_COMPARE(X, Y) do { \
126 return strcmp ((X), (Y)); \
127} while (0)
128
129
130#define STRING_N_HASH_1(KEY, N, RESULT) do { \
131 unsigned char const *_key_ = (unsigned char const *) (KEY) - 1; \
132 int _n_ = (N); \
133 if (_n_) \
134 while (--_n_ && *++_key_) \
135 (RESULT) += (*_key_ << (_key_[1] & 0xf)); \
136 (RESULT) += *++_key_; \
137} while (0)
138#define return_STRING_N_HASH_1(KEY, N) do { \
139 unsigned long _result_ = 0; \
140 STRING_N_HASH_1 ((KEY), (N), _result_); \
141 return _result_; \
142} while (0)
143
144#define STRING_N_HASH_2(KEY, N, RESULT) do { \
145 unsigned char const *_key_ = (unsigned char const *) (KEY) - 1; \
146 int _n_ = (N); \
147 if (_n_) \
148 while (--_n_ && *++_key_) \
149 (RESULT) += (*_key_ << (_key_[1] & 0x7)); \
150 (RESULT) += *++_key_; \
151} while (0)
152#define return_STRING_N_HASH_2(KEY, N) do { \
153 unsigned long _result_ = 0; \
154 STRING_N_HASH_2 ((KEY), (N), _result_); \
155 return _result_; \
156} while (0)
157
158#define STRING_N_COMPARE(X, Y, N, RESULT) do { \
159 RESULT = strncmp ((X), (Y), (N)); \
160} while (0)
161#define return_STRING_N_COMPARE(X, Y, N) do { \
162 return strncmp ((X), (Y), (N)); \
163} while (0)
164
165#ifdef HAVE_CASE_INSENSITIVE_FS
166
167/* hash and comparison macros for case-insensitive string _key_s. */
168
169#define ISTRING_HASH_1(KEY, RESULT) do { \
170 unsigned char const *_key_ = (unsigned char const *) (KEY) - 1; \
171 while (*++_key_) \
172 (RESULT) += ((isupper (*_key_) ? tolower (*_key_) : *_key_) << (_key_[1] & 0xf)); \
173} while (0)
174#define return_ISTRING_HASH_1(KEY) do { \
175 unsigned long _result_ = 0; \
176 ISTRING_HASH_1 ((KEY), _result_); \
177 return _result_; \
178} while (0)
179
180#define ISTRING_HASH_2(KEY, RESULT) do { \
181 unsigned char const *_key_ = (unsigned char const *) (KEY) - 1; \
182 while (*++_key_) \
183 (RESULT) += ((isupper (*_key_) ? tolower (*_key_) : *_key_) << (_key_[1] & 0x7)); \
184} while (0)
185#define return_ISTRING_HASH_2(KEY) do { \
186 unsigned long _result_ = 0; \
187 ISTRING_HASH_2 ((KEY), _result_); \
188 return _result_; \
189} while (0)
190
191#define ISTRING_COMPARE(X, Y, RESULT) do { \
192 RESULT = strcasecmp ((X), (Y)); \
193} while (0)
194#define return_ISTRING_COMPARE(X, Y) do { \
195 return strcasecmp ((X), (Y)); \
196} while (0)
197
198#else
199
200#define ISTRING_HASH_1(KEY, RESULT) STRING_HASH_1 ((KEY), (RESULT))
201#define return_ISTRING_HASH_1(KEY) return_STRING_HASH_1 (KEY)
202
203#define ISTRING_HASH_2(KEY, RESULT) STRING_HASH_2 ((KEY), (RESULT))
204#define return_ISTRING_HASH_2(KEY) return_STRING_HASH_2 (KEY)
205
206#define ISTRING_COMPARE(X, Y, RESULT) STRING_COMPARE ((X), (Y), (RESULT))
207#define return_ISTRING_COMPARE(X, Y) return_STRING_COMPARE ((X), (Y))
208
209#endif
210
211/* hash and comparison macros for integer _key_s. */
212
213#define INTEGER_HASH_1(KEY, RESULT) do { \
214 (RESULT) += ((unsigned long)(KEY)); \
215} while (0)
216#define return_INTEGER_HASH_1(KEY) do { \
217 unsigned long _result_ = 0; \
218 INTEGER_HASH_1 ((KEY), _result_); \
219 return _result_; \
220} while (0)
221
222#define INTEGER_HASH_2(KEY, RESULT) do { \
223 (RESULT) += ~((unsigned long)(KEY)); \
224} while (0)
225#define return_INTEGER_HASH_2(KEY) do { \
226 unsigned long _result_ = 0; \
227 INTEGER_HASH_2 ((KEY), _result_); \
228 return _result_; \
229} while (0)
230
231#define INTEGER_COMPARE(X, Y, RESULT) do { \
232 (RESULT) = X - Y; \
233} while (0)
234#define return_INTEGER_COMPARE(X, Y) do { \
235 int _result_; \
236 INTEGER_COMPARE (X, Y, _result_); \
237 return _result_; \
238} while (0)
239
240/* hash and comparison macros for address keys. */
241
242#define ADDRESS_HASH_1(KEY, RESULT) INTEGER_HASH_1 (((unsigned long)(KEY)) >> 3, (RESULT))
243#define ADDRESS_HASH_2(KEY, RESULT) INTEGER_HASH_2 (((unsigned long)(KEY)) >> 3, (RESULT))
244#define ADDRESS_COMPARE(X, Y, RESULT) INTEGER_COMPARE ((X), (Y), (RESULT))
245#define return_ADDRESS_HASH_1(KEY) return_INTEGER_HASH_1 (((unsigned long)(KEY)) >> 3)
246#define return_ADDRESS_HASH_2(KEY) return_INTEGER_HASH_2 (((unsigned long)(KEY)) >> 3)
247#define return_ADDRESS_COMPARE(X, Y) return_INTEGER_COMPARE ((X), (Y))
248
249#endif /* not _hash_h_ */
Note: See TracBrowser for help on using the repository browser.

© 2024 Oracle Support Privacy / Do Not Sell My Info Terms of Use Trademark Policy Automated Access Etiquette