Lines Matching full:bucket
49 // Okay, we know we have space. Find a hash bucket.
50 const void **Bucket = const_cast<const void**>(FindBucketFor(Ptr));
51 if (*Bucket == Ptr)
52 return std::make_pair(Bucket, false); // Already inserted, good.
55 if (*Bucket == getTombstoneMarker())
59 *Bucket = Ptr;
60 return std::make_pair(Bucket, true);
78 // Okay, we know we have space. Find a hash bucket.
79 void **Bucket = const_cast<void**>(FindBucketFor(Ptr));
80 if (*Bucket != Ptr) return false; // Not in the set?
83 *Bucket = getTombstoneMarker();
89 unsigned Bucket = DenseMapInfo<void *>::getHashValue(Ptr) & (CurArraySize-1);
95 // If we found an empty bucket, the pointer doesn't exist in the set.
96 // Return a tombstone if we've seen one so far, or the empty bucket if
98 if (LLVM_LIKELY(Array[Bucket] == getEmptyMarker()))
99 return Tombstone ? Tombstone : Array+Bucket;
101 // Found Ptr's bucket?
102 if (LLVM_LIKELY(Array[Bucket] == Ptr))
103 return Array+Bucket;
107 if (Array[Bucket] == getTombstoneMarker() && !Tombstone)
108 Tombstone = Array+Bucket; // Remember the first tombstone found.
111 Bucket = (Bucket + ProbeAmt++) & (ArraySize-1);
