Lines Matching refs:hash
82 /* log base 2 of the number of entries in the hash table for match-finding. */
85 /* Constant for the multiplicative hash function. */
104 u32 hash;
114 hash = str * HASH_MULTIPLIER;
117 return hash >> (32 - HASH_SHIFT);
123 * A hash table, each entry of which points to a chain of sequence
124 * positions sharing the corresponding hash code, is maintained to speed up
125 * searching for matches. To maintain the hash table, either
159 unsigned int hash;
167 /* Insert the current sequence into the appropriate hash chain. */
168 hash = ntfs_hash(strptr);
169 cur_match = pctx->head[hash];
171 pctx->head[hash] = i;
179 /* Search the appropriate hash chain for matches. */
250 unsigned int hash;
255 /* Insert the current sequence into the appropriate hash chain. */
256 hash = ntfs_hash(pctx->inbuf + i);
257 pctx->prev[i] = pctx->head[hash];
258 pctx->head[hash] = i;
300 /* All hash chains start as empty. The special value '-1' indicates the
301 * end of each hash chain. */