HomeSort by relevance Sort by last modified time
    Searched defs:NumBuckets (Results 1 - 6 of 6) sorted by null

  /external/clang/lib/Lex/
HeaderMap.cpp 50 uint32_t NumBuckets; // Number of buckets (always a power of 2).
52 // An array of 'NumBuckets' HMapBucket objects follows this header.
183 unsigned NumBuckets = getEndianAdjustedWord(Hdr.NumBuckets);
186 getFileName(), NumBuckets,
189 for (unsigned i = 0; i != NumBuckets; ++i) {
205 unsigned NumBuckets = getEndianAdjustedWord(Hdr.NumBuckets);
209 if (NumBuckets & (NumBuckets-1)
    [all...]
  /external/clang/lib/Basic/
IdentifierTable.cpp 232 unsigned NumBuckets = HashTable.getNumBuckets();
234 unsigned NumEmptyBuckets = NumBuckets-NumIdentifiers;
251 NumIdentifiers/(double)NumBuckets);
  /external/llvm/include/llvm/ADT/
DenseMap.h 41 unsigned NumBuckets;
52 NumBuckets = 0;
68 for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) {
75 if (NumBuckets)
76 memset((void*)Buckets, 0x5a, sizeof(BucketT)*NumBuckets);
86 return empty() ? end() : iterator(Buckets, Buckets+NumBuckets);
89 return iterator(Buckets+NumBuckets, Buckets+NumBuckets);
92 return empty() ? end() : const_iterator(Buckets, Buckets+NumBuckets);
95 return const_iterator(Buckets+NumBuckets, Buckets+NumBuckets)
    [all...]
FoldingSet.h 117 /// NumBuckets - Length of the Buckets array. Always a power of 2.
119 unsigned NumBuckets;
410 iterator end() { return iterator(Buckets+NumBuckets); }
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);
489 iterator end() { return iterator(Buckets+NumBuckets); }
493 const_iterator end() const { return const_iterator(Buckets+NumBuckets); }
498 return bucket_iterator(Buckets + (hash & (NumBuckets-1)));
502 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true)
    [all...]
StringMap.h 68 unsigned NumBuckets;
76 NumBuckets = 0;
109 unsigned getNumBuckets() const { return NumBuckets; }
277 return iterator(TheTable, NumBuckets == 0);
280 return iterator(TheTable+NumBuckets, true);
283 return const_iterator(TheTable, NumBuckets == 0);
286 return const_iterator(TheTable+NumBuckets, true);
331 assert(NumItems + NumTombstones <= NumBuckets);
343 for (ItemBucket *I = TheTable, *E = TheTable+NumBuckets; I != E; ++I) {
370 assert(NumItems + NumTombstones <= NumBuckets);
    [all...]
  /external/clang/include/clang/Basic/
OnDiskHashTable.h 116 unsigned NumBuckets;
155 for (unsigned i = 0; i < NumBuckets; ++i)
164 NumBuckets = newsize;
180 if (4*NumEntries >= 3*NumBuckets) resize(NumBuckets*2);
181 insert(Buckets, NumBuckets, new (BA.Allocate<Item>()) Item(key, data,
194 for (unsigned i = 0; i < NumBuckets; ++i) {
218 Emit32(out, NumBuckets);
220 for (unsigned i = 0; i < NumBuckets; ++i) Emit32(out, Buckets[i].off);
227 NumBuckets = 64
    [all...]

Completed in 447 milliseconds