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/llvm/include/llvm/ADT/
FoldingSet.h 117 /// NumBuckets - Length of the Buckets array. Always a power of 2.
119 unsigned NumBuckets;
419 iterator end() { return iterator(Buckets+NumBuckets); }
423 const_iterator end() const { return const_iterator(Buckets+NumBuckets); }
428 return bucket_iterator(Buckets + (hash & (NumBuckets-1)));
432 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true);
499 iterator end() { return iterator(Buckets+NumBuckets); }
503 const_iterator end() const { return const_iterator(Buckets+NumBuckets); }
508 return bucket_iterator(Buckets + (hash & (NumBuckets-1)));
512 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true)
    [all...]
StringMap.h 55 // Array of NumBuckets pointers to entries, null pointers are holes.
56 // TheTable[NumBuckets] contains a sentinel value for easy iteration. Followed
59 unsigned NumBuckets;
67 NumBuckets = 0;
100 unsigned getNumBuckets() const { return NumBuckets; }
108 std::swap(NumBuckets, Other.NumBuckets);
279 return iterator(TheTable, NumBuckets == 0);
282 return iterator(TheTable+NumBuckets, true);
285 return const_iterator(TheTable, NumBuckets == 0)
    [all...]
DenseMap.h 434 unsigned NumBuckets = getNumBuckets();
435 if (NewNumEntries*4 >= NumBuckets*3) {
436 this->grow(NumBuckets * 2);
438 NumBuckets = getNumBuckets();
440 if (NumBuckets-(NewNumEntries+getNumTombstones()) <= NumBuckets/8) {
441 this->grow(NumBuckets * 2);
466 const unsigned NumBuckets = getNumBuckets();
468 if (NumBuckets == 0) {
481 unsigned BucketNo = getHashValue(Val) & (NumBuckets-1)
    [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) {
219 Emit32(out, NumBuckets);
221 for (unsigned i = 0; i < NumBuckets; ++i) Emit32(out, Buckets[i].off);
228 NumBuckets = 64
    [all...]
  /external/clang/lib/Basic/
IdentifierTable.cpp 256 unsigned NumBuckets = HashTable.getNumBuckets();
258 unsigned NumEmptyBuckets = NumBuckets-NumIdentifiers;
275 NumIdentifiers/(double)NumBuckets);

Completed in 69 milliseconds