Lines Matching full:hash
39 GLuint hash;
56 * Compute hash index from state key.
62 GLuint hash = 0, i;
66 /* Make a slightly better attempt at a hash function:
70 hash += ikey[i];
71 hash += (hash << 10);
72 hash ^= (hash >> 6);
75 return hash;
80 * Rebuild/expand the hash table to accommodate more entries
98 c->next = items[c->hash % size];
99 items[c->hash % size] = c;
184 const GLuint hash = hash_key(key, keysize);
187 for (c = cache->items[hash % cache->size]; c; c = c->next) {
188 if (c->hash == hash &&
208 const GLuint hash = hash_key(key, keysize);
211 c->hash = hash;
227 c->next = cache->items[hash % cache->size];
228 cache->items[hash % cache->size] = c;
237 const GLuint hash = hash_key(key, keysize);
240 c->hash = hash;
256 c->next = cache->items[hash % cache->size];
257 cache->items[hash % cache->size] = c;
