1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
|
/* hash.h
Definitions for hashing... */
/*
* Copyright (c) 2004,2009 by Internet Systems Consortium, Inc. ("ISC")
* Copyright (c) 1995-2003 by Internet Software Consortium
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
* OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*
* Internet Systems Consortium, Inc.
* 950 Charter Street
* Redwood City, CA 94063
* <info@isc.org>
* https://www.isc.org/
*
* This software has been written for Internet Systems Consortium
* by Ted Lemon in cooperation with Vixie Enterprises and Nominum, Inc.
* To learn more about Internet Systems Consortium, see
* ``https://www.isc.org/''. To learn more about Vixie Enterprises,
* see ``http://www.vix.com''. To learn more about Nominum, Inc., see
* ``http://www.nominum.com''.
*/
#ifndef OMAPI_HASH_H
#define OMAPI_HASH_H
#if !defined (DEFAULT_HASH_SIZE)
# define DEFAULT_HASH_SIZE 9973
#endif
#if !defined (KEY_HASH_SIZE)
# define KEY_HASH_SIZE 1009
#endif
/* The purpose of the hashed_object_t struct is to not match anything else. */
typedef struct {
int foo;
} hashed_object_t;
typedef isc_result_t (*hash_foreach_func)(const void *, unsigned, void *);
typedef int (*hash_reference) (hashed_object_t **, hashed_object_t *,
const char *, int);
typedef int (*hash_dereference) (hashed_object_t **, const char *, int);
struct hash_bucket {
struct hash_bucket *next;
const unsigned char *name;
unsigned len;
hashed_object_t *value;
};
typedef int (*hash_comparator_t)(const void *, const void *, size_t);
struct hash_table {
unsigned hash_count;
hash_reference referencer;
hash_dereference dereferencer;
hash_comparator_t cmp;
unsigned (*do_hash)(const void *, unsigned, unsigned);
/* This must remain the last entry in this table. */
struct hash_bucket *buckets [1];
};
struct named_hash {
struct named_hash *next;
const char *name;
struct hash_table *hash;
};
#define HASH_FUNCTIONS_DECL(name, bufarg, type, hashtype) \
void name##_hash_add (hashtype *, bufarg, unsigned, type *, \
const char *, int); \
void name##_hash_delete (hashtype *, bufarg, unsigned, \
const char *, int); \
int name##_hash_lookup (type **, hashtype *, bufarg, unsigned, \
const char *, int); \
unsigned char * name##_hash_report(hashtype *); \
int name##_hash_foreach (hashtype *, hash_foreach_func); \
int name##_new_hash (hashtype **, unsigned, const char *, int); \
void name##_free_hash_table (hashtype **, const char *, int);
#define HASH_FUNCTIONS(name, bufarg, type, hashtype, ref, deref, hasher) \
void name##_hash_add (hashtype *table, \
bufarg buf, unsigned len, type *ptr, \
const char *file, int line) \
{ \
add_hash ((struct hash_table *)table, buf, \
len, (hashed_object_t *)ptr, file, line); \
} \
\
void name##_hash_delete (hashtype *table, bufarg buf, unsigned len, \
const char *file, int line) \
{ \
delete_hash_entry ((struct hash_table *)table, buf, len, \
file, line); \
} \
\
int name##_hash_lookup (type **ptr, hashtype *table, \
bufarg buf, unsigned len, const char *file, int line) \
{ \
return hash_lookup ((hashed_object_t **)ptr, \
(struct hash_table *)table, \
buf, len, file, line); \
} \
\
unsigned char * name##_hash_report(hashtype *table) \
{ \
return hash_report((struct hash_table *)table); \
} \
\
int name##_hash_foreach (hashtype *table, hash_foreach_func func) \
{ \
return hash_foreach ((struct hash_table *)table, \
func); \
} \
\
int name##_new_hash (hashtype **tp, unsigned c, const char *file, int line) \
{ \
return new_hash ((struct hash_table **)tp, \
(hash_reference)ref, (hash_dereference)deref, c, \
hasher, file, line); \
} \
\
void name##_free_hash_table (hashtype **table, const char *file, int line) \
{ \
free_hash_table ((struct hash_table **)table, file, line); \
}
void relinquish_hash_bucket_hunks (void);
int new_hash_table (struct hash_table **, unsigned, const char *, int);
void free_hash_table (struct hash_table **, const char *, int);
struct hash_bucket *new_hash_bucket (const char *, int);
void free_hash_bucket (struct hash_bucket *, const char *, int);
int new_hash(struct hash_table **,
hash_reference, hash_dereference, unsigned,
unsigned (*do_hash)(const void *, unsigned, unsigned),
const char *, int);
unsigned do_string_hash(const void *, unsigned, unsigned);
unsigned do_case_hash(const void *, unsigned, unsigned);
unsigned do_id_hash(const void *, unsigned, unsigned);
unsigned do_number_hash(const void *, unsigned, unsigned);
unsigned do_ip4_hash(const void *, unsigned, unsigned);
unsigned char *hash_report(struct hash_table *);
void add_hash (struct hash_table *,
const void *, unsigned, hashed_object_t *,
const char *, int);
void delete_hash_entry (struct hash_table *, const void *,
unsigned, const char *, int);
int hash_lookup (hashed_object_t **, struct hash_table *,
const void *, unsigned, const char *, int);
int hash_foreach (struct hash_table *, hash_foreach_func);
int casecmp (const void *s, const void *t, size_t len);
#endif /* OMAPI_HASH_H */
|
