Lines Matching defs:hash
28 /* Always insert every fastHashFillStep position into the hash table.
29 * Insert the other positions if their hash entry is empty.
39 size_t const hash = ZSTD_hashPtr(ip + p, hBits, mls);
40 if (hashTable[hash] == 0) { /* not yet filled */
41 hashTable[hash] = curr + p;
50 * 1. Hash (map position to hash value via input read)
51 * 2. Lookup (map hash val to index via hashtable read)
122 size_t hash0; /* hash for ip0 */
123 size_t hash1; /* hash for ip1 */
172 /* write back hash table entry */
204 /* hash ip[2] */
213 /* write back hash table entry */
233 /* hash ip[2] */
290 /* write next hash table entry */
435 hashTable[h] = curr; /* update hash table */
592 hashTable[h] = curr; /* update hash table */