DenseMap.h revision 98153ecbc1b29c576ff43a7718c3f657f81b8aac
16e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner//===- llvm/ADT/DenseMap.h - Dense probed hash table ------------*- C++ -*-===// 26e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// 36e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// The LLVM Compiler Infrastructure 46e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// 56e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// This file was developed by Chris Lattner and is distributed under 66e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// the University of Illinois Open Source 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 176e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner#include "llvm/Support/DataTypes.h" 18398b40671b13018f88371b74822fa8ee2638577eOwen Anderson#include "llvm/Support/MathExtras.h" 196e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner#include <cassert> 20f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner#include <utility> 216e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 226e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnernamespace llvm { 236e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 246e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnertemplate<typename T> 256e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnerstruct DenseMapKeyInfo { 266e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner //static inline T getEmptyKey(); 276e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner //static inline T getTombstoneKey(); 286e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner //static unsigned getHashValue(const T &Val); 296e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner //static bool isPod() 306e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner}; 316e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3204a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner// Provide DenseMapKeyInfo for all pointers. 336e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnertemplate<typename T> 346e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnerstruct DenseMapKeyInfo<T*> { 35276222a5ae189ed5c6a2afb248d4c8f0335585b4Reid Spencer static inline T* getEmptyKey() { return reinterpret_cast<T*>(-1); } 36276222a5ae189ed5c6a2afb248d4c8f0335585b4Reid Spencer static inline T* getTombstoneKey() { return reinterpret_cast<T*>(-2); } 376e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner static unsigned getHashValue(const T *PtrVal) { 38276222a5ae189ed5c6a2afb248d4c8f0335585b4Reid Spencer return (unsigned(uintptr_t(PtrVal)) >> 4) ^ 39276222a5ae189ed5c6a2afb248d4c8f0335585b4Reid Spencer (unsigned(uintptr_t(PtrVal)) >> 9); 406e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 416e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner static bool isPod() { return true; } 426e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner}; 436e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 44a76b1febd4fd258e8054395adedcbd477668d956Chris Lattnertemplate<typename KeyT, typename ValueT, 45a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner typename KeyInfoT = DenseMapKeyInfo<KeyT> > 46f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattnerclass DenseMapIterator; 47a76b1febd4fd258e8054395adedcbd477668d956Chris Lattnertemplate<typename KeyT, typename ValueT, 48a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner typename KeyInfoT = DenseMapKeyInfo<KeyT> > 4970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattnerclass DenseMapConstIterator; 506e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 51a76b1febd4fd258e8054395adedcbd477668d956Chris Lattnertemplate<typename KeyT, typename ValueT, 52a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner typename KeyInfoT = DenseMapKeyInfo<KeyT> > 536e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnerclass DenseMap { 54f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner typedef std::pair<KeyT, ValueT> BucketT; 556e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned NumBuckets; 566e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *Buckets; 576e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 586e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned NumEntries; 5904a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner unsigned NumTombstones; 606e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnerpublic: 6167280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson DenseMap(const DenseMap& other) { 6267280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumBuckets = 0; 6367280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson CopyFrom(other); 6467280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 6567280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson 665a5f6b6e38b7155200903816f22501cce4ca36a7Chris Lattner explicit DenseMap(unsigned NumInitBuckets = 64) { 676e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner init(NumInitBuckets); 686e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 6967280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson 706e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner ~DenseMap() { 716e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); 726e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { 73f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner if (P->first != EmptyKey && P->first != TombstoneKey) 74f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner P->second.~ValueT(); 75f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner P->first.~KeyT(); 766e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 77276222a5ae189ed5c6a2afb248d4c8f0335585b4Reid Spencer delete[] reinterpret_cast<char*>(Buckets); 786e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 796e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 80a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner typedef DenseMapIterator<KeyT, ValueT, KeyInfoT> iterator; 81a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner typedef DenseMapConstIterator<KeyT, ValueT, KeyInfoT> const_iterator; 8270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline iterator begin() { 83a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return iterator(Buckets, Buckets+NumBuckets); 8470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 8570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline iterator end() { 86a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return iterator(Buckets+NumBuckets, Buckets+NumBuckets); 8770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 8870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline const_iterator begin() const { 89a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return const_iterator(Buckets, Buckets+NumBuckets); 9070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 9170a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline const_iterator end() const { 92a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return const_iterator(Buckets+NumBuckets, Buckets+NumBuckets); 9370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 94f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 9570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner bool empty() const { return NumEntries == 0; } 966e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned size() const { return NumEntries; } 976e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 986e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner void clear() { 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 } 1056ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 1066e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); 1076e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { 1087b54452c84e478ab4d49ac08759ca4ec1badf2b2Chris Lattner if (P->first != EmptyKey) { 1097b54452c84e478ab4d49ac08759ca4ec1badf2b2Chris Lattner if (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 } 1256e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 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 } 13870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner 13928f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner bool insert(const std::pair<KeyT, ValueT> &KV) { 14028f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner BucketT *TheBucket; 14128f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner if (LookupBucketFor(KV.first, TheBucket)) 14228f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner return false; // Already in map. 14328f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner 14428f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner // Otherwise, insert the new element. 14528f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner InsertIntoBucket(KV.first, KV.second, TheBucket); 14628f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner return true; 14728f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner } 14828f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner 14970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner bool erase(const KeyT &Val) { 15070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner BucketT *TheBucket; 15170a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner if (!LookupBucketFor(Val, TheBucket)) 15270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return false; // not in map. 15370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner 15470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->second.~ValueT(); 15570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->first = getTombstoneKey(); 15670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner --NumEntries; 15704a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner ++NumTombstones; 15870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return true; 15970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 16070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner bool erase(iterator I) { 16170a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner BucketT *TheBucket = &*I; 16270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->second.~ValueT(); 16370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->first = getTombstoneKey(); 16470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner --NumEntries; 16504a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner ++NumTombstones; 16670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return true; 16770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 16870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner 16928f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner ValueT &operator[](const KeyT &Key) { 1706e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *TheBucket; 17128f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner if (LookupBucketFor(Key, TheBucket)) 172f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner return TheBucket->second; 1736e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 17428f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner return InsertIntoBucket(Key, ValueT(), TheBucket)->second; 17528f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner } 17628f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner 17767280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson DenseMap& operator=(const DenseMap& other) { 17867280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson CopyFrom(other); 1793d345631db71174ffc4997a88c09f21eb9ed052bOwen Anderson return *this; 18067280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 18167280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson 18228f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattnerprivate: 18367280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson void CopyFrom(const DenseMap& other) { 1849544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson if (NumBuckets != 0 && !KeyInfoT::isPod()) { 18567280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); 18667280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { 18767280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson if (P->first != EmptyKey && P->first != TombstoneKey) 18867280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson P->second.~ValueT(); 18967280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson P->first.~KeyT(); 19067280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 19167280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 19267280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson 19367280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumEntries = other.NumEntries; 19467280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumTombstones = other.NumTombstones; 19567280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson 19667280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson if (NumBuckets) 19767280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson delete[] reinterpret_cast<char*>(Buckets); 19867280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson Buckets = reinterpret_cast<BucketT*>(new char[sizeof(BucketT) * 19967280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson other.NumBuckets]); 20067280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson 2019544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson if (KeyInfoT::isPod()) 2029544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson memcpy(Buckets, other.Buckets, other.NumBuckets * sizeof(BucketT)); 2039544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson else 2049544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson for (size_t i = 0; i < other.NumBuckets; ++i) { 2059544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson new (Buckets[i].first) KeyT(other.Buckets[i].first); 20698153ecbc1b29c576ff43a7718c3f657f81b8aacOwen Anderson if (Buckets[i].first != getEmptyKey() && 20798153ecbc1b29c576ff43a7718c3f657f81b8aacOwen Anderson Buckets[i].first != getTombstoneKey()) 20898153ecbc1b29c576ff43a7718c3f657f81b8aacOwen Anderson new (Buckets[i].second) ValueT(other.Buckets[i].second); 2099544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson } 21067280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumBuckets = other.NumBuckets; 21167280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 21267280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson 21328f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner BucketT *InsertIntoBucket(const KeyT &Key, const ValueT &Value, 21428f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner BucketT *TheBucket) { 21504a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // If the load of the hash table is more than 3/4, or if fewer than 1/8 of 21604a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // the buckets are empty (meaning that many are filled with tombstones), 21704a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // grow the table. 21804a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // 21904a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // The later case is tricky. For example, if we had one empty bucket with 22004a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // tons of tombstones, failing lookups (e.g. for insertion) would have to 22104a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // probe almost the entire table until it found the empty bucket. If the 22204a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // table completely filled with tombstones, no lookup would ever succeed, 22304a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // causing infinite loops in lookup. 22404a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner if (NumEntries*4 >= NumBuckets*3 || 22504a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner NumBuckets-(NumEntries+NumTombstones) < NumBuckets/8) { 2266e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner this->grow(); 22728f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner LookupBucketFor(Key, TheBucket); 2286e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 2296e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner ++NumEntries; 23004a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner 23104a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // If we are writing over a tombstone, remember this. 23204a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner if (TheBucket->first != getEmptyKey()) 23304a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner --NumTombstones; 23404a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner 23528f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner TheBucket->first = Key; 23628f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner new (&TheBucket->second) ValueT(Value); 23728f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner return TheBucket; 2386e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 23928f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner 24070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner static unsigned getHashValue(const KeyT &Val) { 241a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return KeyInfoT::getHashValue(Val); 2426e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 24370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner static const KeyT getEmptyKey() { 244a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return KeyInfoT::getEmptyKey(); 24570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 24670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner static const KeyT getTombstoneKey() { 247a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return KeyInfoT::getTombstoneKey(); 2486e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 2496e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 2506e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in 2516e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// FoundBucket. If the bucket contains the key and a value, this returns 2526e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// true, otherwise it returns a bucket with an empty marker or tombstone and 2536e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// returns false. 2546e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner bool LookupBucketFor(const KeyT &Val, BucketT *&FoundBucket) const { 2556e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned BucketNo = getHashValue(Val); 2566e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned ProbeAmt = 1; 2576e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *BucketsPtr = Buckets; 2586e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 2596e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // FoundTombstone - Keep track of whether we find a tombstone while probing. 2606e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *FoundTombstone = 0; 2616e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(); 2626e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT TombstoneKey = getTombstoneKey(); 2636e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner assert(Val != EmptyKey && Val != TombstoneKey && 2646e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner "Empty/Tombstone value shouldn't be inserted into map!"); 2656e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 2666e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner while (1) { 2676e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *ThisBucket = BucketsPtr + (BucketNo & (NumBuckets-1)); 2686e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Found Val's bucket? If so, return it. 269f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner if (ThisBucket->first == Val) { 2706e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner FoundBucket = ThisBucket; 2716e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner return true; 2726e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 2736e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 2746e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // If we found an empty bucket, the key doesn't exist in the set. 2756e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Insert it and return the default value. 276f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner if (ThisBucket->first == EmptyKey) { 2776e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // If we've already seen a tombstone while probing, fill it in instead 2786e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // of the empty bucket we eventually probed to. 2796e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner if (FoundTombstone) ThisBucket = FoundTombstone; 2806e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner FoundBucket = FoundTombstone ? FoundTombstone : ThisBucket; 2816e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner return false; 2826e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 2836e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 2846e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // If this is a tombstone, remember it. If Val ends up not in the map, we 2856e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // prefer to return it than something that would require more probing. 286f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner if (ThisBucket->first == TombstoneKey && !FoundTombstone) 2876e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner FoundTombstone = ThisBucket; // Remember the first tombstone found. 2886e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 2896e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Otherwise, it's a hash collision or a tombstone, continue quadratic 2906e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // probing. 2916e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketNo += ProbeAmt++; 2926e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 2936e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 2946e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 2956e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner void init(unsigned InitBuckets) { 2966e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner NumEntries = 0; 29704a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner NumTombstones = 0; 2986e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner NumBuckets = InitBuckets; 2996e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner assert(InitBuckets && (InitBuckets & InitBuckets-1) == 0 && 3006e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner "# initial buckets must be a power of two!"); 301276222a5ae189ed5c6a2afb248d4c8f0335585b4Reid Spencer Buckets = reinterpret_cast<BucketT*>(new char[sizeof(BucketT)*InitBuckets]); 3026e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Initialize all the keys to EmptyKey. 3036e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(); 3046e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (unsigned i = 0; i != InitBuckets; ++i) 305f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner new (&Buckets[i].first) KeyT(EmptyKey); 3066e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3076e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3086e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner void grow() { 3096e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned OldNumBuckets = NumBuckets; 3106e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *OldBuckets = Buckets; 3116e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3126e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Double the number of buckets. 3136e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner NumBuckets <<= 1; 31404a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner NumTombstones = 0; 315276222a5ae189ed5c6a2afb248d4c8f0335585b4Reid Spencer Buckets = reinterpret_cast<BucketT*>(new char[sizeof(BucketT)*NumBuckets]); 3166e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3176e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Initialize all the keys to EmptyKey. 3186e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(); 3196e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (unsigned i = 0, e = NumBuckets; i != e; ++i) 320f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner new (&Buckets[i].first) KeyT(EmptyKey); 3216e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3226e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Insert all the old elements. 3236e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT TombstoneKey = getTombstoneKey(); 3246e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (BucketT *B = OldBuckets, *E = OldBuckets+OldNumBuckets; B != E; ++B) { 325f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner if (B->first != EmptyKey && B->first != TombstoneKey) { 3266e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Insert the key/value into the new table. 3276e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *DestBucket; 328f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner bool FoundVal = LookupBucketFor(B->first, DestBucket); 329137d4b253384adce88bfa2a1c37695d90f0a9d6cChris Lattner FoundVal = FoundVal; // silence warning. 3306e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner assert(!FoundVal && "Key already in new map?"); 331f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner DestBucket->first = B->first; 332f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner new (&DestBucket->second) ValueT(B->second); 3336e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3346e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Free the value. 335f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner B->second.~ValueT(); 3366e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 337f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner B->first.~KeyT(); 3386e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3396e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3406e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Free the old table. 341276222a5ae189ed5c6a2afb248d4c8f0335585b4Reid Spencer delete[] reinterpret_cast<char*>(OldBuckets); 3426e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3436ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 3446ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson void shrink_and_clear() { 3456ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson unsigned OldNumBuckets = NumBuckets; 3466ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson BucketT *OldBuckets = Buckets; 3476ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 348398b40671b13018f88371b74822fa8ee2638577eOwen Anderson // Reduce the number of buckets. 349398b40671b13018f88371b74822fa8ee2638577eOwen Anderson NumBuckets = NumEntries > 32 ? 1 << (Log2_32_Ceil(NumEntries) + 1) 350398b40671b13018f88371b74822fa8ee2638577eOwen Anderson : 64; 3516ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson NumTombstones = 0; 352276222a5ae189ed5c6a2afb248d4c8f0335585b4Reid Spencer Buckets = reinterpret_cast<BucketT*>(new char[sizeof(BucketT)*NumBuckets]); 3536ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 3546ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Initialize all the keys to EmptyKey. 3556ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson const KeyT EmptyKey = getEmptyKey(); 3566ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson for (unsigned i = 0, e = NumBuckets; i != e; ++i) 3576ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson new (&Buckets[i].first) KeyT(EmptyKey); 3586ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 3596ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Free the old buckets. 3606ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson const KeyT TombstoneKey = getTombstoneKey(); 3616ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson for (BucketT *B = OldBuckets, *E = OldBuckets+OldNumBuckets; B != E; ++B) { 3626ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson if (B->first != EmptyKey && B->first != TombstoneKey) { 3636ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Free the value. 3646ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson B->second.~ValueT(); 3656ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 3666ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson B->first.~KeyT(); 3676ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 3686ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 3696ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Free the old table. 370276222a5ae189ed5c6a2afb248d4c8f0335585b4Reid Spencer delete[] reinterpret_cast<char*>(OldBuckets); 3716ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 3726ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson NumEntries = 0; 3736ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 3746e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner}; 3756e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 376a76b1febd4fd258e8054395adedcbd477668d956Chris Lattnertemplate<typename KeyT, typename ValueT, typename KeyInfoT> 377f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattnerclass DenseMapIterator { 378f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner typedef std::pair<KeyT, ValueT> BucketT; 37970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattnerprotected: 380f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner const BucketT *Ptr, *End; 381f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattnerpublic: 382f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner DenseMapIterator(const BucketT *Pos, const BucketT *E) : Ptr(Pos), End(E) { 383f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner AdvancePastEmptyBuckets(); 384f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 385f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 38670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner std::pair<KeyT, ValueT> &operator*() const { 38770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return *const_cast<BucketT*>(Ptr); 388f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 38970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner std::pair<KeyT, ValueT> *operator->() const { 39070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return const_cast<BucketT*>(Ptr); 391f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 392f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 393f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner bool operator==(const DenseMapIterator &RHS) const { 394f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner return Ptr == RHS.Ptr; 395f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 396f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner bool operator!=(const DenseMapIterator &RHS) const { 397f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner return Ptr != RHS.Ptr; 398f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 399f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 400f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner inline DenseMapIterator& operator++() { // Preincrement 401f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner ++Ptr; 402f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner AdvancePastEmptyBuckets(); 403f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner return *this; 404f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 405f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner DenseMapIterator operator++(int) { // Postincrement 406f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner DenseMapIterator tmp = *this; ++*this; return tmp; 407f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 408f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 409f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattnerprivate: 410f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner void AdvancePastEmptyBuckets() { 411a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner const KeyT Empty = KeyInfoT::getEmptyKey(); 412a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner const KeyT Tombstone = KeyInfoT::getTombstoneKey(); 413f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 41470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner while (Ptr != End && (Ptr->first == Empty || Ptr->first == Tombstone)) 415f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner ++Ptr; 416f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 417f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner}; 418f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 419a76b1febd4fd258e8054395adedcbd477668d956Chris Lattnertemplate<typename KeyT, typename ValueT, typename KeyInfoT> 420a76b1febd4fd258e8054395adedcbd477668d956Chris Lattnerclass DenseMapConstIterator : public DenseMapIterator<KeyT, ValueT, KeyInfoT> { 42170a76a633ed5101dbe472404efd989f4f1b3669cChris Lattnerpublic: 42270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner DenseMapConstIterator(const std::pair<KeyT, ValueT> *Pos, 42370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner const std::pair<KeyT, ValueT> *E) 424569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner : DenseMapIterator<KeyT, ValueT, KeyInfoT>(Pos, E) { 42570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 42670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner const std::pair<KeyT, ValueT> &operator*() const { 42770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return *this->Ptr; 42870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 42970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner const std::pair<KeyT, ValueT> *operator->() const { 43070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return this->Ptr; 43170a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 43270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner}; 433f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 4346e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner} // end namespace llvm 4356e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 4366e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner#endif 437