| /external/llvm/lib/Support/ |
| D | StringMap.cpp | 31 NumBuckets = 0; in StringMapImpl()
39 NumBuckets = InitSize ? InitSize : 16; in init()
43 TheTable = (StringMapEntryBase **)calloc(NumBuckets+1, in init()
49 TheTable[NumBuckets] = (StringMapEntryBase*)2; in init()
59 unsigned HTSize = NumBuckets; in LookupBucketFor()
62 HTSize = NumBuckets; in LookupBucketFor()
66 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1); in LookupBucketFor()
117 unsigned HTSize = NumBuckets; in FindKey()
121 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1); in FindKey()
175 assert(NumItems + NumTombstones <= NumBuckets); in RemoveKey()
[all …]
|
| D | FoldingSet.cpp | 209 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { in GetBucketFor() argument
211 unsigned BucketNum = Hash & (NumBuckets-1); in GetBucketFor()
216 static void **AllocateBuckets(unsigned NumBuckets) { in AllocateBuckets() argument
217 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*))); in AllocateBuckets()
219 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in AllocateBuckets()
231 NumBuckets = 1 << Log2InitSize; in FoldingSetImpl()
232 Buckets = AllocateBuckets(NumBuckets); in FoldingSetImpl()
240 memset(Buckets, 0, NumBuckets*sizeof(void*)); in clear()
243 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in clear()
253 unsigned OldNumBuckets = NumBuckets; in GrowHashTable()
[all …]
|
| /external/llvm/include/llvm/Support/ |
| D | OnDiskHashTable.h | 73 offset_type NumBuckets; variable
99 for (size_t I = 0; I < NumBuckets; ++I) in resize()
108 NumBuckets = NewSize; in resize()
127 if (4 * NumEntries >= 3 * NumBuckets) in insert()
128 resize(NumBuckets * 2); in insert()
129 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj)); in insert()
146 for (offset_type I = 0; I < NumBuckets; ++I) { in Emit()
177 LE.write<offset_type>(NumBuckets); in Emit()
179 for (offset_type I = 0; I < NumBuckets; ++I) in Emit()
187 NumBuckets = 64; in OnDiskChainedHashTableGenerator()
[all …]
|
| /external/clang/lib/Lex/ |
| D | HeaderMap.cpp | 50 uint32_t NumBuckets; // Number of buckets (always a power of 2). member
179 unsigned NumBuckets = getEndianAdjustedWord(Hdr.NumBuckets); in dump() local
182 getFileName(), NumBuckets, in dump()
185 for (unsigned i = 0; i != NumBuckets; ++i) { in dump()
212 unsigned NumBuckets = getEndianAdjustedWord(Hdr.NumBuckets); in lookupFilename() local
216 if (NumBuckets & (NumBuckets-1)) in lookupFilename()
221 HMapBucket B = getBucket(Bucket & (NumBuckets-1)); in lookupFilename()
|
| /external/llvm/include/llvm/ADT/ |
| D | StringMap.h | 47 unsigned NumBuckets; variable
55 NumBuckets(0), NumItems(0), NumTombstones(0), ItemSize(itemSize) {} in StringMapImpl()
57 : TheTable(RHS.TheTable), NumBuckets(RHS.NumBuckets), in StringMapImpl()
61 RHS.NumBuckets = 0; in StringMapImpl()
95 unsigned getNumBuckets() const { return NumBuckets; } in getNumBuckets()
103 std::swap(NumBuckets, Other.NumBuckets); in swap()
252 return iterator(TheTable, NumBuckets == 0); in begin()
255 return iterator(TheTable+NumBuckets, true); in end()
258 return const_iterator(TheTable, NumBuckets == 0); in begin()
261 return const_iterator(TheTable+NumBuckets, true); in end()
[all …]
|
| D | DenseMap.h | 449 unsigned NumBuckets = getNumBuckets(); in InsertIntoBucketImpl() local
450 if (LLVM_UNLIKELY(NewNumEntries * 4 >= NumBuckets * 3)) { in InsertIntoBucketImpl()
451 this->grow(NumBuckets * 2); in InsertIntoBucketImpl()
453 NumBuckets = getNumBuckets(); in InsertIntoBucketImpl()
454 } else if (LLVM_UNLIKELY(NumBuckets-(NewNumEntries+getNumTombstones()) <= in InsertIntoBucketImpl()
455 NumBuckets/8)) { in InsertIntoBucketImpl()
456 this->grow(NumBuckets); in InsertIntoBucketImpl()
481 const unsigned NumBuckets = getNumBuckets(); in LookupBucketFor() local
483 if (NumBuckets == 0) { in LookupBucketFor()
496 unsigned BucketNo = getHashValue(Val) & (NumBuckets-1); in LookupBucketFor()
[all …]
|
| D | FoldingSet.h | 119 unsigned NumBuckets; variable
425 iterator end() { return iterator(Buckets+NumBuckets); } in end()
429 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } in end()
434 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); in bucket_begin()
438 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); in bucket_end()
504 iterator end() { return iterator(Buckets+NumBuckets); } in end()
508 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } in end()
513 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); in bucket_begin()
517 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); in bucket_end()
|
| /external/llvm/lib/DebugInfo/DWARF/ |
| D | DWARFAcceleratorTable.cpp | 27 Hdr.NumBuckets = AccelSection.getU32(&Offset); in extract()
34 Hdr.NumBuckets*4 + Hdr.NumHashes*8)) in extract()
54 << "Bucket count = " << Hdr.NumBuckets << '\n' in dump()
79 unsigned HashesBase = Offset + Hdr.NumBuckets * 4; in dump()
82 for (unsigned Bucket = 0; Bucket < Hdr.NumBuckets; ++Bucket) { in dump()
96 if (Hash % Hdr.NumBuckets != Bucket) in dump()
|
| /external/clang/test/SemaCXX/ |
| D | 2008-01-11-BadWarning.cpp | 4 void** f(void **Buckets, unsigned NumBuckets) { in f() argument
5 return Buckets + NumBuckets; in f()
|
| /external/llvm/include/llvm/DebugInfo/DWARF/ |
| D | DWARFAcceleratorTable.h | 26 uint32_t NumBuckets; member
|
| /external/clang/lib/Basic/ |
| D | IdentifierTable.cpp | 303 unsigned NumBuckets = HashTable.getNumBuckets(); in PrintStats() local
305 unsigned NumEmptyBuckets = NumBuckets-NumIdentifiers; in PrintStats()
322 NumIdentifiers/(double)NumBuckets); in PrintStats()
|