//
// The LLVM Compiler Infrastructure
//
-// This file was developed by Chris Lattner and is distributed under
-// the University of Illinois Open Source License. See LICENSE.TXT for details.
+// This file is distributed under the University of Illinois Open Source
+// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
protected:
/// CurArray - This is the current set of buckets. If it points to
/// SmallArray, then the set is in 'small mode'.
- void **CurArray;
+ const void **CurArray;
/// CurArraySize - The allocated size of CurArray, always a power of two.
/// Note that CurArray points to an array that has CurArraySize+1 elements in
/// it, so that the end iterator actually points to valid memory.
// If small, this is # elts allocated consequtively
unsigned NumElements;
unsigned NumTombstones;
- void *SmallArray[1]; // Must be last ivar.
+ const void *SmallArray[1]; // Must be last ivar.
+
+ // Helper to copy construct a SmallPtrSet.
+ SmallPtrSetImpl(const SmallPtrSetImpl& that);
public:
- SmallPtrSetImpl(unsigned SmallSize) {
+ explicit SmallPtrSetImpl(unsigned SmallSize) {
assert(SmallSize && (SmallSize & (SmallSize-1)) == 0 &&
"Initial size must be a power of two!");
CurArray = &SmallArray[0];
CurArray[SmallSize] = 0;
clear();
}
- ~SmallPtrSetImpl() {
- if (!isSmall())
- delete[] CurArray;
- }
+ ~SmallPtrSetImpl();
bool empty() const { return size() == 0; }
unsigned size() const { return NumElements; }
}
void clear() {
+ // If the capacity of the array is huge, and the # elements used is small,
+ // shrink the array.
+ if (!isSmall() && NumElements*4 < CurArraySize && CurArraySize > 32)
+ return shrink_and_clear();
+
// Fill the array with empty markers.
memset(CurArray, -1, CurArraySize*sizeof(void*));
NumElements = 0;
NumTombstones = 0;
}
- /// insert - This returns true if the pointer was new to the set, false if it
- /// was already in the set.
- bool insert(void *Ptr);
-
- template <typename IterT>
- void insert(IterT I, IterT E) {
- for (; I != E; ++I)
- insert((void*)*I);
- }
+protected:
+ /// insert_imp - This returns true if the pointer was new to the set, false if
+ /// it was already in the set. This is hidden from the client so that the
+ /// derived class can check that the right type of pointer is passed in.
+ bool insert_imp(const void * Ptr);
- /// erase - If the set contains the specified pointer, remove it and return
- /// true, otherwise return false.
- bool erase(void *Ptr);
+ /// erase_imp - If the set contains the specified pointer, remove it and
+ /// return true, otherwise return false. This is hidden from the client so
+ /// that the derived class can check that the right type of pointer is passed
+ /// in.
+ bool erase_imp(const void * Ptr);
- bool count(void *Ptr) const {
+ bool count_imp(const void * Ptr) const {
if (isSmall()) {
// Linear search for the item.
- for (void *const *APtr = SmallArray, *const *E = SmallArray+NumElements;
- APtr != E; ++APtr)
+ for (const void *const *APtr = SmallArray,
+ *const *E = SmallArray+NumElements; APtr != E; ++APtr)
if (*APtr == Ptr)
return true;
return false;
private:
bool isSmall() const { return CurArray == &SmallArray[0]; }
- unsigned Hash(void *Ptr) const {
- return ((uintptr_t)Ptr >> 4) & (CurArraySize-1);
+ unsigned Hash(const void *Ptr) const {
+ return static_cast<unsigned>(((uintptr_t)Ptr >> 4) & (CurArraySize-1));
}
- void * const *FindBucketFor(void *Ptr) const;
+ const void * const *FindBucketFor(const void *Ptr) const;
+ void shrink_and_clear();
/// Grow - Allocate a larger backing store for the buckets and move it over.
void Grow();
+
+ void operator=(const SmallPtrSetImpl &RHS); // DO NOT IMPLEMENT.
+protected:
+ void CopyFrom(const SmallPtrSetImpl &RHS);
};
/// SmallPtrSetIteratorImpl - This is the common base class shared between all
/// instances of SmallPtrSetIterator.
class SmallPtrSetIteratorImpl {
protected:
- void *const *Bucket;
+ const void *const *Bucket;
public:
- SmallPtrSetIteratorImpl(void *const *BP) : Bucket(BP) {
+ explicit SmallPtrSetIteratorImpl(const void *const *BP) : Bucket(BP) {
AdvanceIfNotValid();
}
template<typename PtrTy>
class SmallPtrSetIterator : public SmallPtrSetIteratorImpl {
public:
- SmallPtrSetIterator(void *const *BP) : SmallPtrSetIteratorImpl(BP) {}
+ explicit SmallPtrSetIterator(const void *const *BP)
+ : SmallPtrSetIteratorImpl(BP) {}
// Most methods provided by baseclass.
- PtrTy operator*() const {
- return static_cast<PtrTy>(*Bucket);
+ const PtrTy operator*() const {
+ return static_cast<const PtrTy>(const_cast<void*>(*Bucket));
}
inline SmallPtrSetIterator& operator++() { // Preincrement
void *SmallArray[SmallSizePowTwo];
public:
SmallPtrSet() : SmallPtrSetImpl(NextPowerOfTwo<SmallSizePowTwo>::Val) {}
+ SmallPtrSet(const SmallPtrSet &that) : SmallPtrSetImpl(that) {}
template<typename It>
SmallPtrSet(It I, It E)
insert(I, E);
}
+ /// insert - This returns true if the pointer was new to the set, false if it
+ /// was already in the set.
+ bool insert(PtrType Ptr) { return insert_imp(Ptr); }
+
+ /// erase - If the set contains the specified pointer, remove it and return
+ /// true, otherwise return false.
+ bool erase(PtrType Ptr) { return erase_imp(Ptr); }
+
+ /// count - Return true if the specified pointer is in the set.
+ bool count(PtrType Ptr) const { return count_imp(Ptr); }
+
+ template <typename IterT>
+ void insert(IterT I, IterT E) {
+ for (; I != E; ++I)
+ insert(*I);
+ }
+
typedef SmallPtrSetIterator<PtrType> iterator;
typedef SmallPtrSetIterator<PtrType> const_iterator;
inline iterator begin() const {
inline iterator end() const {
return iterator(CurArray+CurArraySize);
}
+
+ // Allow assignment from any smallptrset with the same element type even if it
+ // doesn't have the same smallsize.
+ const SmallPtrSet<PtrType, SmallSize>&
+ operator=(const SmallPtrSet<PtrType, SmallSize> &RHS) {
+ CopyFrom(RHS);
+ return *this;
+ }
+
};
}
projects / oota-llvm.git / blobdiff