Lines Matching refs:hash
1 /* xf86drmHash.c -- Small hash table support for integer -> integer mapping
31 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
40 * 2) The hash computation uses a table of random integers [Hanson97,
48 * dynamic hash tables was postponed until the need arises. A common (and
49 * naive) approach to dynamic hash table implementation simply creates a
50 * new hash table when necessary, rehashes all the data into the new table,
82 unsigned long hash = 0;
97 hash = (hash << 1) + scatter[tmp & 0xff];
101 hash %= HASH_SIZE;
102 return hash;
142 unsigned long hash = HashHash(key);
146 if (h) *h = hash;
148 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) {
153 bucket->next = table->buckets[hash];
154 table->buckets[hash] = bucket;
184 unsigned long hash;
188 if (HashFind(table, key, &hash)) return 1; /* Already in table */
194 bucket->next = table->buckets[hash];
195 table->buckets[hash] = bucket;
202 unsigned long hash;
207 bucket = HashFind(table, key, &hash);
211 table->buckets[hash] = bucket->next;