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
|
#ifndef OHASH_H
#define OHASH_H
/* $OpenBSD: ohash.h,v 1.2 2000/06/28 10:12:49 espie Exp $ */
/* ex:ts=8 sw=4:
*/
/*
* Copyright (c) 1999 Marc Espie.
*
* Code written for the OpenBSD project.
*
* 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.
*
* THIS SOFTWARE IS PROVIDED BY THE OPENBSD PROJECT 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 OPENBSD
* PROJECT 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.
*/
/* Open hashing support.
* Open hashing was chosen because it is much lighter than other hash
* techniques, and more efficient in most cases.
*/
struct hash_info {
ptrdiff_t key_offset;
void *data; /* user data */
void *(*halloc) __P((size_t, void *));
void (*hfree) __P((void *, size_t, void *));
void *(*alloc) __P((size_t, void *));
};
struct hash {
struct hash_record *t;
struct hash_info info;
unsigned int size;
unsigned int total;
unsigned int deleted;
};
struct hash_record {
u_int32_t hv;
const char *p;
};
/* For this to be tweakable, we use small primitives, and leave part of the
* logic to the client application. e.g., hashing is left to the client
* application. We also provide a simple table entry lookup that yields
* a hashing table index (opaque) to be used in find/insert/remove.
* The keys are stored at a known position in the client data.
*/
__BEGIN_DECLS
void hash_init __P((struct hash *, unsigned, struct hash_info *));
void hash_delete __P((struct hash *));
unsigned int hash_lookup_string __P((struct hash *, const char *, u_int32_t));
unsigned int hash_lookup_interval __P((struct hash *, const char *, \
const char *, u_int32_t));
unsigned int hash_lookup_memory __P((struct hash *, const char *, \
size_t, u_int32_t));
void *hash_find __P((struct hash *, unsigned int));
void *hash_remove __P((struct hash *, unsigned int));
void *hash_insert __P((struct hash *, unsigned int, void *));
void *hash_first __P((struct hash *, unsigned int *));
void *hash_next __P((struct hash *, unsigned int *));
unsigned int hash_entries __P((struct hash *));
void *hash_create_entry __P((struct hash_info *, const char *, const char **));
u_int32_t hash_interval __P((const char *, const char **));
unsigned int hash_qlookupi __P((struct hash *, const char *, const char **));
unsigned int hash_qlookup __P((struct hash *, const char *));
__END_DECLS
#endif
|
