Lines Matching defs:key
109 unsigned long key;
127 HashHash(unsigned long key)
130 unsigned long tmp = key;
151 printf("Hash(%d) = %d\n", key, hash);
201 HashFind(__glxHashTablePtr table, unsigned long key, unsigned long *h)
203 unsigned long hash = HashHash(key);
211 if (bucket->key == key) {
231 __glxHashLookup(__glxHashTable * t, unsigned long key, void **value)
239 bucket = HashFind(table, key, NULL);
247 __glxHashInsert(__glxHashTable * t, unsigned long key, void *value)
256 if (HashFind(table, key, &hash))
262 bucket->key = key;
267 printf("Inserted %d at %d/%p\n", key, hash, bucket);
273 __glxHashDelete(__glxHashTable * t, unsigned long key)
282 bucket = HashFind(table, key, &hash);
293 __glxHashNext(__glxHashTable * t, unsigned long *key, void **value)
299 *key = table->p1->key;
311 __glxHashFirst(__glxHashTable * t, unsigned long *key, void **value)
320 return __glxHashNext(table, key, value);
377 check_table(__glxHashTablePtr table, unsigned long key, unsigned long value)
380 int retcode = __glxHashLookup(table, key, &retval);
385 " key = %lu, expected = %lu, returned = %lu\n",
386 table->magic, key, value, retval);
389 printf("Not found: key = %lu, expected = %lu returned = %lu\n",
390 key, value, retval);
394 printf("Bad value: key = %lu, expected = %lu, returned = %lu\n",
395 key, value, retval);
398 printf("Bad retcode = %d: key = %lu, expected = %lu, returned = %lu\n",
399 retcode, key, value, retval);