1 //===- llvm/ADT/SmallPtrSet.h - 'Normally small' pointer set ----*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by Chris Lattner and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the SmallPtrSet class. See the doxygen comment for
11 // SmallPtrSetImpl for more details on the algorithm used.
13 //===----------------------------------------------------------------------===//
15 #ifndef LLVM_ADT_SMALLPTRSET_H
16 #define LLVM_ADT_SMALLPTRSET_H
20 #include "llvm/Support/DataTypes.h"
24 /// SmallPtrSetImpl - This is the common code shared among all the
25 /// SmallPtrSet<>'s, which is almost everything. SmallPtrSet has two modes, one
26 /// for small and one for large sets.
28 /// Small sets use an array of pointers allocated in the SmallPtrSet object,
29 /// which is treated as a simple array of pointers. When a pointer is added to
30 /// the set, the array is scanned to see if the element already exists, if not
31 /// the element is 'pushed back' onto the array. If we run out of space in the
32 /// array, we grow into the 'large set' case. SmallSet should be used when the
33 /// sets are often small. In this case, no memory allocation is used, and only
34 /// light-weight and cache-efficient scanning is used.
36 /// Large sets use a classic exponentially-probed hash table. Empty buckets are
37 /// represented with an illegal pointer value (-1) to allow null pointers to be
38 /// inserted. Tombstones are represented with another illegal pointer value
39 /// (-2), to allow deletion. The hash table is resized when the table is 3/4 or
40 /// more. When this happens, the table is doubled in size.
42 class SmallPtrSetImpl {
44 /// CurArray - This is the current set of buckets. If it points to
45 /// SmallArray, then the set is in 'small mode'.
46 const void **CurArray;
47 /// CurArraySize - The allocated size of CurArray, always a power of two.
48 /// Note that CurArray points to an array that has CurArraySize+1 elements in
49 /// it, so that the end iterator actually points to valid memory.
50 unsigned CurArraySize;
52 // If small, this is # elts allocated consequtively
54 unsigned NumTombstones;
55 const void *SmallArray[1]; // Must be last ivar.
57 // Helper to copy construct a SmallPtrSet.
58 SmallPtrSetImpl(const SmallPtrSetImpl& that);
60 SmallPtrSetImpl(unsigned SmallSize) {
61 assert(SmallSize && (SmallSize & (SmallSize-1)) == 0 &&
62 "Initial size must be a power of two!");
63 CurArray = &SmallArray[0];
64 CurArraySize = SmallSize;
65 // The end pointer, always valid, is set to a valid element to help the
67 CurArray[SmallSize] = 0;
72 bool empty() const { return size() == 0; }
73 unsigned size() const { return NumElements; }
75 static void *getTombstoneMarker() { return reinterpret_cast<void*>(-2); }
76 static void *getEmptyMarker() {
77 // Note that -1 is chosen to make clear() efficiently implementable with
78 // memset and because it's not a valid pointer value.
79 return reinterpret_cast<void*>(-1);
83 // If the capacity of the array is huge, and the # elements used is small,
85 if (!isSmall() && NumElements*4 < CurArraySize && CurArraySize > 32)
86 return shrink_and_clear();
88 // Fill the array with empty markers.
89 memset(CurArray, -1, CurArraySize*sizeof(void*));
94 /// insert - This returns true if the pointer was new to the set, false if it
95 /// was already in the set.
96 bool insert(const void * Ptr);
98 template <typename IterT>
99 void insert(IterT I, IterT E) {
104 /// erase - If the set contains the specified pointer, remove it and return
105 /// true, otherwise return false.
106 bool erase(const void * Ptr);
108 bool count(const void * Ptr) const {
110 // Linear search for the item.
111 for (const void *const *APtr = SmallArray,
112 *const *E = SmallArray+NumElements; APtr != E; ++APtr)
119 return *FindBucketFor(Ptr) == Ptr;
123 bool isSmall() const { return CurArray == &SmallArray[0]; }
125 unsigned Hash(const void *Ptr) const {
126 return ((uintptr_t)Ptr >> 4) & (CurArraySize-1);
128 const void * const *FindBucketFor(const void *Ptr) const;
129 void shrink_and_clear();
131 /// Grow - Allocate a larger backing store for the buckets and move it over.
134 void operator=(const SmallPtrSetImpl &RHS); // DO NOT IMPLEMENT.
136 void CopyFrom(const SmallPtrSetImpl &RHS);
139 /// SmallPtrSetIteratorImpl - This is the common base class shared between all
140 /// instances of SmallPtrSetIterator.
141 class SmallPtrSetIteratorImpl {
143 const void *const *Bucket;
145 SmallPtrSetIteratorImpl(const void *const *BP) : Bucket(BP) {
149 bool operator==(const SmallPtrSetIteratorImpl &RHS) const {
150 return Bucket == RHS.Bucket;
152 bool operator!=(const SmallPtrSetIteratorImpl &RHS) const {
153 return Bucket != RHS.Bucket;
157 /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucket
158 /// that is. This is guaranteed to stop because the end() bucket is marked
160 void AdvanceIfNotValid() {
161 while (*Bucket == SmallPtrSetImpl::getEmptyMarker() ||
162 *Bucket == SmallPtrSetImpl::getTombstoneMarker())
167 /// SmallPtrSetIterator - This implements a const_iterator for SmallPtrSet.
168 template<typename PtrTy>
169 class SmallPtrSetIterator : public SmallPtrSetIteratorImpl {
171 SmallPtrSetIterator(const void *const *BP) : SmallPtrSetIteratorImpl(BP) {}
173 // Most methods provided by baseclass.
175 const PtrTy operator*() const {
176 return static_cast<const PtrTy>(const_cast<void*>(*Bucket));
179 inline SmallPtrSetIterator& operator++() { // Preincrement
185 SmallPtrSetIterator operator++(int) { // Postincrement
186 SmallPtrSetIterator tmp = *this; ++*this; return tmp;
190 /// NextPowerOfTwo - This is a helper template that rounds N up to the next
193 struct NextPowerOfTwo;
195 /// NextPowerOfTwoH - If N is not a power of two, increase it. This is a helper
196 /// template used to implement NextPowerOfTwo.
197 template<unsigned N, bool isPowerTwo>
198 struct NextPowerOfTwoH {
202 struct NextPowerOfTwoH<N, false> {
204 // We could just use NextVal = N+1, but this converges faster. N|(N-1) sets
205 // the right-most zero bits to one all at once, e.g. 0b0011000 -> 0b0011111.
206 Val = NextPowerOfTwo<(N|(N-1)) + 1>::Val
211 struct NextPowerOfTwo {
212 enum { Val = NextPowerOfTwoH<N, (N&(N-1)) == 0>::Val };
216 /// SmallPtrSet - This class implements a set which is optimizer for holding
217 /// SmallSize or less elements. This internally rounds up SmallSize to the next
218 /// power of two if it is not already a power of two. See the comments above
219 /// SmallPtrSetImpl for details of the algorithm.
220 template<class PtrType, unsigned SmallSize>
221 class SmallPtrSet : public SmallPtrSetImpl {
222 // Make sure that SmallSize is a power of two, round up if not.
223 enum { SmallSizePowTwo = NextPowerOfTwo<SmallSize>::Val };
224 void *SmallArray[SmallSizePowTwo];
226 SmallPtrSet() : SmallPtrSetImpl(NextPowerOfTwo<SmallSizePowTwo>::Val) {}
227 SmallPtrSet(const SmallPtrSet &that) : SmallPtrSetImpl(that) {}
229 template<typename It>
230 SmallPtrSet(It I, It E)
231 : SmallPtrSetImpl(NextPowerOfTwo<SmallSizePowTwo>::Val) {
235 typedef SmallPtrSetIterator<PtrType> iterator;
236 typedef SmallPtrSetIterator<PtrType> const_iterator;
237 inline iterator begin() const {
238 return iterator(CurArray);
240 inline iterator end() const {
241 return iterator(CurArray+CurArraySize);
244 // Allow assignment from any smallptrset with the same element type even if it
245 // doesn't have the same smallsize.
246 const SmallPtrSet<PtrType, SmallSize>&
247 operator=(const SmallPtrSet<PtrType, SmallSize> &RHS) {