DenseMap.h revision 345b378309eabd74a7a43f095dca9a4894bc371e
16e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner//===- llvm/ADT/DenseMap.h - Dense probed hash table ------------*- C++ -*-===// 26e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// 36e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// The LLVM Compiler Infrastructure 46e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// 57ed47a13356daed2a34cd2209a31f92552e3bdd8Chris Lattner// This file is distributed under the University of Illinois Open Source 67ed47a13356daed2a34cd2209a31f92552e3bdd8Chris Lattner// License. See LICENSE.TXT for details. 76e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// 86e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner//===----------------------------------------------------------------------===// 96e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// 106e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// This file defines the DenseMap class. 116e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// 126e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner//===----------------------------------------------------------------------===// 136e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 146e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner#ifndef LLVM_ADT_DENSEMAP_H 156e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner#define LLVM_ADT_DENSEMAP_H 166e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 17398b40671b13018f88371b74822fa8ee2638577eOwen Anderson#include "llvm/Support/MathExtras.h" 1881cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin#include "llvm/Support/PointerLikeTypeTraits.h" 1981cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin#include "llvm/Support/type_traits.h" 20fb3af88ba75898896714d49c608b8daa4f106636Dan Gohman#include "llvm/ADT/DenseMapInfo.h" 21724f6751442e2006856a9365ef3d3bc6f1b31c98Chris Lattner#include <iterator> 22724f6751442e2006856a9365ef3d3bc6f1b31c98Chris Lattner#include <new> 23724f6751442e2006856a9365ef3d3bc6f1b31c98Chris Lattner#include <utility> 246e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner#include <cassert> 25345b378309eabd74a7a43f095dca9a4894bc371eDuncan Sands#include <cstddef> 26d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#include <cstring> 276e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 286e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnernamespace llvm { 293a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 303a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukmantemplate<typename KeyT, typename ValueT, 3176c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner typename KeyInfoT = DenseMapInfo<KeyT>, 3281cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin typename ValueInfoT = DenseMapInfo<ValueT>, bool IsConst = false> 33f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattnerclass DenseMapIterator; 346e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 35a76b1febd4fd258e8054395adedcbd477668d956Chris Lattnertemplate<typename KeyT, typename ValueT, 3676c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner typename KeyInfoT = DenseMapInfo<KeyT>, 3776c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner typename ValueInfoT = DenseMapInfo<ValueT> > 386e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnerclass DenseMap { 39f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner typedef std::pair<KeyT, ValueT> BucketT; 406e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned NumBuckets; 416e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *Buckets; 423a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 436e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned NumEntries; 4404a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner unsigned NumTombstones; 456e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnerpublic: 4613e781ebe7a39e008dd5e5de78983e095e8a1d02David Greene typedef KeyT key_type; 4713e781ebe7a39e008dd5e5de78983e095e8a1d02David Greene typedef ValueT mapped_type; 48aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek typedef BucketT value_type; 493a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 506a363782fe4ecba4f0a72c2edf03596004470c4aChris Lattner DenseMap(const DenseMap &other) { 5167280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumBuckets = 0; 5267280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson CopyFrom(other); 5367280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 543a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 555a5f6b6e38b7155200903816f22501cce4ca36a7Chris Lattner explicit DenseMap(unsigned NumInitBuckets = 64) { 566e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner init(NumInitBuckets); 576e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 583a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 596a363782fe4ecba4f0a72c2edf03596004470c4aChris Lattner template<typename InputIt> 606a363782fe4ecba4f0a72c2edf03596004470c4aChris Lattner DenseMap(const InputIt &I, const InputIt &E) { 616a363782fe4ecba4f0a72c2edf03596004470c4aChris Lattner init(64); 626a363782fe4ecba4f0a72c2edf03596004470c4aChris Lattner insert(I, E); 636a363782fe4ecba4f0a72c2edf03596004470c4aChris Lattner } 646a363782fe4ecba4f0a72c2edf03596004470c4aChris Lattner 656e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner ~DenseMap() { 666e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); 676e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { 6805831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(P->first, EmptyKey) && 6905831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(P->first, TombstoneKey)) 70f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner P->second.~ValueT(); 71f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner P->first.~KeyT(); 726e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 73d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#ifndef NDEBUG 74d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin memset(Buckets, 0x5a, sizeof(BucketT)*NumBuckets); 75d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#endif 7608c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman operator delete(Buckets); 776e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 783a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 79a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner typedef DenseMapIterator<KeyT, ValueT, KeyInfoT> iterator; 8081cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin typedef DenseMapIterator<KeyT, ValueT, 8181cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin KeyInfoT, ValueInfoT, true> const_iterator; 8270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline iterator begin() { 83b843d9f833aa474ae700363a445b7409665c4a6eJakob Stoklund Olesen // When the map is empty, avoid the overhead of AdvancePastEmptyBuckets(). 84b843d9f833aa474ae700363a445b7409665c4a6eJakob Stoklund Olesen return empty() ? end() : iterator(Buckets, Buckets+NumBuckets); 8570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 8670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline iterator end() { 87a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return iterator(Buckets+NumBuckets, Buckets+NumBuckets); 8870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 8970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline const_iterator begin() const { 90b843d9f833aa474ae700363a445b7409665c4a6eJakob Stoklund Olesen return empty() ? end() : const_iterator(Buckets, Buckets+NumBuckets); 9170a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 9270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline const_iterator end() const { 93a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return const_iterator(Buckets+NumBuckets, Buckets+NumBuckets); 9470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 953a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 9670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner bool empty() const { return NumEntries == 0; } 976e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned size() const { return NumEntries; } 98d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin 99d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin /// Grow the densemap so that it has at least Size buckets. Does not shrink 100d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin void resize(size_t Size) { grow(Size); } 1013a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 1026e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner void clear() { 10332859c71d6ba9cd5e38662611a73d82335f4ba41Chris Lattner if (NumEntries == 0 && NumTombstones == 0) return; 10432859c71d6ba9cd5e38662611a73d82335f4ba41Chris Lattner 10542e4bdf2577946380ce1529d5716e48b33d4186dChris Lattner // If the capacity of the array is huge, and the # elements used is small, 10642e4bdf2577946380ce1529d5716e48b33d4186dChris Lattner // shrink the array. 1076ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson if (NumEntries * 4 < NumBuckets && NumBuckets > 64) { 1086ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson shrink_and_clear(); 1096ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson return; 1106ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 1113a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 1126e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); 1136e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { 11405831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(P->first, EmptyKey)) { 11505831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(P->first, TombstoneKey)) { 1167b54452c84e478ab4d49ac08759ca4ec1badf2b2Chris Lattner P->second.~ValueT(); 1177b54452c84e478ab4d49ac08759ca4ec1badf2b2Chris Lattner --NumEntries; 1187b54452c84e478ab4d49ac08759ca4ec1badf2b2Chris Lattner } 119f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner P->first = EmptyKey; 1206e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 1216e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 1226e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner assert(NumEntries == 0 && "Node count imbalance!"); 12304a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner NumTombstones = 0; 1246e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 1256ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 1266e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// count - Return true if the specified key is in the map. 1276e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner bool count(const KeyT &Val) const { 1286e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *TheBucket; 1296e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner return LookupBucketFor(Val, TheBucket); 1306e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 1313a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 132569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner iterator find(const KeyT &Val) { 13370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner BucketT *TheBucket; 13470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner if (LookupBucketFor(Val, TheBucket)) 13570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return iterator(TheBucket, Buckets+NumBuckets); 13670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return end(); 13770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 138569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner const_iterator find(const KeyT &Val) const { 139569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner BucketT *TheBucket; 140569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner if (LookupBucketFor(Val, TheBucket)) 141569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner return const_iterator(TheBucket, Buckets+NumBuckets); 142569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner return end(); 143569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner } 1443a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 1457b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar /// lookup - Return the entry for the specified key, or a default 1467b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar /// constructed value if no such entry exists. 1477b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar ValueT lookup(const KeyT &Val) const { 1487b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar BucketT *TheBucket; 1497b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar if (LookupBucketFor(Val, TheBucket)) 1507b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar return TheBucket->second; 1517b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar return ValueT(); 1527b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar } 1537b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar 154127445818efd810b138dd5362129ab3c7f8b9963Torok Edwin // Inserts key,value pair into the map if the key isn't already in the map. 155127445818efd810b138dd5362129ab3c7f8b9963Torok Edwin // If the key is already in the map, it returns false and doesn't update the 156127445818efd810b138dd5362129ab3c7f8b9963Torok Edwin // value. 1576b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { 15828f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner BucketT *TheBucket; 15928f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner if (LookupBucketFor(KV.first, TheBucket)) 1606b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman return std::make_pair(iterator(TheBucket, Buckets+NumBuckets), 1616b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman false); // Already in map. 1623a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 16328f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner // Otherwise, insert the new element. 1646b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman TheBucket = InsertIntoBucket(KV.first, KV.second, TheBucket); 1656b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman return std::make_pair(iterator(TheBucket, Buckets+NumBuckets), 1666b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman true); 16728f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner } 1683a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 169b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner /// insert - Range insertion of pairs. 170b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner template<typename InputIt> 171b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner void insert(InputIt I, InputIt E) { 172b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner for (; I != E; ++I) 173b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner insert(*I); 174b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner } 175b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner 1763a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 17770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner bool erase(const KeyT &Val) { 17870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner BucketT *TheBucket; 17970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner if (!LookupBucketFor(Val, TheBucket)) 18070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return false; // not in map. 18170a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner 18270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->second.~ValueT(); 18370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->first = getTombstoneKey(); 18470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner --NumEntries; 18504a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner ++NumTombstones; 18670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return true; 18770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 18870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner bool erase(iterator I) { 18970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner BucketT *TheBucket = &*I; 19070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->second.~ValueT(); 19170a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->first = getTombstoneKey(); 19270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner --NumEntries; 19304a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner ++NumTombstones; 19470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return true; 19570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 196aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek 197ccb4f2d813380d8cf139062b8c829e4b8b322c0dAndrew Lenharth void swap(DenseMap& RHS) { 198ccb4f2d813380d8cf139062b8c829e4b8b322c0dAndrew Lenharth std::swap(NumBuckets, RHS.NumBuckets); 199ccb4f2d813380d8cf139062b8c829e4b8b322c0dAndrew Lenharth std::swap(Buckets, RHS.Buckets); 200ccb4f2d813380d8cf139062b8c829e4b8b322c0dAndrew Lenharth std::swap(NumEntries, RHS.NumEntries); 201ccb4f2d813380d8cf139062b8c829e4b8b322c0dAndrew Lenharth std::swap(NumTombstones, RHS.NumTombstones); 202ccb4f2d813380d8cf139062b8c829e4b8b322c0dAndrew Lenharth } 203ccb4f2d813380d8cf139062b8c829e4b8b322c0dAndrew Lenharth 204aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek value_type& FindAndConstruct(const KeyT &Key) { 2056e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *TheBucket; 20628f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner if (LookupBucketFor(Key, TheBucket)) 207aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek return *TheBucket; 2083a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 209aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek return *InsertIntoBucket(Key, ValueT(), TheBucket); 210aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek } 2113a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 212aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek ValueT &operator[](const KeyT &Key) { 213aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek return FindAndConstruct(Key).second; 21428f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner } 2153a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 21667280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson DenseMap& operator=(const DenseMap& other) { 21767280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson CopyFrom(other); 2183d345631db71174ffc4997a88c09f21eb9ed052bOwen Anderson return *this; 21967280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 2203a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 221bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner /// isPointerIntoBucketsArray - Return true if the specified pointer points 222bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner /// somewhere into the DenseMap's array of buckets (i.e. either to a key or 223bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner /// value in the DenseMap). 224bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner bool isPointerIntoBucketsArray(const void *Ptr) const { 225bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner return Ptr >= Buckets && Ptr < Buckets+NumBuckets; 226bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner } 227bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner 228bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner /// getPointerIntoBucketsArray() - Return an opaque pointer into the buckets 229bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner /// array. In conjunction with the previous method, this can be used to 230bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner /// determine whether an insertion caused the DenseMap to reallocate. 231bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner const void *getPointerIntoBucketsArray() const { return Buckets; } 232bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner 23328f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattnerprivate: 23467280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson void CopyFrom(const DenseMap& other) { 2354bbf4ee1491637c247e195e19e3e4a8ee5ad72faChris Lattner if (NumBuckets != 0 && 2364bbf4ee1491637c247e195e19e3e4a8ee5ad72faChris Lattner (!isPodLike<KeyInfoT>::value || !isPodLike<ValueInfoT>::value)) { 23767280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); 23867280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { 23905831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(P->first, EmptyKey) && 24005831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(P->first, TombstoneKey)) 24167280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson P->second.~ValueT(); 24267280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson P->first.~KeyT(); 24367280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 24467280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 2453a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 24667280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumEntries = other.NumEntries; 24767280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumTombstones = other.NumTombstones; 2483a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 249d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin if (NumBuckets) { 250d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#ifndef NDEBUG 251d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin memset(Buckets, 0x5a, sizeof(BucketT)*NumBuckets); 252d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#endif 25308c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman operator delete(Buckets); 254d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin } 25508c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman Buckets = static_cast<BucketT*>(operator new(sizeof(BucketT) * 25608c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman other.NumBuckets)); 2573a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 2584bbf4ee1491637c247e195e19e3e4a8ee5ad72faChris Lattner if (isPodLike<KeyInfoT>::value && isPodLike<ValueInfoT>::value) 2599544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson memcpy(Buckets, other.Buckets, other.NumBuckets * sizeof(BucketT)); 2609544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson else 2619544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson for (size_t i = 0; i < other.NumBuckets; ++i) { 2622b7470eb54880ce7f74469d6e09eaf7f0864f8abOwen Anderson new (&Buckets[i].first) KeyT(other.Buckets[i].first); 26305831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(Buckets[i].first, getEmptyKey()) && 26405831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(Buckets[i].first, getTombstoneKey())) 2654938d347723d452786c1a7c1d1b9ec79121b0040Owen Anderson new (&Buckets[i].second) ValueT(other.Buckets[i].second); 2669544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson } 26767280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumBuckets = other.NumBuckets; 26867280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 2693a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 27028f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner BucketT *InsertIntoBucket(const KeyT &Key, const ValueT &Value, 27128f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner BucketT *TheBucket) { 27204a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // If the load of the hash table is more than 3/4, or if fewer than 1/8 of 27304a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // the buckets are empty (meaning that many are filled with tombstones), 27404a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // grow the table. 27504a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // 27604a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // The later case is tricky. For example, if we had one empty bucket with 27704a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // tons of tombstones, failing lookups (e.g. for insertion) would have to 27804a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // probe almost the entire table until it found the empty bucket. If the 27904a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // table completely filled with tombstones, no lookup would ever succeed, 28004a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // causing infinite loops in lookup. 281f0e4cac7ebdee07639bd1fc3eadf204f45868556Stuart Hastings ++NumEntries; 28204a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner if (NumEntries*4 >= NumBuckets*3 || 2833a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman NumBuckets-(NumEntries+NumTombstones) < NumBuckets/8) { 284d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin this->grow(NumBuckets * 2); 28528f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner LookupBucketFor(Key, TheBucket); 2866e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 2873a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 28804a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // If we are writing over a tombstone, remember this. 28905831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(TheBucket->first, getEmptyKey())) 29004a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner --NumTombstones; 2913a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 29228f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner TheBucket->first = Key; 29328f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner new (&TheBucket->second) ValueT(Value); 29428f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner return TheBucket; 2956e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 29628f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner 29770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner static unsigned getHashValue(const KeyT &Val) { 298a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return KeyInfoT::getHashValue(Val); 2996e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 30070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner static const KeyT getEmptyKey() { 301a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return KeyInfoT::getEmptyKey(); 30270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 30370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner static const KeyT getTombstoneKey() { 304a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return KeyInfoT::getTombstoneKey(); 3056e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3063a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3076e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in 3086e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// FoundBucket. If the bucket contains the key and a value, this returns 3096e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// true, otherwise it returns a bucket with an empty marker or tombstone and 3106e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// returns false. 3116e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner bool LookupBucketFor(const KeyT &Val, BucketT *&FoundBucket) const { 3126e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned BucketNo = getHashValue(Val); 3136e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned ProbeAmt = 1; 3146e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *BucketsPtr = Buckets; 3153a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3166e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // FoundTombstone - Keep track of whether we find a tombstone while probing. 3176e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *FoundTombstone = 0; 3186e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(); 3196e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT TombstoneKey = getTombstoneKey(); 32005831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner assert(!KeyInfoT::isEqual(Val, EmptyKey) && 32105831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(Val, TombstoneKey) && 3226e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner "Empty/Tombstone value shouldn't be inserted into map!"); 3233a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3246e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner while (1) { 3256e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *ThisBucket = BucketsPtr + (BucketNo & (NumBuckets-1)); 3266e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Found Val's bucket? If so, return it. 32776c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner if (KeyInfoT::isEqual(ThisBucket->first, Val)) { 3286e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner FoundBucket = ThisBucket; 3296e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner return true; 3306e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3313a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3326e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // If we found an empty bucket, the key doesn't exist in the set. 3336e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Insert it and return the default value. 33476c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner if (KeyInfoT::isEqual(ThisBucket->first, EmptyKey)) { 3356e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // If we've already seen a tombstone while probing, fill it in instead 3366e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // of the empty bucket we eventually probed to. 3376e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner if (FoundTombstone) ThisBucket = FoundTombstone; 3386e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner FoundBucket = FoundTombstone ? FoundTombstone : ThisBucket; 3396e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner return false; 3406e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3413a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3426e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // If this is a tombstone, remember it. If Val ends up not in the map, we 3436e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // prefer to return it than something that would require more probing. 34476c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner if (KeyInfoT::isEqual(ThisBucket->first, TombstoneKey) && !FoundTombstone) 3456e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner FoundTombstone = ThisBucket; // Remember the first tombstone found. 3463a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3476e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Otherwise, it's a hash collision or a tombstone, continue quadratic 3486e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // probing. 3496e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketNo += ProbeAmt++; 3506e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3516e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3526e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3536e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner void init(unsigned InitBuckets) { 3546e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner NumEntries = 0; 35504a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner NumTombstones = 0; 3566e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner NumBuckets = InitBuckets; 357ae9f3a3b7c915f725aef5a7250e88eaeddda03c6Anton Korobeynikov assert(InitBuckets && (InitBuckets & (InitBuckets-1)) == 0 && 3586e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner "# initial buckets must be a power of two!"); 35908c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman Buckets = static_cast<BucketT*>(operator new(sizeof(BucketT)*InitBuckets)); 3606e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Initialize all the keys to EmptyKey. 3616e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(); 3626e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (unsigned i = 0; i != InitBuckets; ++i) 363f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner new (&Buckets[i].first) KeyT(EmptyKey); 3646e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3653a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 366d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin void grow(unsigned AtLeast) { 3676e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned OldNumBuckets = NumBuckets; 3686e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *OldBuckets = Buckets; 3693a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3706e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Double the number of buckets. 371fcb0ee8ffeae12aa866f4e7da12a4dd2a1d0dc35Junjie Gu while (NumBuckets < AtLeast) 372d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin NumBuckets <<= 1; 37304a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner NumTombstones = 0; 37408c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman Buckets = static_cast<BucketT*>(operator new(sizeof(BucketT)*NumBuckets)); 3756e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3766e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Initialize all the keys to EmptyKey. 3776e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(); 3786e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (unsigned i = 0, e = NumBuckets; i != e; ++i) 379f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner new (&Buckets[i].first) KeyT(EmptyKey); 3806e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3816e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Insert all the old elements. 3826e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT TombstoneKey = getTombstoneKey(); 3836e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (BucketT *B = OldBuckets, *E = OldBuckets+OldNumBuckets; B != E; ++B) { 38405831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(B->first, EmptyKey) && 38505831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(B->first, TombstoneKey)) { 3866e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Insert the key/value into the new table. 3876e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *DestBucket; 388f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner bool FoundVal = LookupBucketFor(B->first, DestBucket); 389137d4b253384adce88bfa2a1c37695d90f0a9d6cChris Lattner FoundVal = FoundVal; // silence warning. 3906e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner assert(!FoundVal && "Key already in new map?"); 391f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner DestBucket->first = B->first; 392f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner new (&DestBucket->second) ValueT(B->second); 3933a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3946e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Free the value. 395f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner B->second.~ValueT(); 3966e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 397f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner B->first.~KeyT(); 3986e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3993a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 400d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#ifndef NDEBUG 401d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin memset(OldBuckets, 0x5a, sizeof(BucketT)*OldNumBuckets); 402d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#endif 4036e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Free the old table. 40408c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman operator delete(OldBuckets); 4056e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 4063a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 4076ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson void shrink_and_clear() { 4086ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson unsigned OldNumBuckets = NumBuckets; 4096ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson BucketT *OldBuckets = Buckets; 4103a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 411398b40671b13018f88371b74822fa8ee2638577eOwen Anderson // Reduce the number of buckets. 412398b40671b13018f88371b74822fa8ee2638577eOwen Anderson NumBuckets = NumEntries > 32 ? 1 << (Log2_32_Ceil(NumEntries) + 1) 413398b40671b13018f88371b74822fa8ee2638577eOwen Anderson : 64; 4146ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson NumTombstones = 0; 41508c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman Buckets = static_cast<BucketT*>(operator new(sizeof(BucketT)*NumBuckets)); 4166ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 4176ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Initialize all the keys to EmptyKey. 4186ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson const KeyT EmptyKey = getEmptyKey(); 4196ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson for (unsigned i = 0, e = NumBuckets; i != e; ++i) 4206ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson new (&Buckets[i].first) KeyT(EmptyKey); 4216ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 4226ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Free the old buckets. 4236ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson const KeyT TombstoneKey = getTombstoneKey(); 4246ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson for (BucketT *B = OldBuckets, *E = OldBuckets+OldNumBuckets; B != E; ++B) { 42505831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(B->first, EmptyKey) && 42605831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(B->first, TombstoneKey)) { 4276ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Free the value. 4286ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson B->second.~ValueT(); 4296ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 4306ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson B->first.~KeyT(); 4316ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 4323a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 433d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#ifndef NDEBUG 434d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin memset(OldBuckets, 0x5a, sizeof(BucketT)*OldNumBuckets); 435d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#endif 4366ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Free the old table. 43708c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman operator delete(OldBuckets); 4383a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 4396ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson NumEntries = 0; 4406ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 4416e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner}; 4426e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 44381cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskintemplate<typename KeyT, typename ValueT, 44481cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin typename KeyInfoT, typename ValueInfoT, bool IsConst> 44581cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskinclass DenseMapIterator { 44681cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin typedef std::pair<KeyT, ValueT> Bucket; 44781cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin typedef DenseMapIterator<KeyT, ValueT, 44881cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin KeyInfoT, ValueInfoT, true> ConstIterator; 44981cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin friend class DenseMapIterator<KeyT, ValueT, KeyInfoT, ValueInfoT, true>; 45081cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskinpublic: 45181cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin typedef ptrdiff_t difference_type; 45281cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin typedef typename conditional<IsConst, const Bucket, Bucket>::type value_type; 45381cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin typedef value_type *pointer; 45481cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin typedef value_type &reference; 45581cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin typedef std::forward_iterator_tag iterator_category; 45681cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskinprivate: 45781cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin pointer Ptr, End; 458f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattnerpublic: 459a9ad04191cb56c42944b17980b8b2bb2afe11ab2Dan Gohman DenseMapIterator() : Ptr(0), End(0) {} 46013e781ebe7a39e008dd5e5de78983e095e8a1d02David Greene 46181cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin DenseMapIterator(pointer Pos, pointer E) : Ptr(Pos), End(E) { 462f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner AdvancePastEmptyBuckets(); 463f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 4643a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 46581cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin // If IsConst is true this is a converting constructor from iterator to 46681cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin // const_iterator and the default copy constructor is used. 46781cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin // Otherwise this is a copy constructor for iterator. 46881cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin DenseMapIterator(const DenseMapIterator<KeyT, ValueT, 46981cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin KeyInfoT, ValueInfoT, false>& I) 47081cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin : Ptr(I.Ptr), End(I.End) {} 47181cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin 47281cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin reference operator*() const { 47381cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin return *Ptr; 474f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 47581cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin pointer operator->() const { 47681cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin return Ptr; 477f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 4783a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 47981cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin bool operator==(const ConstIterator &RHS) const { 48081cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin return Ptr == RHS.operator->(); 481f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 48281cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin bool operator!=(const ConstIterator &RHS) const { 48381cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin return Ptr != RHS.operator->(); 484f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 4853a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 4864ab74cdc124af6b4f57c2d2d09548e01d64a1f34Jeffrey Yasskin inline DenseMapIterator& operator++() { // Preincrement 487f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner ++Ptr; 488f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner AdvancePastEmptyBuckets(); 489f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner return *this; 490f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 4914ab74cdc124af6b4f57c2d2d09548e01d64a1f34Jeffrey Yasskin DenseMapIterator operator++(int) { // Postincrement 492f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner DenseMapIterator tmp = *this; ++*this; return tmp; 493f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 4943a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 495f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattnerprivate: 496f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner void AdvancePastEmptyBuckets() { 497a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner const KeyT Empty = KeyInfoT::getEmptyKey(); 498a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner const KeyT Tombstone = KeyInfoT::getTombstoneKey(); 499f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 5003a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman while (Ptr != End && 50176c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner (KeyInfoT::isEqual(Ptr->first, Empty) || 50276c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner KeyInfoT::isEqual(Ptr->first, Tombstone))) 503f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner ++Ptr; 504f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 505f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner}; 506f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 5076e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner} // end namespace llvm 5086e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 5096e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner#endif 510