Lines Matching defs:hash
263 uint32_t hash = 0;
266 /* compute a hash from the variable length name */
268 hash += (uint32_t)name[i] << shift;
269 hash *= hash;
270 hash = (hash >> (16-cache->tableSize/2)) & mask;
273 for (i = 0; i < size; ++i, hash = (hash+1) & mask) {
275 if (cache->info[hash].name == NULL)
277 else if (!strcmp(name, cache->info[hash].name))
280 /* this assertion fails if the hash table is full */
283 return hash;
320 /* Make the hash table big enough to fit more than the maximum number of