1 //===- llvm/ADT/DenseMap.h - Dense probed hash table ------------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the DenseMap class.
12 //===----------------------------------------------------------------------===//
14 #ifndef LLVM_ADT_DENSEMAP_H
15 #define LLVM_ADT_DENSEMAP_H
17 #include "llvm/Support/Compiler.h"
18 #include "llvm/Support/AlignOf.h"
19 #include "llvm/Support/MathExtras.h"
20 #include "llvm/Support/PointerLikeTypeTraits.h"
21 #include "llvm/Support/type_traits.h"
22 #include "llvm/ADT/DenseMapInfo.h"
34 template<typename KeyT, typename ValueT,
35 typename KeyInfoT = DenseMapInfo<KeyT>,
37 class DenseMapIterator;
39 template<typename DerivedT,
40 typename KeyT, typename ValueT, typename KeyInfoT>
43 typedef std::pair<KeyT, ValueT> BucketT;
46 typedef KeyT key_type;
47 typedef ValueT mapped_type;
48 typedef BucketT value_type;
50 typedef DenseMapIterator<KeyT, ValueT, KeyInfoT> iterator;
51 typedef DenseMapIterator<KeyT, ValueT,
52 KeyInfoT, true> const_iterator;
53 inline iterator begin() {
54 // When the map is empty, avoid the overhead of AdvancePastEmptyBuckets().
55 return empty() ? end() : iterator(getBuckets(), getBucketsEnd());
57 inline iterator end() {
58 return iterator(getBucketsEnd(), getBucketsEnd(), true);
60 inline const_iterator begin() const {
61 return empty() ? end() : const_iterator(getBuckets(), getBucketsEnd());
63 inline const_iterator end() const {
64 return const_iterator(getBucketsEnd(), getBucketsEnd(), true);
67 bool empty() const { return getNumEntries() == 0; }
68 unsigned size() const { return getNumEntries(); }
70 /// Grow the densemap so that it has at least Size buckets. Does not shrink
71 void resize(size_t Size) {
72 if (Size > getNumBuckets())
77 if (getNumEntries() == 0 && getNumTombstones() == 0) return;
79 // If the capacity of the array is huge, and the # elements used is small,
81 if (getNumEntries() * 4 < getNumBuckets() && getNumBuckets() > 64) {
86 const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey();
87 for (BucketT *P = getBuckets(), *E = getBucketsEnd(); P != E; ++P) {
88 if (!KeyInfoT::isEqual(P->first, EmptyKey)) {
89 if (!KeyInfoT::isEqual(P->first, TombstoneKey)) {
91 decrementNumEntries();
96 assert(getNumEntries() == 0 && "Node count imbalance!");
100 /// count - Return true if the specified key is in the map.
101 bool count(const KeyT &Val) const {
102 const BucketT *TheBucket;
103 return LookupBucketFor(Val, TheBucket);
106 iterator find(const KeyT &Val) {
108 if (LookupBucketFor(Val, TheBucket))
109 return iterator(TheBucket, getBucketsEnd(), true);
112 const_iterator find(const KeyT &Val) const {
113 const BucketT *TheBucket;
114 if (LookupBucketFor(Val, TheBucket))
115 return const_iterator(TheBucket, getBucketsEnd(), true);
119 /// Alternate version of find() which allows a different, and possibly
120 /// less expensive, key type.
121 /// The DenseMapInfo is responsible for supplying methods
122 /// getHashValue(LookupKeyT) and isEqual(LookupKeyT, KeyT) for each key
124 template<class LookupKeyT>
125 iterator find_as(const LookupKeyT &Val) {
127 if (LookupBucketFor(Val, TheBucket))
128 return iterator(TheBucket, getBucketsEnd(), true);
131 template<class LookupKeyT>
132 const_iterator find_as(const LookupKeyT &Val) const {
133 const BucketT *TheBucket;
134 if (LookupBucketFor(Val, TheBucket))
135 return const_iterator(TheBucket, getBucketsEnd(), true);
139 /// lookup - Return the entry for the specified key, or a default
140 /// constructed value if no such entry exists.
141 ValueT lookup(const KeyT &Val) const {
142 const BucketT *TheBucket;
143 if (LookupBucketFor(Val, TheBucket))
144 return TheBucket->second;
148 // Inserts key,value pair into the map if the key isn't already in the map.
149 // If the key is already in the map, it returns false and doesn't update the
151 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
153 if (LookupBucketFor(KV.first, TheBucket))
154 return std::make_pair(iterator(TheBucket, getBucketsEnd(), true),
155 false); // Already in map.
157 // Otherwise, insert the new element.
158 TheBucket = InsertIntoBucket(KV.first, KV.second, TheBucket);
159 return std::make_pair(iterator(TheBucket, getBucketsEnd(), true), true);
162 /// insert - Range insertion of pairs.
163 template<typename InputIt>
164 void insert(InputIt I, InputIt E) {
170 bool erase(const KeyT &Val) {
172 if (!LookupBucketFor(Val, TheBucket))
173 return false; // not in map.
175 TheBucket->second.~ValueT();
176 TheBucket->first = getTombstoneKey();
177 decrementNumEntries();
178 incrementNumTombstones();
181 void erase(iterator I) {
182 BucketT *TheBucket = &*I;
183 TheBucket->second.~ValueT();
184 TheBucket->first = getTombstoneKey();
185 decrementNumEntries();
186 incrementNumTombstones();
189 value_type& FindAndConstruct(const KeyT &Key) {
191 if (LookupBucketFor(Key, TheBucket))
194 return *InsertIntoBucket(Key, ValueT(), TheBucket);
197 ValueT &operator[](const KeyT &Key) {
198 return FindAndConstruct(Key).second;
201 #if LLVM_USE_RVALUE_REFERENCES
202 value_type& FindAndConstruct(KeyT &&Key) {
204 if (LookupBucketFor(Key, TheBucket))
207 return *InsertIntoBucket(Key, ValueT(), TheBucket);
210 ValueT &operator[](KeyT &&Key) {
211 return FindAndConstruct(Key).second;
215 /// isPointerIntoBucketsArray - Return true if the specified pointer points
216 /// somewhere into the DenseMap's array of buckets (i.e. either to a key or
217 /// value in the DenseMap).
218 bool isPointerIntoBucketsArray(const void *Ptr) const {
219 return Ptr >= getBuckets() && Ptr < getBucketsEnd();
222 /// getPointerIntoBucketsArray() - Return an opaque pointer into the buckets
223 /// array. In conjunction with the previous method, this can be used to
224 /// determine whether an insertion caused the DenseMap to reallocate.
225 const void *getPointerIntoBucketsArray() const { return getBuckets(); }
231 if (getNumBuckets() == 0) // Nothing to do.
234 const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey();
235 for (BucketT *P = getBuckets(), *E = getBucketsEnd(); P != E; ++P) {
236 if (!KeyInfoT::isEqual(P->first, EmptyKey) &&
237 !KeyInfoT::isEqual(P->first, TombstoneKey))
243 memset((void*)getBuckets(), 0x5a, sizeof(BucketT)*getNumBuckets());
251 assert((getNumBuckets() & (getNumBuckets()-1)) == 0 &&
252 "# initial buckets must be a power of two!");
253 const KeyT EmptyKey = getEmptyKey();
254 for (BucketT *B = getBuckets(), *E = getBucketsEnd(); B != E; ++B)
255 new (&B->first) KeyT(EmptyKey);
258 void moveFromOldBuckets(BucketT *OldBucketsBegin, BucketT *OldBucketsEnd) {
261 // Insert all the old elements.
262 const KeyT EmptyKey = getEmptyKey();
263 const KeyT TombstoneKey = getTombstoneKey();
264 for (BucketT *B = OldBucketsBegin, *E = OldBucketsEnd; B != E; ++B) {
265 if (!KeyInfoT::isEqual(B->first, EmptyKey) &&
266 !KeyInfoT::isEqual(B->first, TombstoneKey)) {
267 // Insert the key/value into the new table.
269 bool FoundVal = LookupBucketFor(B->first, DestBucket);
270 (void)FoundVal; // silence warning.
271 assert(!FoundVal && "Key already in new map?");
272 DestBucket->first = llvm_move(B->first);
273 new (&DestBucket->second) ValueT(llvm_move(B->second));
274 incrementNumEntries();
283 if (OldBucketsBegin != OldBucketsEnd)
284 memset((void*)OldBucketsBegin, 0x5a,
285 sizeof(BucketT) * (OldBucketsEnd - OldBucketsBegin));
289 template <typename OtherBaseT>
290 void copyFrom(const DenseMapBase<OtherBaseT, KeyT, ValueT, KeyInfoT>& other) {
291 assert(getNumBuckets() == other.getNumBuckets());
293 setNumEntries(other.getNumEntries());
294 setNumTombstones(other.getNumTombstones());
296 if (isPodLike<KeyT>::value && isPodLike<ValueT>::value)
297 memcpy(getBuckets(), other.getBuckets(),
298 getNumBuckets() * sizeof(BucketT));
300 for (size_t i = 0; i < getNumBuckets(); ++i) {
301 new (&getBuckets()[i].first) KeyT(other.getBuckets()[i].first);
302 if (!KeyInfoT::isEqual(getBuckets()[i].first, getEmptyKey()) &&
303 !KeyInfoT::isEqual(getBuckets()[i].first, getTombstoneKey()))
304 new (&getBuckets()[i].second) ValueT(other.getBuckets()[i].second);
308 void swap(DenseMapBase& RHS) {
309 std::swap(getNumEntries(), RHS.getNumEntries());
310 std::swap(getNumTombstones(), RHS.getNumTombstones());
313 static unsigned getHashValue(const KeyT &Val) {
314 return KeyInfoT::getHashValue(Val);
316 template<typename LookupKeyT>
317 static unsigned getHashValue(const LookupKeyT &Val) {
318 return KeyInfoT::getHashValue(Val);
320 static const KeyT getEmptyKey() {
321 return KeyInfoT::getEmptyKey();
323 static const KeyT getTombstoneKey() {
324 return KeyInfoT::getTombstoneKey();
328 unsigned getNumEntries() const {
329 return static_cast<const DerivedT *>(this)->getNumEntries();
331 void setNumEntries(unsigned Num) {
332 static_cast<DerivedT *>(this)->setNumEntries(Num);
334 void incrementNumEntries() {
335 setNumEntries(getNumEntries() + 1);
337 void decrementNumEntries() {
338 setNumEntries(getNumEntries() - 1);
340 unsigned getNumTombstones() const {
341 return static_cast<const DerivedT *>(this)->getNumTombstones();
343 void setNumTombstones(unsigned Num) {
344 static_cast<DerivedT *>(this)->setNumTombstones(Num);
346 void incrementNumTombstones() {
347 setNumTombstones(getNumTombstones() + 1);
349 void decrementNumTombstones() {
350 setNumTombstones(getNumTombstones() - 1);
352 const BucketT *getBuckets() const {
353 return static_cast<const DerivedT *>(this)->getBuckets();
355 BucketT *getBuckets() {
356 return static_cast<DerivedT *>(this)->getBuckets();
358 unsigned getNumBuckets() const {
359 return static_cast<const DerivedT *>(this)->getNumBuckets();
361 BucketT *getBucketsEnd() {
362 return getBuckets() + getNumBuckets();
364 const BucketT *getBucketsEnd() const {
365 return getBuckets() + getNumBuckets();
368 void grow(unsigned AtLeast) {
369 static_cast<DerivedT *>(this)->grow(AtLeast);
372 void shrink_and_clear() {
373 static_cast<DerivedT *>(this)->shrink_and_clear();
377 BucketT *InsertIntoBucket(const KeyT &Key, const ValueT &Value,
378 BucketT *TheBucket) {
379 TheBucket = InsertIntoBucketImpl(Key, TheBucket);
381 TheBucket->first = Key;
382 new (&TheBucket->second) ValueT(Value);
386 #if LLVM_USE_RVALUE_REFERENCES
387 BucketT *InsertIntoBucket(const KeyT &Key, ValueT &&Value,
388 BucketT *TheBucket) {
389 TheBucket = InsertIntoBucketImpl(Key, TheBucket);
391 TheBucket->first = Key;
392 new (&TheBucket->second) ValueT(std::move(Value));
396 BucketT *InsertIntoBucket(KeyT &&Key, ValueT &&Value, BucketT *TheBucket) {
397 TheBucket = InsertIntoBucketImpl(Key, TheBucket);
399 TheBucket->first = std::move(Key);
400 new (&TheBucket->second) ValueT(std::move(Value));
405 BucketT *InsertIntoBucketImpl(const KeyT &Key, BucketT *TheBucket) {
406 // If the load of the hash table is more than 3/4, or if fewer than 1/8 of
407 // the buckets are empty (meaning that many are filled with tombstones),
410 // The later case is tricky. For example, if we had one empty bucket with
411 // tons of tombstones, failing lookups (e.g. for insertion) would have to
412 // probe almost the entire table until it found the empty bucket. If the
413 // table completely filled with tombstones, no lookup would ever succeed,
414 // causing infinite loops in lookup.
415 unsigned NewNumEntries = getNumEntries() + 1;
416 unsigned NumBuckets = getNumBuckets();
417 if (NewNumEntries*4 >= NumBuckets*3) {
418 this->grow(NumBuckets * 2);
419 LookupBucketFor(Key, TheBucket);
420 NumBuckets = getNumBuckets();
422 if (NumBuckets-(NewNumEntries+getNumTombstones()) <= NumBuckets/8) {
423 this->grow(NumBuckets);
424 LookupBucketFor(Key, TheBucket);
427 // Only update the state after we've grown our bucket space appropriately
428 // so that when growing buckets we have self-consistent entry count.
429 incrementNumEntries();
431 // If we are writing over a tombstone, remember this.
432 if (!KeyInfoT::isEqual(TheBucket->first, getEmptyKey()))
433 decrementNumTombstones();
438 /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in
439 /// FoundBucket. If the bucket contains the key and a value, this returns
440 /// true, otherwise it returns a bucket with an empty marker or tombstone and
442 template<typename LookupKeyT>
443 bool LookupBucketFor(const LookupKeyT &Val,
444 const BucketT *&FoundBucket) const {
445 const BucketT *BucketsPtr = getBuckets();
446 const unsigned NumBuckets = getNumBuckets();
448 if (NumBuckets == 0) {
453 // FoundTombstone - Keep track of whether we find a tombstone while probing.
454 const BucketT *FoundTombstone = 0;
455 const KeyT EmptyKey = getEmptyKey();
456 const KeyT TombstoneKey = getTombstoneKey();
457 assert(!KeyInfoT::isEqual(Val, EmptyKey) &&
458 !KeyInfoT::isEqual(Val, TombstoneKey) &&
459 "Empty/Tombstone value shouldn't be inserted into map!");
461 unsigned BucketNo = getHashValue(Val) & (NumBuckets-1);
462 unsigned ProbeAmt = 1;
464 const BucketT *ThisBucket = BucketsPtr + BucketNo;
465 // Found Val's bucket? If so, return it.
466 if (KeyInfoT::isEqual(Val, ThisBucket->first)) {
467 FoundBucket = ThisBucket;
471 // If we found an empty bucket, the key doesn't exist in the set.
472 // Insert it and return the default value.
473 if (KeyInfoT::isEqual(ThisBucket->first, EmptyKey)) {
474 // If we've already seen a tombstone while probing, fill it in instead
475 // of the empty bucket we eventually probed to.
476 if (FoundTombstone) ThisBucket = FoundTombstone;
477 FoundBucket = FoundTombstone ? FoundTombstone : ThisBucket;
481 // If this is a tombstone, remember it. If Val ends up not in the map, we
482 // prefer to return it than something that would require more probing.
483 if (KeyInfoT::isEqual(ThisBucket->first, TombstoneKey) && !FoundTombstone)
484 FoundTombstone = ThisBucket; // Remember the first tombstone found.
486 // Otherwise, it's a hash collision or a tombstone, continue quadratic
488 BucketNo += ProbeAmt++;
489 BucketNo &= (NumBuckets-1);
493 template <typename LookupKeyT>
494 bool LookupBucketFor(const LookupKeyT &Val, BucketT *&FoundBucket) {
495 const BucketT *ConstFoundBucket;
496 bool Result = const_cast<const DenseMapBase *>(this)
497 ->LookupBucketFor(Val, ConstFoundBucket);
498 FoundBucket = const_cast<BucketT *>(ConstFoundBucket);
503 /// Return the approximate size (in bytes) of the actual map.
504 /// This is just the raw memory used by DenseMap.
505 /// If entries are pointers to objects, the size of the referenced objects
506 /// are not included.
507 size_t getMemorySize() const {
508 return getNumBuckets() * sizeof(BucketT);
512 template<typename KeyT, typename ValueT,
513 typename KeyInfoT = DenseMapInfo<KeyT> >
515 : public DenseMapBase<DenseMap<KeyT, ValueT, KeyInfoT>,
516 KeyT, ValueT, KeyInfoT> {
517 // Lift some types from the dependent base class into this class for
518 // simplicity of referring to them.
519 typedef DenseMapBase<DenseMap, KeyT, ValueT, KeyInfoT> BaseT;
520 typedef typename BaseT::BucketT BucketT;
521 friend class DenseMapBase<DenseMap, KeyT, ValueT, KeyInfoT>;
525 unsigned NumTombstones;
529 explicit DenseMap(unsigned NumInitBuckets = 0) {
530 init(NumInitBuckets);
533 DenseMap(const DenseMap &other) {
538 #if LLVM_USE_RVALUE_REFERENCES
539 DenseMap(DenseMap &&other) {
545 template<typename InputIt>
546 DenseMap(const InputIt &I, const InputIt &E) {
547 init(NextPowerOf2(std::distance(I, E)));
553 operator delete(Buckets);
556 void swap(DenseMap& RHS) {
557 std::swap(Buckets, RHS.Buckets);
558 std::swap(NumEntries, RHS.NumEntries);
559 std::swap(NumTombstones, RHS.NumTombstones);
560 std::swap(NumBuckets, RHS.NumBuckets);
563 DenseMap& operator=(const DenseMap& other) {
568 #if LLVM_USE_RVALUE_REFERENCES
569 DenseMap& operator=(DenseMap &&other) {
571 operator delete(Buckets);
578 void copyFrom(const DenseMap& other) {
580 operator delete(Buckets);
581 if (allocateBuckets(other.NumBuckets)) {
582 this->BaseT::copyFrom(other);
589 void init(unsigned InitBuckets) {
590 if (allocateBuckets(InitBuckets)) {
591 this->BaseT::initEmpty();
598 void grow(unsigned AtLeast) {
599 unsigned OldNumBuckets = NumBuckets;
600 BucketT *OldBuckets = Buckets;
602 allocateBuckets(std::max<unsigned>(64, NextPowerOf2(AtLeast)));
605 this->BaseT::initEmpty();
609 this->moveFromOldBuckets(OldBuckets, OldBuckets+OldNumBuckets);
611 // Free the old table.
612 operator delete(OldBuckets);
615 void shrink_and_clear() {
616 unsigned OldNumEntries = NumEntries;
619 // Reduce the number of buckets.
620 unsigned NewNumBuckets = 0;
622 NewNumBuckets = std::max(64, 1 << (Log2_32_Ceil(OldNumEntries) + 1));
623 if (NewNumBuckets == NumBuckets) {
624 this->BaseT::initEmpty();
628 operator delete(Buckets);
633 unsigned getNumEntries() const {
636 void setNumEntries(unsigned Num) {
640 unsigned getNumTombstones() const {
641 return NumTombstones;
643 void setNumTombstones(unsigned Num) {
647 BucketT *getBuckets() const {
651 unsigned getNumBuckets() const {
655 bool allocateBuckets(unsigned Num) {
657 if (NumBuckets == 0) {
662 Buckets = static_cast<BucketT*>(operator new(sizeof(BucketT) * NumBuckets));
667 template<typename KeyT, typename ValueT,
668 unsigned InlineBuckets = 4,
669 typename KeyInfoT = DenseMapInfo<KeyT> >
671 : public DenseMapBase<SmallDenseMap<KeyT, ValueT, InlineBuckets, KeyInfoT>,
672 KeyT, ValueT, KeyInfoT> {
673 // Lift some types from the dependent base class into this class for
674 // simplicity of referring to them.
675 typedef DenseMapBase<SmallDenseMap, KeyT, ValueT, KeyInfoT> BaseT;
676 typedef typename BaseT::BucketT BucketT;
677 friend class DenseMapBase<SmallDenseMap, KeyT, ValueT, KeyInfoT>;
680 unsigned NumEntries : 31;
681 unsigned NumTombstones;
688 /// A "union" of an inline bucket array and the struct representing
689 /// a large bucket. This union will be discriminated by the 'Small' bit.
690 AlignedCharArrayUnion<BucketT[InlineBuckets], LargeRep> storage;
693 explicit SmallDenseMap(unsigned NumInitBuckets = 0) {
694 init(NumInitBuckets);
697 SmallDenseMap(const SmallDenseMap &other) {
702 #if LLVM_USE_RVALUE_REFERENCES
703 SmallDenseMap(SmallDenseMap &&other) {
709 template<typename InputIt>
710 SmallDenseMap(const InputIt &I, const InputIt &E) {
711 init(NextPowerOf2(std::distance(I, E)));
720 void swap(SmallDenseMap& RHS) {
721 unsigned TmpNumEntries = RHS.NumEntries;
722 RHS.NumEntries = NumEntries;
723 NumEntries = TmpNumEntries;
724 std::swap(NumTombstones, RHS.NumTombstones);
726 const KeyT EmptyKey = this->getEmptyKey();
727 const KeyT TombstoneKey = this->getTombstoneKey();
728 if (Small && RHS.Small) {
729 // If we're swapping inline bucket arrays, we have to cope with some of
730 // the tricky bits of DenseMap's storage system: the buckets are not
731 // fully initialized. Thus we swap every key, but we may have
732 // a one-directional move of the value.
733 for (unsigned i = 0, e = InlineBuckets; i != e; ++i) {
734 BucketT *LHSB = &getInlineBuckets()[i],
735 *RHSB = &RHS.getInlineBuckets()[i];
736 bool hasLHSValue = (!KeyInfoT::isEqual(LHSB->first, EmptyKey) &&
737 !KeyInfoT::isEqual(LHSB->first, TombstoneKey));
738 bool hasRHSValue = (!KeyInfoT::isEqual(RHSB->first, EmptyKey) &&
739 !KeyInfoT::isEqual(RHSB->first, TombstoneKey));
740 if (hasLHSValue && hasRHSValue) {
741 // Swap together if we can...
742 std::swap(*LHSB, *RHSB);
745 // Swap separately and handle any assymetry.
746 std::swap(LHSB->first, RHSB->first);
748 new (&RHSB->second) ValueT(llvm_move(LHSB->second));
749 LHSB->second.~ValueT();
750 } else if (hasRHSValue) {
751 new (&LHSB->second) ValueT(llvm_move(RHSB->second));
752 RHSB->second.~ValueT();
757 if (!Small && !RHS.Small) {
758 std::swap(getLargeRep()->Buckets, RHS.getLargeRep()->Buckets);
759 std::swap(getLargeRep()->NumBuckets, RHS.getLargeRep()->NumBuckets);
763 SmallDenseMap &SmallSide = Small ? *this : RHS;
764 SmallDenseMap &LargeSide = Small ? RHS : *this;
766 // First stash the large side's rep and move the small side across.
767 LargeRep TmpRep = llvm_move(*LargeSide.getLargeRep());
768 LargeSide.getLargeRep()->~LargeRep();
769 LargeSide.Small = true;
770 // This is similar to the standard move-from-old-buckets, but the bucket
771 // count hasn't actually rotated in this case. So we have to carefully
772 // move construct the keys and values into their new locations, but there
773 // is no need to re-hash things.
774 for (unsigned i = 0, e = InlineBuckets; i != e; ++i) {
775 BucketT *NewB = &LargeSide.getInlineBuckets()[i],
776 *OldB = &SmallSide.getInlineBuckets()[i];
777 new (&NewB->first) KeyT(llvm_move(OldB->first));
779 if (!KeyInfoT::isEqual(NewB->first, EmptyKey) &&
780 !KeyInfoT::isEqual(NewB->first, TombstoneKey)) {
781 new (&NewB->second) ValueT(llvm_move(OldB->second));
782 OldB->second.~ValueT();
786 // The hard part of moving the small buckets across is done, just move
787 // the TmpRep into its new home.
788 SmallSide.Small = false;
789 new (SmallSide.getLargeRep()) LargeRep(llvm_move(TmpRep));
792 SmallDenseMap& operator=(const SmallDenseMap& other) {
797 #if LLVM_USE_RVALUE_REFERENCES
798 SmallDenseMap& operator=(SmallDenseMap &&other) {
807 void copyFrom(const SmallDenseMap& other) {
811 if (other.getNumBuckets() > InlineBuckets) {
813 allocateBuckets(other.getNumBuckets());
815 this->BaseT::copyFrom(other);
818 void init(unsigned InitBuckets) {
820 if (InitBuckets > InlineBuckets) {
822 new (getLargeRep()) LargeRep(allocateBuckets(InitBuckets));
824 this->BaseT::initEmpty();
827 void grow(unsigned AtLeast) {
828 if (AtLeast > InlineBuckets)
829 AtLeast = std::max<unsigned>(64, NextPowerOf2(AtLeast));
832 if (AtLeast <= InlineBuckets)
833 return; // Nothing to do.
835 // First move the inline buckets into a temporary storage.
836 AlignedCharArrayUnion<BucketT[InlineBuckets]> TmpStorage;
837 BucketT *TmpBegin = reinterpret_cast<BucketT *>(TmpStorage.buffer);
838 BucketT *TmpEnd = TmpBegin;
840 // Loop over the buckets, moving non-empty, non-tombstones into the
841 // temporary storage. Have the loop move the TmpEnd forward as it goes.
842 const KeyT EmptyKey = this->getEmptyKey();
843 const KeyT TombstoneKey = this->getTombstoneKey();
844 for (BucketT *P = getBuckets(), *E = P + InlineBuckets; P != E; ++P) {
845 if (!KeyInfoT::isEqual(P->first, EmptyKey) &&
846 !KeyInfoT::isEqual(P->first, TombstoneKey)) {
847 assert(size_t(TmpEnd - TmpBegin) < InlineBuckets &&
848 "Too many inline buckets!");
849 new (&TmpEnd->first) KeyT(llvm_move(P->first));
850 new (&TmpEnd->second) ValueT(llvm_move(P->second));
857 // Now make this map use the large rep, and move all the entries back
860 new (getLargeRep()) LargeRep(allocateBuckets(AtLeast));
861 this->moveFromOldBuckets(TmpBegin, TmpEnd);
865 LargeRep OldRep = llvm_move(*getLargeRep());
866 getLargeRep()->~LargeRep();
867 if (AtLeast <= InlineBuckets) {
870 new (getLargeRep()) LargeRep(allocateBuckets(AtLeast));
873 this->moveFromOldBuckets(OldRep.Buckets, OldRep.Buckets+OldRep.NumBuckets);
875 // Free the old table.
876 operator delete(OldRep.Buckets);
879 void shrink_and_clear() {
880 unsigned OldSize = this->size();
883 // Reduce the number of buckets.
884 unsigned NewNumBuckets = 0;
886 NewNumBuckets = 1 << (Log2_32_Ceil(OldSize) + 1);
887 if (NewNumBuckets > InlineBuckets && NewNumBuckets < 64u)
890 if ((Small && NewNumBuckets <= InlineBuckets) ||
891 (!Small && NewNumBuckets == getLargeRep()->NumBuckets)) {
892 this->BaseT::initEmpty();
901 unsigned getNumEntries() const {
904 void setNumEntries(unsigned Num) {
905 assert(Num < INT_MAX && "Cannot support more than INT_MAX entries");
909 unsigned getNumTombstones() const {
910 return NumTombstones;
912 void setNumTombstones(unsigned Num) {
916 const BucketT *getInlineBuckets() const {
918 // Note that this cast does not violate aliasing rules as we assert that
919 // the memory's dynamic type is the small, inline bucket buffer, and the
920 // 'storage.buffer' static type is 'char *'.
921 return reinterpret_cast<const BucketT *>(storage.buffer);
923 BucketT *getInlineBuckets() {
924 return const_cast<BucketT *>(
925 const_cast<const SmallDenseMap *>(this)->getInlineBuckets());
927 const LargeRep *getLargeRep() const {
929 // Note, same rule about aliasing as with getInlineBuckets.
930 return reinterpret_cast<const LargeRep *>(storage.buffer);
932 LargeRep *getLargeRep() {
933 return const_cast<LargeRep *>(
934 const_cast<const SmallDenseMap *>(this)->getLargeRep());
937 const BucketT *getBuckets() const {
938 return Small ? getInlineBuckets() : getLargeRep()->Buckets;
940 BucketT *getBuckets() {
941 return const_cast<BucketT *>(
942 const_cast<const SmallDenseMap *>(this)->getBuckets());
944 unsigned getNumBuckets() const {
945 return Small ? InlineBuckets : getLargeRep()->NumBuckets;
948 void deallocateBuckets() {
952 operator delete(getLargeRep()->Buckets);
953 getLargeRep()->~LargeRep();
956 LargeRep allocateBuckets(unsigned Num) {
957 assert(Num > InlineBuckets && "Must allocate more buckets than are inline");
959 static_cast<BucketT*>(operator new(sizeof(BucketT) * Num)), Num
965 template<typename KeyT, typename ValueT,
966 typename KeyInfoT, bool IsConst>
967 class DenseMapIterator {
968 typedef std::pair<KeyT, ValueT> Bucket;
969 typedef DenseMapIterator<KeyT, ValueT,
970 KeyInfoT, true> ConstIterator;
971 friend class DenseMapIterator<KeyT, ValueT, KeyInfoT, true>;
973 typedef ptrdiff_t difference_type;
974 typedef typename conditional<IsConst, const Bucket, Bucket>::type value_type;
975 typedef value_type *pointer;
976 typedef value_type &reference;
977 typedef std::forward_iterator_tag iterator_category;
981 DenseMapIterator() : Ptr(0), End(0) {}
983 DenseMapIterator(pointer Pos, pointer E, bool NoAdvance = false)
985 if (!NoAdvance) AdvancePastEmptyBuckets();
988 // If IsConst is true this is a converting constructor from iterator to
989 // const_iterator and the default copy constructor is used.
990 // Otherwise this is a copy constructor for iterator.
991 DenseMapIterator(const DenseMapIterator<KeyT, ValueT,
993 : Ptr(I.Ptr), End(I.End) {}
995 reference operator*() const {
998 pointer operator->() const {
1002 bool operator==(const ConstIterator &RHS) const {
1003 return Ptr == RHS.operator->();
1005 bool operator!=(const ConstIterator &RHS) const {
1006 return Ptr != RHS.operator->();
1009 inline DenseMapIterator& operator++() { // Preincrement
1011 AdvancePastEmptyBuckets();
1014 DenseMapIterator operator++(int) { // Postincrement
1015 DenseMapIterator tmp = *this; ++*this; return tmp;
1019 void AdvancePastEmptyBuckets() {
1020 const KeyT Empty = KeyInfoT::getEmptyKey();
1021 const KeyT Tombstone = KeyInfoT::getTombstoneKey();
1023 while (Ptr != End &&
1024 (KeyInfoT::isEqual(Ptr->first, Empty) ||
1025 KeyInfoT::isEqual(Ptr->first, Tombstone)))
1030 template<typename KeyT, typename ValueT, typename KeyInfoT>
1031 static inline size_t
1032 capacity_in_bytes(const DenseMap<KeyT, ValueT, KeyInfoT> &X) {
1033 return X.getMemorySize();
1036 } // end namespace llvm