DenseMap.h revision 13e781ebe7a39e008dd5e5de78983e095e8a1d02
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 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> 2576c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattnerstruct DenseMapInfo { 266e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner //static inline T getEmptyKey(); 276e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner //static inline T getTombstoneKey(); 286e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner //static unsigned getHashValue(const T &Val); 2976c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner //static bool isEqual(const T &LHS, const T &RHS); 306e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner //static bool isPod() 316e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner}; 326e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3376c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner// Provide DenseMapInfo for all pointers. 346e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnertemplate<typename T> 3576c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattnerstruct DenseMapInfo<T*> { 36276222a5ae189ed5c6a2afb248d4c8f0335585b4Reid Spencer static inline T* getEmptyKey() { return reinterpret_cast<T*>(-1); } 37276222a5ae189ed5c6a2afb248d4c8f0335585b4Reid Spencer static inline T* getTombstoneKey() { return reinterpret_cast<T*>(-2); } 386e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner static unsigned getHashValue(const T *PtrVal) { 39f8a3ee1d637a747c87f72bc880445e6a82280ff0Chris Lattner return (unsigned((uintptr_t)PtrVal) >> 4) ^ 40f8a3ee1d637a747c87f72bc880445e6a82280ff0Chris Lattner (unsigned((uintptr_t)PtrVal) >> 9); 416e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 4276c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner static bool isEqual(const T *LHS, const T *RHS) { return LHS == RHS; } 4329ce95511f905df3a63e3b953a4a0179ead46865Owen Anderson static bool isPod() { return true; } 4429ce95511f905df3a63e3b953a4a0179ead46865Owen Anderson}; 4529ce95511f905df3a63e3b953a4a0179ead46865Owen Anderson 462dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner// Provide DenseMapInfo for unsigned ints. 472dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattnertemplate<> struct DenseMapInfo<uint32_t> { 482dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner static inline uint32_t getEmptyKey() { return ~0; } 492dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner static inline uint32_t getTombstoneKey() { return ~0 - 1; } 502dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner static unsigned getHashValue(const uint32_t& Val) { return Val * 37; } 512dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner static bool isPod() { return true; } 522dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner static bool isEqual(const uint32_t& LHS, const uint32_t& RHS) { 532dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner return LHS == RHS; 542dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner } 552dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner}; 562dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner 572dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner// Provide DenseMapInfo for all pairs whose members have info. 582dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattnertemplate<typename T, typename U> 592dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattnerstruct DenseMapInfo<std::pair<T, U> > { 602dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner typedef std::pair<T, U> Pair; 612dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner typedef DenseMapInfo<T> FirstInfo; 622dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner typedef DenseMapInfo<U> SecondInfo; 632dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner 642dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner static inline Pair getEmptyKey() { 652dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner return std::make_pair(FirstInfo::getEmptyKey(), 662dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner SecondInfo::getEmptyKey()); 672dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner } 682dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner static inline Pair getTombstoneKey() { 692dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner return std::make_pair(FirstInfo::getTombstoneKey(), 702dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner SecondInfo::getEmptyKey()); } 712dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner static unsigned getHashValue(const Pair& PairVal) { 722dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner uint64_t key = (uint64_t)FirstInfo::getHashValue(PairVal.first) << 32 732dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner | (uint64_t)SecondInfo::getHashValue(PairVal.second); 742dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner key += ~(key << 32); 752dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner key ^= (key >> 22); 762dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner key += ~(key << 13); 772dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner key ^= (key >> 8); 782dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner key += (key << 3); 792dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner key ^= (key >> 15); 802dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner key += ~(key << 27); 812dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner key ^= (key >> 31); 822dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner return (unsigned)key; 832dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner } 842dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner static bool isEqual(const Pair& LHS, const Pair& RHS) { return LHS == RHS; } 852dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner static bool isPod() { return false; } 862dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner}; 872dba6a1bdb7d78b4d1e5e69b81989816193e6b70Chris Lattner 88a76b1febd4fd258e8054395adedcbd477668d956Chris Lattnertemplate<typename KeyT, typename ValueT, 8976c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner typename KeyInfoT = DenseMapInfo<KeyT>, 9076c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner typename ValueInfoT = DenseMapInfo<ValueT> > 91f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattnerclass DenseMapIterator; 92a76b1febd4fd258e8054395adedcbd477668d956Chris Lattnertemplate<typename KeyT, typename ValueT, 9376c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner typename KeyInfoT = DenseMapInfo<KeyT>, 9476c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner typename ValueInfoT = DenseMapInfo<ValueT> > 9570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattnerclass DenseMapConstIterator; 966e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 97a76b1febd4fd258e8054395adedcbd477668d956Chris Lattnertemplate<typename KeyT, typename ValueT, 9876c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner typename KeyInfoT = DenseMapInfo<KeyT>, 9976c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner typename ValueInfoT = DenseMapInfo<ValueT> > 1006e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnerclass DenseMap { 101f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner typedef std::pair<KeyT, ValueT> BucketT; 1026e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned NumBuckets; 1036e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *Buckets; 1046e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 1056e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned NumEntries; 10604a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner unsigned NumTombstones; 1076e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnerpublic: 10813e781ebe7a39e008dd5e5de78983e095e8a1d02David Greene typedef KeyT key_type; 10913e781ebe7a39e008dd5e5de78983e095e8a1d02David Greene typedef ValueT mapped_type; 110aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek typedef BucketT value_type; 111aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek 11267280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson DenseMap(const DenseMap& other) { 11367280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumBuckets = 0; 11467280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson CopyFrom(other); 11567280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 11667280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson 1175a5f6b6e38b7155200903816f22501cce4ca36a7Chris Lattner explicit DenseMap(unsigned NumInitBuckets = 64) { 1186e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner init(NumInitBuckets); 1196e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 12067280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson 1216e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner ~DenseMap() { 1226e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); 1236e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { 12405831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(P->first, EmptyKey) && 12505831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(P->first, TombstoneKey)) 126f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner P->second.~ValueT(); 127f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner P->first.~KeyT(); 1286e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 12908c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman operator delete(Buckets); 1306e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 1316e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 132a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner typedef DenseMapIterator<KeyT, ValueT, KeyInfoT> iterator; 133a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner typedef DenseMapConstIterator<KeyT, ValueT, KeyInfoT> const_iterator; 13470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline iterator begin() { 135a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return iterator(Buckets, Buckets+NumBuckets); 13670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 13770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline iterator end() { 138a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return iterator(Buckets+NumBuckets, Buckets+NumBuckets); 13970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 14070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline const_iterator begin() const { 141a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return const_iterator(Buckets, Buckets+NumBuckets); 14270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 14370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline const_iterator end() const { 144a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return const_iterator(Buckets+NumBuckets, Buckets+NumBuckets); 14570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 146f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 14770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner bool empty() const { return NumEntries == 0; } 1486e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned size() const { return NumEntries; } 149d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin 150d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin /// Grow the densemap so that it has at least Size buckets. Does not shrink 151d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin void resize(size_t Size) { grow(Size); } 1526e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 1536e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner void clear() { 15442e4bdf2577946380ce1529d5716e48b33d4186dChris Lattner // If the capacity of the array is huge, and the # elements used is small, 15542e4bdf2577946380ce1529d5716e48b33d4186dChris Lattner // shrink the array. 1566ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson if (NumEntries * 4 < NumBuckets && NumBuckets > 64) { 1576ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson shrink_and_clear(); 1586ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson return; 1596ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 1606ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 1616e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); 1626e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { 16305831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(P->first, EmptyKey)) { 16405831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(P->first, TombstoneKey)) { 1657b54452c84e478ab4d49ac08759ca4ec1badf2b2Chris Lattner P->second.~ValueT(); 1667b54452c84e478ab4d49ac08759ca4ec1badf2b2Chris Lattner --NumEntries; 1677b54452c84e478ab4d49ac08759ca4ec1badf2b2Chris Lattner } 168f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner P->first = EmptyKey; 1696e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 1706e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 1716e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner assert(NumEntries == 0 && "Node count imbalance!"); 17204a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner NumTombstones = 0; 1736e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 1746ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 1756e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// count - Return true if the specified key is in the map. 1766e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner bool count(const KeyT &Val) const { 1776e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *TheBucket; 1786e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner return LookupBucketFor(Val, TheBucket); 1796e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 1806e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 181569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner iterator find(const KeyT &Val) { 18270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner BucketT *TheBucket; 18370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner if (LookupBucketFor(Val, TheBucket)) 18470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return iterator(TheBucket, Buckets+NumBuckets); 18570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return end(); 18670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 187569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner const_iterator find(const KeyT &Val) const { 188569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner BucketT *TheBucket; 189569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner if (LookupBucketFor(Val, TheBucket)) 190569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner return const_iterator(TheBucket, Buckets+NumBuckets); 191569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner return end(); 192569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner } 19370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner 1947b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar /// lookup - Return the entry for the specified key, or a default 1957b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar /// constructed value if no such entry exists. 1967b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar ValueT lookup(const KeyT &Val) const { 1977b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar BucketT *TheBucket; 1987b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar if (LookupBucketFor(Val, TheBucket)) 1997b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar return TheBucket->second; 2007b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar return ValueT(); 2017b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar } 2027b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar 2036b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { 20428f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner BucketT *TheBucket; 20528f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner if (LookupBucketFor(KV.first, TheBucket)) 2066b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman return std::make_pair(iterator(TheBucket, Buckets+NumBuckets), 2076b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman false); // Already in map. 20828f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner 20928f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner // Otherwise, insert the new element. 2106b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman TheBucket = InsertIntoBucket(KV.first, KV.second, TheBucket); 2116b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman return std::make_pair(iterator(TheBucket, Buckets+NumBuckets), 2126b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman true); 21328f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner } 21428f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner 21570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner bool erase(const KeyT &Val) { 21670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner BucketT *TheBucket; 21770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner if (!LookupBucketFor(Val, TheBucket)) 21870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return false; // not in map. 21970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner 22070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->second.~ValueT(); 22170a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->first = getTombstoneKey(); 22270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner --NumEntries; 22304a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner ++NumTombstones; 22470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return true; 22570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 22670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner bool erase(iterator I) { 22770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner BucketT *TheBucket = &*I; 22870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->second.~ValueT(); 22970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->first = getTombstoneKey(); 23070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner --NumEntries; 23104a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner ++NumTombstones; 23270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return true; 23370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 234aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek 235aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek value_type& FindAndConstruct(const KeyT &Key) { 2366e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *TheBucket; 23728f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner if (LookupBucketFor(Key, TheBucket)) 238aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek return *TheBucket; 239aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek 240aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek return *InsertIntoBucket(Key, ValueT(), TheBucket); 241aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek } 242aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek 243aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek ValueT &operator[](const KeyT &Key) { 244aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek return FindAndConstruct(Key).second; 24528f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner } 24628f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner 24767280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson DenseMap& operator=(const DenseMap& other) { 24867280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson CopyFrom(other); 2493d345631db71174ffc4997a88c09f21eb9ed052bOwen Anderson return *this; 25067280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 25167280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson 25228f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattnerprivate: 25367280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson void CopyFrom(const DenseMap& other) { 25429ce95511f905df3a63e3b953a4a0179ead46865Owen Anderson if (NumBuckets != 0 && (!KeyInfoT::isPod() || !ValueInfoT::isPod())) { 25567280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); 25667280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { 25705831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(P->first, EmptyKey) && 25805831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(P->first, TombstoneKey)) 25967280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson P->second.~ValueT(); 26067280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson P->first.~KeyT(); 26167280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 26267280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 26367280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson 26467280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumEntries = other.NumEntries; 26567280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumTombstones = other.NumTombstones; 26667280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson 26767280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson if (NumBuckets) 26808c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman operator delete(Buckets); 26908c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman Buckets = static_cast<BucketT*>(operator new(sizeof(BucketT) * 27008c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman other.NumBuckets)); 27167280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson 27229ce95511f905df3a63e3b953a4a0179ead46865Owen Anderson if (KeyInfoT::isPod() && ValueInfoT::isPod()) 2739544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson memcpy(Buckets, other.Buckets, other.NumBuckets * sizeof(BucketT)); 2749544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson else 2759544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson for (size_t i = 0; i < other.NumBuckets; ++i) { 2762b7470eb54880ce7f74469d6e09eaf7f0864f8abOwen Anderson new (&Buckets[i].first) KeyT(other.Buckets[i].first); 27705831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(Buckets[i].first, getEmptyKey()) && 27805831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(Buckets[i].first, getTombstoneKey())) 2794938d347723d452786c1a7c1d1b9ec79121b0040Owen Anderson new (&Buckets[i].second) ValueT(other.Buckets[i].second); 2809544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson } 28167280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumBuckets = other.NumBuckets; 28267280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 28367280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson 28428f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner BucketT *InsertIntoBucket(const KeyT &Key, const ValueT &Value, 28528f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner BucketT *TheBucket) { 28604a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // If the load of the hash table is more than 3/4, or if fewer than 1/8 of 28704a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // the buckets are empty (meaning that many are filled with tombstones), 28804a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // grow the table. 28904a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // 29004a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // The later case is tricky. For example, if we had one empty bucket with 29104a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // tons of tombstones, failing lookups (e.g. for insertion) would have to 29204a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // probe almost the entire table until it found the empty bucket. If the 29304a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // table completely filled with tombstones, no lookup would ever succeed, 29404a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // causing infinite loops in lookup. 29504a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner if (NumEntries*4 >= NumBuckets*3 || 29604a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner NumBuckets-(NumEntries+NumTombstones) < NumBuckets/8) { 297d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin this->grow(NumBuckets * 2); 29828f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner LookupBucketFor(Key, TheBucket); 2996e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3006e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner ++NumEntries; 30104a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner 30204a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // If we are writing over a tombstone, remember this. 30305831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(TheBucket->first, getEmptyKey())) 30404a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner --NumTombstones; 30504a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner 30628f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner TheBucket->first = Key; 30728f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner new (&TheBucket->second) ValueT(Value); 30828f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner return TheBucket; 3096e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 31028f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner 31170a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner static unsigned getHashValue(const KeyT &Val) { 312a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return KeyInfoT::getHashValue(Val); 3136e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 31470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner static const KeyT getEmptyKey() { 315a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return KeyInfoT::getEmptyKey(); 31670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 31770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner static const KeyT getTombstoneKey() { 318a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return KeyInfoT::getTombstoneKey(); 3196e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3206e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3216e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in 3226e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// FoundBucket. If the bucket contains the key and a value, this returns 3236e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// true, otherwise it returns a bucket with an empty marker or tombstone and 3246e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// returns false. 3256e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner bool LookupBucketFor(const KeyT &Val, BucketT *&FoundBucket) const { 3266e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned BucketNo = getHashValue(Val); 3276e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned ProbeAmt = 1; 3286e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *BucketsPtr = Buckets; 3296e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3306e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // FoundTombstone - Keep track of whether we find a tombstone while probing. 3316e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *FoundTombstone = 0; 3326e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(); 3336e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT TombstoneKey = getTombstoneKey(); 33405831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner assert(!KeyInfoT::isEqual(Val, EmptyKey) && 33505831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(Val, TombstoneKey) && 3366e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner "Empty/Tombstone value shouldn't be inserted into map!"); 3376e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3386e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner while (1) { 3396e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *ThisBucket = BucketsPtr + (BucketNo & (NumBuckets-1)); 3406e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Found Val's bucket? If so, return it. 34176c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner if (KeyInfoT::isEqual(ThisBucket->first, Val)) { 3426e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner FoundBucket = ThisBucket; 3436e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner return true; 3446e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3456e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3466e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // If we found an empty bucket, the key doesn't exist in the set. 3476e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Insert it and return the default value. 34876c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner if (KeyInfoT::isEqual(ThisBucket->first, EmptyKey)) { 3496e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // If we've already seen a tombstone while probing, fill it in instead 3506e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // of the empty bucket we eventually probed to. 3516e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner if (FoundTombstone) ThisBucket = FoundTombstone; 3526e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner FoundBucket = FoundTombstone ? FoundTombstone : ThisBucket; 3536e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner return false; 3546e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3556e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3566e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // If this is a tombstone, remember it. If Val ends up not in the map, we 3576e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // prefer to return it than something that would require more probing. 35876c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner if (KeyInfoT::isEqual(ThisBucket->first, TombstoneKey) && !FoundTombstone) 3596e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner FoundTombstone = ThisBucket; // Remember the first tombstone found. 3606e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3616e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Otherwise, it's a hash collision or a tombstone, continue quadratic 3626e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // probing. 3636e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketNo += ProbeAmt++; 3646e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3656e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3666e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3676e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner void init(unsigned InitBuckets) { 3686e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner NumEntries = 0; 36904a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner NumTombstones = 0; 3706e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner NumBuckets = InitBuckets; 371ae9f3a3b7c915f725aef5a7250e88eaeddda03c6Anton Korobeynikov assert(InitBuckets && (InitBuckets & (InitBuckets-1)) == 0 && 3726e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner "# initial buckets must be a power of two!"); 37308c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman Buckets = static_cast<BucketT*>(operator new(sizeof(BucketT)*InitBuckets)); 3746e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Initialize all the keys to EmptyKey. 3756e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(); 3766e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (unsigned i = 0; i != InitBuckets; ++i) 377f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner new (&Buckets[i].first) KeyT(EmptyKey); 3786e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3796e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 380d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin void grow(unsigned AtLeast) { 3816e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned OldNumBuckets = NumBuckets; 3826e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *OldBuckets = Buckets; 3836e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3846e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Double the number of buckets. 385d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin while (NumBuckets <= AtLeast) 386d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin NumBuckets <<= 1; 38704a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner NumTombstones = 0; 38808c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman Buckets = static_cast<BucketT*>(operator new(sizeof(BucketT)*NumBuckets)); 3896e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3906e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Initialize all the keys to EmptyKey. 3916e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(); 3926e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (unsigned i = 0, e = NumBuckets; i != e; ++i) 393f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner new (&Buckets[i].first) KeyT(EmptyKey); 3946e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3956e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Insert all the old elements. 3966e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT TombstoneKey = getTombstoneKey(); 3976e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (BucketT *B = OldBuckets, *E = OldBuckets+OldNumBuckets; B != E; ++B) { 39805831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(B->first, EmptyKey) && 39905831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(B->first, TombstoneKey)) { 4006e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Insert the key/value into the new table. 4016e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *DestBucket; 402f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner bool FoundVal = LookupBucketFor(B->first, DestBucket); 403137d4b253384adce88bfa2a1c37695d90f0a9d6cChris Lattner FoundVal = FoundVal; // silence warning. 4046e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner assert(!FoundVal && "Key already in new map?"); 405f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner DestBucket->first = B->first; 406f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner new (&DestBucket->second) ValueT(B->second); 4076e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 4086e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Free the value. 409f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner B->second.~ValueT(); 4106e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 411f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner B->first.~KeyT(); 4126e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 4136e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 4146e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Free the old table. 41508c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman operator delete(OldBuckets); 4166e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 4176ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 4186ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson void shrink_and_clear() { 4196ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson unsigned OldNumBuckets = NumBuckets; 4206ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson BucketT *OldBuckets = Buckets; 4216ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 422398b40671b13018f88371b74822fa8ee2638577eOwen Anderson // Reduce the number of buckets. 423398b40671b13018f88371b74822fa8ee2638577eOwen Anderson NumBuckets = NumEntries > 32 ? 1 << (Log2_32_Ceil(NumEntries) + 1) 424398b40671b13018f88371b74822fa8ee2638577eOwen Anderson : 64; 4256ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson NumTombstones = 0; 42608c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman Buckets = static_cast<BucketT*>(operator new(sizeof(BucketT)*NumBuckets)); 4276ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 4286ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Initialize all the keys to EmptyKey. 4296ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson const KeyT EmptyKey = getEmptyKey(); 4306ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson for (unsigned i = 0, e = NumBuckets; i != e; ++i) 4316ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson new (&Buckets[i].first) KeyT(EmptyKey); 4326ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 4336ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Free the old buckets. 4346ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson const KeyT TombstoneKey = getTombstoneKey(); 4356ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson for (BucketT *B = OldBuckets, *E = OldBuckets+OldNumBuckets; B != E; ++B) { 43605831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(B->first, EmptyKey) && 43705831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(B->first, TombstoneKey)) { 4386ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Free the value. 4396ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson B->second.~ValueT(); 4406ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 4416ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson B->first.~KeyT(); 4426ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 4436ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 4446ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Free the old table. 44508c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman operator delete(OldBuckets); 4466ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 4476ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson NumEntries = 0; 4486ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 4496e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner}; 4506e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 45129ce95511f905df3a63e3b953a4a0179ead46865Owen Andersontemplate<typename KeyT, typename ValueT, typename KeyInfoT, typename ValueInfoT> 452f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattnerclass DenseMapIterator { 453f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner typedef std::pair<KeyT, ValueT> BucketT; 45470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattnerprotected: 455f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner const BucketT *Ptr, *End; 456f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattnerpublic: 45713e781ebe7a39e008dd5e5de78983e095e8a1d02David Greene DenseMapIterator(void) : Ptr(0), End(0) {} 45813e781ebe7a39e008dd5e5de78983e095e8a1d02David Greene 459f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner DenseMapIterator(const BucketT *Pos, const BucketT *E) : Ptr(Pos), End(E) { 460f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner AdvancePastEmptyBuckets(); 461f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 462f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 46370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner std::pair<KeyT, ValueT> &operator*() const { 46470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return *const_cast<BucketT*>(Ptr); 465f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 46670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner std::pair<KeyT, ValueT> *operator->() const { 46770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return const_cast<BucketT*>(Ptr); 468f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 469f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 470f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner bool operator==(const DenseMapIterator &RHS) const { 471f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner return Ptr == RHS.Ptr; 472f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 473f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner bool operator!=(const DenseMapIterator &RHS) const { 474f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner return Ptr != RHS.Ptr; 475f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 476f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 477f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner inline DenseMapIterator& operator++() { // Preincrement 478f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner ++Ptr; 479f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner AdvancePastEmptyBuckets(); 480f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner return *this; 481f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 482f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner DenseMapIterator operator++(int) { // Postincrement 483f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner DenseMapIterator tmp = *this; ++*this; return tmp; 484f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 485f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 486f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattnerprivate: 487f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner void AdvancePastEmptyBuckets() { 488a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner const KeyT Empty = KeyInfoT::getEmptyKey(); 489a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner const KeyT Tombstone = KeyInfoT::getTombstoneKey(); 490f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 49176c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner while (Ptr != End && 49276c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner (KeyInfoT::isEqual(Ptr->first, Empty) || 49376c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner KeyInfoT::isEqual(Ptr->first, Tombstone))) 494f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner ++Ptr; 495f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 496f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner}; 497f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 49829ce95511f905df3a63e3b953a4a0179ead46865Owen Andersontemplate<typename KeyT, typename ValueT, typename KeyInfoT, typename ValueInfoT> 499a76b1febd4fd258e8054395adedcbd477668d956Chris Lattnerclass DenseMapConstIterator : public DenseMapIterator<KeyT, ValueT, KeyInfoT> { 50070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattnerpublic: 50113e781ebe7a39e008dd5e5de78983e095e8a1d02David Greene DenseMapConstIterator(void) : DenseMapIterator<KeyT, ValueT, KeyInfoT>() {} 50270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner DenseMapConstIterator(const std::pair<KeyT, ValueT> *Pos, 50370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner const std::pair<KeyT, ValueT> *E) 504569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner : DenseMapIterator<KeyT, ValueT, KeyInfoT>(Pos, E) { 50570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 50670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner const std::pair<KeyT, ValueT> &operator*() const { 50770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return *this->Ptr; 50870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 50970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner const std::pair<KeyT, ValueT> *operator->() const { 51070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return this->Ptr; 51170a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 51270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner}; 513f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 5146e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner} // end namespace llvm 5156e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 5166e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner#endif 517