DenseMap.h revision 127445818efd810b138dd5362129ab3c7f8b9963
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 17f341a47d10501bc69b5d4d2217992bb6e08668d8Chris Lattner#include "llvm/Support/PointerLikeTypeTraits.h" 18398b40671b13018f88371b74822fa8ee2638577eOwen Anderson#include "llvm/Support/MathExtras.h" 19fb3af88ba75898896714d49c608b8daa4f106636Dan Gohman#include "llvm/ADT/DenseMapInfo.h" 20724f6751442e2006856a9365ef3d3bc6f1b31c98Chris Lattner#include <iterator> 21724f6751442e2006856a9365ef3d3bc6f1b31c98Chris Lattner#include <new> 22724f6751442e2006856a9365ef3d3bc6f1b31c98Chris Lattner#include <utility> 236e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner#include <cassert> 24d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#include <cstring> 256e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 266e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnernamespace llvm { 273a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 283a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukmantemplate<typename KeyT, typename ValueT, 2976c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner typename KeyInfoT = DenseMapInfo<KeyT>, 3076c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner typename ValueInfoT = DenseMapInfo<ValueT> > 31f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattnerclass DenseMapIterator; 32a76b1febd4fd258e8054395adedcbd477668d956Chris Lattnertemplate<typename KeyT, typename ValueT, 3376c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner typename KeyInfoT = DenseMapInfo<KeyT>, 3476c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner typename ValueInfoT = DenseMapInfo<ValueT> > 3570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattnerclass DenseMapConstIterator; 366e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 37a76b1febd4fd258e8054395adedcbd477668d956Chris Lattnertemplate<typename KeyT, typename ValueT, 3876c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner typename KeyInfoT = DenseMapInfo<KeyT>, 3976c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner typename ValueInfoT = DenseMapInfo<ValueT> > 406e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnerclass DenseMap { 41f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner typedef std::pair<KeyT, ValueT> BucketT; 426e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned NumBuckets; 436e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *Buckets; 443a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 456e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned NumEntries; 4604a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner unsigned NumTombstones; 476e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnerpublic: 4813e781ebe7a39e008dd5e5de78983e095e8a1d02David Greene typedef KeyT key_type; 4913e781ebe7a39e008dd5e5de78983e095e8a1d02David Greene typedef ValueT mapped_type; 50aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek typedef BucketT value_type; 513a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 5267280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson DenseMap(const DenseMap& other) { 5367280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumBuckets = 0; 5467280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson CopyFrom(other); 5567280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 563a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 575a5f6b6e38b7155200903816f22501cce4ca36a7Chris Lattner explicit DenseMap(unsigned NumInitBuckets = 64) { 586e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner init(NumInitBuckets); 596e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 603a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 616e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner ~DenseMap() { 626e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); 636e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { 6405831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(P->first, EmptyKey) && 6505831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(P->first, TombstoneKey)) 66f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner P->second.~ValueT(); 67f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner P->first.~KeyT(); 686e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 69d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#ifndef NDEBUG 70d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin memset(Buckets, 0x5a, sizeof(BucketT)*NumBuckets); 71d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#endif 7208c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman operator delete(Buckets); 736e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 743a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 75a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner typedef DenseMapIterator<KeyT, ValueT, KeyInfoT> iterator; 76a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner typedef DenseMapConstIterator<KeyT, ValueT, KeyInfoT> const_iterator; 7770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline iterator begin() { 78a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return iterator(Buckets, Buckets+NumBuckets); 7970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 8070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline iterator end() { 81a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return iterator(Buckets+NumBuckets, Buckets+NumBuckets); 8270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 8370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline const_iterator begin() const { 84a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return const_iterator(Buckets, Buckets+NumBuckets); 8570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 8670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline const_iterator end() const { 87a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return const_iterator(Buckets+NumBuckets, Buckets+NumBuckets); 8870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 893a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 9070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner bool empty() const { return NumEntries == 0; } 916e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned size() const { return NumEntries; } 92d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin 93d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin /// Grow the densemap so that it has at least Size buckets. Does not shrink 94d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin void resize(size_t Size) { grow(Size); } 953a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 966e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner void clear() { 9732859c71d6ba9cd5e38662611a73d82335f4ba41Chris Lattner if (NumEntries == 0 && NumTombstones == 0) return; 9832859c71d6ba9cd5e38662611a73d82335f4ba41Chris Lattner 9942e4bdf2577946380ce1529d5716e48b33d4186dChris Lattner // If the capacity of the array is huge, and the # elements used is small, 10042e4bdf2577946380ce1529d5716e48b33d4186dChris Lattner // shrink the array. 1016ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson if (NumEntries * 4 < NumBuckets && NumBuckets > 64) { 1026ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson shrink_and_clear(); 1036ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson return; 1046ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 1053a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 1066e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); 1076e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { 10805831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(P->first, EmptyKey)) { 10905831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(P->first, TombstoneKey)) { 1107b54452c84e478ab4d49ac08759ca4ec1badf2b2Chris Lattner P->second.~ValueT(); 1117b54452c84e478ab4d49ac08759ca4ec1badf2b2Chris Lattner --NumEntries; 1127b54452c84e478ab4d49ac08759ca4ec1badf2b2Chris Lattner } 113f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner P->first = EmptyKey; 1146e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 1156e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 1166e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner assert(NumEntries == 0 && "Node count imbalance!"); 11704a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner NumTombstones = 0; 1186e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 1196ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 1206e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// count - Return true if the specified key is in the map. 1216e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner bool count(const KeyT &Val) const { 1226e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *TheBucket; 1236e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner return LookupBucketFor(Val, TheBucket); 1246e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 1253a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 126569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner iterator find(const KeyT &Val) { 12770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner BucketT *TheBucket; 12870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner if (LookupBucketFor(Val, TheBucket)) 12970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return iterator(TheBucket, Buckets+NumBuckets); 13070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return end(); 13170a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 132569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner const_iterator find(const KeyT &Val) const { 133569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner BucketT *TheBucket; 134569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner if (LookupBucketFor(Val, TheBucket)) 135569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner return const_iterator(TheBucket, Buckets+NumBuckets); 136569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner return end(); 137569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner } 1383a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 1397b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar /// lookup - Return the entry for the specified key, or a default 1407b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar /// constructed value if no such entry exists. 1417b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar ValueT lookup(const KeyT &Val) const { 1427b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar BucketT *TheBucket; 1437b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar if (LookupBucketFor(Val, TheBucket)) 1447b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar return TheBucket->second; 1457b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar return ValueT(); 1467b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar } 1477b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar 148127445818efd810b138dd5362129ab3c7f8b9963Torok Edwin // Inserts key,value pair into the map if the key isn't already in the map. 149127445818efd810b138dd5362129ab3c7f8b9963Torok Edwin // If the key is already in the map, it returns false and doesn't update the 150127445818efd810b138dd5362129ab3c7f8b9963Torok Edwin // value. 1516b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { 15228f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner BucketT *TheBucket; 15328f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner if (LookupBucketFor(KV.first, TheBucket)) 1546b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman return std::make_pair(iterator(TheBucket, Buckets+NumBuckets), 1556b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman false); // Already in map. 1563a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 15728f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner // Otherwise, insert the new element. 1586b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman TheBucket = InsertIntoBucket(KV.first, KV.second, TheBucket); 1596b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman return std::make_pair(iterator(TheBucket, Buckets+NumBuckets), 1606b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman true); 16128f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner } 1623a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 163b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner /// insert - Range insertion of pairs. 164b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner template<typename InputIt> 165b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner void insert(InputIt I, InputIt E) { 166b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner for (; I != E; ++I) 167b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner insert(*I); 168b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner } 169b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner 1703a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 17170a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner bool erase(const KeyT &Val) { 17270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner BucketT *TheBucket; 17370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner if (!LookupBucketFor(Val, TheBucket)) 17470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return false; // not in map. 17570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner 17670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->second.~ValueT(); 17770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->first = getTombstoneKey(); 17870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner --NumEntries; 17904a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner ++NumTombstones; 18070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return true; 18170a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 18270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner bool erase(iterator I) { 18370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner BucketT *TheBucket = &*I; 18470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->second.~ValueT(); 18570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->first = getTombstoneKey(); 18670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner --NumEntries; 18704a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner ++NumTombstones; 18870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return true; 18970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 190aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek 191aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek value_type& FindAndConstruct(const KeyT &Key) { 1926e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *TheBucket; 19328f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner if (LookupBucketFor(Key, TheBucket)) 194aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek return *TheBucket; 1953a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 196aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek return *InsertIntoBucket(Key, ValueT(), TheBucket); 197aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek } 1983a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 199aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek ValueT &operator[](const KeyT &Key) { 200aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek return FindAndConstruct(Key).second; 20128f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner } 2023a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 20367280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson DenseMap& operator=(const DenseMap& other) { 20467280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson CopyFrom(other); 2053d345631db71174ffc4997a88c09f21eb9ed052bOwen Anderson return *this; 20667280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 2073a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 208bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner /// isPointerIntoBucketsArray - Return true if the specified pointer points 209bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner /// somewhere into the DenseMap's array of buckets (i.e. either to a key or 210bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner /// value in the DenseMap). 211bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner bool isPointerIntoBucketsArray(const void *Ptr) const { 212bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner return Ptr >= Buckets && Ptr < Buckets+NumBuckets; 213bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner } 214bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner 215bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner /// getPointerIntoBucketsArray() - Return an opaque pointer into the buckets 216bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner /// array. In conjunction with the previous method, this can be used to 217bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner /// determine whether an insertion caused the DenseMap to reallocate. 218bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner const void *getPointerIntoBucketsArray() const { return Buckets; } 219bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner 22028f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattnerprivate: 22167280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson void CopyFrom(const DenseMap& other) { 22229ce95511f905df3a63e3b953a4a0179ead46865Owen Anderson if (NumBuckets != 0 && (!KeyInfoT::isPod() || !ValueInfoT::isPod())) { 22367280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); 22467280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { 22505831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(P->first, EmptyKey) && 22605831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(P->first, TombstoneKey)) 22767280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson P->second.~ValueT(); 22867280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson P->first.~KeyT(); 22967280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 23067280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 2313a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 23267280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumEntries = other.NumEntries; 23367280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumTombstones = other.NumTombstones; 2343a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 235d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin if (NumBuckets) { 236d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#ifndef NDEBUG 237d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin memset(Buckets, 0x5a, sizeof(BucketT)*NumBuckets); 238d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#endif 23908c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman operator delete(Buckets); 240d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin } 24108c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman Buckets = static_cast<BucketT*>(operator new(sizeof(BucketT) * 24208c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman other.NumBuckets)); 2433a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 24429ce95511f905df3a63e3b953a4a0179ead46865Owen Anderson if (KeyInfoT::isPod() && ValueInfoT::isPod()) 2459544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson memcpy(Buckets, other.Buckets, other.NumBuckets * sizeof(BucketT)); 2469544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson else 2479544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson for (size_t i = 0; i < other.NumBuckets; ++i) { 2482b7470eb54880ce7f74469d6e09eaf7f0864f8abOwen Anderson new (&Buckets[i].first) KeyT(other.Buckets[i].first); 24905831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(Buckets[i].first, getEmptyKey()) && 25005831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(Buckets[i].first, getTombstoneKey())) 2514938d347723d452786c1a7c1d1b9ec79121b0040Owen Anderson new (&Buckets[i].second) ValueT(other.Buckets[i].second); 2529544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson } 25367280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumBuckets = other.NumBuckets; 25467280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 2553a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 25628f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner BucketT *InsertIntoBucket(const KeyT &Key, const ValueT &Value, 25728f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner BucketT *TheBucket) { 25804a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // If the load of the hash table is more than 3/4, or if fewer than 1/8 of 25904a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // the buckets are empty (meaning that many are filled with tombstones), 26004a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // grow the table. 26104a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // 26204a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // The later case is tricky. For example, if we had one empty bucket with 26304a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // tons of tombstones, failing lookups (e.g. for insertion) would have to 26404a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // probe almost the entire table until it found the empty bucket. If the 26504a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // table completely filled with tombstones, no lookup would ever succeed, 26604a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // causing infinite loops in lookup. 267f0e4cac7ebdee07639bd1fc3eadf204f45868556Stuart Hastings ++NumEntries; 26804a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner if (NumEntries*4 >= NumBuckets*3 || 2693a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman NumBuckets-(NumEntries+NumTombstones) < NumBuckets/8) { 270d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin this->grow(NumBuckets * 2); 27128f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner LookupBucketFor(Key, TheBucket); 2726e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 2733a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 27404a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // If we are writing over a tombstone, remember this. 27505831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(TheBucket->first, getEmptyKey())) 27604a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner --NumTombstones; 2773a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 27828f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner TheBucket->first = Key; 27928f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner new (&TheBucket->second) ValueT(Value); 28028f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner return TheBucket; 2816e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 28228f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner 28370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner static unsigned getHashValue(const KeyT &Val) { 284a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return KeyInfoT::getHashValue(Val); 2856e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 28670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner static const KeyT getEmptyKey() { 287a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return KeyInfoT::getEmptyKey(); 28870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 28970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner static const KeyT getTombstoneKey() { 290a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return KeyInfoT::getTombstoneKey(); 2916e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 2923a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 2936e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in 2946e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// FoundBucket. If the bucket contains the key and a value, this returns 2956e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// true, otherwise it returns a bucket with an empty marker or tombstone and 2966e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// returns false. 2976e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner bool LookupBucketFor(const KeyT &Val, BucketT *&FoundBucket) const { 2986e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned BucketNo = getHashValue(Val); 2996e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned ProbeAmt = 1; 3006e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *BucketsPtr = Buckets; 3013a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3026e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // FoundTombstone - Keep track of whether we find a tombstone while probing. 3036e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *FoundTombstone = 0; 3046e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(); 3056e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT TombstoneKey = getTombstoneKey(); 30605831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner assert(!KeyInfoT::isEqual(Val, EmptyKey) && 30705831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(Val, TombstoneKey) && 3086e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner "Empty/Tombstone value shouldn't be inserted into map!"); 3093a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3106e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner while (1) { 3116e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *ThisBucket = BucketsPtr + (BucketNo & (NumBuckets-1)); 3126e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Found Val's bucket? If so, return it. 31376c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner if (KeyInfoT::isEqual(ThisBucket->first, Val)) { 3146e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner FoundBucket = ThisBucket; 3156e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner return true; 3166e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3173a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3186e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // If we found an empty bucket, the key doesn't exist in the set. 3196e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Insert it and return the default value. 32076c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner if (KeyInfoT::isEqual(ThisBucket->first, EmptyKey)) { 3216e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // If we've already seen a tombstone while probing, fill it in instead 3226e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // of the empty bucket we eventually probed to. 3236e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner if (FoundTombstone) ThisBucket = FoundTombstone; 3246e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner FoundBucket = FoundTombstone ? FoundTombstone : ThisBucket; 3256e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner return false; 3266e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3273a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3286e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // If this is a tombstone, remember it. If Val ends up not in the map, we 3296e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // prefer to return it than something that would require more probing. 33076c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner if (KeyInfoT::isEqual(ThisBucket->first, TombstoneKey) && !FoundTombstone) 3316e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner FoundTombstone = ThisBucket; // Remember the first tombstone found. 3323a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3336e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Otherwise, it's a hash collision or a tombstone, continue quadratic 3346e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // probing. 3356e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketNo += ProbeAmt++; 3366e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3376e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3386e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3396e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner void init(unsigned InitBuckets) { 3406e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner NumEntries = 0; 34104a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner NumTombstones = 0; 3426e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner NumBuckets = InitBuckets; 343ae9f3a3b7c915f725aef5a7250e88eaeddda03c6Anton Korobeynikov assert(InitBuckets && (InitBuckets & (InitBuckets-1)) == 0 && 3446e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner "# initial buckets must be a power of two!"); 34508c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman Buckets = static_cast<BucketT*>(operator new(sizeof(BucketT)*InitBuckets)); 3466e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Initialize all the keys to EmptyKey. 3476e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(); 3486e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (unsigned i = 0; i != InitBuckets; ++i) 349f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner new (&Buckets[i].first) KeyT(EmptyKey); 3506e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3513a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 352d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin void grow(unsigned AtLeast) { 3536e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned OldNumBuckets = NumBuckets; 3546e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *OldBuckets = Buckets; 3553a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3566e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Double the number of buckets. 357d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin while (NumBuckets <= AtLeast) 358d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin NumBuckets <<= 1; 35904a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner NumTombstones = 0; 36008c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman Buckets = static_cast<BucketT*>(operator new(sizeof(BucketT)*NumBuckets)); 3616e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3626e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Initialize all the keys to EmptyKey. 3636e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(); 3646e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (unsigned i = 0, e = NumBuckets; i != e; ++i) 365f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner new (&Buckets[i].first) KeyT(EmptyKey); 3666e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3676e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Insert all the old elements. 3686e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT TombstoneKey = getTombstoneKey(); 3696e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (BucketT *B = OldBuckets, *E = OldBuckets+OldNumBuckets; B != E; ++B) { 37005831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(B->first, EmptyKey) && 37105831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(B->first, TombstoneKey)) { 3726e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Insert the key/value into the new table. 3736e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *DestBucket; 374f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner bool FoundVal = LookupBucketFor(B->first, DestBucket); 375137d4b253384adce88bfa2a1c37695d90f0a9d6cChris Lattner FoundVal = FoundVal; // silence warning. 3766e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner assert(!FoundVal && "Key already in new map?"); 377f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner DestBucket->first = B->first; 378f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner new (&DestBucket->second) ValueT(B->second); 3793a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3806e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Free the value. 381f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner B->second.~ValueT(); 3826e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 383f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner B->first.~KeyT(); 3846e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3853a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 386d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#ifndef NDEBUG 387d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin memset(OldBuckets, 0x5a, sizeof(BucketT)*OldNumBuckets); 388d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#endif 3896e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Free the old table. 39008c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman operator delete(OldBuckets); 3916e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3923a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3936ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson void shrink_and_clear() { 3946ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson unsigned OldNumBuckets = NumBuckets; 3956ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson BucketT *OldBuckets = Buckets; 3963a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 397398b40671b13018f88371b74822fa8ee2638577eOwen Anderson // Reduce the number of buckets. 398398b40671b13018f88371b74822fa8ee2638577eOwen Anderson NumBuckets = NumEntries > 32 ? 1 << (Log2_32_Ceil(NumEntries) + 1) 399398b40671b13018f88371b74822fa8ee2638577eOwen Anderson : 64; 4006ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson NumTombstones = 0; 40108c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman Buckets = static_cast<BucketT*>(operator new(sizeof(BucketT)*NumBuckets)); 4026ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 4036ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Initialize all the keys to EmptyKey. 4046ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson const KeyT EmptyKey = getEmptyKey(); 4056ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson for (unsigned i = 0, e = NumBuckets; i != e; ++i) 4066ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson new (&Buckets[i].first) KeyT(EmptyKey); 4076ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 4086ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Free the old buckets. 4096ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson const KeyT TombstoneKey = getTombstoneKey(); 4106ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson for (BucketT *B = OldBuckets, *E = OldBuckets+OldNumBuckets; B != E; ++B) { 41105831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(B->first, EmptyKey) && 41205831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(B->first, TombstoneKey)) { 4136ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Free the value. 4146ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson B->second.~ValueT(); 4156ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 4166ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson B->first.~KeyT(); 4176ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 4183a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 419d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#ifndef NDEBUG 420d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin memset(OldBuckets, 0x5a, sizeof(BucketT)*OldNumBuckets); 421d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#endif 4226ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Free the old table. 42308c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman operator delete(OldBuckets); 4243a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 4256ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson NumEntries = 0; 4266ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 4276e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner}; 4286e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 42929ce95511f905df3a63e3b953a4a0179ead46865Owen Andersontemplate<typename KeyT, typename ValueT, typename KeyInfoT, typename ValueInfoT> 430724f6751442e2006856a9365ef3d3bc6f1b31c98Chris Lattnerclass DenseMapIterator : 431724f6751442e2006856a9365ef3d3bc6f1b31c98Chris Lattner public std::iterator<std::forward_iterator_tag, std::pair<KeyT, ValueT>, 432724f6751442e2006856a9365ef3d3bc6f1b31c98Chris Lattner ptrdiff_t> { 433f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner typedef std::pair<KeyT, ValueT> BucketT; 43470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattnerprotected: 435f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner const BucketT *Ptr, *End; 436f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattnerpublic: 437a9ad04191cb56c42944b17980b8b2bb2afe11ab2Dan Gohman DenseMapIterator() : Ptr(0), End(0) {} 43813e781ebe7a39e008dd5e5de78983e095e8a1d02David Greene 439f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner DenseMapIterator(const BucketT *Pos, const BucketT *E) : Ptr(Pos), End(E) { 440f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner AdvancePastEmptyBuckets(); 441f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 4423a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 44370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner std::pair<KeyT, ValueT> &operator*() const { 44470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return *const_cast<BucketT*>(Ptr); 445f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 44670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner std::pair<KeyT, ValueT> *operator->() const { 44770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return const_cast<BucketT*>(Ptr); 448f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 4493a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 450f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner bool operator==(const DenseMapIterator &RHS) const { 451f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner return Ptr == RHS.Ptr; 452f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 453f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner bool operator!=(const DenseMapIterator &RHS) const { 454f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner return Ptr != RHS.Ptr; 455f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 4563a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 457f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner inline DenseMapIterator& operator++() { // Preincrement 458f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner ++Ptr; 459f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner AdvancePastEmptyBuckets(); 460f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner return *this; 461f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 462f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner DenseMapIterator operator++(int) { // Postincrement 463f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner DenseMapIterator tmp = *this; ++*this; return tmp; 464f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 4653a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 466f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattnerprivate: 467f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner void AdvancePastEmptyBuckets() { 468a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner const KeyT Empty = KeyInfoT::getEmptyKey(); 469a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner const KeyT Tombstone = KeyInfoT::getTombstoneKey(); 470f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 4713a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman while (Ptr != End && 47276c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner (KeyInfoT::isEqual(Ptr->first, Empty) || 47376c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner KeyInfoT::isEqual(Ptr->first, Tombstone))) 474f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner ++Ptr; 475f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 476f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner}; 477f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 47829ce95511f905df3a63e3b953a4a0179ead46865Owen Andersontemplate<typename KeyT, typename ValueT, typename KeyInfoT, typename ValueInfoT> 479a76b1febd4fd258e8054395adedcbd477668d956Chris Lattnerclass DenseMapConstIterator : public DenseMapIterator<KeyT, ValueT, KeyInfoT> { 48070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattnerpublic: 481a9ad04191cb56c42944b17980b8b2bb2afe11ab2Dan Gohman DenseMapConstIterator() : DenseMapIterator<KeyT, ValueT, KeyInfoT>() {} 48270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner DenseMapConstIterator(const std::pair<KeyT, ValueT> *Pos, 48370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner const std::pair<KeyT, ValueT> *E) 484569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner : DenseMapIterator<KeyT, ValueT, KeyInfoT>(Pos, E) { 48570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 48670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner const std::pair<KeyT, ValueT> &operator*() const { 48770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return *this->Ptr; 48870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 48970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner const std::pair<KeyT, ValueT> *operator->() const { 49070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return this->Ptr; 49170a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 49270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner}; 493f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 4946e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner} // end namespace llvm 4956e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 4966e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner#endif 497