Lines Matching full:hash
106 /* Tail of hash chains */
165 * Update a hash value with the given input byte
167 * input characters, so that a running hash key can be computed from the
175 * of the hash chain (the most recent string with same hash key). Return
176 * the previous length of the hash chain.
178 * to 1, and no hash chains are maintained.
196 * Initialize the hash table (avoiding 64K overflow for 16 bit systems).
343 /* Insert all strings in the hash table (except for the last two bytes).
1019 * IN assertions: cur_match is the head of the hash chain for the current
1031 unsigned chain_length = s->max_chain_length;/* max hash chain length */
1094 * always equal when the other bytes match, given that the hash keys
1130 * the hash keys are equal and that HASH_BITS >= 8.
1203 * the hash keys are equal and that HASH_BITS >= 8.
1300 /* Slide the hash table (could be avoided with 32 bit values
1302 to keep the hash table consistent if we switch back to level > 0
1320 /* If n is not on any hash chain, prev[n] is garbage but
1345 /* Initialize the hash value now that we have some input: */
1452 IPos hash_head = NIL; /* head of the hash chain */
1470 * dictionary, and set hash_head to the head of the hash chain:
1506 /* Insert new strings in the hash table only if the match length
1558 IPos hash_head = NIL; /* head of hash chain */
1577 * dictionary, and set hash_head to the head of the hash chain:
1619 /* Do not insert strings in hash table beyond this. */
1626 /* Insert in hash table all strings up to the end of the match.
1629 * the hash table.
1680 * one. Do not maintain a hash table. (It will be regenerated if this run of
