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
|
/* hash.h
Definitions for hashing... */
/*
* Copyright (c) 1995-2001 Internet Software Consortium.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of The Internet Software Consortium nor the names
* of its contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INTERNET SOFTWARE CONSORTIUM AND
* CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE INTERNET SOFTWARE CONSORTIUM OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* This software has been written for the Internet Software Consortium
* by Ted Lemon in cooperation with Vixie Enterprises and Nominum, Inc.
* To learn more about the Internet Software Consortium, see
* ``http://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
#define DEFAULT_HASH_SIZE 9973
/* The purpose of the hashed_object_t struct is to not match anything else. */
typedef struct {
int foo;
} hashed_object_t;
typedef void (*hash_foreach_func) (const unsigned char *,
unsigned, hashed_object_t *);
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 *, unsigned long);
struct hash_table {
unsigned hash_count;
struct hash_bucket *buckets [DEFAULT_HASH_SIZE];
hash_reference referencer;
hash_dereference dereferencer;
hash_comparator_t cmp;
int (*do_hash) (const unsigned char *, unsigned, unsigned);
};
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); \
int name##_hash_foreach (hashtype *, \
void (*) (bufarg, unsigned, type *)); \
int name##_new_hash (hashtype **, int, const char *, int); \
void name##_free_hash_table (hashtype **, const char *, int);
#define HASH_FUNCTIONS(name, bufarg, type, hashtype, ref, deref) \
void name##_hash_add (hashtype *table, \
bufarg buf, unsigned len, type *ptr, \
const char *file, int line) \
{ \
add_hash ((struct hash_table *)table, \
(const unsigned char *)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, \
(const unsigned char *)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, \
(const unsigned char *)buf, len, file, line); \
} \
\
int name##_hash_foreach (hashtype *table, \
void (*func) (bufarg, unsigned, type *)) \
{ \
return hash_foreach ((struct hash_table *)table, \
(hash_foreach_func)func); \
} \
\
int name##_new_hash (hashtype **tp, int c, const char *file, int line) \
{ \
return new_hash ((struct hash_table **)tp, \
(hash_reference)ref, (hash_dereference)deref, c, \
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 **, int, 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, int, const char *, int);
void add_hash (struct hash_table *,
const unsigned char *, unsigned, hashed_object_t *,
const char *, int);
void delete_hash_entry (struct hash_table *, const unsigned char *,
unsigned, const char *, int);
int hash_lookup (hashed_object_t **, struct hash_table *,
const unsigned char *, unsigned, const char *, int);
int hash_foreach (struct hash_table *, hash_foreach_func);
int casecmp (const void *s, const void *t, unsigned long len);
#endif /* OMAPI_HASH_H */
|
