forked from twitter-forks/rubyenterpriseedition187-248
-
Notifications
You must be signed in to change notification settings - Fork 0
/
pointerset.c
247 lines (216 loc) · 4.97 KB
/
pointerset.c
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
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
#include "config.h"
#include "defines.h"
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#include <string.h>
#include "pointerset.h"
typedef struct _PointerSetEntry PointerSetEntry;
struct _PointerSet {
unsigned int num_bins;
unsigned int num_entries;
PointerSetEntry **bins;
};
struct _PointerSetEntry {
PointerSetElement element;
PointerSetEntry *next;
};
/* Table of prime numbers 2^n+a, 2<=n<=30. */
static const long primes[] = {
8 + 3,
16 + 3,
32 + 5,
64 + 3,
128 + 3,
256 + 27,
512 + 9,
1024 + 9,
2048 + 5,
4096 + 3,
8192 + 27,
16384 + 43,
32768 + 3,
65536 + 45,
131072 + 29,
262144 + 3,
524288 + 21,
1048576 + 7,
2097152 + 17,
4194304 + 15,
8388608 + 9,
16777216 + 43,
33554432 + 35,
67108864 + 15,
134217728 + 29,
268435456 + 3,
536870912 + 11,
1073741824 + 85,
0
};
/* The percentage of nonempty buckets, before increasing the number of bins. 1.0 == 100%
* A value larger than 1.0 means that it's very likely that some buckets contain more than
* 1 entry.
*/
#define MAX_LOAD_FACTOR 2.0
/* The default for the number of bins allocated initially. Must be a prime number. */
#define DEFAULT_TABLE_SIZE 11
/* MINSIZE is the minimum size of a dictionary. */
#define MINSIZE 8
#if SIZEOF_LONG == SIZEOF_VOIDP
typedef unsigned long PointerInt;
#elif SIZEOF_LONG_LONG == SIZEOF_VOIDP
typedef unsigned LONG_LONG PointerInt;
#else
#error ---->> pointerset.c requires sizeof(void*) == sizeof(long) to be compiled. <<---
-
#endif
#define alloc(type) (type*)malloc((unsigned)sizeof(type))
#define Calloc(n,s) (char*)calloc((n),(s))
#define HASH(element, num_bins) ((PointerInt) element) % num_bins
#define FIND_ENTRY(set, entry, element) \
do { \
unsigned int bin_pos = HASH(element, set->num_bins); \
entry = (set)->bins[bin_pos]; \
while (entry != NULL && entry->element != element) { \
entry = entry->next; \
} \
} while (0)
static int
new_size(int size)
{
int i;
int newsize;
for (i = 0, newsize = MINSIZE;
i < sizeof(primes)/sizeof(primes[0]);
i++, newsize <<= 1)
{
if (newsize > size)
return primes[i];
}
/* Ran out of polynomials */
return -1; /* should raise exception */
}
PointerSet *
pointer_set_new()
{
PointerSet *set;
set = alloc(PointerSet);
if (set != NULL) {
set->num_entries = 0;
set->num_bins = DEFAULT_TABLE_SIZE;
set->bins = (PointerSetEntry **) Calloc(DEFAULT_TABLE_SIZE, sizeof(PointerSetEntry *));
}
return set;
}
static void
free_bin_contents(PointerSet *set)
{
PointerSetEntry *entry, *next;
int i;
for(i = 0; i < set->num_bins; i++) {
entry = set->bins[i];
while (entry != NULL) {
next = entry->next;
free(entry);
entry = next;
}
set->bins[i] = NULL;
}
set->num_entries = 0;
}
void
pointer_set_free(PointerSet *set)
{
free_bin_contents(set);
free(set->bins);
free(set);
}
int
pointer_set_contains(PointerSet *set, PointerSetElement element)
{
PointerSetEntry *entry;
FIND_ENTRY(set, entry, element);
return entry != NULL;
}
static void
rehash(PointerSet *set, int new_num_bins)
{
PointerSetEntry *entry, **new_bins;
int i;
new_bins = (PointerSetEntry **) Calloc(new_num_bins, sizeof(PointerSetEntry *));
for (i = 0; i < set->num_bins; i++) {
entry = set->bins[i];
while (entry != NULL) {
unsigned int new_bin_pos;
PointerSetEntry *next;
new_bin_pos = HASH(entry->element, new_num_bins);
next = entry->next;
entry->next = new_bins[new_bin_pos];
new_bins[new_bin_pos] = entry;
entry = next;
}
}
free(set->bins);
set->num_bins = new_num_bins;
set->bins = new_bins;
}
void
pointer_set_insert(PointerSet *set, PointerSetElement element)
{
PointerSetEntry *entry;
FIND_ENTRY(set, entry, element);
if (entry == NULL) {
unsigned int bin_pos;
if (set->num_entries / (double) set->num_bins > MAX_LOAD_FACTOR) {
/* Increase number of bins to the next prime number. */
rehash(set, new_size(set->num_bins + 1));
}
bin_pos = HASH(element, set->num_bins);
entry = malloc(sizeof(PointerSetEntry));
entry->element = element;
entry->next = set->bins[bin_pos];
set->bins[bin_pos] = entry;
set->num_entries++;
}
}
void
pointer_set_delete(PointerSet *set, PointerSetElement element)
{
unsigned int bin_pos;
PointerSetEntry *entry, *prev;
bin_pos = HASH(element, set->num_bins);
entry = set->bins[bin_pos];
prev = NULL;
while (entry != NULL && entry->element != element) {
prev = entry;
entry = entry->next;
}
if (entry != NULL) {
if (prev != NULL) {
prev->next = entry->next;
} else {
set->bins[bin_pos] = entry->next;
}
free(entry);
set->num_entries--;
/* TODO: is it a good idea to reduce the number of bins? */
}
}
void
pointer_set_reset(PointerSet *set)
{
free_bin_contents(set);
set->bins = realloc(set->bins, sizeof(PointerSetEntry *) * DEFAULT_TABLE_SIZE);
set->num_bins = DEFAULT_TABLE_SIZE;
memset(set->bins, 0, sizeof(PointerSetEntry *) * DEFAULT_TABLE_SIZE);
}
unsigned int
pointer_set_get_size(PointerSet *set)
{
return set->num_entries;
}
unsigned int
pointer_set_get_capacity(PointerSet *set)
{
return set->num_bins;
}