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
|
/* Copyright (C) 2000-2010 Red Hat, Inc.
This file is part of elfutils.
Written by Ulrich Drepper <drepper@redhat.com>, 2000.
This file is free software; you can redistribute it and/or modify
it under the terms of either
* the GNU Lesser General Public License as published by the Free
Software Foundation; either version 3 of the License, or (at
your option) any later version
or
* the GNU General Public License as published by the Free
Software Foundation; either version 2 of the License, or (at
your option) any later version
or both in parallel, as here.
elfutils is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received copies of the GNU General Public License and
the GNU Lesser General Public License along with this program. If
not, see <http://www.gnu.org/licenses/>. */
#include <stddef.h>
/* Before including this file the following macros must be defined:
NAME name of the hash table structure.
TYPE data type of the hash table entries
The following macros if present select features:
ITERATE iterating over the table entries is possible
HASHTYPE integer type for hash values, default unsigned long int
*/
/* Optionally include an entry pointing to the first used entry. */
#ifdef ITERATE
# define FIRST(name) name##_ent *first;
# define NEXT(name) struct name##_ent *next;
#else
# define FIRST(name)
# define NEXT(name)
#endif
#ifndef HASHTYPE
# define HASHTYPE unsigned long int
#endif
/* Defined separately. */
extern size_t next_prime (size_t seed);
/* Table entry type. */
#define _DYNHASHENTTYPE(name) \
typedef struct name##_ent \
{ \
HASHTYPE hashval; \
TYPE data; \
NEXT (name) \
} name##_ent
#define DYNHASHENTTYPE(name) _DYNHASHENTTYPE (name)
DYNHASHENTTYPE (NAME);
/* Type of the dynamic hash table data structure. */
#define _DYNHASHTYPE(name) \
typedef struct \
{ \
size_t size; \
size_t filled; \
name##_ent *table; \
FIRST (name) \
} name
#define DYNHASHTYPE(name) _DYNHASHTYPE (name)
DYNHASHTYPE (NAME);
#define _FUNCTIONS(name) \
/* Initialize the hash table. */ \
extern int name##_init (name *htab, size_t init_size); \
\
/* Free resources allocated for hash table. */ \
extern int name##_free (name *htab); \
\
/* Insert new entry. */ \
extern int name##_insert (name *htab, HASHTYPE hval, TYPE data); \
\
/* Insert new entry, possibly overwrite old entry. */ \
extern int name##_overwrite (name *htab, HASHTYPE hval, TYPE data); \
\
/* Find entry in hash table. */ \
extern TYPE name##_find (name *htab, HASHTYPE hval, TYPE val);
#define FUNCTIONS(name) _FUNCTIONS (name)
FUNCTIONS (NAME)
#ifdef ITERATE
# define _XFUNCTIONS(name) \
/* Get next element in table. */ \
extern TYPE name##_iterate (name *htab, void **ptr);
# define XFUNCTIONS(name) _XFUNCTIONS (name)
XFUNCTIONS (NAME)
#endif
#ifndef NO_UNDEF
# undef DYNHASHENTTYPE
# undef DYNHASHTYPE
# undef FUNCTIONS
# undef _FUNCTIONS
# undef XFUNCTIONS
# undef _XFUNCTIONS
# undef NAME
# undef TYPE
# undef ITERATE
# undef COMPARE
# undef FIRST
# undef NEXT
#endif
|
