Searched refs:Buckets (Results 1 – 9 of 9) sorted by relevance
/external/llvm/include/llvm/Support/ |
D | OnDiskHashTable.h | 87 Bucket *Buckets; variable 91 void insert(Bucket *Buckets, size_t Size, Item *E) { in insert() argument 92 Bucket &B = Buckets[E->Hash & (Size - 1)]; in insert() 103 for (Item *E = Buckets[I].Head; E;) { in resize() 110 free(Buckets); in resize() 112 Buckets = NewBuckets; in resize() 132 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj)); in insert() 150 Bucket &B = Buckets[I]; in Emit() 183 LE.write<offset_type>(Buckets[I].Off); in Emit() 193 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 | 93 Buckets.resize(Header.bucket_count); in FinalizeTable() 96 Buckets[bucket].push_back(Data[i]); in FinalizeTable() 132 for (size_t i = 0, e = Buckets.size(); i < e; ++i) { in EmitBuckets() 134 if (Buckets[i].size() != 0) in EmitBuckets() 138 index += Buckets[i].size(); in EmitBuckets() 145 for (size_t i = 0, e = Buckets.size(); i < e; ++i) { in EmitHashes() 146 for (HashList::const_iterator HI = Buckets[i].begin(), in EmitHashes() 147 HE = Buckets[i].end(); in EmitHashes() 160 for (size_t i = 0, e = Buckets.size(); i < e; ++i) { in EmitOffsets() 161 for (HashList::const_iterator HI = Buckets[i].begin(), in EmitOffsets() [all …]
|
D | DwarfAccelTable.h | 242 BucketList Buckets; variable
|
/external/llvm/lib/Support/ |
D | FoldingSet.cpp | 208 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { in GetBucketFor() argument 211 return Buckets + BucketNum; in GetBucketFor() 216 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*))); in AllocateBuckets() local 218 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in AllocateBuckets() 219 return Buckets; in AllocateBuckets() 229 Buckets = AllocateBuckets(NumBuckets); in FoldingSetImpl() 233 free(Buckets); in ~FoldingSetImpl() 237 memset(Buckets, 0, NumBuckets*sizeof(void*)); in clear() 240 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in clear() 249 void **OldBuckets = Buckets; in GrowHashTable() [all …]
|
/external/llvm/include/llvm/ADT/ |
D | FoldingSet.h | 115 void **Buckets; 423 iterator begin() { return iterator(Buckets); } in begin() 424 iterator end() { return iterator(Buckets+NumBuckets); } in end() 427 const_iterator begin() const { return const_iterator(Buckets); } in begin() 428 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } in end() 433 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); in bucket_begin() 437 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); in bucket_end() 502 iterator begin() { return iterator(Buckets); } in begin() 503 iterator end() { return iterator(Buckets+NumBuckets); } in end() 506 const_iterator begin() const { return const_iterator(Buckets); } in begin() [all …]
|
D | DenseMap.h | 538 BucketT *Buckets; variable 566 operator delete(Buckets); in ~DenseMap() 570 std::swap(Buckets, RHS.Buckets); in swap() 583 operator delete(Buckets); 591 operator delete(Buckets); in copyFrom() 611 BucketT *OldBuckets = Buckets; in grow() 614 assert(Buckets); in grow() 639 operator delete(Buckets); in shrink_and_clear() 659 return Buckets; in getBuckets() 669 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()
|
/external/chromium_org/gpu/command_buffer/docs/ |
D | gles2_cmd_format_docs.txt | 29 //! A 3rd way of passing data is through Buckets. Buckets are identified by
|