Searched defs:Buckets (Results 1 - 20 of 20) sorted by relevance

/external/clang/test/SemaCXX/
H A D2008-01-11-BadWarning.cpp4 void** f(void **Buckets, unsigned NumBuckets) { argument
5 return Buckets + NumBuckets;
/external/clang/unittests/Lex/
H A DHeaderMapTest.cpp27 HMapBucket Buckets[NumBuckets]; member in struct:__anon3388::MapFile
35 Header.StringsOffset = sizeof(Header) + sizeof(Buckets);
79 if (!File.Buckets[I].Key) {
80 File.Buckets[I].Key = Key;
81 File.Buckets[I].Prefix = Prefix;
82 File.Buckets[I].Suffix = Suffix;
139 ASSERT_EQ(3 * sizeof(HMapBucket), sizeof(File.Buckets));
/external/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h180 // Instead of using a bucket per vertex, we use a single array Buckets that
182 // Buckets[i] stores the index of the first element in V's bucket. After V's
183 // bucket is processed, Buckets[i] stores the index of the next element in the
185 SmallVector<unsigned, 32> Buckets; local
186 Buckets.resize(N + 1);
188 Buckets[i] = i;
196 for (unsigned j = i; Buckets[j] != i; j = Buckets[j]) {
197 typename GraphT::NodeType* V = DT.Vertex[Buckets[j]];
224 Buckets[
[all...]
H A DOnDiskHashTable.h86 Bucket *Buckets; member in class:llvm::OnDiskChainedHashTableGenerator
90 void insert(Bucket *Buckets, size_t Size, Item *E) { argument
91 Bucket &B = Buckets[E->Hash & (Size - 1)];
102 for (Item *E = Buckets[I].Head; E;) {
109 free(Buckets);
111 Buckets = NewBuckets;
130 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj));
136 for (Item *I = Buckets[Hash & (NumBuckets - 1)].Head; I; I = I->Next)
173 Bucket &B = Buckets[I];
220 LE.write<offset_type>(Buckets[
277 const unsigned char *const Buckets; member in class:llvm::OnDiskChainedHashTable
289 OnDiskChainedHashTable(offset_type NumBuckets, offset_type NumEntries, const unsigned char *Buckets, const unsigned char *Base, const Info &InfoObj = Info()) argument
303 readNumBucketsAndEntries(const unsigned char *&Buckets) argument
416 Create(const unsigned char *Buckets, const unsigned char *const Base, const Info &InfoObj = Info()) argument
492 OnDiskIterableChainedHashTable(offset_type NumBuckets, offset_type NumEntries, const unsigned char *Buckets, const unsigned char *Payload, const unsigned char *Base, const Info &InfoObj = Info()) argument
603 Create(const unsigned char *Buckets, const unsigned char *const Payload, const unsigned char *const Base, const Info &InfoObj = Info()) argument
[all...]
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
H A DDominatorInternals.h181 // Instead of using a bucket per vertex, we use a single array Buckets that
183 // Buckets[i] stores the index of the first element in V's bucket. After V's
184 // bucket is processed, Buckets[i] stores the index of the next element in the
186 SmallVector<unsigned, 32> Buckets; local
187 Buckets.resize(N + 1);
189 Buckets[i] = i;
197 for (unsigned j = i; Buckets[j] != i; j = Buckets[j]) {
198 typename GraphT::NodeType* V = DT.Vertex[Buckets[j]];
225 Buckets[
[all...]
/external/brotli/enc/
H A Dhash_longest_match64_inc.h50 /* Buckets containing block_size_ of backward references. */
62 static BROTLI_INLINE uint32_t* FN(Buckets)(HashLongestMatch* self) { function
117 FN(Buckets)(self)[offset] = (uint32_t)ix;
169 uint32_t* buckets = FN(Buckets)(self);
H A Dhash_longest_match_inc.h46 /* Buckets containing block_size_ of backward references. */
58 static BROTLI_INLINE uint32_t* FN(Buckets)(HashLongestMatch* self) { function
110 FN(Buckets)(self)[offset] = (uint32_t)ix;
162 uint32_t* buckets = FN(Buckets)(self);
/external/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfAccelTable.h238 // Buckets/Hashes/Offsets
241 BucketList Buckets; member in class:llvm::DwarfAccelTable
/external/llvm/lib/Support/
H A DFoldingSet.cpp209 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { argument
212 return Buckets + BucketNum;
217 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*))); local
219 Buckets[NumBuckets] = reinterpret_cast<void*>(-1);
220 return Buckets;
232 Buckets = AllocateBuckets(NumBuckets);
237 : Buckets(Arg.Buckets), NumBuckets(Arg.NumBuckets), NumNodes(Arg.NumNodes) {
238 Arg.Buckets = nullptr;
244 free(Buckets); // Thi
[all...]
/external/llvm/lib/Target/PowerPC/
H A DPPCLoopPreIncPrep.cpp183 SmallVector<Bucket, 16> Buckets; local
225 for (auto &B : Buckets) {
235 if (Buckets.size() == MaxVars)
237 Buckets.push_back(Bucket(LSCEV, MemI));
242 if (Buckets.empty())
258 DEBUG(dbgs() << "PIP: Found " << Buckets.size() << " buckets\n");
261 for (unsigned i = 0, e = Buckets.size(); i != e; ++i) {
274 for (int j = 0, je = Buckets[i].Elements.size(); j != je; ++j) {
275 if (auto *II = dyn_cast<IntrinsicInst>(Buckets[i].Elements[j].Instr))
285 if (!Buckets[
[all...]
/external/swiftshader/third_party/LLVM/lib/Support/
H A DFoldingSet.cpp208 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { argument
211 return Buckets + BucketNum;
216 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*))); local
218 Buckets[NumBuckets] = reinterpret_cast<void*>(-1);
219 return Buckets;
229 Buckets = AllocateBuckets(NumBuckets);
233 free(Buckets);
237 memset(Buckets, 0, NumBuckets*sizeof(void*));
240 Buckets[NumBuckets] = reinterpret_cast<void*>(-1);
249 void **OldBuckets = Buckets;
[all...]
/external/swiftshader/third_party/llvm-subzero/lib/Support/
H A DFoldingSet.cpp209 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { argument
212 return Buckets + BucketNum;
217 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*))); local
219 Buckets[NumBuckets] = reinterpret_cast<void*>(-1);
220 return Buckets;
232 Buckets = AllocateBuckets(NumBuckets);
237 : Buckets(Arg.Buckets), NumBuckets(Arg.NumBuckets), NumNodes(Arg.NumNodes) {
238 Arg.Buckets = nullptr;
244 free(Buckets); // Thi
[all...]
/external/clang/lib/Serialization/
H A DMultiOnDiskHashTable.h53 storage_type Buckets, storage_type Payload, storage_type Base,
56 Table(NumBuckets, NumEntries, Buckets, Payload, Base, InfoObj) {}
200 storage_type Buckets = Data + BucketOffset; local
202 OnDiskTable::HashTable::readNumBucketsAndEntries(Buckets);
207 Buckets, Ptr, Data, std::move(InfoObj));
52 OnDiskTable(file_type File, unsigned NumBuckets, unsigned NumEntries, storage_type Buckets, storage_type Payload, storage_type Base, const Info &InfoObj) argument
/external/llvm/include/llvm/ADT/
H A DFoldingSet.h112 /// Buckets - Array of bucket chains.
114 void **Buckets; member in class:llvm::FoldingSetImpl
116 /// NumBuckets - Length of the Buckets array. Always a power of 2.
446 iterator begin() { return iterator(Buckets); }
447 iterator end() { return iterator(Buckets+NumBuckets); }
450 const_iterator begin() const { return const_iterator(Buckets); }
451 const_iterator end() const { return const_iterator(Buckets+NumBuckets); }
456 return bucket_iterator(Buckets + (hash & (NumBuckets-1)));
460 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true);
524 iterator begin() { return iterator(Buckets); }
[all...]
H A DDenseMap.h592 BucketT *Buckets; member in class:llvm::DenseMap
620 operator delete(Buckets);
626 std::swap(Buckets, RHS.Buckets);
640 operator delete(Buckets);
648 operator delete(Buckets);
669 BucketT *OldBuckets = Buckets;
672 assert(Buckets);
697 operator delete(Buckets);
717 return Buckets;
753 BucketT *Buckets; member in struct:llvm::SmallDenseMap::LargeRep
[all...]
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
H A DDenseMap.h42 BucketT *Buckets; member in class:llvm::DenseMap
68 for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) {
76 memset((void*)Buckets, 0x5a, sizeof(BucketT)*NumBuckets);
78 operator delete(Buckets);
86 return empty() ? end() : iterator(Buckets, Buckets+NumBuckets);
89 return iterator(Buckets+NumBuckets, Buckets+NumBuckets);
92 return empty() ? end() : const_iterator(Buckets, Bucket
[all...]
H A DFoldingSet.h113 /// Buckets - Array of bucket chains.
115 void **Buckets; member in class:llvm::FoldingSetImpl
117 /// NumBuckets - Length of the Buckets array. Always a power of 2.
409 iterator begin() { return iterator(Buckets); }
410 iterator end() { return iterator(Buckets+NumBuckets); }
413 const_iterator begin() const { return const_iterator(Buckets); }
414 const_iterator end() const { return const_iterator(Buckets+NumBuckets); }
419 return bucket_iterator(Buckets + (hash & (NumBuckets-1)));
423 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true);
488 iterator begin() { return iterator(Buckets); }
[all...]
/external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
H A DFoldingSet.h117 /// Buckets - Array of bucket chains.
119 void **Buckets; member in class:llvm::FoldingSetImpl
121 /// NumBuckets - Length of the Buckets array. Always a power of 2.
454 iterator begin() { return iterator(Buckets); }
455 iterator end() { return iterator(Buckets+NumBuckets); }
458 const_iterator begin() const { return const_iterator(Buckets); }
459 const_iterator end() const { return const_iterator(Buckets+NumBuckets); }
464 return bucket_iterator(Buckets + (hash & (NumBuckets-1)));
468 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true);
534 iterator begin() { return iterator(Buckets); }
[all...]
H A DDenseMap.h590 BucketT *Buckets; member in class:llvm::DenseMap
618 operator delete(Buckets);
624 std::swap(Buckets, RHS.Buckets);
638 operator delete(Buckets);
646 operator delete(Buckets);
667 BucketT *OldBuckets = Buckets;
670 assert(Buckets);
695 operator delete(Buckets);
715 return Buckets;
753 BucketT *Buckets; member in struct:llvm::SmallDenseMap::LargeRep
[all...]
/external/llvm/tools/llvm-readobj/
H A DELFDumper.cpp1813 W.printNumber("Num Buckets", HashTable->nbucket);
1815 W.printList("Buckets", HashTable->buckets());
1824 W.printNumber("Num Buckets", GnuHashTable->nbuckets);
1829 W.printList("Buckets", GnuHashTable->buckets());
3072 ArrayRef<Elf_Word> Buckets = HashTable->buckets(); local
3086 for (size_t C = Buckets[B]; C > 0 && C < NChain; C = Chains[C])
3115 ArrayRef<Elf_Word> Buckets = GnuHashTable->buckets(); local
3131 if (!Buckets[B])
3134 for (size_t C = Buckets[B] - Symndx;

Completed in 676 milliseconds