Searched defs:Buckets (Results 1 - 7 of 7) 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/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.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...]
H A DOnDiskHashTable.h87 Bucket *Buckets; member in class:llvm::OnDiskChainedHashTableGenerator
91 void insert(Bucket *Buckets, size_t Size, Item *E) { argument
92 Bucket &B = Buckets[E->Hash & (Size - 1)];
103 for (Item *E = Buckets[I].Head; E;) {
110 free(Buckets);
112 Buckets = NewBuckets;
132 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj));
150 Bucket &B = Buckets[I];
183 LE.write<offset_type>(Buckets[I].Off);
193 Buckets
240 const unsigned char *const Buckets; member in class:llvm::OnDiskChainedHashTable
251 OnDiskChainedHashTable(offset_type NumBuckets, offset_type NumEntries, const unsigned char *Buckets, const unsigned char *Base, const Info &InfoObj = Info()) argument
353 Create(const unsigned char *Buckets, const unsigned char *const Base, const Info &InfoObj = Info()) argument
385 OnDiskIterableChainedHashTable(offset_type NumBuckets, offset_type NumEntries, const unsigned char *Buckets, const unsigned char *Payload, const unsigned char *Base, const Info &InfoObj = Info()) argument
553 Create(const unsigned char *Buckets, const unsigned char *const Payload, const unsigned char *const Base, const Info &InfoObj = Info()) argument
[all...]
/external/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfAccelTable.h239 // Buckets/Hashes/Offsets
242 BucketList Buckets; member in class:llvm::DwarfAccelTable
/external/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/llvm/include/llvm/ADT/
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.
423 iterator begin() { return iterator(Buckets); }
424 iterator end() { return iterator(Buckets+NumBuckets); }
427 const_iterator begin() const { return const_iterator(Buckets); }
428 const_iterator end() const { return const_iterator(Buckets+NumBuckets); }
433 return bucket_iterator(Buckets + (hash & (NumBuckets-1)));
437 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true);
502 iterator begin() { return iterator(Buckets); }
[all...]
H A DDenseMap.h538 BucketT *Buckets; member in class:llvm::DenseMap
566 operator delete(Buckets);
570 std::swap(Buckets, RHS.Buckets);
583 operator delete(Buckets);
591 operator delete(Buckets);
611 BucketT *OldBuckets = Buckets;
614 assert(Buckets);
639 operator delete(Buckets);
659 return Buckets;
695 BucketT *Buckets; member in struct:llvm::SmallDenseMap::LargeRep
[all...]

Completed in 1014 milliseconds