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) {
216 unsigned NumBuckets = getEndianAdjustedWord(Hdr.NumBuckets);
220 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;
424 iterator end() { return iterator(Buckets+NumBuckets); }
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);
503 iterator end() { return iterator(Buckets+NumBuckets); }
507 const_iterator end() const { return const_iterator(Buckets+NumBuckets); }
512 return bucket_iterator(Buckets + (hash & (NumBuckets-1)));
516 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true)
    [all...]
StringMap.h 43 // Array of NumBuckets pointers to entries, null pointers are holes.
44 // TheTable[NumBuckets] contains a sentinel value for easy iteration. Followed
47 unsigned NumBuckets;
55 NumBuckets(0), NumItems(0), NumTombstones(0), ItemSize(itemSize) {}
57 : TheTable(RHS.TheTable), NumBuckets(RHS.NumBuckets),
61 RHS.NumBuckets = 0;
95 unsigned getNumBuckets() const { return NumBuckets; }
103 std::swap(NumBuckets, Other.NumBuckets);
    [all...]
DenseMap.h 431 unsigned NumBuckets = getNumBuckets();
432 if (NewNumEntries*4 >= NumBuckets*3) {
433 this->grow(NumBuckets * 2);
435 NumBuckets = getNumBuckets();
436 } else if (NumBuckets-(NewNumEntries+getNumTombstones()) <= NumBuckets/8) {
437 this->grow(NumBuckets);
462 const unsigned NumBuckets = getNumBuckets();
464 if (NumBuckets == 0) {
477 unsigned BucketNo = getHashValue(Val) & (NumBuckets-1)
    [all...]
  /external/llvm/include/llvm/Support/
OnDiskHashTable.h 73 offset_type NumBuckets;
102 for (size_t I = 0; I < NumBuckets; ++I)
111 NumBuckets = NewSize;
130 if (4 * NumEntries >= 3 * NumBuckets)
131 resize(NumBuckets * 2);
132 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj));
149 for (offset_type I = 0; I < NumBuckets; ++I) {
180 LE.write<offset_type>(NumBuckets);
182 for (offset_type I = 0; I < NumBuckets; ++I)
190 NumBuckets = 64
    [all...]
  /external/clang/lib/Basic/
IdentifierTable.cpp 260 unsigned NumBuckets = HashTable.getNumBuckets();
262 unsigned NumEmptyBuckets = NumBuckets-NumIdentifiers;
279 NumIdentifiers/(double)NumBuckets);

Completed in 90 milliseconds