| /external/clang/test/SemaCXX/ |
| 2008-01-11-BadWarning.cpp | 4 void** f(void **Buckets, unsigned NumBuckets) {
5 return Buckets + NumBuckets;
|
| /external/llvm/lib/Support/ |
| StringMap.cpp | 31 NumBuckets = 0;
39 NumBuckets = InitSize ? InitSize : 16;
43 TheTable = (StringMapEntryBase **)calloc(NumBuckets+1,
49 TheTable[NumBuckets] = (StringMapEntryBase*)2;
59 unsigned HTSize = NumBuckets;
62 HTSize = NumBuckets;
66 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1);
117 unsigned HTSize = NumBuckets;
121 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1);
175 assert(NumItems + NumTombstones <= NumBuckets);
[all...] |
| FoldingSet.cpp | 209 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) {
210 // NumBuckets is always a power of 2.
211 unsigned BucketNum = Hash & (NumBuckets-1);
216 static void **AllocateBuckets(unsigned NumBuckets) {
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), NumNodes(Arg.NumNodes)
[all...] |
| /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.
179 unsigned NumBuckets = getEndianAdjustedWord(Hdr.NumBuckets);
182 getFileName(), NumBuckets,
185 for (unsigned i = 0; i != NumBuckets; ++i) {
212 unsigned NumBuckets = getEndianAdjustedWord(Hdr.NumBuckets);
216 if (NumBuckets & (NumBuckets-1)
[all...] |
| /external/llvm/lib/DebugInfo/DWARF/ |
| DWARFUnitIndex.cpp | 24 NumBuckets = IndexData.getU32(OffsetPtr);
29 OS << format("version = %u slots = %u\n\n", Version, NumBuckets);
36 Header.NumBuckets = 0;
50 Offset, Header.NumBuckets * (8 + 4) +
54 Rows = llvm::make_unique<Entry[]>(Header.NumBuckets);
60 for (unsigned i = 0; i != Header.NumBuckets; ++i)
64 for (unsigned i = 0; i != Header.NumBuckets; ++i) {
122 if (!Header.NumBuckets)
133 for (unsigned i = 0; i != Header.NumBuckets; ++i) {
162 for (uint32_t i = 0; i != Header.NumBuckets; ++i
[all...] |
| DWARFAcceleratorTable.cpp | 27 Hdr.NumBuckets = AccelSection.getU32(&Offset);
34 Hdr.NumBuckets*4 + Hdr.NumHashes*8))
54 << "Bucket count = " << Hdr.NumBuckets << '\n'
79 unsigned HashesBase = Offset + Hdr.NumBuckets * 4;
82 for (unsigned Bucket = 0; Bucket < Hdr.NumBuckets; ++Bucket) {
96 if (Hash % Hdr.NumBuckets != Bucket)
|
| /external/llvm/include/llvm/ADT/ |
| StringMap.h | 44 // Array of NumBuckets pointers to entries, null pointers are holes.
45 // TheTable[NumBuckets] contains a sentinel value for easy iteration. Followed
48 unsigned NumBuckets;
57 NumBuckets(0), NumItems(0), NumTombstones(0), ItemSize(itemSize) {}
59 : TheTable(RHS.TheTable), NumBuckets(RHS.NumBuckets),
63 RHS.NumBuckets = 0;
99 unsigned getNumBuckets() const { return NumBuckets; }
107 std::swap(NumBuckets, Other.NumBuckets);
[all...] |
| DenseMap.h | 439 unsigned NumBuckets = getNumBuckets();
440 if (LLVM_UNLIKELY(NewNumEntries * 4 >= NumBuckets * 3)) {
441 this->grow(NumBuckets * 2);
443 NumBuckets = getNumBuckets();
444 } else if (LLVM_UNLIKELY(NumBuckets-(NewNumEntries+getNumTombstones()) <=
445 NumBuckets/8)) {
446 this->grow(NumBuckets);
471 const unsigned NumBuckets = getNumBuckets();
473 if (NumBuckets == 0) {
486 unsigned BucketNo = getHashValue(Val) & (NumBuckets-1)
[all...] |
| FoldingSet.h | 117 /// NumBuckets - Length of the Buckets array. Always a power of 2.
119 unsigned NumBuckets;
433 iterator end() { return iterator(Buckets+NumBuckets); }
437 const_iterator end() const { return const_iterator(Buckets+NumBuckets); }
442 return bucket_iterator(Buckets + (hash & (NumBuckets-1)));
446 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true);
511 iterator end() { return iterator(Buckets+NumBuckets); }
515 const_iterator end() const { return const_iterator(Buckets+NumBuckets); }
520 return bucket_iterator(Buckets + (hash & (NumBuckets-1)));
524 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true)
[all...] |
| /art/runtime/base/ |
| hash_set.h | 107 const size_t num_buckets = hash_set->NumBuckets();
181 AllocateStorage(other.NumBuckets());
291 return iterator(this, NumBuckets());
296 return const_iterator(this, NumBuckets());
338 unwrapped_next_index += NumBuckets();
343 unwrapped_next_ideal_index += NumBuckets();
438 if (num_buckets > NumBuckets()) {
447 for (size_t i = 0; i < NumBuckets(); ++i) {
452 total += i + NumBuckets() - ideal_location;
463 return static_cast<double>(Size()) / static_cast<double>(NumBuckets());
[all...] |
| hash_set_test.cc | 341 const size_t buckets_before = hash_set.NumBuckets();
349 CHECK_EQ(hash_set.NumBuckets(), buckets_before);
|
| /external/llvm/include/llvm/Support/ |
| OnDiskHashTable.h | 75 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)
156 for (offset_type I = 0; I < NumBuckets; ++I) {
201 LE.write<offset_type>(NumBuckets);
203 for (offset_type I = 0; I < NumBuckets; ++I
[all...] |
| /external/llvm/include/llvm/DebugInfo/DWARF/ |
| DWARFAcceleratorTable.h | 26 uint32_t NumBuckets;
|
| DWARFUnitIndex.h | 36 uint32_t NumBuckets = 0;
|
| /external/clang/lib/Serialization/ |
| MultiOnDiskHashTable.h | 52 OnDiskTable(file_type File, unsigned NumBuckets, unsigned NumEntries,
56 Table(NumBuckets, NumEntries, Buckets, Payload, Base, InfoObj) {}
|
| /external/clang/lib/Basic/ |
| IdentifierTable.cpp | 312 unsigned NumBuckets = HashTable.getNumBuckets();
314 unsigned NumEmptyBuckets = NumBuckets-NumIdentifiers;
331 NumIdentifiers/(double)NumBuckets);
|
