3 * File name: ir/adt/set.c
4 * Purpose: Set --- collection of entries that are unique wrt to a key.
5 * Author: Markus Armbruster
7 * Created: 1999 by getting from fiasco
9 * Copyright: (c) 1995, 1996 Markus Armbruster
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
13 /* This code is derived from:
15 From: ejp@ausmelb.oz.AU (Esmond Pitt)
16 Date: Tue, 7 Mar 1989 22:06:26 GMT
17 Subject: v06i042: dynamic hashing version of hsearch(3)
18 Message-ID: <1821@basser.oz>
19 Newsgroups: comp.sources.misc
20 Sender: msgs@basser.oz
22 Posting-number: Volume 6, Issue 42
23 Submitted-By: Esmond Pitt <ejp@ausmelb.oz.AU>
24 Archive-name: dynamic-hash
26 * Dynamic hashing, after CACM April 1988 pp 446-457, by Per-Ake Larson.
27 * Coded into C, with minor code improvements, and with hsearch(3) interface,
28 * by ejp@ausmelb.oz, Jul 26, 1988: 13:16;
30 TODO: Fix Esmond's ugly MixedCapsIdentifiers ;->
39 /* bcopy is not ISO C *
40 #define bcopy(X, Y, Z) memcpy((Y), (X), (Z))
45 # define PMANGLE(pre) pre##_pset
46 # define MANGLEP(post) pset_##post
47 # define MANGLE(pre, post) pre##pset##post
48 # define EQUAL(cmp, elt, key, siz) (!(cmp) ((elt)->entry.dptr, (key)))
51 # define PMANGLE(pre) pre##_set
52 # define MANGLEP(post) set_##post
53 # define MANGLE(pre, post) pre##set##post
54 # define EQUAL(cmp, elt, key, siz) \
55 (((elt)->entry.size == (siz)) && !(cmp) ((elt)->entry.dptr, (key), (siz)))
71 #define TOBSTACK_ID MANGLEP(tag)
75 #define SEGMENT_SIZE_SHIFT 8
76 #define SEGMENT_SIZE (1 << SEGMENT_SIZE_SHIFT)
77 #define DIRECTORY_SIZE_SHIFT 8
78 #define DIRECTORY_SIZE (1 << DIRECTORY_SIZE_SHIFT)
79 #define MAX_LOAD_FACTOR 4
82 typedef struct element {
83 struct element *chain; /* for chaining Elements */
84 MANGLEP (entry) entry;
89 short p; /* Next bucket to be split */
90 short maxp; /* upper bound on p during expansion */
91 int nkey; /* current # keys */
92 short nseg; /* current # segments */
93 Segment *dir[DIRECTORY_SIZE];
94 MANGLEP(cmp_fun) cmp; /* function comparing entries */
96 Element *iter_tail; /* non-NULL while iterating over elts */
98 Element *free_list; /* list of free Elements */
100 struct obstack obst; /* obstack for allocation all data */
102 int naccess, ncollision, ndups;
114 MANGLEP(stats) (SET *table)
118 Element *q = table->free_list;
119 while (q) { q = q->chain; ++nfree; }
121 printf (" accesses collisions keys duplicates longest wasted\n%12d%12d%12d%12d%12d%12d\n",
122 table->naccess, table->ncollision, table->nkey, table->ndups, table->max_chain_len, nfree);
126 stat_chain_len (SET *table, int chain_len)
128 table->ncollision += chain_len;
129 if (table->max_chain_len < chain_len) table->max_chain_len = chain_len;
132 # define stat_access(table) (++(table)->naccess)
133 # define stat_dup(table) (++(table)->ndups)
137 # define stat_chain_len(table, chain_len) ((void)0)
138 # define stat_access(table) ((void)0)
139 # define stat_dup(table) ((void)0)
145 const char *MANGLEP(tag);
149 MANGLEP(describe) (SET *table)
155 printf ("p=%d maxp=%d nkey=%d nseg=%d\n",
156 table->p, table->maxp, table->nkey, table->nseg);
157 for (i = 0; i < table->nseg; i++) {
159 for (j = 0; j < SEGMENT_SIZE; j++) {
163 if (collide) printf ("<%3d>", collide);
164 else printf ("table");
165 printf ("[%d][%3d]: %u %p\n", i, j, ptr->entry.hash, ptr->entry.dptr);
177 (PMANGLE(new)) (MANGLEP(cmp_fun) cmp, int nslots)
180 SET *table = xmalloc (sizeof (SET));
182 /* Adjust nslots up to next power of 2, minimum SEGMENT_SIZE */
183 assert (nslots >= 0);
184 for (i = SEGMENT_SIZE; i < nslots; i <<= 1) assert (i < (i << 1));
185 nslots = i >> SEGMENT_SIZE_SHIFT;
187 table->nseg = table->p = table->nkey = 0;
188 table->maxp = nslots << SEGMENT_SIZE_SHIFT;
190 table->iter_tail = NULL;
192 table->free_list = NULL;
194 obstack_init (&table->obst);
197 for (i = 0; i < nslots; ++i) {
198 table->dir[i] = (Segment *)obstack_alloc (&table->obst,
199 sizeof (Segment) * SEGMENT_SIZE);
201 memset (table->dir[i], 0, sizeof (Segment) * SEGMENT_SIZE);
206 table->naccess = table->ncollision = table->ndups = 0;
207 table->max_chain_len = 0;
210 table->tag = MANGLEP(tag);
217 PMANGLE(del) (SET *table)
220 MANGLEP(tag) = table->tag;
222 obstack_free (&table->obst, NULL);
227 * do one iteration step, return 1
228 * if still data in the set, 0 else
231 iter_step (SET *table)
233 if (++table->iter_j >= SEGMENT_SIZE) {
235 if (++table->iter_i >= table->nseg) {
244 * finds the first entry in the table
247 MANGLEP(first) (SET *table)
249 assert (!table->iter_tail);
252 while (!table->dir[table->iter_i][table->iter_j]) {
253 if (!iter_step (table)) return NULL;
255 table->iter_tail = table->dir[table->iter_i][table->iter_j];
256 assert (table->iter_tail->entry.dptr);
257 return table->iter_tail->entry.dptr;
261 * returns next entry in the table
264 MANGLEP(next) (SET *table)
266 assert (table->iter_tail);
268 /* follow collision chain */
269 table->iter_tail = table->iter_tail->chain;
270 if (!table->iter_tail) {
271 /* go to next segment */
273 if (!iter_step (table)) return NULL;
274 } while (!table->dir[table->iter_i][table->iter_j]);
275 table->iter_tail = table->dir[table->iter_i][table->iter_j];
277 assert (table->iter_tail->entry.dptr);
278 return table->iter_tail->entry.dptr;
282 MANGLEP(break) (SET *table)
284 assert (table->iter_tail);
285 table->iter_tail = NULL;
289 * limit the hash value
291 static INLINE unsigned
292 Hash (SET *table, unsigned h)
296 address = h & (table->maxp - 1); /* h % table->maxp */
297 if (address < (unsigned)table->p)
298 address = h & ((table->maxp << 1) - 1); /* h % (2*table->maxp) */
303 * returns non-zero if the number of elements in
304 * the set is greater then number of segments * MAX_LOAD_FACTOR
309 return ( ++table->nkey
310 > (table->nseg << SEGMENT_SIZE_SHIFT) * MAX_LOAD_FACTOR);
314 * expand the hash-table: the algorithm is split, so on every
315 * insert, only ONE segment is rehashed!
317 * table->p contains the current segment to split
318 * after all segments were split, table->p is set to zero and
319 * table->maxp is duplicated.
322 expand_table (SET *table)
325 int OldSegmentIndex, NewSegmentIndex;
326 int OldSegmentDir, NewSegmentDir;
333 if (table->maxp + table->p < (DIRECTORY_SIZE << SEGMENT_SIZE_SHIFT)) {
334 /* Locate the bucket to be split */
335 OldSegmentDir = table->p >> SEGMENT_SIZE_SHIFT;
336 OldSegment = table->dir[OldSegmentDir];
337 OldSegmentIndex = table->p & (SEGMENT_SIZE-1);
339 /* Expand address space; if necessary create a new segment */
340 NewAddress = table->maxp + table->p;
341 NewSegmentDir = NewAddress >> SEGMENT_SIZE_SHIFT;
342 NewSegmentIndex = NewAddress & (SEGMENT_SIZE-1);
343 if (NewSegmentIndex == 0) {
344 table->dir[NewSegmentDir] =
345 (Segment *)obstack_alloc (&table->obst,
346 sizeof(Segment) * SEGMENT_SIZE);
347 memset(table->dir[NewSegmentDir], 0, sizeof(Segment) * SEGMENT_SIZE);
349 NewSegment = table->dir[NewSegmentDir];
351 /* Adjust state variables */
353 if (table->p == table->maxp) {
354 table->maxp <<= 1; /* table->maxp *= 2 */
359 /* Relocate records to the new bucket */
360 Previous = &OldSegment[OldSegmentIndex];
362 LastOfNew = &NewSegment[NewSegmentIndex];
364 while (Current != NULL) {
365 if (Hash (table, Current->entry.hash) == NewAddress) {
366 /* move to new chain */
367 *LastOfNew = Current;
368 *Previous = Current->chain;
369 LastOfNew = &Current->chain;
370 Current = Current->chain;
373 /* leave on old chain */
374 Previous = &Current->chain;
375 Current = Current->chain;
383 MANGLE(_,_search) (SET *table,
389 MANGLE(_,_action) action)
392 Segment *CurrentSegment;
394 MANGLEP(cmp_fun) cmp = table->cmp;
399 assert (!table->iter_tail);
402 MANGLEP(tag) = table->tag;
406 /* Find collision chain */
407 h = Hash (table, hash);
408 SegmentIndex = h & (SEGMENT_SIZE-1);
409 CurrentSegment = table->dir[h >> SEGMENT_SIZE_SHIFT];
410 assert (CurrentSegment != NULL);
411 q = CurrentSegment[SegmentIndex];
413 /* Follow collision chain */
414 while (q && !EQUAL (cmp, q, key, size)) {
419 stat_chain_len (table, chain_len);
421 if (!q && (action != MANGLE(_,_find))) { /* not found, insert */
422 if (CurrentSegment[SegmentIndex]) stat_dup (table);
425 if (table->free_list) {
426 q = table->free_list;
427 table->free_list = table->free_list->chain;
429 q = obstack_alloc (&table->obst, sizeof (Element));
431 q->entry.dptr = (void *)key;
433 obstack_blank (&table->obst, offsetof (Element, entry.dptr));
434 if (action == _set_hinsert0)
435 obstack_grow0 (&table->obst, key, size);
437 obstack_grow (&table->obst, key, size);
438 q = obstack_finish (&table->obst);
439 q->entry.size = size;
441 q->chain = CurrentSegment[SegmentIndex];
442 q->entry.hash = hash;
443 CurrentSegment[SegmentIndex] = q;
445 if (loaded (table)) {
446 expand_table(table); /* doesn't affect q */
452 if (action == _pset_hinsert) return &q->entry;
454 if (action == _set_hinsert || action == _set_hinsert0) return &q->entry;
456 return q->entry.dptr;
463 pset_remove (SET *table, const void *key, unsigned hash)
466 Segment *CurrentSegment;
468 pset_cmp_fun cmp = table->cmp;
473 assert (table && !table->iter_tail);
476 /* Find collision chain */
477 h = Hash (table, hash);
478 SegmentIndex = h & (SEGMENT_SIZE-1);
479 CurrentSegment = table->dir[h >> SEGMENT_SIZE_SHIFT];
480 assert (CurrentSegment != NULL);
481 p = &CurrentSegment[SegmentIndex];
483 /* Follow collision chain */
484 while (!EQUAL (cmp, *p, key, size)) {
490 stat_chain_len (table, chain_len);
494 q->chain = table->free_list;
495 table->free_list = q;
497 return q->entry.dptr;
502 (pset_find) (SET *se, const void *key, unsigned hash)
504 return pset_find (se, key, hash);
509 (pset_insert) (SET *se, const void *key, unsigned hash)
511 return pset_insert (se, key, hash);
516 (pset_hinsert) (SET *se, const void *key, unsigned hash)
518 return pset_hinsert (se, key, hash);
524 (set_find) (set *se, const void *key, size_t size, unsigned hash)
526 return set_find (se, key, size, hash);
531 (set_insert) (set *se, const void *key, size_t size, unsigned hash)
533 return set_insert (se, key, size, hash);
538 (set_hinsert) (set *se, const void *key, size_t size, unsigned hash)
540 return set_hinsert (se, key, size, hash);