16e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner//===- llvm/ADT/DenseMap.h - Dense probed hash table ------------*- C++ -*-===// 26e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// 36e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// The LLVM Compiler Infrastructure 46e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// 57ed47a13356daed2a34cd2209a31f92552e3bdd8Chris Lattner// This file is distributed under the University of Illinois Open Source 67ed47a13356daed2a34cd2209a31f92552e3bdd8Chris Lattner// License. See LICENSE.TXT for details. 76e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// 86e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner//===----------------------------------------------------------------------===// 96e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// 106e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// This file defines the DenseMap class. 116e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner// 126e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner//===----------------------------------------------------------------------===// 136e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 146e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner#ifndef LLVM_ADT_DENSEMAP_H 156e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner#define LLVM_ADT_DENSEMAP_H 166e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 17398b40671b13018f88371b74822fa8ee2638577eOwen Anderson#include "llvm/Support/MathExtras.h" 1881cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin#include "llvm/Support/PointerLikeTypeTraits.h" 1981cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin#include "llvm/Support/type_traits.h" 20fb3af88ba75898896714d49c608b8daa4f106636Dan Gohman#include "llvm/ADT/DenseMapInfo.h" 21476b242fe7a61e5f9ac6214b0bc5c680d24f152eNick Lewycky#include <algorithm> 22724f6751442e2006856a9365ef3d3bc6f1b31c98Chris Lattner#include <iterator> 23724f6751442e2006856a9365ef3d3bc6f1b31c98Chris Lattner#include <new> 24724f6751442e2006856a9365ef3d3bc6f1b31c98Chris Lattner#include <utility> 256e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner#include <cassert> 26345b378309eabd74a7a43f095dca9a4894bc371eDuncan Sands#include <cstddef> 27d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#include <cstring> 286e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 296e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnernamespace llvm { 303a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 313a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukmantemplate<typename KeyT, typename ValueT, 3276c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner typename KeyInfoT = DenseMapInfo<KeyT>, 334e58263459d7f9ae862b52adafe585b66411272fBenjamin Kramer bool IsConst = false> 34f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattnerclass DenseMapIterator; 356e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 36a76b1febd4fd258e8054395adedcbd477668d956Chris Lattnertemplate<typename KeyT, typename ValueT, 374e58263459d7f9ae862b52adafe585b66411272fBenjamin Kramer typename KeyInfoT = DenseMapInfo<KeyT> > 386e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnerclass DenseMap { 39f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner typedef std::pair<KeyT, ValueT> BucketT; 406e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned NumBuckets; 416e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *Buckets; 423a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 436e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned NumEntries; 4404a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner unsigned NumTombstones; 456e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattnerpublic: 4613e781ebe7a39e008dd5e5de78983e095e8a1d02David Greene typedef KeyT key_type; 4713e781ebe7a39e008dd5e5de78983e095e8a1d02David Greene typedef ValueT mapped_type; 48aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek typedef BucketT value_type; 493a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 506a363782fe4ecba4f0a72c2edf03596004470c4aChris Lattner DenseMap(const DenseMap &other) { 5167280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumBuckets = 0; 5267280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson CopyFrom(other); 5367280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 543a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 5549d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer explicit DenseMap(unsigned NumInitBuckets = 0) { 566e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner init(NumInitBuckets); 576e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 583a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 596a363782fe4ecba4f0a72c2edf03596004470c4aChris Lattner template<typename InputIt> 606a363782fe4ecba4f0a72c2edf03596004470c4aChris Lattner DenseMap(const InputIt &I, const InputIt &E) { 6149d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer init(NextPowerOf2(std::distance(I, E))); 626a363782fe4ecba4f0a72c2edf03596004470c4aChris Lattner insert(I, E); 636a363782fe4ecba4f0a72c2edf03596004470c4aChris Lattner } 646a363782fe4ecba4f0a72c2edf03596004470c4aChris Lattner 656e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner ~DenseMap() { 666e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); 676e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { 6805831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(P->first, EmptyKey) && 6905831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(P->first, TombstoneKey)) 70f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner P->second.~ValueT(); 71f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner P->first.~KeyT(); 726e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 73d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#ifndef NDEBUG 74e54f64899fbaaa95fc3241236aabfaa37003a658Duncan Sands if (NumBuckets) 75450ed1a05bd5e12c141629b0d0ba275958634980Chris Lattner memset((void*)Buckets, 0x5a, sizeof(BucketT)*NumBuckets); 76d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#endif 7708c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman operator delete(Buckets); 786e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 793a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 80a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner typedef DenseMapIterator<KeyT, ValueT, KeyInfoT> iterator; 8181cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin typedef DenseMapIterator<KeyT, ValueT, 824e58263459d7f9ae862b52adafe585b66411272fBenjamin Kramer KeyInfoT, true> const_iterator; 8370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline iterator begin() { 84b843d9f833aa474ae700363a445b7409665c4a6eJakob Stoklund Olesen // When the map is empty, avoid the overhead of AdvancePastEmptyBuckets(). 85b843d9f833aa474ae700363a445b7409665c4a6eJakob Stoklund Olesen return empty() ? end() : iterator(Buckets, Buckets+NumBuckets); 8670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 8770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline iterator end() { 88f0be7ca7e42915779175a9332c6baba18a2a840cBenjamin Kramer return iterator(Buckets+NumBuckets, Buckets+NumBuckets, true); 8970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 9070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline const_iterator begin() const { 91b843d9f833aa474ae700363a445b7409665c4a6eJakob Stoklund Olesen return empty() ? end() : const_iterator(Buckets, Buckets+NumBuckets); 9270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 9370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner inline const_iterator end() const { 94f0be7ca7e42915779175a9332c6baba18a2a840cBenjamin Kramer return const_iterator(Buckets+NumBuckets, Buckets+NumBuckets, true); 9570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 963a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 9770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner bool empty() const { return NumEntries == 0; } 986e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned size() const { return NumEntries; } 99d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin 100d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin /// Grow the densemap so that it has at least Size buckets. Does not shrink 10149d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer void resize(size_t Size) { 10249d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer if (Size > NumBuckets) 10349d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer grow(Size); 10449d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer } 1053a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 1066e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner void clear() { 10732859c71d6ba9cd5e38662611a73d82335f4ba41Chris Lattner if (NumEntries == 0 && NumTombstones == 0) return; 10832859c71d6ba9cd5e38662611a73d82335f4ba41Chris Lattner 10942e4bdf2577946380ce1529d5716e48b33d4186dChris Lattner // If the capacity of the array is huge, and the # elements used is small, 11042e4bdf2577946380ce1529d5716e48b33d4186dChris Lattner // shrink the array. 1116ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson if (NumEntries * 4 < NumBuckets && NumBuckets > 64) { 1126ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson shrink_and_clear(); 1136ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson return; 1146ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 1153a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 1166e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); 1176e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { 11805831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(P->first, EmptyKey)) { 11905831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(P->first, TombstoneKey)) { 1207b54452c84e478ab4d49ac08759ca4ec1badf2b2Chris Lattner P->second.~ValueT(); 1217b54452c84e478ab4d49ac08759ca4ec1badf2b2Chris Lattner --NumEntries; 1227b54452c84e478ab4d49ac08759ca4ec1badf2b2Chris Lattner } 123f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner P->first = EmptyKey; 1246e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 1256e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 1266e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner assert(NumEntries == 0 && "Node count imbalance!"); 12704a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner NumTombstones = 0; 1286e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 1296ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 1306e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// count - Return true if the specified key is in the map. 1316e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner bool count(const KeyT &Val) const { 1326e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *TheBucket; 1336e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner return LookupBucketFor(Val, TheBucket); 1346e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 1353a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 136569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner iterator find(const KeyT &Val) { 13770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner BucketT *TheBucket; 13870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner if (LookupBucketFor(Val, TheBucket)) 139f0be7ca7e42915779175a9332c6baba18a2a840cBenjamin Kramer return iterator(TheBucket, Buckets+NumBuckets, true); 14070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return end(); 14170a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 142569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner const_iterator find(const KeyT &Val) const { 143569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner BucketT *TheBucket; 144569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner if (LookupBucketFor(Val, TheBucket)) 145f0be7ca7e42915779175a9332c6baba18a2a840cBenjamin Kramer return const_iterator(TheBucket, Buckets+NumBuckets, true); 146569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner return end(); 147569b935e6b23c4a0e4ebb2c96603974310ef0587Chris Lattner } 1483a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 149babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin /// Alternate version of find() which allows a different, and possibly 150babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin /// less expensive, key type. 151babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin /// The DenseMapInfo is responsible for supplying methods 152babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin /// getHashValue(LookupKeyT) and isEqual(LookupKeyT, KeyT) for each key 153babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin /// type used. 154babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin template<class LookupKeyT> 155babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin iterator find_as(const LookupKeyT &Val) { 156babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin BucketT *TheBucket; 157babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin if (LookupBucketFor(Val, TheBucket)) 158babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin return iterator(TheBucket, Buckets+NumBuckets, true); 159babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin return end(); 160babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin } 161babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin template<class LookupKeyT> 162babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin const_iterator find_as(const LookupKeyT &Val) const { 163babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin BucketT *TheBucket; 164babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin if (LookupBucketFor(Val, TheBucket)) 165babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin return const_iterator(TheBucket, Buckets+NumBuckets, true); 166babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin return end(); 167babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin } 168babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin 1697b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar /// lookup - Return the entry for the specified key, or a default 1707b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar /// constructed value if no such entry exists. 1717b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar ValueT lookup(const KeyT &Val) const { 1727b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar BucketT *TheBucket; 1737b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar if (LookupBucketFor(Val, TheBucket)) 1747b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar return TheBucket->second; 1757b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar return ValueT(); 1767b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar } 1777b75fbf224c0a2d181c35708a27c514ae798c904Daniel Dunbar 178127445818efd810b138dd5362129ab3c7f8b9963Torok Edwin // Inserts key,value pair into the map if the key isn't already in the map. 179127445818efd810b138dd5362129ab3c7f8b9963Torok Edwin // If the key is already in the map, it returns false and doesn't update the 180127445818efd810b138dd5362129ab3c7f8b9963Torok Edwin // value. 1816b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { 18228f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner BucketT *TheBucket; 18328f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner if (LookupBucketFor(KV.first, TheBucket)) 184f0be7ca7e42915779175a9332c6baba18a2a840cBenjamin Kramer return std::make_pair(iterator(TheBucket, Buckets+NumBuckets, true), 1856b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman false); // Already in map. 1863a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 18728f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner // Otherwise, insert the new element. 1886b345ee9b2833cf1b2f79dc16d06d4060bec36efDan Gohman TheBucket = InsertIntoBucket(KV.first, KV.second, TheBucket); 189f0be7ca7e42915779175a9332c6baba18a2a840cBenjamin Kramer return std::make_pair(iterator(TheBucket, Buckets+NumBuckets, true), true); 19028f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner } 1913a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 192b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner /// insert - Range insertion of pairs. 193b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner template<typename InputIt> 194b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner void insert(InputIt I, InputIt E) { 195b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner for (; I != E; ++I) 196b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner insert(*I); 197b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner } 198b6bbe6320b4a60b7399eea08426aec834701d514Chris Lattner 1993a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 20070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner bool erase(const KeyT &Val) { 20170a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner BucketT *TheBucket; 20270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner if (!LookupBucketFor(Val, TheBucket)) 20370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return false; // not in map. 20470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner 20570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->second.~ValueT(); 20670a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->first = getTombstoneKey(); 20770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner --NumEntries; 20804a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner ++NumTombstones; 20970a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner return true; 21070a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 211e3955df639ff9aff990f628ef6a219ff5efdbc81Dan Gohman void erase(iterator I) { 21270a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner BucketT *TheBucket = &*I; 21370a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->second.~ValueT(); 21470a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner TheBucket->first = getTombstoneKey(); 21570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner --NumEntries; 21604a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner ++NumTombstones; 21770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 218aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek 219ccb4f2d813380d8cf139062b8c829e4b8b322c0dAndrew Lenharth void swap(DenseMap& RHS) { 220ccb4f2d813380d8cf139062b8c829e4b8b322c0dAndrew Lenharth std::swap(NumBuckets, RHS.NumBuckets); 221ccb4f2d813380d8cf139062b8c829e4b8b322c0dAndrew Lenharth std::swap(Buckets, RHS.Buckets); 222ccb4f2d813380d8cf139062b8c829e4b8b322c0dAndrew Lenharth std::swap(NumEntries, RHS.NumEntries); 223ccb4f2d813380d8cf139062b8c829e4b8b322c0dAndrew Lenharth std::swap(NumTombstones, RHS.NumTombstones); 224ccb4f2d813380d8cf139062b8c829e4b8b322c0dAndrew Lenharth } 225ccb4f2d813380d8cf139062b8c829e4b8b322c0dAndrew Lenharth 226aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek value_type& FindAndConstruct(const KeyT &Key) { 2276e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *TheBucket; 22828f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner if (LookupBucketFor(Key, TheBucket)) 229aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek return *TheBucket; 2303a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 231aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek return *InsertIntoBucket(Key, ValueT(), TheBucket); 232aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek } 2333a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 234aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek ValueT &operator[](const KeyT &Key) { 235aef806e9cb021919be8f3a988af0478f3da75758Ted Kremenek return FindAndConstruct(Key).second; 23628f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner } 2373a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 23867280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson DenseMap& operator=(const DenseMap& other) { 23967280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson CopyFrom(other); 2403d345631db71174ffc4997a88c09f21eb9ed052bOwen Anderson return *this; 24167280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 2423a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 243bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner /// isPointerIntoBucketsArray - Return true if the specified pointer points 244bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner /// somewhere into the DenseMap's array of buckets (i.e. either to a key or 245bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner /// value in the DenseMap). 246bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner bool isPointerIntoBucketsArray(const void *Ptr) const { 247bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner return Ptr >= Buckets && Ptr < Buckets+NumBuckets; 248bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner } 249bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner 250bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner /// getPointerIntoBucketsArray() - Return an opaque pointer into the buckets 251bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner /// array. In conjunction with the previous method, this can be used to 252bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner /// determine whether an insertion caused the DenseMap to reallocate. 253bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner const void *getPointerIntoBucketsArray() const { return Buckets; } 254bdd376ccb25f251e115fff24b526b4e65e03a1d3Chris Lattner 25528f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattnerprivate: 25667280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson void CopyFrom(const DenseMap& other) { 2574bbf4ee1491637c247e195e19e3e4a8ee5ad72faChris Lattner if (NumBuckets != 0 && 2584e58263459d7f9ae862b52adafe585b66411272fBenjamin Kramer (!isPodLike<KeyT>::value || !isPodLike<ValueT>::value)) { 25967280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); 26067280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { 26105831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(P->first, EmptyKey) && 26205831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(P->first, TombstoneKey)) 26367280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson P->second.~ValueT(); 26467280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson P->first.~KeyT(); 26567280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 26667280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 2673a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 26867280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumEntries = other.NumEntries; 26967280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson NumTombstones = other.NumTombstones; 2703a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 271d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin if (NumBuckets) { 272d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#ifndef NDEBUG 273776157ac926102de7a8e40e936dd9efcd7f9dd1bChandler Carruth memset((void*)Buckets, 0x5a, sizeof(BucketT)*NumBuckets); 274d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#endif 27508c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman operator delete(Buckets); 276d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin } 27788b0c6a59a54a2d7b3763dfabb595ce0e09e658aBenjamin Kramer 27888b0c6a59a54a2d7b3763dfabb595ce0e09e658aBenjamin Kramer NumBuckets = other.NumBuckets; 27988b0c6a59a54a2d7b3763dfabb595ce0e09e658aBenjamin Kramer 28088b0c6a59a54a2d7b3763dfabb595ce0e09e658aBenjamin Kramer if (NumBuckets == 0) { 28188b0c6a59a54a2d7b3763dfabb595ce0e09e658aBenjamin Kramer Buckets = 0; 28288b0c6a59a54a2d7b3763dfabb595ce0e09e658aBenjamin Kramer return; 28388b0c6a59a54a2d7b3763dfabb595ce0e09e658aBenjamin Kramer } 28488b0c6a59a54a2d7b3763dfabb595ce0e09e658aBenjamin Kramer 28588b0c6a59a54a2d7b3763dfabb595ce0e09e658aBenjamin Kramer Buckets = static_cast<BucketT*>(operator new(sizeof(BucketT) * NumBuckets)); 2863a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 2874e58263459d7f9ae862b52adafe585b66411272fBenjamin Kramer if (isPodLike<KeyT>::value && isPodLike<ValueT>::value) 28888b0c6a59a54a2d7b3763dfabb595ce0e09e658aBenjamin Kramer memcpy(Buckets, other.Buckets, NumBuckets * sizeof(BucketT)); 2899544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson else 29088b0c6a59a54a2d7b3763dfabb595ce0e09e658aBenjamin Kramer for (size_t i = 0; i < NumBuckets; ++i) { 2912b7470eb54880ce7f74469d6e09eaf7f0864f8abOwen Anderson new (&Buckets[i].first) KeyT(other.Buckets[i].first); 29205831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(Buckets[i].first, getEmptyKey()) && 29305831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(Buckets[i].first, getTombstoneKey())) 2944938d347723d452786c1a7c1d1b9ec79121b0040Owen Anderson new (&Buckets[i].second) ValueT(other.Buckets[i].second); 2959544dc294f63ce116fbab398a8874ebf834cf41eOwen Anderson } 29667280e1dd22cf9fa452c335d1e2328d13f158da1Owen Anderson } 2973a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 29828f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner BucketT *InsertIntoBucket(const KeyT &Key, const ValueT &Value, 29928f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner BucketT *TheBucket) { 30004a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // If the load of the hash table is more than 3/4, or if fewer than 1/8 of 30104a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // the buckets are empty (meaning that many are filled with tombstones), 30204a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // grow the table. 30304a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // 30404a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // The later case is tricky. For example, if we had one empty bucket with 30504a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // tons of tombstones, failing lookups (e.g. for insertion) would have to 30604a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // probe almost the entire table until it found the empty bucket. If the 30704a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // table completely filled with tombstones, no lookup would ever succeed, 30804a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // causing infinite loops in lookup. 309f0e4cac7ebdee07639bd1fc3eadf204f45868556Stuart Hastings ++NumEntries; 310414fdbdb0104fdc8c570287f94df8bb697e7b7c1Jakob Stoklund Olesen if (NumEntries*4 >= NumBuckets*3) { 311d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin this->grow(NumBuckets * 2); 31228f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner LookupBucketFor(Key, TheBucket); 3136e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 314414fdbdb0104fdc8c570287f94df8bb697e7b7c1Jakob Stoklund Olesen if (NumBuckets-(NumEntries+NumTombstones) < NumBuckets/8) { 315414fdbdb0104fdc8c570287f94df8bb697e7b7c1Jakob Stoklund Olesen this->grow(NumBuckets); 316414fdbdb0104fdc8c570287f94df8bb697e7b7c1Jakob Stoklund Olesen LookupBucketFor(Key, TheBucket); 317414fdbdb0104fdc8c570287f94df8bb697e7b7c1Jakob Stoklund Olesen } 3183a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 31904a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner // If we are writing over a tombstone, remember this. 32005831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(TheBucket->first, getEmptyKey())) 32104a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner --NumTombstones; 3223a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 32328f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner TheBucket->first = Key; 32428f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner new (&TheBucket->second) ValueT(Value); 32528f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner return TheBucket; 3266e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 32728f72279f5aaf34ba62ae00ca3b8bb94d8b91f70Chris Lattner 32870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner static unsigned getHashValue(const KeyT &Val) { 329a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return KeyInfoT::getHashValue(Val); 3306e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 331babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin template<typename LookupKeyT> 332babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin static unsigned getHashValue(const LookupKeyT &Val) { 333babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin return KeyInfoT::getHashValue(Val); 334babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin } 33570a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner static const KeyT getEmptyKey() { 336a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return KeyInfoT::getEmptyKey(); 33770a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner } 33870a76a633ed5101dbe472404efd989f4f1b3669cChris Lattner static const KeyT getTombstoneKey() { 339a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner return KeyInfoT::getTombstoneKey(); 3406e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3413a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3426e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in 3436e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// FoundBucket. If the bucket contains the key and a value, this returns 3446e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// true, otherwise it returns a bucket with an empty marker or tombstone and 3456e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner /// returns false. 346babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin template<typename LookupKeyT> 347babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin bool LookupBucketFor(const LookupKeyT &Val, BucketT *&FoundBucket) const { 3486e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned BucketNo = getHashValue(Val); 3496e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned ProbeAmt = 1; 3506e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *BucketsPtr = Buckets; 3513a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 35249d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer if (NumBuckets == 0) { 35349d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer FoundBucket = 0; 35449d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer return false; 35549d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer } 35649d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer 3576e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // FoundTombstone - Keep track of whether we find a tombstone while probing. 3586e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *FoundTombstone = 0; 3596e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(); 3606e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT TombstoneKey = getTombstoneKey(); 36105831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner assert(!KeyInfoT::isEqual(Val, EmptyKey) && 36205831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(Val, TombstoneKey) && 3636e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner "Empty/Tombstone value shouldn't be inserted into map!"); 3643a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3656e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner while (1) { 3666e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *ThisBucket = BucketsPtr + (BucketNo & (NumBuckets-1)); 3676e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Found Val's bucket? If so, return it. 368babd5980d8a8b4aad9814212a269f6197ebf1f2eTalin if (KeyInfoT::isEqual(Val, ThisBucket->first)) { 3696e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner FoundBucket = ThisBucket; 3706e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner return true; 3716e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3723a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3736e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // If we found an empty bucket, the key doesn't exist in the set. 3746e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Insert it and return the default value. 37576c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner if (KeyInfoT::isEqual(ThisBucket->first, EmptyKey)) { 3766e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // If we've already seen a tombstone while probing, fill it in instead 3776e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // of the empty bucket we eventually probed to. 3786e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner if (FoundTombstone) ThisBucket = FoundTombstone; 3796e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner FoundBucket = FoundTombstone ? FoundTombstone : ThisBucket; 3806e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner return false; 3816e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3823a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3836e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // If this is a tombstone, remember it. If Val ends up not in the map, we 3846e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // prefer to return it than something that would require more probing. 38576c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner if (KeyInfoT::isEqual(ThisBucket->first, TombstoneKey) && !FoundTombstone) 3866e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner FoundTombstone = ThisBucket; // Remember the first tombstone found. 3873a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 3886e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Otherwise, it's a hash collision or a tombstone, continue quadratic 3896e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // probing. 3906e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketNo += ProbeAmt++; 3916e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3926e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 3936e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 3946e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner void init(unsigned InitBuckets) { 3956e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner NumEntries = 0; 39604a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner NumTombstones = 0; 3976e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner NumBuckets = InitBuckets; 39849d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer 39949d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer if (InitBuckets == 0) { 40049d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer Buckets = 0; 40149d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer return; 40249d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer } 40349d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer 404ae9f3a3b7c915f725aef5a7250e88eaeddda03c6Anton Korobeynikov assert(InitBuckets && (InitBuckets & (InitBuckets-1)) == 0 && 4056e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner "# initial buckets must be a power of two!"); 40608c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman Buckets = static_cast<BucketT*>(operator new(sizeof(BucketT)*InitBuckets)); 4076e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Initialize all the keys to EmptyKey. 4086e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(); 4096e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (unsigned i = 0; i != InitBuckets; ++i) 410f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner new (&Buckets[i].first) KeyT(EmptyKey); 4116e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 4123a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 413d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin void grow(unsigned AtLeast) { 4146e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner unsigned OldNumBuckets = NumBuckets; 4156e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *OldBuckets = Buckets; 4163a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 41749d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer if (NumBuckets < 64) 41849d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer NumBuckets = 64; 41949d443053bf6565f2420692b54f96abffa76f236Benjamin Kramer 4206e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Double the number of buckets. 421fcb0ee8ffeae12aa866f4e7da12a4dd2a1d0dc35Junjie Gu while (NumBuckets < AtLeast) 422d81ccc2806b2c8a498d16f1a547d0cc9c00d602dDaniel Berlin NumBuckets <<= 1; 42304a3115e619740245cbe34c8c7428b4bde7868f7Chris Lattner NumTombstones = 0; 42408c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman Buckets = static_cast<BucketT*>(operator new(sizeof(BucketT)*NumBuckets)); 4256e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 4266e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Initialize all the keys to EmptyKey. 4276e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT EmptyKey = getEmptyKey(); 4286e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (unsigned i = 0, e = NumBuckets; i != e; ++i) 429f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner new (&Buckets[i].first) KeyT(EmptyKey); 4306e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 4316e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Insert all the old elements. 4326e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner const KeyT TombstoneKey = getTombstoneKey(); 4336e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner for (BucketT *B = OldBuckets, *E = OldBuckets+OldNumBuckets; B != E; ++B) { 43405831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(B->first, EmptyKey) && 43505831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(B->first, TombstoneKey)) { 4366e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Insert the key/value into the new table. 4376e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner BucketT *DestBucket; 438f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner bool FoundVal = LookupBucketFor(B->first, DestBucket); 4399d38acb254108db0ee9e746bb3f7aa64168f7e36Nick Lewycky (void)FoundVal; // silence warning. 4406e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner assert(!FoundVal && "Key already in new map?"); 441f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner DestBucket->first = B->first; 442f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner new (&DestBucket->second) ValueT(B->second); 4433a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 4446e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Free the value. 445f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner B->second.~ValueT(); 4466e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 447f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner B->first.~KeyT(); 4486e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 4493a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 450d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#ifndef NDEBUG 451d01f2633b9aab6281c936da04226b46a0dde7ba9Jay Foad if (OldNumBuckets) 452450ed1a05bd5e12c141629b0d0ba275958634980Chris Lattner memset((void*)OldBuckets, 0x5a, sizeof(BucketT)*OldNumBuckets); 453d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#endif 4546e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner // Free the old table. 45508c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman operator delete(OldBuckets); 4566e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner } 4573a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 4586ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson void shrink_and_clear() { 4596ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson unsigned OldNumBuckets = NumBuckets; 4606ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson BucketT *OldBuckets = Buckets; 4613a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 462398b40671b13018f88371b74822fa8ee2638577eOwen Anderson // Reduce the number of buckets. 463398b40671b13018f88371b74822fa8ee2638577eOwen Anderson NumBuckets = NumEntries > 32 ? 1 << (Log2_32_Ceil(NumEntries) + 1) 464398b40671b13018f88371b74822fa8ee2638577eOwen Anderson : 64; 4656ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson NumTombstones = 0; 46608c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman Buckets = static_cast<BucketT*>(operator new(sizeof(BucketT)*NumBuckets)); 4676ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 4686ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Initialize all the keys to EmptyKey. 4696ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson const KeyT EmptyKey = getEmptyKey(); 4706ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson for (unsigned i = 0, e = NumBuckets; i != e; ++i) 4716ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson new (&Buckets[i].first) KeyT(EmptyKey); 4726ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson 4736ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Free the old buckets. 4746ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson const KeyT TombstoneKey = getTombstoneKey(); 4756ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson for (BucketT *B = OldBuckets, *E = OldBuckets+OldNumBuckets; B != E; ++B) { 47605831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner if (!KeyInfoT::isEqual(B->first, EmptyKey) && 47705831c073abbaacbf2fc21ef5ef160872056e075Chris Lattner !KeyInfoT::isEqual(B->first, TombstoneKey)) { 4786ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Free the value. 4796ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson B->second.~ValueT(); 4806ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 4816ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson B->first.~KeyT(); 4826ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 4833a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 484d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#ifndef NDEBUG 485776157ac926102de7a8e40e936dd9efcd7f9dd1bChandler Carruth memset((void*)OldBuckets, 0x5a, sizeof(BucketT)*OldNumBuckets); 486d06c59821a1ca0191ea8a326a18509808a02ed03Torok Edwin#endif 4876ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson // Free the old table. 48808c09496c2fa7c1da027a52d8c410c2ae98481e1Dan Gohman operator delete(OldBuckets); 4893a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 4906ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson NumEntries = 0; 4916ad5fde5d01e0c8c23b928583d2fb9489b1b5a36Owen Anderson } 492e6b693db8cc07be91229bef0d8577ce8b5caf34bTed Kremenek 493e6b693db8cc07be91229bef0d8577ce8b5caf34bTed Kremenekpublic: 494e6b693db8cc07be91229bef0d8577ce8b5caf34bTed Kremenek /// Return the approximate size (in bytes) of the actual map. 495e6b693db8cc07be91229bef0d8577ce8b5caf34bTed Kremenek /// This is just the raw memory used by DenseMap. 496e6b693db8cc07be91229bef0d8577ce8b5caf34bTed Kremenek /// If entries are pointers to objects, the size of the referenced objects 497e6b693db8cc07be91229bef0d8577ce8b5caf34bTed Kremenek /// are not included. 498e6b693db8cc07be91229bef0d8577ce8b5caf34bTed Kremenek size_t getMemorySize() const { 499e6b693db8cc07be91229bef0d8577ce8b5caf34bTed Kremenek return NumBuckets * sizeof(BucketT); 500e6b693db8cc07be91229bef0d8577ce8b5caf34bTed Kremenek } 5016e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner}; 5026e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 50381cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskintemplate<typename KeyT, typename ValueT, 5044e58263459d7f9ae862b52adafe585b66411272fBenjamin Kramer typename KeyInfoT, bool IsConst> 50581cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskinclass DenseMapIterator { 50681cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin typedef std::pair<KeyT, ValueT> Bucket; 50781cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin typedef DenseMapIterator<KeyT, ValueT, 5084e58263459d7f9ae862b52adafe585b66411272fBenjamin Kramer KeyInfoT, true> ConstIterator; 5094e58263459d7f9ae862b52adafe585b66411272fBenjamin Kramer friend class DenseMapIterator<KeyT, ValueT, KeyInfoT, true>; 51081cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskinpublic: 51181cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin typedef ptrdiff_t difference_type; 51281cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin typedef typename conditional<IsConst, const Bucket, Bucket>::type value_type; 51381cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin typedef value_type *pointer; 51481cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin typedef value_type &reference; 51581cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin typedef std::forward_iterator_tag iterator_category; 51681cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskinprivate: 51781cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin pointer Ptr, End; 518f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattnerpublic: 519a9ad04191cb56c42944b17980b8b2bb2afe11ab2Dan Gohman DenseMapIterator() : Ptr(0), End(0) {} 52013e781ebe7a39e008dd5e5de78983e095e8a1d02David Greene 521f0be7ca7e42915779175a9332c6baba18a2a840cBenjamin Kramer DenseMapIterator(pointer Pos, pointer E, bool NoAdvance = false) 522f0be7ca7e42915779175a9332c6baba18a2a840cBenjamin Kramer : Ptr(Pos), End(E) { 523f0be7ca7e42915779175a9332c6baba18a2a840cBenjamin Kramer if (!NoAdvance) AdvancePastEmptyBuckets(); 524f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 5253a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 52681cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin // If IsConst is true this is a converting constructor from iterator to 52781cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin // const_iterator and the default copy constructor is used. 52881cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin // Otherwise this is a copy constructor for iterator. 52981cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin DenseMapIterator(const DenseMapIterator<KeyT, ValueT, 5304e58263459d7f9ae862b52adafe585b66411272fBenjamin Kramer KeyInfoT, false>& I) 53181cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin : Ptr(I.Ptr), End(I.End) {} 53281cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin 53381cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin reference operator*() const { 53481cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin return *Ptr; 535f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 53681cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin pointer operator->() const { 53781cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin return Ptr; 538f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 5393a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 54081cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin bool operator==(const ConstIterator &RHS) const { 54181cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin return Ptr == RHS.operator->(); 542f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 54381cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin bool operator!=(const ConstIterator &RHS) const { 54481cf4325698b48b02eddab921ac333c7f25005c3Jeffrey Yasskin return Ptr != RHS.operator->(); 545f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 5463a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 5474ab74cdc124af6b4f57c2d2d09548e01d64a1f34Jeffrey Yasskin inline DenseMapIterator& operator++() { // Preincrement 548f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner ++Ptr; 549f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner AdvancePastEmptyBuckets(); 550f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner return *this; 551f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 5524ab74cdc124af6b4f57c2d2d09548e01d64a1f34Jeffrey Yasskin DenseMapIterator operator++(int) { // Postincrement 553f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner DenseMapIterator tmp = *this; ++*this; return tmp; 554f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 5553a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman 556f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattnerprivate: 557f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner void AdvancePastEmptyBuckets() { 558a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner const KeyT Empty = KeyInfoT::getEmptyKey(); 559a76b1febd4fd258e8054395adedcbd477668d956Chris Lattner const KeyT Tombstone = KeyInfoT::getTombstoneKey(); 560f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 5613a54b3dc87a581c203b18050b4f787b4ca28a12cMisha Brukman while (Ptr != End && 56276c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner (KeyInfoT::isEqual(Ptr->first, Empty) || 56376c1b97e4020faace8c95a127f1eab66c278fb58Chris Lattner KeyInfoT::isEqual(Ptr->first, Tombstone))) 564f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner ++Ptr; 565f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner } 566f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner}; 56718dceba0bb5e38250535401ecc9d9737943d0657Ted Kremenek 5684e58263459d7f9ae862b52adafe585b66411272fBenjamin Kramertemplate<typename KeyT, typename ValueT, typename KeyInfoT> 56918dceba0bb5e38250535401ecc9d9737943d0657Ted Kremenekstatic inline size_t 5704e58263459d7f9ae862b52adafe585b66411272fBenjamin Kramercapacity_in_bytes(const DenseMap<KeyT, ValueT, KeyInfoT> &X) { 57118dceba0bb5e38250535401ecc9d9737943d0657Ted Kremenek return X.getMemorySize(); 57218dceba0bb5e38250535401ecc9d9737943d0657Ted Kremenek} 573f6390f48e6324b0221d10a9c75ab625357d8a43aChris Lattner 5746e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner} // end namespace llvm 5756e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner 5766e94c00ab29e654125e845f3bce692a3764c1c11Chris Lattner#endif 577