diff options
Diffstat (limited to 'include/llvm/ADT')
| -rw-r--r-- | include/llvm/ADT/BitSetVector.h | 40 | ||||
| -rw-r--r-- | include/llvm/ADT/DepthFirstIterator.h | 22 | ||||
| -rw-r--r-- | include/llvm/ADT/EquivalenceClasses.h | 12 | ||||
| -rw-r--r-- | include/llvm/ADT/GraphTraits.h | 12 | ||||
| -rw-r--r-- | include/llvm/ADT/HashExtras.h | 4 | ||||
| -rw-r--r-- | include/llvm/ADT/PostOrderIterator.h | 16 | ||||
| -rw-r--r-- | include/llvm/ADT/SCCIterator.h | 18 | ||||
| -rw-r--r-- | include/llvm/ADT/STLExtras.h | 20 | ||||
| -rw-r--r-- | include/llvm/ADT/SetOperations.h | 10 | ||||
| -rw-r--r-- | include/llvm/ADT/SetVector.h | 8 | ||||
| -rw-r--r-- | include/llvm/ADT/Statistic.h | 4 | ||||
| -rw-r--r-- | include/llvm/ADT/StringExtras.h | 14 | ||||
| -rw-r--r-- | include/llvm/ADT/Tree.h | 6 | ||||
| -rw-r--r-- | include/llvm/ADT/VectorExtras.h | 4 |
14 files changed, 95 insertions, 95 deletions
diff --git a/include/llvm/ADT/BitSetVector.h b/include/llvm/ADT/BitSetVector.h index 73c5841ad6..954bb79aa5 100644 --- a/include/llvm/ADT/BitSetVector.h +++ b/include/llvm/ADT/BitSetVector.h @@ -1,10 +1,10 @@ //===-- llvm/ADT/BitVectorSet.h - A bit-vector rep. of sets -----*- C++ -*-===// -// +// // The LLVM Compiler Infrastructure // // This file was developed by the LLVM research group and is distributed under // the University of Illinois Open Source License. See LICENSE.TXT for details. -// +// //===----------------------------------------------------------------------===// // // This is an implementation of the bit-vector representation of sets. Unlike @@ -15,11 +15,11 @@ // universal set) can be chosen at creation time. // // External functions: -// +// // bool Disjoint(const BitSetVector& set1, const BitSetVector& set2): // Tests if two sets have an empty intersection. // This is more efficient than !(set1 & set2).any(). -// +// //===----------------------------------------------------------------------===// #ifndef LLVM_ADT_BITSETVECTOR_H @@ -47,7 +47,7 @@ private: // Utility functions for the representation static unsigned NumWords(unsigned Size) { return (Size+BITSET_WORDSIZE-1)/BITSET_WORDSIZE; - } + } static unsigned LastWordSize(unsigned Size) { return Size % BITSET_WORDSIZE; } // Clear the unused bits in the last word. @@ -67,7 +67,7 @@ private: public: class iterator; - /// + /// /// Constructor: create a set of the maximum size maxSetSize. /// The set is initialized to empty. /// @@ -77,9 +77,9 @@ public: /// size - Return the number of bits tracked by this bit vector... unsigned size() const { return maxSize; } - /// + /// /// Modifier methods: reset, set for entire set, operator[] for one element. - /// + /// void reset() { for (unsigned i=0, N = bitsetVec.size(); i < N; ++i) bitsetVec[i].reset(); @@ -95,11 +95,11 @@ public: return bitsetVec[ndiv][nmod]; } iterator begin() { return iterator::begin(*this); } - iterator end() { return iterator::end(*this); } + iterator end() { return iterator::end(*this); } - /// + /// /// Comparison operations: equal, not equal - /// + /// bool operator == (const BitSetVector& set2) const { assert(maxSize == set2.maxSize && "Illegal == comparison"); for (unsigned i = 0; i < bitsetVec.size(); ++i) @@ -111,9 +111,9 @@ public: return ! (*this == set2); } - /// + /// /// Set membership operations: single element, any, none, count - /// + /// bool test(unsigned n) const { assert(n < size() && "BitSetVector: Bit number out of range"); unsigned ndiv = n / BITSET_WORDSIZE, nmod = n % BITSET_WORDSIZE; @@ -138,9 +138,9 @@ public: return (count() == size()); } - /// + /// /// Set operations: intersection, union, disjoint union, complement. - /// + /// BitSetVector operator& (const BitSetVector& set2) const { assert(maxSize == set2.maxSize && "Illegal intersection"); BitSetVector result(maxSize); @@ -170,19 +170,19 @@ public: return result; } - /// + /// /// Printing and debugging support - /// + /// void print(std::ostream &O) const; void dump() const { print(std::cerr); } public: - // + // // An iterator to enumerate the bits in a BitSetVector. // Eventually, this needs to inherit from bidirectional_iterator. // But this iterator may not be as useful as I once thought and // may just go away. - // + // class iterator { unsigned currentBit; unsigned currentWord; @@ -257,7 +257,7 @@ inline std::ostream& operator<< (std::ostream& O, const BitSetVector& bset) /// /// Optimized versions of fundamental comparison operations -/// +/// inline bool Disjoint(const BitSetVector& set1, const BitSetVector& set2) { diff --git a/include/llvm/ADT/DepthFirstIterator.h b/include/llvm/ADT/DepthFirstIterator.h index d18ca9d582..48ee3b2ba8 100644 --- a/include/llvm/ADT/DepthFirstIterator.h +++ b/include/llvm/ADT/DepthFirstIterator.h @@ -1,10 +1,10 @@ //===- llvm/ADT/DepthFirstIterator.h - Depth First iterator -----*- C++ -*-===// -// +// // The LLVM Compiler Infrastructure // // This file was developed by the LLVM research group and is distributed under // the University of Illinois Open Source License. See LICENSE.TXT for details. -// +// //===----------------------------------------------------------------------===// // // This file builds on the ADT/GraphTraits.h file to build generic depth @@ -58,7 +58,7 @@ public: // Generic Depth First Iterator -template<class GraphT, class SetType = +template<class GraphT, class SetType = std::set<typename GraphTraits<GraphT>::NodeType*>, bool ExtStorage = false, class GT = GraphTraits<GraphT> > class df_iterator : public forward_iterator<typename GT::NodeType, ptrdiff_t>, @@ -85,7 +85,7 @@ private: VisitStack.push_back(std::make_pair(Node, GT::child_begin(Node))); } } - inline df_iterator(SetType &S) + inline df_iterator(SetType &S) : df_iterator_storage<SetType, ExtStorage>(S) { // End is when stack is empty } @@ -106,13 +106,13 @@ public: } static inline _Self end(GraphT G, SetType &S) { return _Self(S); } - inline bool operator==(const _Self& x) const { + inline bool operator==(const _Self& x) const { return VisitStack.size() == x.VisitStack.size() && VisitStack == x.VisitStack; } inline bool operator!=(const _Self& x) const { return !operator==(x); } - inline pointer operator*() const { + inline pointer operator*() const { return VisitStack.back().first; } @@ -127,7 +127,7 @@ public: std::pair<NodeType *, ChildItTy> &Top = VisitStack.back(); NodeType *Node = Top.first; ChildItTy &It = Top.second; - + while (It != GT::child_end(Node)) { NodeType *Next = *It++; if (!this->Visited.count(Next)) { // Has our next sibling been visited? @@ -137,22 +137,22 @@ public: return *this; } } - + // Oops, ran out of successors... go up a level on the stack. VisitStack.pop_back(); } while (!VisitStack.empty()); - return *this; + return *this; } inline _Self operator++(int) { // Postincrement - _Self tmp = *this; ++*this; return tmp; + _Self tmp = *this; ++*this; return tmp; } // nodeVisited - return true if this iterator has already visited the // specified node. This is public, and will probably be used to iterate over // nodes that a depth first iteration did not find: ie unreachable nodes. // - inline bool nodeVisited(NodeType *Node) const { + inline bool nodeVisited(NodeType *Node) const { return this->Visited.count(Node) != 0; } }; diff --git a/include/llvm/ADT/EquivalenceClasses.h b/include/llvm/ADT/EquivalenceClasses.h index a866cd67e1..2924df549e 100644 --- a/include/llvm/ADT/EquivalenceClasses.h +++ b/include/llvm/ADT/EquivalenceClasses.h @@ -1,15 +1,15 @@ //===-- llvm/ADT/EquivalenceClasses.h - Generic Equiv. Classes --*- C++ -*-===// -// +// // The LLVM Compiler Infrastructure // // This file was developed by the LLVM research group and is distributed under // the University of Illinois Open Source License. See LICENSE.TXT for details. -// +// //===----------------------------------------------------------------------===// -// +// // Generic implementation of equivalence classes through the use Tarjan's // efficient union-find algorithm. -// +// //===----------------------------------------------------------------------===// #ifndef LLVM_ADT_EQUIVALENCECLASSES_H @@ -128,7 +128,7 @@ public: } return *this; } - + //===--------------------------------------------------------------------===// // Inspection methods // @@ -220,7 +220,7 @@ public: // point to the L2 leader node. const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; L1LV.getEndOfList()->setNext(&L2LV); - + // Update L1LV's end of list pointer. L1LV.Leader = L2LV.getEndOfList(); diff --git a/include/llvm/ADT/GraphTraits.h b/include/llvm/ADT/GraphTraits.h index e5765bb713..99a69b8cc8 100644 --- a/include/llvm/ADT/GraphTraits.h +++ b/include/llvm/ADT/GraphTraits.h @@ -1,13 +1,13 @@ //===-- llvm/ADT/GraphTraits.h - Graph traits template ----------*- C++ -*-===// -// +// // The LLVM Compiler Infrastructure // // This file was developed by the LLVM research group and is distributed under // the University of Illinois Open Source License. See LICENSE.TXT for details. -// +// //===----------------------------------------------------------------------===// // -// This file defines the little GraphTraits<X> template class that should be +// This file defines the little GraphTraits<X> template class that should be // specialized by classes that want to be iteratable by generic graph iterators. // // This file also defines the marker class Inverse that is used to iterate over @@ -35,9 +35,9 @@ struct GraphTraits { // static ChildIteratorType child_begin(NodeType *) // static ChildIteratorType child_end (NodeType *) - // Return iterators that point to the beginning and ending of the child + // Return iterators that point to the beginning and ending of the child // node list for the specified node. - // + // // typedef ...iterator nodes_iterator; @@ -50,7 +50,7 @@ struct GraphTraits { // If anyone tries to use this class without having an appropriate // specialization, make an error. If you get this error, it's because you // need to include the appropriate specialization of GraphTraits<> for your - // graph, or you need to define it for a new graph type. Either that or + // graph, or you need to define it for a new graph type. Either that or // your argument to XXX_begin(...) is unknown or needs to have the proper .h // file #include'd. // diff --git a/include/llvm/ADT/HashExtras.h b/include/llvm/ADT/HashExtras.h index ab9b302ff1..9993248779 100644 --- a/include/llvm/ADT/HashExtras.h +++ b/include/llvm/ADT/HashExtras.h @@ -1,10 +1,10 @@ //===-- llvm/ADT/HashExtras.h - Useful functions for STL hash ---*- C++ -*-===// -// +// // The LLVM Compiler Infrastructure // // This file was developed by the LLVM research group and is distributed under // the University of Illinois Open Source License. See LICENSE.TXT for details. -// +// //===----------------------------------------------------------------------===// // // This file contains some templates that are useful if you are working with the diff --git a/include/llvm/ADT/PostOrderIterator.h b/include/llvm/ADT/PostOrderIterator.h index 961be340f7..97831a232d 100644 --- a/include/llvm/ADT/PostOrderIterator.h +++ b/include/llvm/ADT/PostOrderIterator.h @@ -1,10 +1,10 @@ //===- llvm/ADT/PostOrderIterator.h - PostOrder iterator --------*- C++ -*-===// -// +// // The LLVM Compiler Infrastructure // // This file was developed by the LLVM research group and is distributed under // the University of Illinois Open Source License. See LICENSE.TXT for details. -// +// //===----------------------------------------------------------------------===// // // This file builds on the ADT/GraphTraits.h file to build a generic graph @@ -58,12 +58,12 @@ public: static inline _Self begin(GraphT G) { return _Self(GT::getEntryNode(G)); } static inline _Self end (GraphT G) { return _Self(); } - inline bool operator==(const _Self& x) const { + inline bool operator==(const _Self& x) const { return VisitStack == x.VisitStack; } inline bool operator!=(const _Self& x) const { return !operator==(x); } - inline pointer operator*() const { + inline pointer operator*() const { return VisitStack.top().first; } @@ -77,11 +77,11 @@ public: VisitStack.pop(); if (!VisitStack.empty()) traverseChild(); - return *this; + return *this; } inline _Self operator++(int) { // Postincrement - _Self tmp = *this; ++*this; return tmp; + _Self tmp = *this; ++*this; return tmp; } }; @@ -112,10 +112,10 @@ ipo_iterator<T> ipo_end(T G){ //===--------------------------------------------------------------------===// // Reverse Post Order CFG iterator code //===--------------------------------------------------------------------===// -// +// // This is used to visit basic blocks in a method in reverse post order. This // class is awkward to use because I don't know a good incremental algorithm to -// computer RPO from a graph. Because of this, the construction of the +// computer RPO from a graph. Because of this, the construction of the // ReversePostOrderTraversal object is expensive (it must walk the entire graph // with a postorder iterator to build the data structures). The moral of this // story is: Don't create more ReversePostOrderTraversal classes than necessary. diff --git a/include/llvm/ADT/SCCIterator.h b/include/llvm/ADT/SCCIterator.h index 9cccd12324..050353d20d 100644 --- a/include/llvm/ADT/SCCIterator.h +++ b/include/llvm/ADT/SCCIterator.h @@ -1,10 +1,10 @@ //===-- Support/SCCIterator.h - Strongly Connected Comp. Iter. --*- C++ -*-===// -// +// // The LLVM Compiler Infrastructure // // This file was developed by the LLVM research group and is distributed under // the University of Illinois Open Source License. See LICENSE.TXT for details. -// +// //===----------------------------------------------------------------------===// // // This builds on the llvm/ADT/GraphTraits.h file to find the strongly connected @@ -12,7 +12,7 @@ // // The SCC iterator has the important property that if a node in SCC S1 has an // edge to a node in SCC S2, then it visits S1 *after* S2. -// +// // To visit S1 *before* S2, use the scc_iterator on the Inverse graph. // (NOTE: This requires some simple wrappers and is not supported yet.) // @@ -118,7 +118,7 @@ class scc_iterator do { CurrentSCC.push_back(SCCNodeStack.back()); SCCNodeStack.pop_back(); - nodeVisitNumbers[CurrentSCC.back()] = ~0UL; + nodeVisitNumbers[CurrentSCC.back()] = ~0UL; } while (CurrentSCC.back() != visitingN); return; } @@ -144,7 +144,7 @@ public: return CurrentSCC.empty(); } - inline bool operator==(const _Self& x) const { + inline bool operator==(const _Self& x) const { return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC; } inline bool operator!=(const _Self& x) const { return !operator==(x); } @@ -152,18 +152,18 @@ public: // Iterator traversal: forward iteration only inline _Self& operator++() { // Preincrement GetNextSCC(); - return *this; + return *this; } inline _Self operator++(int) { // Postincrement - _Self tmp = *this; ++*this; return tmp; + _Self tmp = *this; ++*this; return tmp; } // Retrieve a reference to the current SCC - inline const SccTy &operator*() const { + inline const SccTy &operator*() const { assert(!CurrentSCC.empty() && "Dereferencing END SCC iterator!"); return CurrentSCC; } - inline SccTy &operator*() { + inline SccTy &operator*() { assert(!CurrentSCC.empty() && "Dereferencing END SCC iterator!"); return CurrentSCC; } diff --git a/include/llvm/ADT/STLExtras.h b/include/llvm/ADT/STLExtras.h index a58da0febd..af4996502f 100644 --- a/include/llvm/ADT/STLExtras.h +++ b/include/llvm/ADT/STLExtras.h @@ -1,10 +1,10 @@ //===- llvm/ADT/STLExtras.h - Useful STL related functions ------*- C++ -*-===// -// +// // The LLVM Compiler Infrastructure // // This file was developed by the LLVM research group and is distributed under // the University of Illinois Open Source License. See LICENSE.TXT for details. -// +// //===----------------------------------------------------------------------===// // // This file contains some templates that are useful if you are working with the @@ -35,13 +35,13 @@ struct greater_ptr : public std::binary_function<Ty, Ty, bool> { }; // deleter - Very very very simple method that is used to invoke operator -// delete on something. It is used like this: +// delete on something. It is used like this: // // for_each(V.begin(), B.end(), deleter<Interval>); // -template <class T> -static inline void deleter(T *Ptr) { - delete Ptr; +template <class T> +static inline void deleter(T *Ptr) { + delete Ptr; } @@ -78,7 +78,7 @@ public: inline mapped_iterator(const mapped_iterator &It) : current(It.current), Fn(It.Fn) {} - inline value_type operator*() const { // All this work to do this + inline value_type operator*() const { // All this work to do this return Fn(*current); // little change } @@ -90,7 +90,7 @@ public: _Self& operator+= (difference_type n) { current += n; return *this; } _Self operator- (difference_type n) const { return _Self(current - n); } _Self& operator-= (difference_type n) { current -= n; return *this; } - reference operator[](difference_type n) const { return *(*this + n); } + reference operator[](difference_type n) const { return *(*this + n); } inline bool operator!=(const _Self &X) const { return !operator==(X); } inline bool operator==(const _Self &X) const { return current == X.current; } @@ -102,7 +102,7 @@ public: }; template <class _Iterator, class Func> -inline mapped_iterator<_Iterator, Func> +inline mapped_iterator<_Iterator, Func> operator+(typename mapped_iterator<_Iterator, Func>::difference_type N, const mapped_iterator<_Iterator, Func>& X) { return mapped_iterator<_Iterator, Func>(X.getCurrent() - N); @@ -164,7 +164,7 @@ inline ItTy prior(ItTy it) // a std::pair. Since an example is worth 1000 words: // // typedef std::map<int, int> Int2IntMap; -// +// // Int2IntMap myMap; // Int2IntMap::iterator where; // bool inserted; diff --git a/include/llvm/ADT/SetOperations.h b/include/llvm/ADT/SetOperations.h index 57750d19c6..c37d1e7b14 100644 --- a/include/llvm/ADT/SetOperations.h +++ b/include/llvm/ADT/SetOperations.h @@ -1,10 +1,10 @@ //===-- llvm/ADT/SetOperations.h - Generic Set Operations -------*- C++ -*-===// -// +// // The LLVM Compiler Infrastructure // // This file was developed by the LLVM research group and is distributed under // the University of Illinois Open Source License. See LICENSE.TXT for details. -// +// //===----------------------------------------------------------------------===// // // This file defines generic set operations that may be used on set's of @@ -20,7 +20,7 @@ namespace llvm { /// set_union(A, B) - Compute A := A u B, return whether A changed. /// template <class S1Ty, class S2Ty> -bool set_union(S1Ty &S1, const S2Ty &S2) { +bool set_union(S1Ty &S1, const S2Ty &S2) { bool Changed = false; for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end(); @@ -60,9 +60,9 @@ S1Ty set_difference(const S1Ty &S1, const S2Ty &S2) { /// set_subtract(A, B) - Compute A := A - B /// template <class S1Ty, class S2Ty> -void set_subtract(S1Ty &S1, const S2Ty &S2) { +void set_subtract(S1Ty &S1, const S2Ty &S2) { for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end(); - SI != SE; ++SI) + SI != SE; ++SI) S1.erase(*SI); } diff --git a/include/llvm/ADT/SetVector.h b/include/llvm/ADT/SetVector.h index b40ed7c3e0..f8b37c5918 100644 --- a/include/llvm/ADT/SetVector.h +++ b/include/llvm/ADT/SetVector.h @@ -1,13 +1,13 @@ //===- llvm/ADT/SetVector.h - Set with insert order iteration ---*- C++ -*-===// -// +// // The LLVM Compiler Infrastructure // // This file was developed by Reid Spencer and is distributed under // the University of Illinois Open Source License. See LICENSE.TXT for details. -// +// //===----------------------------------------------------------------------===// // -// This file implements a set that has insertion order iteration +// This file implements a set that has insertion order iteration // characteristics. This is useful for keeping a set of things that need to be // visited later but in a deterministic order (insertion order). The interface // is purposefully minimal. @@ -24,7 +24,7 @@ namespace llvm { -/// This class provides a way to keep a set of things that also has the +/// This class provides a way to keep a set of things that also has the /// property of a deterministic iteration order. The order of iteration is the /// order of insertion. /// @brief A vector that has set insertion semantics. diff --git a/include/llvm/ADT/Statistic.h b/include/llvm/ADT/Statistic.h index 31e9ae110d..15ba9107d9 100644 --- a/include/llvm/ADT/Statistic.h +++ b/include/llvm/ADT/Statistic.h @@ -1,10 +1,10 @@ //===-- llvm/ADT/Statistic.h - Easy way to expose stats ---------*- C++ -*-===// -// +// // The LLVM Compiler Infrastructure // // This file was developed by the LLVM research group and is distributed under // the University of Illinois Open Source License. See LICENSE.TXT for details. -// +// //===----------------------------------------------------------------------===// // // This file defines the 'Statistic' class, which is designed to be an easy way diff --git a/include/llvm/ADT/StringExtras.h b/include/llvm/ADT/StringExtras.h index d952ae236f..32f9b0c907 100644 --- a/include/llvm/ADT/StringExtras.h +++ b/include/llvm/ADT/StringExtras.h @@ -1,10 +1,10 @@ //===-- llvm/ADT/StringExtras.h - Useful string functions -------*- C++ -*-===// -// +// // The LLVM Compiler Infrastructure // // This file was developed by the LLVM research group and is distributed under // the University of Illinois Open Source License. See LICENSE.TXT for details. -// +// //===----------------------------------------------------------------------===// // // This file contains some functions that are useful when dealing with strings. @@ -77,21 +77,21 @@ static inline std::string utostr(unsigned X, bool isNeg = false) { } static inline std::string itostr(long long X) { - if (X < 0) + if (X < 0) return utostr(static_cast<uint64_t>(-X), true); else return utostr(static_cast<uint64_t>(X)); } - + static inline std::string itostr(long X) { - if (X < 0) + if (X < 0) return utostr(static_cast<uint64_t>(-X), true); else return utostr(static_cast<uint64_t>(X)); } static inline std::string itostr(int X) { - if (X < 0) + if (X < 0) return utostr(static_cast<unsigned>(-X), true); else return utostr(static_cast<unsigned>(X)); @@ -105,7 +105,7 @@ static inline std::string ftostr(double V) { return B; } -static inline std::string LowercaseString(const std::string &S) { +static inline std::string LowercaseString(const std::string &S) { std::string result(S); for (unsigned i = 0; i < S.length(); ++i) if (isupper(result[i])) diff --git a/include/llvm/ADT/Tree.h b/include/llvm/ADT/Tree.h index 3193eecba2..835a001091 100644 --- a/include/llvm/ADT/Tree.h +++ b/include/llvm/ADT/Tree.h @@ -1,10 +1,10 @@ //===- llvm/ADT/Tree.h - Generic n-way tree structure -----------*- C++ -*-===// -// +// // The LLVM Compiler Infrastructure // // This file was developed by the LLVM research group and is distributed under // the University of Illinois Open Source License. See LICENSE.TXT for details. -// +// //===----------------------------------------------------------------------===// // // This class defines a generic N way tree node structure. The tree structure @@ -35,7 +35,7 @@ public: ConcreteTreeNode *par) : Children(children), Parent(par) {} inline Tree(const std::vector<ConcreteTreeNode*> &children, - ConcreteTreeNode *par, const Payload &data) + ConcreteTreeNode *par, const Payload &data) : Children(children), Parent(par), Data(data) {} // Tree dtor - Free all children diff --git a/include/llvm/ADT/VectorExtras.h b/include/llvm/ADT/VectorExtras.h index adc3ff720d..56d65bb372 100644 --- a/include/llvm/ADT/VectorExtras.h +++ b/include/llvm/ADT/VectorExtras.h @@ -1,10 +1,10 @@ //===-- llvm/ADT/VectorExtras.h - Helpers for std::vector -------*- C++ -*-===// -// +// // The LLVM Compiler Infrastructure // // This file was developed by the LLVM research group and is distributed under // the University of Illinois Open Source License. See LICENSE.TXT for details. -// +// //===----------------------------------------------------------------------===// // // This file contains helper functions which are useful for working with the |