/external/clang/test/SemaCXX/ |
H A D | 2008-01-11-BadWarning.cpp | 4 void** f(void **Buckets, unsigned NumBuckets) { argument 5 return Buckets + NumBuckets;
|
/external/llvm/lib/DebugInfo/PDB/Raw/ |
H A D | PublicsStream.cpp | 71 ulittle32_t NumBuckets; variable 123 NumBuckets += countPopulation(B); 131 if (auto EC = Reader.readArray(HashBuckets, NumBuckets))
|
/external/clang/include/clang/Lex/ |
H A D | HeaderMapTypes.h | 35 uint32_t NumBuckets; // Number of buckets (always a power of 2). member in struct:clang::HMapHeader 37 // An array of 'NumBuckets' HMapBucket objects follows this header.
|
/external/llvm/include/llvm/DebugInfo/DWARF/ |
H A D | DWARFAcceleratorTable.h | 26 uint32_t NumBuckets; member in struct:llvm::DWARFAcceleratorTable::Header
|
H A D | DWARFUnitIndex.h | 37 uint32_t NumBuckets = 0; member in struct:llvm::DWARFUnitIndex::Header 87 return makeArrayRef(Rows.get(), Header.NumBuckets);
|
/external/llvm/include/llvm/DebugInfo/PDB/Raw/ |
H A D | PublicsStream.h | 38 uint32_t getNumBuckets() const { return NumBuckets; } 60 uint32_t NumBuckets = 0; member in class:llvm::pdb::PublicsStream
|
/external/clang/lib/Lex/ |
H A D | 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); local 176 llvm::dbgs() << "Header Map " << getFileName() << ":\n " << NumBuckets 185 for (unsigned i = 0; i != NumBuckets; ++i) { 213 unsigned NumBuckets local [all...] |
/external/llvm/lib/Support/ |
H A D | FoldingSet.cpp | 209 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { argument 210 // NumBuckets is always a power of 2. 211 unsigned BucketNum = Hash & (NumBuckets-1); 216 static void **AllocateBuckets(unsigned NumBuckets) { argument 217 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*))); 219 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); 231 NumBuckets = 1 << Log2InitSize; 232 Buckets = AllocateBuckets(NumBuckets); 237 : Buckets(Arg.Buckets), NumBuckets(Arg.NumBuckets), NumNode [all...] |
/external/llvm/unittests/ADT/ |
H A D | StringMapTest.cpp | 421 auto NumBuckets = Map.getNumBuckets(); local 433 EXPECT_EQ(Map.getNumBuckets(), NumBuckets);
|
/external/swiftshader/third_party/LLVM/lib/Support/ |
H A D | FoldingSet.cpp | 208 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { argument 209 // NumBuckets is always a power of 2. 210 unsigned BucketNum = Hash & (NumBuckets-1); 215 static void **AllocateBuckets(unsigned NumBuckets) { argument 216 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*))); 218 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); 228 NumBuckets = 1 << Log2InitSize; 229 Buckets = AllocateBuckets(NumBuckets); 237 memset(Buckets, 0, NumBuckets*sizeof(void*)); 240 Buckets[NumBuckets] [all...] |
/external/clang/lib/Serialization/ |
H A D | MultiOnDiskHashTable.h | 52 OnDiskTable(file_type File, unsigned NumBuckets, unsigned NumEntries, argument 56 Table(NumBuckets, NumEntries, Buckets, Payload, Base, InfoObj) {}
|
/external/llvm/include/llvm/ADT/ |
H A D | FoldingSet.h | 116 /// NumBuckets - Length of the Buckets array. Always a power of 2. 118 unsigned NumBuckets; member in class:llvm::FoldingSetImpl 191 // so that means our capacity is NumBuckets * 2 192 return NumBuckets * 2; 447 iterator end() { return iterator(Buckets+NumBuckets); } 451 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } 456 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); 460 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); 525 iterator end() { return iterator(Buckets+NumBuckets); } 529 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } [all...] |
H A D | StringMap.h | 45 // Array of NumBuckets pointers to entries, null pointers are holes. 46 // TheTable[NumBuckets] contains a sentinel value for easy iteration. Followed 49 unsigned NumBuckets; member in class:llvm::StringMapImpl 58 NumBuckets(0), NumItems(0), NumTombstones(0), ItemSize(itemSize) {} 60 : TheTable(RHS.TheTable), NumBuckets(RHS.NumBuckets), 64 RHS.NumBuckets = 0; 103 unsigned getNumBuckets() const { return NumBuckets; } 111 std::swap(NumBuckets, Other.NumBuckets); [all...] |
H A D | DenseMap.h | 87 auto NumBuckets = getMinBucketToReserveForEntries(NumEntries); local 89 if (NumBuckets > getNumBuckets()) 90 grow(NumBuckets); 313 // Ensure that "NumEntries * 4 < NumBuckets * 3" 484 unsigned NumBuckets = getNumBuckets(); local 485 if (LLVM_UNLIKELY(NewNumEntries * 4 >= NumBuckets * 3)) { 486 this->grow(NumBuckets * 2); 488 NumBuckets = getNumBuckets(); 489 } else if (LLVM_UNLIKELY(NumBuckets-(NewNumEntries+getNumTombstones()) <= 490 NumBuckets/ 516 const unsigned NumBuckets = getNumBuckets(); local 595 unsigned NumBuckets; member in class:llvm::DenseMap 754 unsigned NumBuckets; member in struct:llvm::SmallDenseMap::LargeRep [all...] |
/external/llvm/include/llvm/Support/ |
H A D | OnDiskHashTable.h | 75 offset_type NumBuckets; member in class:llvm::OnDiskChainedHashTableGenerator 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); 275 const typename Info::offset_type NumBuckets; member in class:llvm::OnDiskChainedHashTable 289 OnDiskChainedHashTable(offset_type NumBuckets, offset_type NumEntries, const unsigned char *Buckets, const unsigned char *Base, const Info &InfoObj = Info()) argument 492 OnDiskIterableChainedHashTable(offset_type NumBuckets, offset_type NumEntries, const unsigned char *Buckets, const unsigned char *Payload, const unsigned char *Base, const Info &InfoObj = Info()) argument [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
H A D | DenseMap.h | 41 unsigned NumBuckets; member in class:llvm::DenseMap 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, Bucket [all...] |
H A D | FoldingSet.h | 117 /// NumBuckets - Length of the Buckets array. Always a power of 2. 119 unsigned NumBuckets; member in class:llvm::FoldingSetImpl 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 [all...] |
H A D | StringMap.h | 68 unsigned NumBuckets; member in class:llvm::StringMapImpl 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/lib/Basic/ |
H A D | IdentifierTable.cpp | 313 unsigned NumBuckets = HashTable.getNumBuckets(); local 315 unsigned NumEmptyBuckets = NumBuckets-NumIdentifiers; 332 NumIdentifiers/(double)NumBuckets);
|