HomeSort by relevance Sort by last modified time
    Searched refs:Buckets (Results 1 - 8 of 8) sorted by null

  /external/clang/test/SemaCXX/
2008-01-11-BadWarning.cpp 4 void** f(void **Buckets, unsigned NumBuckets) {
5 return Buckets + NumBuckets;
  /external/llvm/lib/CodeGen/AsmPrinter/
DwarfAccelTable.cpp 93 // Figure out how many buckets we need, then compute the bucket
101 Buckets.resize(Header.bucket_count);
104 Buckets[bucket].push_back(Data[i]);
136 // Walk through and emit the buckets for the table. Each index is
140 for (size_t i = 0, e = Buckets.size(); i < e; ++i) {
142 if (Buckets[i].size() != 0)
146 index += Buckets[i].size();
150 // Walk through the buckets and emit the individual hashes for each
153 for (size_t i = 0, e = Buckets.size(); i < e; ++i) {
154 for (HashList::const_iterator HI = Buckets[i].begin()
    [all...]
DwarfAccelTable.h 37 // | BUCKETS |
47 // the number of buckets, total number of hashes, and room for a special
50 // The buckets contain an index (e.g. 6) into the hashes array. The hashes
56 // number of buckets giving us our bucket. From there we take the bucket value
81 // Helper function to compute the number of buckets needed based on
89 uint32_t bucket_count; // The number of buckets in this hash table.
93 // indexes (buckets) for correct alignment.
263 // Buckets/Hashes/Offsets
266 BucketList Buckets;
  /external/llvm/lib/Support/
FoldingSet.cpp 187 /// The problem with this is that the start of the hash buckets are not
208 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) {
211 return Buckets + BucketNum;
216 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*)));
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)
    [all...]
  /external/llvm/include/llvm/Analysis/
DominatorInternals.h 181 // 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;
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[i] = Buckets[WInfo.Semi]
    [all...]
  /external/clang/include/clang/Basic/
OnDiskHashTable.h 141 Bucket* Buckets;
156 for (Item* E = Buckets[i].head; E ; ) {
163 free(Buckets);
165 Buckets = newBuckets;
181 insert(Buckets, NumBuckets, new (BA.Allocate<Item>()) Item(key, data,
195 Bucket& B = Buckets[i];
221 for (unsigned i = 0; i < NumBuckets; ++i) Emit32(out, Buckets[i].off);
231 Buckets = (Bucket*) std::calloc(NumBuckets, sizeof(Bucket));
235 std::free(Buckets);
243 const unsigned char* const Buckets;
    [all...]
  /external/llvm/include/llvm/ADT/
FoldingSet.h 35 /// "buckets" are actually the nodes themselves (the next pointer is in the
106 /// structure is an array of buckets. Each bucket is indexed by the hash of
113 /// Buckets - Array of bucket chains.
115 void **Buckets;
117 /// NumBuckets - Length of the Buckets array. Always a power of 2.
122 /// is greater than twice the number of buckets.
418 iterator begin() { return iterator(Buckets); }
419 iterator end() { return iterator(Buckets+NumBuckets); }
422 const_iterator begin() const { return const_iterator(Buckets); }
423 const_iterator end() const { return const_iterator(Buckets+NumBuckets);
    [all...]
DenseMap.h 70 /// Grow the densemap so that it has at least Size buckets. Does not shrink
234 /// somewhere into the DenseMap's array of buckets (i.e. either to a key or
240 /// getPointerIntoBucketsArray() - Return an opaque pointer into the buckets
270 "# initial buckets must be a power of two!");
425 // the buckets are empty (meaning that many are filled with tombstones),
447 // so that when growing buckets we have self-consistent entry count.
542 BucketT *Buckets;
572 operator delete(Buckets);
576 std::swap(Buckets, RHS.Buckets);
    [all...]

Completed in 259 milliseconds