Searched refs:NumBuckets (Results 1 - 6 of 6) sorted by relevance

/macosx-10.10.1/llvmCore-3425.0.34/lib/Support/
H A DStringMap.cpp31 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...]
H A DFoldingSet.cpp210 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { argument
211 // NumBuckets is always a power of 2.
212 unsigned BucketNum = Hash & (NumBuckets-1);
217 static void **AllocateBuckets(unsigned NumBuckets) { argument
218 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*)));
220 Buckets[NumBuckets] = reinterpret_cast<void*>(-1);
230 NumBuckets = 1 << Log2InitSize;
231 Buckets = AllocateBuckets(NumBuckets);
239 memset(Buckets, 0, NumBuckets*sizeof(void*));
242 Buckets[NumBuckets]
[all...]
/macosx-10.10.1/objc4-646/runtime/
H A Dllvm-DenseMap.h452 unsigned NumBuckets = getNumBuckets(); local
453 if (NewNumEntries*4 >= NumBuckets*3) {
454 this->grow(NumBuckets * 2);
456 NumBuckets = getNumBuckets();
458 if (NumBuckets-(NewNumEntries+getNumTombstones()) <= NumBuckets/8) {
459 this->grow(NumBuckets);
494 const unsigned NumBuckets = getNumBuckets(); local
496 if (NumBuckets == 0) {
509 unsigned BucketNo = getHashValue(Val) & (NumBuckets
590 unsigned NumBuckets; member in class:objc::DenseMap
750 unsigned NumBuckets; member in struct:objc::SmallDenseMap::LargeRep
[all...]
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/ADT/
H A DDenseMap.h416 unsigned NumBuckets = getNumBuckets(); local
417 if (NewNumEntries*4 >= NumBuckets*3) {
418 this->grow(NumBuckets * 2);
420 NumBuckets = getNumBuckets();
422 if (NumBuckets-(NewNumEntries+getNumTombstones()) <= NumBuckets/8) {
423 this->grow(NumBuckets);
447 const unsigned NumBuckets = getNumBuckets(); local
449 if (NumBuckets == 0) {
462 unsigned BucketNo = getHashValue(Val) & (NumBuckets
527 unsigned NumBuckets; member in class:llvm::DenseMap
686 unsigned NumBuckets; member in struct:llvm::SmallDenseMap::LargeRep
[all...]
H A DStringMap.h55 // Array of NumBuckets pointers to entries, null pointers are holes.
56 // TheTable[NumBuckets] contains a sentinel value for easy iteration. Follwed
59 unsigned NumBuckets; member in class:llvm::StringMapImpl
67 NumBuckets = 0;
100 unsigned getNumBuckets() const { return NumBuckets; }
269 return iterator(TheTable, NumBuckets == 0);
272 return iterator(TheTable+NumBuckets, true);
275 return const_iterator(TheTable, NumBuckets == 0);
278 return const_iterator(TheTable+NumBuckets, true);
323 assert(NumItems + NumTombstones <= NumBuckets);
[all...]
H A DFoldingSet.h117 /// NumBuckets - Length of the Buckets array. Always a power of 2.
119 unsigned NumBuckets; member in class:llvm::FoldingSetImpl
418 iterator end() { return iterator(Buckets+NumBuckets); }
422 const_iterator end() const { return const_iterator(Buckets+NumBuckets); }
427 return bucket_iterator(Buckets + (hash & (NumBuckets-1)));
431 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true);
498 iterator end() { return iterator(Buckets+NumBuckets); }
502 const_iterator end() const { return const_iterator(Buckets+NumBuckets); }
507 return bucket_iterator(Buckets + (hash & (NumBuckets-1)));
511 return bucket_iterator(Buckets + (hash & (NumBuckets
[all...]

Completed in 96 milliseconds