dist/libdrm/xf86drmHash.c

105     unsigned long     key;
124 extern int  drmHashLookup(void *t, unsigned long key, unsigned long *value);
125 extern int  drmHashInsert(void *t, unsigned long key, unsigned long value);
126 extern int  drmHashDelete(void *t, unsigned long key);
129 static unsigned long HashHash(unsigned long key)
132     unsigned long        tmp  = key;
152     printf( "Hash(%d) = %d\n", key, hash);
198 			      unsigned long key, unsigned long *h)
200     unsigned long hash = HashHash(key);
207 	if (bucket->key == key) {
225 int drmHashLookup(void *t, unsigned long key, void **value)
232     bucket = HashFind(table, key, NULL);
238 int drmHashInsert(void *t, unsigned long key, void *value)
246     if (HashFind(table, key, &hash)) return 1; /* Already in table */
250     bucket->key          = key;
255     printf("Inserted %d at %d/%p\n", key, hash, bucket);
260 int drmHashDelete(void *t, unsigned long key)
268     bucket = HashFind(table, key, &hash);
277 int drmHashNext(void *t, unsigned long *key, void **value)
283 	    *key       = table->p1->key;
294 int drmHashFirst(void *t, unsigned long *key, void **value)
302     return drmHashNext(table, key, value);
348 			unsigned long key, unsigned long value)
351     int           retcode = drmHashLookup(table, key, &retval);
356 	       " key = %lu, expected = %lu, returned = %lu\n",
357 	       table->magic, key, value, retval);
360 	printf("Not found: key = %lu, expected = %lu returned = %lu\n",
361 	       key, value, retval);
365 	    printf("Bad value: key = %lu, expected = %lu, returned = %lu\n",
366 		   key, value, retval);
369 	printf("Bad retcode = %d: key = %lu, expected = %lu, returned = %lu\n",
370 	       retcode, key, value, retval);