HomeSort by relevance Sort by last modified time
    Searched refs:NewBucket (Results 1 - 4 of 4) sorted by null

  /external/llvm/lib/Support/
StringMap.cpp 230 unsigned NewBucket = FullHash & (NewSize-1);
231 if (!NewTableArray[NewBucket]) {
235 NewBucketNo = NewBucket;
242 NewBucket = (NewBucket + ProbeSize++) & (NewSize-1);
243 } while (NewTableArray[NewBucket]);
246 NewTableArray[NewBucket] = Bucket;
247 NewHashArray[NewBucket] = FullHash;
249 NewBucketNo = NewBucket;
  /external/swiftshader/third_party/llvm-subzero/lib/Support/
StringMap.cpp 228 unsigned NewBucket = FullHash & (NewSize-1);
229 if (!NewTableArray[NewBucket]) {
233 NewBucketNo = NewBucket;
240 NewBucket = (NewBucket + ProbeSize++) & (NewSize-1);
241 } while (NewTableArray[NewBucket]);
244 NewTableArray[NewBucket] = Bucket;
245 NewHashArray[NewBucket] = FullHash;
247 NewBucketNo = NewBucket;
  /external/swiftshader/third_party/LLVM/lib/Support/
StringMap.cpp 206 unsigned NewBucket = FullHash & (NewSize-1);
207 if (NewTableArray[NewBucket].Item == 0) {
216 NewBucket = (NewBucket + ProbeSize++) & (NewSize-1);
217 } while (NewTableArray[NewBucket].Item);
220 NewTableArray[NewBucket].Item = IB->Item;
221 NewTableArray[NewBucket].FullHashValue = FullHash;
  /external/clang/lib/ASTMatchers/
ASTMatchFinder.cpp 494 /// \brief Start timing for \p NewBucket.
498 /// \p NewBucket will be timed until the next call to \c setBucket() or
500 /// If \p NewBucket is the same as the currently timed bucket, this call
502 void setBucket(llvm::TimeRecord *NewBucket) {
503 if (Bucket != NewBucket) {
507 if (NewBucket)
508 *NewBucket -= Now;
509 Bucket = NewBucket;
    [all...]

Completed in 88 milliseconds