aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorEmil Velikov2015-03-22 14:41:12 -0500
committerEmil Velikov2015-04-05 09:19:42 -0500
commit79f9cf3eb78a4feebda167ad4a3475ee1f2aa067 (patch)
treedbbd3c4cf350ab7e668744129137259eeb941c65 /xf86drmHash.c
parent7d8c9464081634f053e16e5eac9655a12fae1dc4 (diff)
downloadexternal-libdrm-79f9cf3eb78a4feebda167ad4a3475ee1f2aa067.tar.gz
external-libdrm-79f9cf3eb78a4feebda167ad4a3475ee1f2aa067.tar.xz
external-libdrm-79f9cf3eb78a4feebda167ad4a3475ee1f2aa067.zip
tests/hash: extract test out of xf86drmHash.c
This way with follow up commits we can fix it and wire it up to make check v2: - Use xf86drmHash.h for common structs.(Jan) - Add test to .gitignore. Signed-off-by: Emil Velikov <emil.l.velikov@gmail.com> Reviewed-by: Jan Vesely <jan.vesely@rutgers.edu>
Diffstat (limited to 'xf86drmHash.c')
-rw-r--r--xf86drmHash.c196
1 files changed, 11 insertions, 185 deletions
diff --git a/xf86drmHash.c b/xf86drmHash.c
index 82cbc2a5..f7d7f73b 100644
--- a/xf86drmHash.c
+++ b/xf86drmHash.c
@@ -71,60 +71,11 @@
71#include <stdio.h> 71#include <stdio.h>
72#include <stdlib.h> 72#include <stdlib.h>
73 73
74#define HASH_MAIN 0 74#include "xf86drm.h"
75 75#include "xf86drmHash.h"
76#if !HASH_MAIN
77# include "xf86drm.h"
78#endif
79 76
80#define HASH_MAGIC 0xdeadbeef 77#define HASH_MAGIC 0xdeadbeef
81#define HASH_DEBUG 0 78#define HASH_DEBUG 0
82#define HASH_SIZE 512 /* Good for about 100 entries */
83 /* If you change this value, you probably
84 have to change the HashHash hashing
85 function! */
86
87#if HASH_MAIN
88#define HASH_ALLOC malloc
89#define HASH_FREE free
90#define HASH_RANDOM_DECL
91#define HASH_RANDOM_INIT(seed) srandom(seed)
92#define HASH_RANDOM random()
93#define HASH_RANDOM_DESTROY
94#else
95#define HASH_ALLOC drmMalloc
96#define HASH_FREE drmFree
97#define HASH_RANDOM_DECL void *state
98#define HASH_RANDOM_INIT(seed) state = drmRandomCreate(seed)
99#define HASH_RANDOM drmRandom(state)
100#define HASH_RANDOM_DESTROY drmRandomDestroy(state)
101
102#endif
103
104typedef struct HashBucket {
105 unsigned long key;
106 void *value;
107 struct HashBucket *next;
108} HashBucket, *HashBucketPtr;
109
110typedef struct HashTable {
111 unsigned long magic;
112 unsigned long entries;
113 unsigned long hits; /* At top of linked list */
114 unsigned long partials; /* Not at top of linked list */
115 unsigned long misses; /* Not in table */
116 HashBucketPtr buckets[HASH_SIZE];
117 int p0;
118 HashBucketPtr p1;
119} HashTable, *HashTablePtr;
120
121#if HASH_MAIN
122extern void *drmHashCreate(void);
123extern int drmHashDestroy(void *t);
124extern int drmHashLookup(void *t, unsigned long key, unsigned long *value);
125extern int drmHashInsert(void *t, unsigned long key, unsigned long value);
126extern int drmHashDelete(void *t, unsigned long key);
127#endif
128 79
129static unsigned long HashHash(unsigned long key) 80static unsigned long HashHash(unsigned long key)
130{ 81{
@@ -135,10 +86,10 @@ static unsigned long HashHash(unsigned long key)
135 int i; 86 int i;
136 87
137 if (!init) { 88 if (!init) {
138 HASH_RANDOM_DECL; 89 void *state;
139 HASH_RANDOM_INIT(37); 90 state = drmRandomCreate(37);
140 for (i = 0; i < 256; i++) scatter[i] = HASH_RANDOM; 91 for (i = 0; i < 256; i++) scatter[i] = drmRandom(state);
141 HASH_RANDOM_DESTROY; 92 drmRandomDestroy(state);
142 ++init; 93 ++init;
143 } 94 }
144 95
@@ -159,7 +110,7 @@ void *drmHashCreate(void)
159 HashTablePtr table; 110 HashTablePtr table;
160 int i; 111 int i;
161 112
162 table = HASH_ALLOC(sizeof(*table)); 113 table = drmMalloc(sizeof(*table));
163 if (!table) return NULL; 114 if (!table) return NULL;
164 table->magic = HASH_MAGIC; 115 table->magic = HASH_MAGIC;
165 table->entries = 0; 116 table->entries = 0;
@@ -183,11 +134,11 @@ int drmHashDestroy(void *t)
183 for (i = 0; i < HASH_SIZE; i++) { 134 for (i = 0; i < HASH_SIZE; i++) {
184 for (bucket = table->buckets[i]; bucket;) { 135 for (bucket = table->buckets[i]; bucket;) {
185 next = bucket->next; 136 next = bucket->next;
186 HASH_FREE(bucket); 137 drmFree(bucket);
187 bucket = next; 138 bucket = next;
188 } 139 }
189 } 140 }
190 HASH_FREE(table); 141 drmFree(table);
191 return 0; 142 return 0;
192} 143}
193 144
@@ -245,7 +196,7 @@ int drmHashInsert(void *t, unsigned long key, void *value)
245 196
246 if (HashFind(table, key, &hash)) return 1; /* Already in table */ 197 if (HashFind(table, key, &hash)) return 1; /* Already in table */
247 198
248 bucket = HASH_ALLOC(sizeof(*bucket)); 199 bucket = drmMalloc(sizeof(*bucket));
249 if (!bucket) return -1; /* Error */ 200 if (!bucket) return -1; /* Error */
250 bucket->key = key; 201 bucket->key = key;
251 bucket->value = value; 202 bucket->value = value;
@@ -270,7 +221,7 @@ int drmHashDelete(void *t, unsigned long key)
270 if (!bucket) return 1; /* Not found */ 221 if (!bucket) return 1; /* Not found */
271 222
272 table->buckets[hash] = bucket->next; 223 table->buckets[hash] = bucket->next;
273 HASH_FREE(bucket); 224 drmFree(bucket);
274 return 0; 225 return 0;
275} 226}
276 227
@@ -301,128 +252,3 @@ int drmHashFirst(void *t, unsigned long *key, void **value)
301 table->p1 = table->buckets[0]; 252 table->p1 = table->buckets[0];
302 return drmHashNext(table, key, value); 253 return drmHashNext(table, key, value);
303} 254}
304
305#if HASH_MAIN
306#define DIST_LIMIT 10
307static int dist[DIST_LIMIT];
308
309static void clear_dist(void) {
310 int i;
311
312 for (i = 0; i < DIST_LIMIT; i++) dist[i] = 0;
313}
314
315static int count_entries(HashBucketPtr bucket)
316{
317 int count = 0;
318
319 for (; bucket; bucket = bucket->next) ++count;
320 return count;
321}
322
323static void update_dist(int count)
324{
325 if (count >= DIST_LIMIT) ++dist[DIST_LIMIT-1];
326 else ++dist[count];
327}
328
329static void compute_dist(HashTablePtr table)
330{
331 int i;
332 HashBucketPtr bucket;
333
334 printf("Entries = %ld, hits = %ld, partials = %ld, misses = %ld\n",
335 table->entries, table->hits, table->partials, table->misses);
336 clear_dist();
337 for (i = 0; i < HASH_SIZE; i++) {
338 bucket = table->buckets[i];
339 update_dist(count_entries(bucket));
340 }
341 for (i = 0; i < DIST_LIMIT; i++) {
342 if (i != DIST_LIMIT-1) printf("%5d %10d\n", i, dist[i]);
343 else printf("other %10d\n", dist[i]);
344 }
345}
346
347static void check_table(HashTablePtr table,
348 unsigned long key, unsigned long value)
349{
350 unsigned long retval = 0;
351 int retcode = drmHashLookup(table, key, &retval);
352
353 switch (retcode) {
354 case -1:
355 printf("Bad magic = 0x%08lx:"
356 " key = %lu, expected = %lu, returned = %lu\n",
357 table->magic, key, value, retval);
358 break;
359 case 1:
360 printf("Not found: key = %lu, expected = %lu returned = %lu\n",
361 key, value, retval);
362 break;
363 case 0:
364 if (value != retval)
365 printf("Bad value: key = %lu, expected = %lu, returned = %lu\n",
366 key, value, retval);
367 break;
368 default:
369 printf("Bad retcode = %d: key = %lu, expected = %lu, returned = %lu\n",
370 retcode, key, value, retval);
371 break;
372 }
373}
374
375int main(void)
376{
377 HashTablePtr table;
378 int i;
379
380 printf("\n***** 256 consecutive integers ****\n");
381 table = drmHashCreate();
382 for (i = 0; i < 256; i++) drmHashInsert(table, i, i);
383 for (i = 0; i < 256; i++) check_table(table, i, i);
384 for (i = 256; i >= 0; i--) check_table(table, i, i);
385 compute_dist(table);
386 drmHashDestroy(table);
387
388 printf("\n***** 1024 consecutive integers ****\n");
389 table = drmHashCreate();
390 for (i = 0; i < 1024; i++) drmHashInsert(table, i, i);
391 for (i = 0; i < 1024; i++) check_table(table, i, i);
392 for (i = 1024; i >= 0; i--) check_table(table, i, i);
393 compute_dist(table);
394 drmHashDestroy(table);
395
396 printf("\n***** 1024 consecutive page addresses (4k pages) ****\n");
397 table = drmHashCreate();
398 for (i = 0; i < 1024; i++) drmHashInsert(table, i*4096, i);
399 for (i = 0; i < 1024; i++) check_table(table, i*4096, i);
400 for (i = 1024; i >= 0; i--) check_table(table, i*4096, i);
401 compute_dist(table);
402 drmHashDestroy(table);
403
404 printf("\n***** 1024 random integers ****\n");
405 table = drmHashCreate();
406 srandom(0xbeefbeef);
407 for (i = 0; i < 1024; i++) drmHashInsert(table, random(), i);
408 srandom(0xbeefbeef);
409 for (i = 0; i < 1024; i++) check_table(table, random(), i);
410 srandom(0xbeefbeef);
411 for (i = 0; i < 1024; i++) check_table(table, random(), i);
412 compute_dist(table);
413 drmHashDestroy(table);
414
415 printf("\n***** 5000 random integers ****\n");
416 table = drmHashCreate();
417 srandom(0xbeefbeef);
418 for (i = 0; i < 5000; i++) drmHashInsert(table, random(), i);
419 srandom(0xbeefbeef);
420 for (i = 0; i < 5000; i++) check_table(table, random(), i);
421 srandom(0xbeefbeef);
422 for (i = 0; i < 5000; i++) check_table(table, random(), i);
423 compute_dist(table);
424 drmHashDestroy(table);
425
426 return 0;
427}
428#endif