1 /* xf86drmHash.c -- Small hash table support for integer -> integer mapping
2 * Created: Sun Apr 18 09:35:45 1999 by faith@precisioninsight.com
4 * Copyright 1999 Precision Insight, Inc., Cedar Park, Texas.
7 * Permission is hereby granted, free of charge, to any person obtaining a
8 * copy of this software and associated documentation files (the "Software"),
9 * to deal in the Software without restriction, including without limitation
10 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
11 * and/or sell copies of the Software, and to permit persons to whom the
12 * Software is furnished to do so, subject to the following conditions:
14 * The above copyright notice and this permission notice (including the next
15 * paragraph) shall be included in all copies or substantial portions of the
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
19 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
20 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
21 * PRECISION INSIGHT AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
22 * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
23 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
24 * DEALINGS IN THE SOFTWARE.
26 * Authors: Rickard E. (Rik) Faith <faith@valinux.com>
28 * $XFree86: xc/programs/Xserver/hw/xfree86/os-support/linux/drm/xf86drmHash.c,v 1.4 2001/03/21 18:08:54 dawes Exp $
32 * This file contains a straightforward implementation of a fixed-sized
33 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
34 * collision resolution. There are two potentially interesting things
35 * about this implementation:
37 * 1) The table is power-of-two sized. Prime sized tables are more
38 * traditional, but do not have a significant advantage over power-of-two
39 * sized table, especially when double hashing is not used for collision
42 * 2) The hash computation uses a table of random integers [Hanson97,
47 * With a table size of 512, the current implementation is sufficient for a
48 * few hundred keys. Since this is well above the expected size of the
49 * tables for which this implementation was designed, the implementation of
50 * dynamic hash tables was postponed until the need arises. A common (and
51 * naive) approach to dynamic hash table implementation simply creates a
52 * new hash table when necessary, rehashes all the data into the new table,
53 * and destroys the old table. The approach in [Larson88] is superior in
54 * two ways: 1) only a portion of the table is expanded when needed,
55 * distributing the expansion cost over several insertions, and 2) portions
56 * of the table can be locked, enabling a scalable thread-safe
61 * [Hanson97] David R. Hanson. C Interfaces and Implementations:
62 * Techniques for Creating Reusable Software. Reading, Massachusetts:
63 * Addison-Wesley, 1997.
65 * [Knuth73] Donald E. Knuth. The Art of Computer Programming. Volume 3:
66 * Sorting and Searching. Reading, Massachusetts: Addison-Wesley, 1973.
68 * [Larson88] Per-Ake Larson. "Dynamic Hash Tables". CACM 31(4), April
83 # include "xf86_ansic.h"
92 #define HASH_MAGIC 0xdeadbeef
94 #define HASH_SIZE 512 /* Good for about 100 entries */
95 /* If you change this value, you probably
96 have to change the HashHash hashing
100 #define HASH_ALLOC malloc
101 #define HASH_FREE free
102 #define HASH_RANDOM_DECL
103 #define HASH_RANDOM_INIT(seed) srandom(seed)
104 #define HASH_RANDOM random()
106 #define HASH_ALLOC drmMalloc
107 #define HASH_FREE drmFree
108 #define HASH_RANDOM_DECL void *state
109 #define HASH_RANDOM_INIT(seed) state = drmRandomCreate(seed)
110 #define HASH_RANDOM drmRandom(state)
114 typedef struct HashBucket {
117 struct HashBucket *next;
118 } HashBucket, *HashBucketPtr;
120 typedef struct HashTable {
122 unsigned long entries;
123 unsigned long hits; /* At top of linked list */
124 unsigned long partials; /* Not at top of linked list */
125 unsigned long misses; /* Not in table */
126 HashBucketPtr buckets[HASH_SIZE];
129 } HashTable, *HashTablePtr;
132 extern void *N(HashCreate)(void);
133 extern int N(HashDestroy)(void *t);
134 extern int N(HashLookup)(void *t, unsigned long key, unsigned long *value);
135 extern int N(HashInsert)(void *t, unsigned long key, unsigned long value);
136 extern int N(HashDelete)(void *t, unsigned long key);
139 static unsigned long HashHash(unsigned long key)
141 unsigned long hash = 0;
142 unsigned long tmp = key;
144 static unsigned long scatter[256];
149 HASH_RANDOM_INIT(37);
150 for (i = 0; i < 256; i++) scatter[i] = HASH_RANDOM;
155 hash = (hash << 1) + scatter[tmp & 0xff];
161 printf( "Hash(%d) = %d\n", key, hash);
166 void *N(HashCreate)(void)
171 table = HASH_ALLOC(sizeof(*table));
172 if (!table) return NULL;
173 table->magic = HASH_MAGIC;
179 for (i = 0; i < HASH_SIZE; i++) table->buckets[i] = NULL;
183 int N(HashDestroy)(void *t)
185 HashTablePtr table = (HashTablePtr)t;
186 HashBucketPtr bucket;
190 if (table->magic != HASH_MAGIC) return -1; /* Bad magic */
192 for (i = 0; i < HASH_SIZE; i++) {
193 for (bucket = table->buckets[i]; bucket;) {
203 /* Find the bucket and organize the list so that this bucket is at the
206 static HashBucketPtr HashFind(HashTablePtr table,
207 unsigned long key, unsigned long *h)
209 unsigned long hash = HashHash(key);
210 HashBucketPtr prev = NULL;
211 HashBucketPtr bucket;
215 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) {
216 if (bucket->key == key) {
219 prev->next = bucket->next;
220 bucket->next = table->buckets[hash];
221 table->buckets[hash] = bucket;
234 int N(HashLookup)(void *t, unsigned long key, void **value)
236 HashTablePtr table = (HashTablePtr)t;
237 HashBucketPtr bucket;
239 if (!table || table->magic != HASH_MAGIC) return -1; /* Bad magic */
241 bucket = HashFind(table, key, NULL);
242 if (!bucket) return 1; /* Not found */
243 *value = bucket->value;
244 return 0; /* Found */
247 int N(HashInsert)(void *t, unsigned long key, void *value)
249 HashTablePtr table = (HashTablePtr)t;
250 HashBucketPtr bucket;
253 if (table->magic != HASH_MAGIC) return -1; /* Bad magic */
255 if (HashFind(table, key, &hash)) return 1; /* Already in table */
257 bucket = HASH_ALLOC(sizeof(*bucket));
258 if (!bucket) return -1; /* Error */
260 bucket->value = value;
261 bucket->next = table->buckets[hash];
262 table->buckets[hash] = bucket;
264 printf("Inserted %d at %d/%p\n", key, hash, bucket);
266 return 0; /* Added to table */
269 int N(HashDelete)(void *t, unsigned long key)
271 HashTablePtr table = (HashTablePtr)t;
273 HashBucketPtr bucket;
275 if (table->magic != HASH_MAGIC) return -1; /* Bad magic */
277 bucket = HashFind(table, key, &hash);
279 if (!bucket) return 1; /* Not found */
281 table->buckets[hash] = bucket->next;
286 int N(HashNext)(void *t, unsigned long *key, void **value)
288 HashTablePtr table = (HashTablePtr)t;
290 for (; table->p0 < HASH_SIZE;
291 ++table->p0, table->p1 = table->buckets[table->p0]) {
293 *key = table->p1->key;
294 *value = table->p1->value;
295 table->p1 = table->p1->next;
302 int N(HashFirst)(void *t, unsigned long *key, void **value)
304 HashTablePtr table = (HashTablePtr)t;
306 if (table->magic != HASH_MAGIC) return -1; /* Bad magic */
309 table->p1 = table->buckets[0];
310 return N(HashNext)(table, key, value);
314 #define DIST_LIMIT 10
315 static int dist[DIST_LIMIT];
317 static void clear_dist(void) {
320 for (i = 0; i < DIST_LIMIT; i++) dist[i] = 0;
323 static int count_entries(HashBucketPtr bucket)
327 for (; bucket; bucket = bucket->next) ++count;
331 static void update_dist(int count)
333 if (count >= DIST_LIMIT) ++dist[DIST_LIMIT-1];
337 static void compute_dist(HashTablePtr table)
340 HashBucketPtr bucket;
342 printf("Entries = %ld, hits = %ld, partials = %ld, misses = %ld\n",
343 table->entries, table->hits, table->partials, table->misses);
345 for (i = 0; i < HASH_SIZE; i++) {
346 bucket = table->buckets[i];
347 update_dist(count_entries(bucket));
349 for (i = 0; i < DIST_LIMIT; i++) {
350 if (i != DIST_LIMIT-1) printf("%5d %10d\n", i, dist[i]);
351 else printf("other %10d\n", dist[i]);
355 static void check_table(HashTablePtr table,
356 unsigned long key, unsigned long value)
358 unsigned long retval = 0;
359 int retcode = N(HashLookup)(table, key, &retval);
363 printf("Bad magic = 0x%08lx:"
364 " key = %lu, expected = %lu, returned = %lu\n",
365 table->magic, key, value, retval);
368 printf("Not found: key = %lu, expected = %lu returned = %lu\n",
373 printf("Bad value: key = %lu, expected = %lu, returned = %lu\n",
377 printf("Bad retcode = %d: key = %lu, expected = %lu, returned = %lu\n",
378 retcode, key, value, retval);
388 printf("\n***** 256 consecutive integers ****\n");
389 table = N(HashCreate)();
390 for (i = 0; i < 256; i++) N(HashInsert)(table, i, i);
391 for (i = 0; i < 256; i++) check_table(table, i, i);
392 for (i = 256; i >= 0; i--) check_table(table, i, i);
394 N(HashDestroy)(table);
396 printf("\n***** 1024 consecutive integers ****\n");
397 table = N(HashCreate)();
398 for (i = 0; i < 1024; i++) N(HashInsert)(table, i, i);
399 for (i = 0; i < 1024; i++) check_table(table, i, i);
400 for (i = 1024; i >= 0; i--) check_table(table, i, i);
402 N(HashDestroy)(table);
404 printf("\n***** 1024 consecutive page addresses (4k pages) ****\n");
405 table = N(HashCreate)();
406 for (i = 0; i < 1024; i++) N(HashInsert)(table, i*4096, i);
407 for (i = 0; i < 1024; i++) check_table(table, i*4096, i);
408 for (i = 1024; i >= 0; i--) check_table(table, i*4096, i);
410 N(HashDestroy)(table);
412 printf("\n***** 1024 random integers ****\n");
413 table = N(HashCreate)();
415 for (i = 0; i < 1024; i++) N(HashInsert)(table, random(), i);
417 for (i = 0; i < 1024; i++) check_table(table, random(), i);
419 for (i = 0; i < 1024; i++) check_table(table, random(), i);
421 N(HashDestroy)(table);
423 printf("\n***** 5000 random integers ****\n");
424 table = N(HashCreate)();
426 for (i = 0; i < 5000; i++) N(HashInsert)(table, random(), i);
428 for (i = 0; i < 5000; i++) check_table(table, random(), i);
430 for (i = 0; i < 5000; i++) check_table(table, random(), i);
432 N(HashDestroy)(table);