HomeSort by: relevance | last modified time | path
    Searched defs:NumBuckets (Results 1 - 12 of 12) sorted by relevancy

  /src/external/apache2/llvm/dist/clang/include/clang/Lex/
HeaderMapTypes.h 34 uint32_t NumBuckets; // Number of buckets (always a power of 2).
36 // An array of 'NumBuckets' HMapBucket objects follows this header.
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/Native/
GlobalsStream.cpp 158 uint32_t NumBuckets = 0;
160 NumBuckets += countPopulation(B);
163 if (auto EC = Reader.readArray(HashBuckets, NumBuckets))
  /src/external/apache2/llvm/dist/clang/lib/Lex/
HeaderMap.cpp 90 uint32_t NumBuckets = NeedsByteSwap
91 ? llvm::sys::getSwappedBytes(Header->NumBuckets)
92 : Header->NumBuckets;
93 if (!llvm::isPowerOf2_32(NumBuckets))
96 sizeof(HMapHeader) + sizeof(HMapBucket) * NumBuckets)
174 unsigned NumBuckets = getEndianAdjustedWord(Hdr.NumBuckets);
176 llvm::dbgs() << "Header Map " << getFileName() << ":\n " << NumBuckets
185 for (unsigned i = 0; i != NumBuckets; ++i) {
213 unsigned NumBuckets = getEndianAdjustedWord(Hdr.NumBuckets)
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/DWARF/
DWARFUnitIndex.h 85 uint32_t NumBuckets = 0;
137 explicit operator bool() const { return Header.NumBuckets; }
152 return makeArrayRef(Rows.get(), Header.NumBuckets);
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
StringMap.h 32 // Array of NumBuckets pointers to entries, null pointers are holes.
33 // TheTable[NumBuckets] contains a sentinel value for easy iteration. Followed
36 unsigned NumBuckets = 0;
44 : TheTable(RHS.TheTable), NumBuckets(RHS.NumBuckets),
48 RHS.NumBuckets = 0;
89 unsigned getNumBuckets() const { return NumBuckets; }
97 std::swap(NumBuckets, Other.NumBuckets);
144 // sentinel appropriately (and NumBuckets)
    [all...]
FoldingSet.h 117 /// NumBuckets - Length of the Buckets array. Always a power of 2.
118 unsigned NumBuckets;
159 // so that means our capacity is NumBuckets * 2
160 return NumBuckets * 2;
421 iterator end() { return iterator(Buckets+NumBuckets); }
426 const_iterator end() const { return const_iterator(Buckets+NumBuckets); }
431 return bucket_iterator(Buckets + (hash & (NumBuckets-1)));
435 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true);
DenseMap.h 105 auto NumBuckets = getMinBucketToReserveForEntries(NumEntries);
107 if (NumBuckets > getNumBuckets())
108 grow(NumBuckets);
387 // Ensure that "NumEntries * 4 < NumBuckets * 3"
579 unsigned NumBuckets = getNumBuckets();
580 if (LLVM_UNLIKELY(NewNumEntries * 4 >= NumBuckets * 3)) {
581 this->grow(NumBuckets * 2);
583 NumBuckets = getNumBuckets();
584 } else if (LLVM_UNLIKELY(NumBuckets-(NewNumEntries+getNumTombstones()) <=
585 NumBuckets/8))
    [all...]
  /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/
sanitizer_dense_map.h 41 auto NumBuckets = getMinBucketToReserveForEntries(NumEntries);
42 if (NumBuckets > getNumBuckets())
43 grow(NumBuckets);
280 // Ensure that "NumEntries * 4 < NumBuckets * 3"
428 unsigned NumBuckets = getNumBuckets();
429 if (UNLIKELY(NewNumEntries * 4 >= NumBuckets * 3)) {
430 this->grow(NumBuckets * 2);
432 NumBuckets = getNumBuckets();
433 } else if (UNLIKELY(NumBuckets - (NewNumEntries + getNumTombstones()) <=
434 NumBuckets / 8))
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Basic/
IdentifierTable.cpp 367 unsigned NumBuckets = HashTable.getNumBuckets();
369 unsigned NumEmptyBuckets = NumBuckets-NumIdentifiers;
386 NumIdentifiers/(double)NumBuckets);
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
OnDiskHashTable.h 74 offset_type NumBuckets;
101 for (size_t I = 0; I < NumBuckets; ++I)
110 NumBuckets = NewSize;
128 if (4 * NumEntries >= 3 * NumBuckets)
129 resize(NumBuckets * 2);
130 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj));
136 for (Item *I = Buckets[Hash & (NumBuckets - 1)].Head; I; I = I->Next)
168 if (TargetNumBuckets != NumBuckets)
172 for (offset_type I = 0; I < NumBuckets; ++I) {
217 LE.write<offset_type>(NumBuckets);
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/PDB/Native/
RawTypes.h 36 support::ulittle32_t NumBuckets;
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/
DWARFVerifier.cpp 890 uint32_t NumBuckets = AccelTable.getNumBuckets();
895 uint64_t HashesBase = BucketsOffset + NumBuckets * 4;
897 for (uint32_t BucketIdx = 0; BucketIdx < NumBuckets; ++BucketIdx) {
942 NumBuckets ? (Hash % NumBuckets) : UINT32_MAX;

Completed in 40 milliseconds