X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=include%2Fllvm%2FADT%2FSmallVector.h;h=445f99190085106c7a2acece129332c49b549e57;hb=76d38384542e2f596e14eb8e80b8e1c6a2652fd1;hp=fdecb6c44812dc25266a68548e59b29d979eac7c;hpb=1501cdbf63cff3afd92df6cd249096770334b268;p=oota-llvm.git diff --git a/include/llvm/ADT/SmallVector.h b/include/llvm/ADT/SmallVector.h index fdecb6c4481..445f9919008 100644 --- a/include/llvm/ADT/SmallVector.h +++ b/include/llvm/ADT/SmallVector.h @@ -17,6 +17,7 @@ #include "llvm/ADT/iterator.h" #include "llvm/Support/type_traits.h" #include +#include #include #include @@ -53,7 +54,7 @@ template class SmallVectorImpl { protected: T *Begin, *End, *Capacity; - + // Allocate raw space for N elements of type T. If T has a ctor or dtor, we // don't want it to be automatically run, so we need to represent the space as // something else. An array of char would work great, but might not be @@ -74,12 +75,12 @@ protected: // Space after 'FirstEl' is clobbered, do not add any instance vars after it. public: // Default ctor - Initialize to empty. - SmallVectorImpl(unsigned N) - : Begin(reinterpret_cast(&FirstEl)), - End(reinterpret_cast(&FirstEl)), + explicit SmallVectorImpl(unsigned N) + : Begin(reinterpret_cast(&FirstEl)), + End(reinterpret_cast(&FirstEl)), Capacity(reinterpret_cast(&FirstEl)+N) { } - + ~SmallVectorImpl() { // Destroy the constructed elements in the vector. destroy_range(Begin, End); @@ -88,55 +89,63 @@ public: if (!isSmall()) operator delete(Begin); } - + typedef size_t size_type; + typedef ptrdiff_t difference_type; typedef T value_type; typedef T* iterator; typedef const T* const_iterator; - + typedef std::reverse_iterator const_reverse_iterator; typedef std::reverse_iterator reverse_iterator; - + typedef T& reference; typedef const T& const_reference; + typedef T* pointer; + typedef const T* const_pointer; bool empty() const { return Begin == End; } size_type size() const { return End-Begin; } + size_type max_size() const { return size_type(-1) / sizeof(T); } // forward iterator creation methods. iterator begin() { return Begin; } const_iterator begin() const { return Begin; } iterator end() { return End; } const_iterator end() const { return End; } - + // reverse iterator creation methods. reverse_iterator rbegin() { return reverse_iterator(end()); } const_reverse_iterator rbegin() const{ return const_reverse_iterator(end()); } reverse_iterator rend() { return reverse_iterator(begin()); } const_reverse_iterator rend() const { return const_reverse_iterator(begin());} - - + + + /* These asserts could be "Begin + idx < End", but there are lots of places + in llvm where we use &v[v.size()] instead of v.end(). */ reference operator[](unsigned idx) { + assert (Begin + idx <= End); return Begin[idx]; } const_reference operator[](unsigned idx) const { + assert (Begin + idx <= End); return Begin[idx]; } - + reference front() { return begin()[0]; } const_reference front() const { return begin()[0]; } - + reference back() { return end()[-1]; } const_reference back() const { return end()[-1]; } - + void push_back(const_reference Elt) { if (End < Capacity) { Retry: @@ -147,17 +156,23 @@ public: grow(); goto Retry; } - + void pop_back() { --End; End->~T(); } - + + T pop_back_val() { + T Result = back(); + pop_back(); + return Result; + } + void clear() { destroy_range(Begin, End); End = Begin; } - + void resize(unsigned N) { if (N < size()) { destroy_range(Begin+N, End); @@ -169,7 +184,7 @@ public: End = Begin+N; } } - + void resize(unsigned N, const T &NV) { if (N < size()) { destroy_range(Begin+N, End); @@ -181,14 +196,14 @@ public: End = Begin+N; } } - + void reserve(unsigned N) { if (unsigned(Capacity-Begin) < N) grow(N); } - + void swap(SmallVectorImpl &RHS); - + /// append - Add the specified range to the end of the SmallVector. /// template @@ -202,7 +217,19 @@ public: std::uninitialized_copy(in_start, in_end, End); End += NumInputs; } - + + /// append - Add the specified range to the end of the SmallVector. + /// + void append(size_type NumInputs, const T &Elt) { + // Grow allocated space if needed. + if (End+NumInputs > Capacity) + grow(size()+NumInputs); + + // Copy the new elements over. + std::uninitialized_fill_n(End, NumInputs, Elt); + End += NumInputs; + } + void assign(unsigned NumElts, const T &Elt) { clear(); if (unsigned(Capacity-Begin) < NumElts) @@ -210,7 +237,7 @@ public: End = Begin+NumElts; construct_range(Begin, End, Elt); } - + iterator erase(iterator I) { iterator N = I; // Shift all elts down one. @@ -219,7 +246,7 @@ public: pop_back(); return(N); } - + iterator erase(iterator S, iterator E) { iterator N = S; // Shift all elts down. @@ -229,13 +256,13 @@ public: End = I; return(N); } - + iterator insert(iterator I, const T &Elt) { if (I == End) { // Important special case for empty vector. push_back(Elt); return end()-1; } - + if (End < Capacity) { Retry: new (End) T(back()); @@ -250,60 +277,108 @@ public: I = Begin+EltNo; goto Retry; } - + + iterator insert(iterator I, size_type NumToInsert, const T &Elt) { + if (I == End) { // Important special case for empty vector. + append(NumToInsert, Elt); + return end()-1; + } + + // Convert iterator to elt# to avoid invalidating iterator when we reserve() + size_t InsertElt = I-begin(); + + // Ensure there is enough space. + reserve(static_cast(size() + NumToInsert)); + + // Uninvalidate the iterator. + I = begin()+InsertElt; + + // If there are more elements between the insertion point and the end of the + // range than there are being inserted, we can use a simple approach to + // insertion. Since we already reserved space, we know that this won't + // reallocate the vector. + if (size_t(end()-I) >= NumToInsert) { + T *OldEnd = End; + append(End-NumToInsert, End); + + // Copy the existing elements that get replaced. + std::copy(I, OldEnd-NumToInsert, I+NumToInsert); + + std::fill_n(I, NumToInsert, Elt); + return I; + } + + // Otherwise, we're inserting more elements than exist already, and we're + // not inserting at the end. + + // Copy over the elements that we're about to overwrite. + T *OldEnd = End; + End += NumToInsert; + size_t NumOverwritten = OldEnd-I; + std::uninitialized_copy(I, OldEnd, End-NumOverwritten); + + // Replace the overwritten part. + std::fill_n(I, NumOverwritten, Elt); + + // Insert the non-overwritten middle part. + std::uninitialized_fill_n(OldEnd, NumToInsert-NumOverwritten, Elt); + return I; + } + template iterator insert(iterator I, ItTy From, ItTy To) { if (I == End) { // Important special case for empty vector. append(From, To); return end()-1; } - + size_t NumToInsert = std::distance(From, To); // Convert iterator to elt# to avoid invalidating iterator when we reserve() size_t InsertElt = I-begin(); - + // Ensure there is enough space. reserve(static_cast(size() + NumToInsert)); - + // Uninvalidate the iterator. I = begin()+InsertElt; - - // If we already have this many elements in the collection, append the - // dest elements at the end, then copy over the appropriate elements. Since - // we already reserved space, we know that this won't reallocate the vector. - if (size() >= NumToInsert) { + + // If there are more elements between the insertion point and the end of the + // range than there are being inserted, we can use a simple approach to + // insertion. Since we already reserved space, we know that this won't + // reallocate the vector. + if (size_t(end()-I) >= NumToInsert) { T *OldEnd = End; append(End-NumToInsert, End); - + // Copy the existing elements that get replaced. std::copy(I, OldEnd-NumToInsert, I+NumToInsert); - + std::copy(From, To, I); return I; } // Otherwise, we're inserting more elements than exist already, and we're // not inserting at the end. - + // Copy over the elements that we're about to overwrite. T *OldEnd = End; End += NumToInsert; size_t NumOverwritten = OldEnd-I; std::uninitialized_copy(I, OldEnd, End-NumOverwritten); - + // Replace the overwritten part. std::copy(From, From+NumOverwritten, I); - + // Insert the non-overwritten middle part. std::uninitialized_copy(From+NumOverwritten, To, OldEnd); return I; } - + const SmallVectorImpl &operator=(const SmallVectorImpl &RHS); - + bool operator==(const SmallVectorImpl &RHS) const { if (size() != RHS.size()) return false; - for (T *This = Begin, *That = RHS.Begin, *E = Begin+size(); + for (T *This = Begin, *That = RHS.Begin, *E = Begin+size(); This != E; ++This, ++That) if (*This != *That) return false; @@ -315,12 +390,12 @@ public: return std::lexicographical_compare(begin(), end(), RHS.begin(), RHS.end()); } - + private: /// isSmall - Return true if this is a smallvector which has not had dynamic /// memory allocated for it. bool isSmall() const { - return static_cast(Begin) == + return static_cast(Begin) == static_cast(&FirstEl); } @@ -332,7 +407,7 @@ private: for (; S != E; ++S) new (S) T(Elt); } - + void destroy_range(T *S, T *E) { while (S != E) { --E; @@ -350,21 +425,21 @@ void SmallVectorImpl::grow(size_t MinSize) { if (NewCapacity < MinSize) NewCapacity = MinSize; T *NewElts = static_cast(operator new(NewCapacity*sizeof(T))); - + // Copy the elements over. if (is_class::value) std::uninitialized_copy(Begin, End, NewElts); else // Use memcpy for PODs (std::uninitialized_copy optimizes to memmove). memcpy(NewElts, Begin, CurSize * sizeof(T)); - + // Destroy the original elements. destroy_range(Begin, End); - + // If this wasn't grown from the inline copy, deallocate the old space. if (!isSmall()) operator delete(Begin); - + Begin = NewElts; End = NewElts+CurSize; Capacity = Begin+NewCapacity; @@ -373,7 +448,7 @@ void SmallVectorImpl::grow(size_t MinSize) { template void SmallVectorImpl::swap(SmallVectorImpl &RHS) { if (this == &RHS) return; - + // We can only avoid copying elements if neither vector is small. if (!isSmall() && !RHS.isSmall()) { std::swap(Begin, RHS.Begin); @@ -385,13 +460,13 @@ void SmallVectorImpl::swap(SmallVectorImpl &RHS) { grow(RHS.size()); if (RHS.begin()+size() > RHS.Capacity) RHS.grow(size()); - + // Swap the shared elements. size_t NumShared = size(); if (NumShared > RHS.size()) NumShared = RHS.size(); for (unsigned i = 0; i != static_cast(NumShared); ++i) std::swap(Begin[i], RHS[i]); - + // Copy over the extra elts. if (size() > RHS.size()) { size_t EltDiff = size() - RHS.size(); @@ -407,13 +482,13 @@ void SmallVectorImpl::swap(SmallVectorImpl &RHS) { RHS.End = RHS.Begin+NumShared; } } - + template const SmallVectorImpl & SmallVectorImpl::operator=(const SmallVectorImpl &RHS) { // Avoid self-assignment. if (this == &RHS) return *this; - + // If we already have sufficient space, assign the common elements, then // destroy any excess. unsigned RHSSize = unsigned(RHS.size()); @@ -425,15 +500,15 @@ SmallVectorImpl::operator=(const SmallVectorImpl &RHS) { NewEnd = std::copy(RHS.Begin, RHS.Begin+RHSSize, Begin); else NewEnd = Begin; - + // Destroy excess elements. destroy_range(NewEnd, End); - + // Trim. End = NewEnd; return *this; } - + // If we have to grow to have enough elements, destroy the current elements. // This allows us to avoid copying them during the grow. if (unsigned(Capacity-Begin) < RHSSize) { @@ -446,15 +521,15 @@ SmallVectorImpl::operator=(const SmallVectorImpl &RHS) { // Otherwise, use assignment for the already-constructed elements. std::copy(RHS.Begin, RHS.Begin+CurSize, Begin); } - + // Copy construct the new elements in place. std::uninitialized_copy(RHS.Begin+CurSize, RHS.End, Begin+CurSize); - + // Set end. End = Begin+RHSSize; return *this; } - + /// SmallVector - This is a 'vector' (really, a variable-sized array), optimized /// for the case when the array is small. It contains some number of elements /// in-place, which allows it to avoid heap allocation when the actual number of @@ -471,46 +546,46 @@ class SmallVector : public SmallVectorImpl { enum { // MinUs - The number of U's require to cover N T's. MinUs = (static_cast(sizeof(T))*N + - static_cast(sizeof(U)) - 1) / + static_cast(sizeof(U)) - 1) / static_cast(sizeof(U)), - + // NumInlineEltsElts - The number of elements actually in this array. There // is already one in the parent class, and we have to round up to avoid // having a zero-element array. NumInlineEltsElts = MinUs > 1 ? (MinUs - 1) : 1, - + // NumTsAvailable - The number of T's we actually have space for, which may // be more than N due to rounding. NumTsAvailable = (NumInlineEltsElts+1)*static_cast(sizeof(U))/ static_cast(sizeof(T)) }; U InlineElts[NumInlineEltsElts]; -public: +public: SmallVector() : SmallVectorImpl(NumTsAvailable) { } - + explicit SmallVector(unsigned Size, const T &Value = T()) : SmallVectorImpl(NumTsAvailable) { this->reserve(Size); while (Size--) - push_back(Value); + this->push_back(Value); } - + template SmallVector(ItTy S, ItTy E) : SmallVectorImpl(NumTsAvailable) { - append(S, E); + this->append(S, E); } - + SmallVector(const SmallVector &RHS) : SmallVectorImpl(NumTsAvailable) { if (!RHS.empty()) - operator=(RHS); + SmallVectorImpl::operator=(RHS); } const SmallVector &operator=(const SmallVector &RHS) { SmallVectorImpl::operator=(RHS); return *this; } - + }; } // End llvm namespace @@ -522,7 +597,7 @@ namespace std { swap(llvm::SmallVectorImpl &LHS, llvm::SmallVectorImpl &RHS) { LHS.swap(RHS); } - + /// Implement std::swap in terms of SmallVector swap. template inline void