/prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
DenseMap.h | 91 auto NumBuckets = getMinBucketToReserveForEntries(NumEntries); 93 if (NumBuckets > getNumBuckets()) 94 grow(NumBuckets); 331 // Ensure that "NumEntries * 4 < NumBuckets * 3" 487 unsigned NumBuckets = getNumBuckets(); 488 if (LLVM_UNLIKELY(NewNumEntries * 4 >= NumBuckets * 3)) { 489 this->grow(NumBuckets * 2); 491 NumBuckets = getNumBuckets(); 492 } else if (LLVM_UNLIKELY(NumBuckets-(NewNumEntries+getNumTombstones()) <= 493 NumBuckets/8)) [all...] |
FoldingSet.h | 121 /// NumBuckets - Length of the Buckets array. Always a power of 2. 123 unsigned NumBuckets; 197 // so that means our capacity is NumBuckets * 2 198 return NumBuckets * 2; 455 iterator end() { return iterator(Buckets+NumBuckets); } 459 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } 464 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); 468 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); 535 iterator end() { return iterator(Buckets+NumBuckets); } 539 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } [all...] |
/prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
DenseMap.h | 91 auto NumBuckets = getMinBucketToReserveForEntries(NumEntries); 93 if (NumBuckets > getNumBuckets()) 94 grow(NumBuckets); 331 // Ensure that "NumEntries * 4 < NumBuckets * 3" 487 unsigned NumBuckets = getNumBuckets(); 488 if (LLVM_UNLIKELY(NewNumEntries * 4 >= NumBuckets * 3)) { 489 this->grow(NumBuckets * 2); 491 NumBuckets = getNumBuckets(); 492 } else if (LLVM_UNLIKELY(NumBuckets-(NewNumEntries+getNumTombstones()) <= 493 NumBuckets/8)) [all...] |
FoldingSet.h | 121 /// NumBuckets - Length of the Buckets array. Always a power of 2. 123 unsigned NumBuckets; 197 // so that means our capacity is NumBuckets * 2 198 return NumBuckets * 2; 455 iterator end() { return iterator(Buckets+NumBuckets); } 459 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } 464 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); 468 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); 535 iterator end() { return iterator(Buckets+NumBuckets); } 539 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } [all...] |
/prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
DenseMap.h | 91 auto NumBuckets = getMinBucketToReserveForEntries(NumEntries); 93 if (NumBuckets > getNumBuckets()) 94 grow(NumBuckets); 331 // Ensure that "NumEntries * 4 < NumBuckets * 3" 487 unsigned NumBuckets = getNumBuckets(); 488 if (LLVM_UNLIKELY(NewNumEntries * 4 >= NumBuckets * 3)) { 489 this->grow(NumBuckets * 2); 491 NumBuckets = getNumBuckets(); 492 } else if (LLVM_UNLIKELY(NumBuckets-(NewNumEntries+getNumTombstones()) <= 493 NumBuckets/8)) [all...] |
FoldingSet.h | 121 /// NumBuckets - Length of the Buckets array. Always a power of 2. 123 unsigned NumBuckets; 197 // so that means our capacity is NumBuckets * 2 198 return NumBuckets * 2; 455 iterator end() { return iterator(Buckets+NumBuckets); } 459 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } 464 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); 468 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); 535 iterator end() { return iterator(Buckets+NumBuckets); } 539 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } [all...] |
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
DenseMap.h | 91 auto NumBuckets = getMinBucketToReserveForEntries(NumEntries); 93 if (NumBuckets > getNumBuckets()) 94 grow(NumBuckets); 331 // Ensure that "NumEntries * 4 < NumBuckets * 3" 487 unsigned NumBuckets = getNumBuckets(); 488 if (LLVM_UNLIKELY(NewNumEntries * 4 >= NumBuckets * 3)) { 489 this->grow(NumBuckets * 2); 491 NumBuckets = getNumBuckets(); 492 } else if (LLVM_UNLIKELY(NumBuckets-(NewNumEntries+getNumTombstones()) <= 493 NumBuckets/8)) [all...] |
/external/llvm/include/llvm/DebugInfo/DWARF/ |
DWARFAcceleratorTable.h | 26 uint32_t NumBuckets;
|
/prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/DebugInfo/DWARF/ |
DWARFAcceleratorTable.h | 29 uint32_t NumBuckets;
|
/prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/DebugInfo/DWARF/ |
DWARFAcceleratorTable.h | 29 uint32_t NumBuckets;
|
/prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/DebugInfo/DWARF/ |
DWARFAcceleratorTable.h | 29 uint32_t NumBuckets;
|
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/DebugInfo/DWARF/ |
DWARFAcceleratorTable.h | 29 uint32_t NumBuckets;
|
/prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/DebugInfo/DWARF/ |
DWARFAcceleratorTable.h | 29 uint32_t NumBuckets;
|
/prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/DebugInfo/DWARF/ |
DWARFAcceleratorTable.h | 29 uint32_t NumBuckets;
|
/prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/DebugInfo/DWARF/ |
DWARFAcceleratorTable.h | 29 uint32_t NumBuckets;
|
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/DebugInfo/DWARF/ |
DWARFAcceleratorTable.h | 29 uint32_t NumBuckets;
|
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
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...] |
/external/llvm/lib/DebugInfo/PDB/Raw/ |
PublicsStream.cpp | 71 ulittle32_t NumBuckets; 123 NumBuckets += countPopulation(B); 131 if (auto EC = Reader.readArray(HashBuckets, NumBuckets))
|
/external/mesa3d/src/gallium/drivers/swr/rasterizer/core/ |
rdtsc_core.h | 94 NumBuckets 137 gBucketMap.resize(NumBuckets); 138 for (uint32_t i = 0; i < NumBuckets; ++i)
|
/external/llvm/include/llvm/ADT/ |
FoldingSet.h | 116 /// NumBuckets - Length of the Buckets array. Always a power of 2. 118 unsigned NumBuckets; 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...] |
/external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
FoldingSet.h | 121 /// NumBuckets - Length of the Buckets array. Always a power of 2. 123 unsigned NumBuckets; 197 // so that means our capacity is NumBuckets * 2 198 return NumBuckets * 2; 455 iterator end() { return iterator(Buckets+NumBuckets); } 459 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } 464 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); 468 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); 535 iterator end() { return iterator(Buckets+NumBuckets); } 539 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } [all...] |
/prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
FoldingSet.h | 121 /// NumBuckets - Length of the Buckets array. Always a power of 2. 123 unsigned NumBuckets; 197 // so that means our capacity is NumBuckets * 2 198 return NumBuckets * 2; 455 iterator end() { return iterator(Buckets+NumBuckets); } 459 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } 464 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); 468 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); 535 iterator end() { return iterator(Buckets+NumBuckets); } 539 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } [all...] |
/prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
FoldingSet.h | 121 /// NumBuckets - Length of the Buckets array. Always a power of 2. 123 unsigned NumBuckets; 197 // so that means our capacity is NumBuckets * 2 198 return NumBuckets * 2; 455 iterator end() { return iterator(Buckets+NumBuckets); } 459 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } 464 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); 468 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); 535 iterator end() { return iterator(Buckets+NumBuckets); } 539 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } [all...] |
/prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
FoldingSet.h | 121 /// NumBuckets - Length of the Buckets array. Always a power of 2. 123 unsigned NumBuckets; 197 // so that means our capacity is NumBuckets * 2 198 return NumBuckets * 2; 455 iterator end() { return iterator(Buckets+NumBuckets); } 459 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } 464 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); 468 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); 535 iterator end() { return iterator(Buckets+NumBuckets); } 539 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } [all...] |
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
FoldingSet.h | 121 /// NumBuckets - Length of the Buckets array. Always a power of 2. 123 unsigned NumBuckets; 197 // so that means our capacity is NumBuckets * 2 198 return NumBuckets * 2; 455 iterator end() { return iterator(Buckets+NumBuckets); } 459 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } 464 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); 468 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); 535 iterator end() { return iterator(Buckets+NumBuckets); } 539 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } [all...] |