/freebsd-10.2-release/contrib/llvm/include/llvm/Support/ |
H A D | ArrayRecycler.h | 39 SmallVector<FreeList*, 8> Bucket; member in class:llvm::ArrayRecycler 41 // Remove an entry from the free list in Bucket[Idx] and return it. 44 if (Idx >= Bucket.size()) 46 FreeList *Entry = Bucket[Idx]; 49 Bucket[Idx] = Entry->Next; 53 // Add an entry to the free list at Bucket[Idx]. 59 if (Idx >= Bucket.size()) 60 Bucket.resize(size_t(Idx) + 1); 61 Entry->Next = Bucket[Idx]; 62 Bucket[Id [all...] |
/freebsd-10.2-release/contrib/llvm/lib/Support/ |
H A D | FoldingSet.cpp | 285 void **Bucket = GetBucketFor(IDHash, Buckets, NumBuckets); local 286 void *Probe = *Bucket; 300 InsertPos = Bucket; 319 void **Bucket = static_cast<void**>(InsertPos); local 321 void *Next = *Bucket; 327 Next = reinterpret_cast<void*>(reinterpret_cast<intptr_t>(Bucket)|1); 331 *Bucket = N; 361 void **Bucket = GetBucketPtr(Ptr); local 362 Ptr = *Bucket; 367 *Bucket 390 FoldingSetIteratorImpl(void **Bucket) argument 407 void **Bucket = GetBucketPtr(Probe); local 422 FoldingSetBucketIteratorImpl(void **Bucket) argument [all...] |
H A D | SmallPtrSet.cpp | 63 const void **Bucket = const_cast<const void**>(FindBucketFor(Ptr)); 64 if (*Bucket == Ptr) return false; // Already inserted, good. 67 if (*Bucket == getTombstoneMarker()) 69 *Bucket = Ptr; 91 void **Bucket = const_cast<void**>(FindBucketFor(Ptr)); 92 if (*Bucket != Ptr) return false; // Not in the set? 95 *Bucket = getTombstoneMarker(); 102 unsigned Bucket = DenseMapInfo<void *>::getHashValue(Ptr) & (CurArraySize-1); 109 if (Array[Bucket] == Ptr) 110 return Array+Bucket; [all...] |
H A D | StringMap.cpp | 168 int Bucket = FindKey(Key); local 169 if (Bucket == -1) return 0; 171 StringMapEntryBase *Result = TheTable[Bucket]; 172 TheTable[Bucket] = getTombstoneVal(); 210 StringMapEntryBase *Bucket = TheTable[I]; local 211 if (Bucket && Bucket != getTombstoneVal()) { 216 NewTableArray[FullHash & (NewSize-1)] = Bucket; 228 NewTableArray[NewBucket] = Bucket;
|
/freebsd-10.2-release/contrib/llvm/include/llvm/ADT/ |
H A D | StringMap.h | 152 // Okay, the item doesn't already exist, and 'Bucket' is the bucket to fill 292 int Bucket = FindKey(Key); local 293 if (Bucket == -1) return end(); 294 return iterator(TheTable+Bucket, true); 298 int Bucket = FindKey(Key); local 299 if (Bucket == -1) return end(); 300 return const_iterator(TheTable+Bucket, true); 325 StringMapEntryBase *&Bucket = TheTable[BucketNo]; local 326 if (Bucket && Bucket ! 346 StringMapEntryBase *&Bucket = TheTable[I]; local 363 StringMapEntryBase *&Bucket = TheTable[BucketNo]; local 422 StringMapConstIterator(StringMapEntryBase **Bucket, bool NoAdvance = false) argument 462 StringMapIterator(StringMapEntryBase **Bucket, bool NoAdvance = false) argument [all...] |
H A D | SmallPtrSet.h | 144 const void *const *Bucket; member in class:llvm::SmallPtrSetIteratorImpl 148 : Bucket(BP), End(E) { 153 return Bucket == RHS.Bucket; 156 return Bucket != RHS.Bucket; 164 assert(Bucket <= End); 165 while (Bucket != End && 166 (*Bucket == SmallPtrSetImpl::getEmptyMarker() || 167 *Bucket [all...] |
H A D | FoldingSet.h | 641 FoldingSetIteratorImpl(void **Bucket); 657 explicit FoldingSetIterator(void **Bucket) : FoldingSetIteratorImpl(Bucket) {} argument 685 explicit FoldingSetBucketIteratorImpl(void **Bucket); 687 FoldingSetBucketIteratorImpl(void **Bucket, bool) argument 688 : Ptr(Bucket) {} 709 explicit FoldingSetBucketIterator(void **Bucket) : argument 710 FoldingSetBucketIteratorImpl(Bucket) {} 712 FoldingSetBucketIterator(void **Bucket, bool) : argument 713 FoldingSetBucketIteratorImpl(Bucket, tru [all...] |
H A D | DenseMap.h | 988 typedef std::pair<KeyT, ValueT> Bucket; typedef in class:llvm::DenseMapIterator 994 typedef typename conditional<IsConst, const Bucket, Bucket>::type value_type;
|
/freebsd-10.2-release/contrib/llvm/tools/clang/include/clang/Basic/ |
H A D | OnDiskHashTable.h | 132 class Bucket { class in class:clang::OnDiskChainedHashTableGenerator 138 Bucket() {} function in class:clang::OnDiskChainedHashTableGenerator::Bucket 141 Bucket* Buckets; 144 void insert(Bucket* b, size_t size, Item* E) { 146 Bucket& B = b[idx]; 153 Bucket* newBuckets = (Bucket*) std::calloc(newsize, sizeof(Bucket)); 195 Bucket& B = Buckets[i]; 204 assert(B.length != 0 && "Bucket ha 295 const unsigned char* Bucket = Buckets + sizeof(uint32_t)*idx; local [all...] |
/freebsd-10.2-release/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/java_api/src/ |
H A D | TestBean.java | 206 List < Distribution.Bucket > buckets = 207 new ArrayList < Distribution.Bucket > (); 208 Distribution.Bucket bucket; 220 bucket = new Distribution.Bucket(-1, -1, n++); 222 bucket = new Distribution.Bucket(0, 0, n++); 224 bucket = new Distribution.Bucket(1, 1, n++); 238 bucket = new Distribution.Bucket(lowerBound, upperBound, n++); 248 List < Distribution.Bucket > buckets = 249 new ArrayList < Distribution.Bucket > (); 250 Distribution.Bucket bucke [all...] |
/freebsd-10.2-release/contrib/llvm/tools/clang/lib/Lex/ |
H A D | HeaderMap.cpp | 213 for (unsigned Bucket = HashHMapKey(Filename);; ++Bucket) { 214 HMapBucket B = getBucket(Bucket & (NumBuckets-1));
|
/freebsd-10.2-release/cddl/contrib/opensolaris/cmd/dtrace/test/cmd/jdtrace/ |
H A D | JDTrace.java | 303 Distribution.Bucket bucket;
|