Home
last modified time | relevance | path

Searched refs:NumBuckets (Results 1 – 10 of 10) sorted by relevance

/external/llvm/lib/Support/
DStringMap.cpp31 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 …]
DFoldingSet.cpp210 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { in GetBucketFor() argument
212 unsigned BucketNum = Hash & (NumBuckets-1); in GetBucketFor()
217 static void **AllocateBuckets(unsigned NumBuckets) { in AllocateBuckets() argument
218 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*))); in AllocateBuckets()
220 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in AllocateBuckets()
230 NumBuckets = 1 << Log2InitSize; in FoldingSetImpl()
231 Buckets = AllocateBuckets(NumBuckets); in FoldingSetImpl()
239 memset(Buckets, 0, NumBuckets*sizeof(void*)); in clear()
242 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in clear()
252 unsigned OldNumBuckets = NumBuckets; in GrowHashTable()
[all …]
/external/clang/lib/Lex/
DHeaderMap.cpp50 uint32_t NumBuckets; // Number of buckets (always a power of 2). member
183 unsigned NumBuckets = getEndianAdjustedWord(Hdr.NumBuckets); in dump() local
186 getFileName(), NumBuckets, in dump()
189 for (unsigned i = 0; i != NumBuckets; ++i) { in dump()
205 unsigned NumBuckets = getEndianAdjustedWord(Hdr.NumBuckets); in LookupFile() local
209 if (NumBuckets & (NumBuckets-1)) in LookupFile()
214 HMapBucket B = getBucket(Bucket & (NumBuckets-1)); in LookupFile()
/external/llvm/include/llvm/ADT/
DDenseMap.h416 unsigned NumBuckets = getNumBuckets(); in InsertIntoBucketImpl() local
417 if (NewNumEntries*4 >= NumBuckets*3) { in InsertIntoBucketImpl()
418 this->grow(NumBuckets * 2); in InsertIntoBucketImpl()
420 NumBuckets = getNumBuckets(); in InsertIntoBucketImpl()
422 if (NumBuckets-(NewNumEntries+getNumTombstones()) <= NumBuckets/8) { in InsertIntoBucketImpl()
423 this->grow(NumBuckets); in InsertIntoBucketImpl()
446 const unsigned NumBuckets = getNumBuckets(); in LookupBucketFor() local
448 if (NumBuckets == 0) { in LookupBucketFor()
461 unsigned BucketNo = getHashValue(Val) & (NumBuckets-1); in LookupBucketFor()
489 BucketNo &= (NumBuckets-1); in LookupBucketFor()
[all …]
DStringMap.h59 unsigned NumBuckets; variable
67 NumBuckets = 0; in StringMapImpl()
100 unsigned getNumBuckets() const { return NumBuckets; } in getNumBuckets()
269 return iterator(TheTable, NumBuckets == 0); in begin()
272 return iterator(TheTable+NumBuckets, true); in end()
275 return const_iterator(TheTable, NumBuckets == 0); in begin()
278 return const_iterator(TheTable+NumBuckets, true); in end()
323 assert(NumItems + NumTombstones <= NumBuckets); in insert()
335 for (unsigned I = 0, E = NumBuckets; I != E; ++I) { in clear()
363 assert(NumItems + NumTombstones <= NumBuckets); in GetOrCreateValue()
DFoldingSet.h119 unsigned NumBuckets; variable
418 iterator end() { return iterator(Buckets+NumBuckets); } in end()
422 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } in end()
427 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); in bucket_begin()
431 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); in bucket_end()
498 iterator end() { return iterator(Buckets+NumBuckets); } in end()
502 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } in end()
507 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); in bucket_begin()
511 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); in bucket_end()
/external/clang/include/clang/Basic/
DOnDiskHashTable.h115 unsigned NumBuckets; variable
154 for (unsigned i = 0; i < NumBuckets; ++i) in resize()
163 NumBuckets = newsize; in resize()
179 if (4*NumEntries >= 3*NumBuckets) resize(NumBuckets*2); in insert()
180 insert(Buckets, NumBuckets, new (BA.Allocate<Item>()) Item(key, data, in insert()
193 for (unsigned i = 0; i < NumBuckets; ++i) { in Emit()
218 Emit32(out, NumBuckets); in Emit()
220 for (unsigned i = 0; i < NumBuckets; ++i) Emit32(out, Buckets[i].off); in Emit()
227 NumBuckets = 64; in OnDiskChainedHashTableGenerator()
230 Buckets = (Bucket*) std::calloc(NumBuckets, sizeof(Bucket)); in OnDiskChainedHashTableGenerator()
[all …]
/external/clang/utils/
DclangVisualizers.txt228 " NumBuckets=", $e.NumBuckets,
240 #(NumBuckets : $e.NumBuckets),
243 size: $e.NumBuckets
253 "[NumBuckets=", $e.NumBuckets,
262 #(NumBuckets : $e.NumBuckets),
266 size: $e.NumBuckets,
/external/clang/test/SemaCXX/
D2008-01-11-BadWarning.cpp3 void** f(void **Buckets, unsigned NumBuckets) { in f() argument
4 return Buckets + NumBuckets; in f()
/external/clang/lib/Basic/
DIdentifierTable.cpp257 unsigned NumBuckets = HashTable.getNumBuckets(); in PrintStats() local
259 unsigned NumEmptyBuckets = NumBuckets-NumIdentifiers; in PrintStats()
276 NumIdentifiers/(double)NumBuckets); in PrintStats()