SmallPtrSet.h revision 0b930852cf1a9899ae82dd6c31b43e754a77dcb0
1c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner//===- llvm/ADT/SmallPtrSet.h - 'Normally small' pointer set ----*- C++ -*-===// 2c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner// 3c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner// The LLVM Compiler Infrastructure 4c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner// 5c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner// This file was developed by Chris Lattner and is distributed under 6c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner// the University of Illinois Open Source License. See LICENSE.TXT for details. 7c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner// 8c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner//===----------------------------------------------------------------------===// 9c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner// 1018b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner// This file defines the SmallPtrSet class. See the doxygen comment for 1118b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner// SmallPtrSetImpl for more details on the algorithm used. 12c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner// 13c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner//===----------------------------------------------------------------------===// 14c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 15c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner#ifndef LLVM_ADT_SMALLPTRSET_H 16c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner#define LLVM_ADT_SMALLPTRSET_H 17c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 18c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner#include <cassert> 19c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner#include <cstring> 20c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 21c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattnernamespace llvm { 22c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 2318b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner/// SmallPtrSetImpl - This is the common code shared among all the 2418b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner/// SmallPtrSet<>'s, which is almost everything. SmallPtrSet has two modes, one 2518b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner/// for small and one for large sets. 2618b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner/// 2718b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner/// Small sets use an array of pointers allocated in the SmallPtrSet object, 2818b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner/// which is treated as a simple array of pointers. When a pointer is added to 2918b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner/// the set, the array is scanned to see if the element already exists, if not 3018b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner/// the element is 'pushed back' onto the array. If we run out of space in the 3118b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner/// array, we grow into the 'large set' case. SmallSet should be used when the 3218b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner/// sets are often small. In this case, no memory allocation is used, and only 3318b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner/// light-weight and cache-efficient scanning is used. 3418b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner/// 3518b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner/// Large sets use a classic exponentially-probed hash table. Empty buckets are 3618b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner/// represented with an illegal pointer value (-1) to allow null pointers to be 3718b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner/// inserted. Tombstones are represented with another illegal pointer value 3818b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner/// (-2), to allow deletion. The hash table is resized when the table is 3/4 or 3918b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner/// more. When this happens, the table is doubled in size. 4018b69106b7a66ac6abde37d1be6d0d952796ed04Chris Lattner/// 41c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattnerclass SmallPtrSetImpl { 42c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattnerprotected: 43c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner /// CurArray - This is the current set of buckets. If it points to 44c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner /// SmallArray, then the set is in 'small mode'. 45c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner void **CurArray; 46c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner /// CurArraySize - The allocated size of CurArray, always a power of two. 47c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner /// Note that CurArray points to an array that has CurArraySize+1 elements in 48c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner /// it, so that the end iterator actually points to valid memory. 49c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner unsigned CurArraySize; 50c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 51c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner // If small, this is # elts allocated consequtively 52c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner unsigned NumElements; 53c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner void *SmallArray[1]; // Must be last ivar. 54c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattnerpublic: 55c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner SmallPtrSetImpl(unsigned SmallSize) { 56c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner assert(SmallSize && (SmallSize & (SmallSize-1)) == 0 && 57c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner "Initial size must be a power of two!"); 58c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner CurArray = &SmallArray[0]; 59c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner CurArraySize = SmallSize; 60c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner // The end pointer, always valid, is set to a valid element to help the 61c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner // iterator. 62c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner CurArray[SmallSize] = 0; 63c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner clear(); 64c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner } 65c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner ~SmallPtrSetImpl() { 66c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner if (!isSmall()) 67c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner delete[] CurArray; 68c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner } 69c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 70c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner static void *getTombstoneMarker() { return reinterpret_cast<void*>(-2); } 71c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner static void *getEmptyMarker() { 72c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner // Note that -1 is chosen to make clear() efficiently implementable with 73c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner // memset and because it's not a valid pointer value. 74c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner return reinterpret_cast<void*>(-1); 75c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner } 76c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 77c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner void clear() { 78c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner // Fill the array with empty markers. 79c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner memset(CurArray, -1, CurArraySize*sizeof(void*)); 80c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner NumElements = 0; 81c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner } 82c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 83c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner /// insert - This returns true if the pointer was new to the set, false if it 84c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner /// was already in the set. 85c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner bool insert(void *Ptr); 86c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 870b930852cf1a9899ae82dd6c31b43e754a77dcb0Chris Lattner /// erase - If the set contains the specified pointer, remove it and return 880b930852cf1a9899ae82dd6c31b43e754a77dcb0Chris Lattner /// true, otherwise return false. 890b930852cf1a9899ae82dd6c31b43e754a77dcb0Chris Lattner bool erase(void *Ptr); 900b930852cf1a9899ae82dd6c31b43e754a77dcb0Chris Lattner 91c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner bool count(void *Ptr) const { 92c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner if (isSmall()) { 93c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner // Linear search for the item. 94c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner for (void *const *APtr = SmallArray, *const *E = SmallArray+NumElements; 95c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner APtr != E; ++APtr) 96c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner if (*APtr == Ptr) 97c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner return true; 98c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner return false; 99c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner } 100c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 101c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner // Big set case. 102c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner return *FindBucketFor(Ptr) == Ptr; 103c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner } 104c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 105c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattnerprivate: 1060b930852cf1a9899ae82dd6c31b43e754a77dcb0Chris Lattner bool isSmall() const { return CurArray == &SmallArray[0]; } 1070b930852cf1a9899ae82dd6c31b43e754a77dcb0Chris Lattner 108c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner unsigned Hash(void *Ptr) const { 109c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner return ((uintptr_t)Ptr >> 4) & (CurArraySize-1); 110c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner } 111c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner void * const *FindBucketFor(void *Ptr) const; 112c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 113c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner /// Grow - Allocate a larger backing store for the buckets and move it over. 114c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner void Grow(); 115c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner}; 116c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 117c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner/// SmallPtrSetIteratorImpl - This is the common base class shared between all 118c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner/// instances of SmallPtrSetIterator. 119c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattnerclass SmallPtrSetIteratorImpl { 120c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattnerprotected: 121c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner void *const *Bucket; 122c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattnerpublic: 123c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner SmallPtrSetIteratorImpl(void *const *BP) : Bucket(BP) { 124c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner AdvanceIfNotValid(); 125c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner } 126c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 127c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner bool operator==(const SmallPtrSetIteratorImpl &RHS) const { 128c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner return Bucket == RHS.Bucket; 129c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner } 130c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner bool operator!=(const SmallPtrSetIteratorImpl &RHS) const { 131c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner return Bucket != RHS.Bucket; 132c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner } 133c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 134c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattnerprotected: 135c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucket 136c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner /// that is. This is guaranteed to stop because the end() bucket is marked 137c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner /// valid. 138c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner void AdvanceIfNotValid() { 139c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner while (*Bucket == SmallPtrSetImpl::getEmptyMarker() || 140c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner *Bucket == SmallPtrSetImpl::getTombstoneMarker()) 141c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner ++Bucket; 142c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner } 143c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner}; 144c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 145c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner/// SmallPtrSetIterator - This implements a const_iterator for SmallPtrSet. 146c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattnertemplate<typename PtrTy> 147c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattnerclass SmallPtrSetIterator : public SmallPtrSetIteratorImpl { 148c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattnerpublic: 149c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner SmallPtrSetIterator(void *const *BP) : SmallPtrSetIteratorImpl(BP) {} 150c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 151c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner // Most methods provided by baseclass. 152c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 153c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner PtrTy operator*() const { 154c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner return static_cast<PtrTy>(*Bucket); 155c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner } 156c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 157c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner inline SmallPtrSetIterator& operator++() { // Preincrement 158c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner ++Bucket; 159c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner AdvanceIfNotValid(); 160c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner return *this; 161c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner } 162c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 163c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner SmallPtrSetIterator operator++(int) { // Postincrement 164c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner SmallPtrSetIterator tmp = *this; ++*this; return tmp; 165c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner } 166c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner}; 167c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 168af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner/// NextPowerOfTwo - This is a helper template that rounds N up to the next 169af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner/// power of two. 170af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattnertemplate<unsigned N> 171af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattnerstruct NextPowerOfTwo; 172af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner 173af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner/// NextPowerOfTwoH - If N is not a power of two, increase it. This is a helper 174af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner/// template used to implement NextPowerOfTwo. 175af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattnertemplate<unsigned N, bool isPowerTwo> 176af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattnerstruct NextPowerOfTwoH { 177af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner enum { Val = N }; 178af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner}; 179af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattnertemplate<unsigned N> 180af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattnerstruct NextPowerOfTwoH<N, false> { 181af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner enum { 182af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner // We could just use NextVal = N+1, but this converges faster. N|(N-1) sets 183af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner // the right-most zero bits to one all at once, e.g. 0b0011000 -> 0b0011111. 184af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner NextVal = (N|(N-1)) + 1, 185af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner Val = NextPowerOfTwo<NextVal>::Val 186af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner }; 187af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner}; 188af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner 189af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattnertemplate<unsigned N> 190af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattnerstruct NextPowerOfTwo { 191af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner enum { Val = NextPowerOfTwoH<N, (N&(N-1)) == 0>::Val }; 192af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner}; 193af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner 194c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 1950b930852cf1a9899ae82dd6c31b43e754a77dcb0Chris Lattner/// SmallPtrSet - This class implements a set which is optimizer for holding 1960b930852cf1a9899ae82dd6c31b43e754a77dcb0Chris Lattner/// SmallSize or less elements. This internally rounds up SmallSize to the next 1970b930852cf1a9899ae82dd6c31b43e754a77dcb0Chris Lattner/// power of two if it is not already a power of two. See the comments above 1980b930852cf1a9899ae82dd6c31b43e754a77dcb0Chris Lattner/// SmallPtrSetImpl for details of the algorithm. 199c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattnertemplate<class PtrType, unsigned SmallSize> 200c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattnerclass SmallPtrSet : public SmallPtrSetImpl { 201af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner // Make sure that SmallSize is a power of two, round up if not. 202af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner enum { SmallSizePowTwo = NextPowerOfTwo<SmallSize>::Val }; 203af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner void *SmallArray[SmallSizePowTwo]; 204c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattnerpublic: 205af3056c97e56106af7c3b9a5c856d1dc1d21e358Chris Lattner SmallPtrSet() : SmallPtrSetImpl(NextPowerOfTwo<SmallSizePowTwo>::Val) {} 206c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 207c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner typedef SmallPtrSetIterator<PtrType> iterator; 208c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner typedef SmallPtrSetIterator<PtrType> const_iterator; 209c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner inline iterator begin() const { 210c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner return iterator(CurArray); 211c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner } 212c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner inline iterator end() const { 213c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner return iterator(CurArray+CurArraySize); 214c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner } 215c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner}; 216c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 217c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner} 218c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner 219c95dc987e9e369c1c63819dbc4f76ab9b913772cChris Lattner#endif 220