Lines Matching refs:hash
10 // This file defines a hash set that can be used to remove duplication of nodes
34 /// This class is implemented as a single-link chained hash table, where the
106 /// structure is an array of buckets. Each bucket is indexed by the hash of
185 /// GrowHashTable - Double the size of the hash table and rehash everything.
199 /// this function to compute a hash value for the given node.
225 // ComputeHash - Compute a hash value for X, using TempID to
227 // just calls Profile and does a regular hash computation.
275 /// ComputeHash - Compute a strong hash value for this FoldingSetNodeIDRef,
292 /// hash value for the node.
325 /// ComputeHash - Compute a strong hash value for this FoldingSetNodeID, used
406 /// hash value directly from a node.
427 bucket_iterator bucket_begin(unsigned hash) {
428 return bucket_iterator(Buckets + (hash & (NumBuckets-1)));
431 bucket_iterator bucket_end(unsigned hash) {
432 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true);
507 bucket_iterator bucket_begin(unsigned hash) {
508 return bucket_iterator(Buckets + (hash & (NumBuckets-1)));
511 bucket_iterator bucket_end(unsigned hash) {
512 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true);
637 /// folding sets, which knows how to walk the folding set hash table.
679 /// of a folding set hash table.