Searched refs:Buckets (Results 1 – 9 of 9) sorted by relevance
| /external/llvm/include/llvm/Support/ |
| D | OnDiskHashTable.h | 84 Bucket *Buckets; variable
88 void insert(Bucket *Buckets, size_t Size, Item *E) { in insert() argument
89 Bucket &B = Buckets[E->Hash & (Size - 1)]; in insert()
100 for (Item *E = Buckets[I].Head; E;) { in resize()
107 free(Buckets); in resize()
109 Buckets = NewBuckets; in resize()
129 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj)); in insert()
147 Bucket &B = Buckets[I]; in Emit()
180 LE.write<offset_type>(Buckets[I].Off); in Emit()
190 Buckets = (Bucket *)std::calloc(NumBuckets, sizeof(Bucket)); in OnDiskChainedHashTableGenerator()
[all …]
|
| D | GenericDomTreeConstruction.h | 186 SmallVector<unsigned, 32> Buckets; in Calculate() local
187 Buckets.resize(N + 1); in Calculate()
189 Buckets[i] = i; in Calculate()
197 for (unsigned j = i; Buckets[j] != i; j = Buckets[j]) { in Calculate()
198 typename GraphT::NodeType* V = DT.Vertex[Buckets[j]]; in Calculate()
225 Buckets[i] = Buckets[WInfo.Semi]; in Calculate()
226 Buckets[WInfo.Semi] = i; in Calculate()
232 for (unsigned j = 1; Buckets[j] != 1; j = Buckets[j]) { in Calculate()
233 typename GraphT::NodeType* V = DT.Vertex[Buckets[j]]; in Calculate()
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| D | DwarfAccelTable.cpp | 95 Buckets.resize(Header.bucket_count); in FinalizeTable()
98 Buckets[bucket].push_back(Data[i]); in FinalizeTable()
105 for (size_t i = 0; i < Buckets.size(); ++i) in FinalizeTable()
106 std::stable_sort(Buckets[i].begin(), Buckets[i].end(), in FinalizeTable()
143 for (size_t i = 0, e = Buckets.size(); i < e; ++i) { in EmitBuckets()
145 if (Buckets[i].size() != 0) in EmitBuckets()
152 for (auto *HD : Buckets[i]) { in EmitBuckets()
165 for (size_t i = 0, e = Buckets.size(); i < e; ++i) { in EmitHashes()
166 for (HashList::const_iterator HI = Buckets[i].begin(), in EmitHashes()
167 HE = Buckets[i].end(); in EmitHashes()
[all …]
|
| D | DwarfAccelTable.h | 242 BucketList Buckets; variable
|
| /external/llvm/lib/Support/ |
| D | FoldingSet.cpp | 209 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { in GetBucketFor() argument
212 return Buckets + BucketNum; in GetBucketFor()
217 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*))); in AllocateBuckets() local
219 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in AllocateBuckets()
220 return Buckets; in AllocateBuckets()
232 Buckets = AllocateBuckets(NumBuckets); in FoldingSetImpl()
236 free(Buckets); in ~FoldingSetImpl()
240 memset(Buckets, 0, NumBuckets*sizeof(void*)); in clear()
243 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in clear()
252 void **OldBuckets = Buckets; in GrowHashTable()
[all …]
|
| /external/llvm/lib/Target/PowerPC/ |
| D | PPCLoopPreIncPrep.cpp | 173 SmallVector<Bucket, 16> Buckets; in runOnLoop() local
215 for (unsigned i = 0, e = Buckets.size(); i != e; ++i) in runOnLoop()
216 for (Bucket::iterator K = Buckets[i].begin(), KE = Buckets[i].end(); in runOnLoop()
220 Buckets[i].insert(std::make_pair(LSCEV, MemI)); in runOnLoop()
227 Buckets.push_back(Bucket(SCEVLess(SE))); in runOnLoop()
228 Buckets[Buckets.size()-1].insert(std::make_pair(LSCEV, MemI)); in runOnLoop()
233 if (Buckets.empty() || Buckets.size() > MaxVars) in runOnLoop()
249 DEBUG(dbgs() << "PIP: Found " << Buckets.size() << " buckets\n"); in runOnLoop()
252 for (unsigned i = 0, e = Buckets.size(); i != e; ++i) { in runOnLoop()
257 cast<SCEVAddRecExpr>(Buckets[i].begin()->first); in runOnLoop()
[all …]
|
| /external/llvm/include/llvm/ADT/ |
| D | FoldingSet.h | 115 void **Buckets;
424 iterator begin() { return iterator(Buckets); } in begin()
425 iterator end() { return iterator(Buckets+NumBuckets); } in end()
428 const_iterator begin() const { return const_iterator(Buckets); } in begin()
429 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } in end()
434 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); in bucket_begin()
438 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); in bucket_end()
503 iterator begin() { return iterator(Buckets); } in begin()
504 iterator end() { return iterator(Buckets+NumBuckets); } in end()
507 const_iterator begin() const { return const_iterator(Buckets); } in begin()
[all …]
|
| D | DenseMap.h | 557 BucketT *Buckets; variable
585 operator delete(Buckets); in ~DenseMap()
591 std::swap(Buckets, RHS.Buckets); in swap()
605 operator delete(Buckets);
613 operator delete(Buckets); in copyFrom()
633 BucketT *OldBuckets = Buckets; in grow()
636 assert(Buckets); in grow()
661 operator delete(Buckets); in shrink_and_clear()
681 return Buckets; in getBuckets()
691 Buckets = nullptr; in allocateBuckets()
[all …]
|
| /external/clang/test/SemaCXX/ |
| D | 2008-01-11-BadWarning.cpp | 4 void** f(void **Buckets, unsigned NumBuckets) { in f() argument
5 return Buckets + NumBuckets; in f()
|