[llvm-commits] [llvm] r65181 - in /llvm/trunk/include/llvm/ADT: APInt.h DepthFirstIterator.h GraphTraits.h ImmutableMap.h IndexedMap.h IntrusiveRefCntPtr.h OwningPtr.h PostOrderIterator.h SCCIterator.h STLExtras.h SetVector.h SmallVector.h Tree.h Trie.h ilist.h
Misha Brukman
brukman+llvm at gmail.com
Fri Feb 20 14:20:18 PST 2009
Author: brukman
Date: Fri Feb 20 16:20:18 2009
New Revision: 65181
URL: http://llvm.org/viewvc/llvm-project?rev=65181&view=rev
Log:
Fixed lint errors:
* Alphabetized #includes
* Removed trailing whitespace
* Wrapped or shortened lines over 80 chars
Modified:
llvm/trunk/include/llvm/ADT/APInt.h
llvm/trunk/include/llvm/ADT/DepthFirstIterator.h
llvm/trunk/include/llvm/ADT/GraphTraits.h
llvm/trunk/include/llvm/ADT/ImmutableMap.h
llvm/trunk/include/llvm/ADT/IndexedMap.h
llvm/trunk/include/llvm/ADT/IntrusiveRefCntPtr.h
llvm/trunk/include/llvm/ADT/OwningPtr.h
llvm/trunk/include/llvm/ADT/PostOrderIterator.h
llvm/trunk/include/llvm/ADT/SCCIterator.h
llvm/trunk/include/llvm/ADT/STLExtras.h
llvm/trunk/include/llvm/ADT/SetVector.h
llvm/trunk/include/llvm/ADT/SmallVector.h
llvm/trunk/include/llvm/ADT/Tree.h
llvm/trunk/include/llvm/ADT/Trie.h
llvm/trunk/include/llvm/ADT/ilist.h
Modified: llvm/trunk/include/llvm/ADT/APInt.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/APInt.h?rev=65181&r1=65180&r2=65181&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/APInt.h (original)
+++ llvm/trunk/include/llvm/ADT/APInt.h Fri Feb 20 16:20:18 2009
@@ -1275,7 +1275,8 @@
/// srcLSB, to DST, of dstCOUNT parts, such that the bit srcLSB
/// becomes the least significant bit of DST. All high bits above
/// srcBITS in DST are zero-filled.
- static void tcExtract(integerPart *, unsigned int dstCount, const integerPart *,
+ static void tcExtract(integerPart *, unsigned int dstCount,
+ const integerPart *,
unsigned int srcBits, unsigned int srcLSB);
/// Set the given bit of a bignum. Zero-based.
Modified: llvm/trunk/include/llvm/ADT/DepthFirstIterator.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/DepthFirstIterator.h?rev=65181&r1=65180&r2=65181&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/DepthFirstIterator.h (original)
+++ llvm/trunk/include/llvm/ADT/DepthFirstIterator.h Fri Feb 20 16:20:18 2009
@@ -36,8 +36,8 @@
#include "llvm/ADT/GraphTraits.h"
#include "llvm/ADT/iterator.h"
#include "llvm/ADT/SmallPtrSet.h"
-#include <vector>
#include <set>
+#include <vector>
namespace llvm {
Modified: llvm/trunk/include/llvm/ADT/GraphTraits.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/GraphTraits.h?rev=65181&r1=65180&r2=65181&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/GraphTraits.h (original)
+++ llvm/trunk/include/llvm/ADT/GraphTraits.h Fri Feb 20 16:20:18 2009
@@ -78,8 +78,8 @@
inline Inverse(const GraphType &G) : Graph(G) {}
};
-// Provide a partial specialization of GraphTraits so that the inverse of an inverse
-// falls back to the original graph.
+// Provide a partial specialization of GraphTraits so that the inverse of an
+// inverse falls back to the original graph.
template<class T>
struct GraphTraits<Inverse<Inverse<T> > > {
typedef typename GraphTraits<T>::NodeType NodeType;
Modified: llvm/trunk/include/llvm/ADT/ImmutableMap.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/ImmutableMap.h?rev=65181&r1=65180&r2=65181&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/ImmutableMap.h (original)
+++ llvm/trunk/include/llvm/ADT/ImmutableMap.h Fri Feb 20 16:20:18 2009
@@ -18,8 +18,8 @@
namespace llvm {
-/// ImutKeyValueInfo -Traits class used by ImmutableMap. While both the first and
-/// second elements in a pair are used to generate profile information,
+/// ImutKeyValueInfo -Traits class used by ImmutableMap. While both the first
+/// and second elements in a pair are used to generate profile information,
/// only the first element (the key) is used by isEqual and isLess.
template <typename T, typename S>
struct ImutKeyValueInfo {
Modified: llvm/trunk/include/llvm/ADT/IndexedMap.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/IndexedMap.h?rev=65181&r1=65180&r2=65181&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/IndexedMap.h (original)
+++ llvm/trunk/include/llvm/ADT/IndexedMap.h Fri Feb 20 16:20:18 2009
@@ -20,9 +20,9 @@
#ifndef LLVM_ADT_INDEXEDMAP_H
#define LLVM_ADT_INDEXEDMAP_H
+#include <cassert>
#include <functional>
#include <vector>
-#include <cassert>
namespace llvm {
Modified: llvm/trunk/include/llvm/ADT/IntrusiveRefCntPtr.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/IntrusiveRefCntPtr.h?rev=65181&r1=65180&r2=65181&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/IntrusiveRefCntPtr.h (original)
+++ llvm/trunk/include/llvm/ADT/IntrusiveRefCntPtr.h Fri Feb 20 16:20:18 2009
@@ -1,4 +1,4 @@
-//== llvm/ADT/IntrusiveRefCntPtr.h - Smart Refcounting Pointer ----*- C++ -*-==//
+//== llvm/ADT/IntrusiveRefCntPtr.h - Smart Refcounting Pointer ---*- C++ -*-==//
//
// The LLVM Compiler Infrastructure
//
Modified: llvm/trunk/include/llvm/ADT/OwningPtr.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/OwningPtr.h?rev=65181&r1=65180&r2=65181&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/OwningPtr.h (original)
+++ llvm/trunk/include/llvm/ADT/OwningPtr.h Fri Feb 20 16:20:18 2009
@@ -26,7 +26,7 @@
template<class T>
class OwningPtr {
OwningPtr(OwningPtr const &); // DO NOT IMPLEMENT
- OwningPtr &operator=(OwningPtr const &); // DO NOT IMPLEMENT
+ OwningPtr &operator=(OwningPtr const &); // DO NOT IMPLEMENT
T *Ptr;
public:
explicit OwningPtr(T *P = 0) : Ptr(P) {}
Modified: llvm/trunk/include/llvm/ADT/PostOrderIterator.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/PostOrderIterator.h?rev=65181&r1=65180&r2=65181&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/PostOrderIterator.h (original)
+++ llvm/trunk/include/llvm/ADT/PostOrderIterator.h Fri Feb 20 16:20:18 2009
@@ -18,8 +18,8 @@
#include "llvm/ADT/GraphTraits.h"
#include "llvm/ADT/iterator.h"
-#include <stack>
#include <set>
+#include <stack>
#include <vector>
namespace llvm {
@@ -165,7 +165,8 @@
}
//Provide global definitions of external inverse postorder iterators...
-template <class T, class SetType = std::set<typename GraphTraits<T>::NodeType*> >
+template <class T,
+ class SetType = std::set<typename GraphTraits<T>::NodeType*> >
struct ipo_ext_iterator : public ipo_iterator<T, SetType, true> {
ipo_ext_iterator(const ipo_iterator<T, SetType, true> &V) :
ipo_iterator<T, SetType, true>(&V) {}
Modified: llvm/trunk/include/llvm/ADT/SCCIterator.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/SCCIterator.h?rev=65181&r1=65180&r2=65181&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/SCCIterator.h (original)
+++ llvm/trunk/include/llvm/ADT/SCCIterator.h Fri Feb 20 16:20:18 2009
@@ -23,8 +23,8 @@
#include "llvm/ADT/GraphTraits.h"
#include "llvm/ADT/iterator.h"
-#include <vector>
#include <map>
+#include <vector>
namespace llvm {
Modified: llvm/trunk/include/llvm/ADT/STLExtras.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/STLExtras.h?rev=65181&r1=65180&r2=65181&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/STLExtras.h (original)
+++ llvm/trunk/include/llvm/ADT/STLExtras.h Fri Feb 20 16:20:18 2009
@@ -17,9 +17,9 @@
#ifndef LLVM_ADT_STLEXTRAS_H
#define LLVM_ADT_STLEXTRAS_H
+#include <cstddef> // for std::size_t
#include <functional>
#include <utility> // for std::pair
-#include <cstddef> // for std::size_t
#include "llvm/ADT/iterator.h"
namespace llvm {
Modified: llvm/trunk/include/llvm/ADT/SetVector.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/SetVector.h?rev=65181&r1=65180&r2=65181&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/SetVector.h (original)
+++ llvm/trunk/include/llvm/ADT/SetVector.h Fri Feb 20 16:20:18 2009
@@ -21,9 +21,9 @@
#define LLVM_ADT_SETVECTOR_H
#include "llvm/ADT/SmallSet.h"
-#include <vector>
-#include <cassert>
#include <algorithm>
+#include <cassert>
+#include <vector>
namespace llvm {
Modified: llvm/trunk/include/llvm/ADT/SmallVector.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/SmallVector.h?rev=65181&r1=65180&r2=65181&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/SmallVector.h (original)
+++ llvm/trunk/include/llvm/ADT/SmallVector.h Fri Feb 20 16:20:18 2009
@@ -17,9 +17,9 @@
#include "llvm/ADT/iterator.h"
#include "llvm/Support/type_traits.h"
#include <algorithm>
+#include <cassert>
#include <cstring>
#include <memory>
-#include <cassert>
#ifdef _MSC_VER
namespace std {
Modified: llvm/trunk/include/llvm/ADT/Tree.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/Tree.h?rev=65181&r1=65180&r2=65181&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/Tree.h (original)
+++ llvm/trunk/include/llvm/ADT/Tree.h Fri Feb 20 16:20:18 2009
@@ -7,7 +7,7 @@
//
//===----------------------------------------------------------------------===//
//
-// This class defines a generic N way tree node structure. The tree structure
+// This class defines a generic N-way tree node structure. The tree structure
// is immutable after creation, but the payload contained within it is not.
//
//===----------------------------------------------------------------------===//
@@ -21,9 +21,9 @@
template<class ConcreteTreeNode, class Payload>
class Tree {
- std::vector<ConcreteTreeNode*> Children; // This nodes children, if any
- ConcreteTreeNode *Parent; // Parent of this node...
- Payload Data; // Data held in this node...
+ std::vector<ConcreteTreeNode*> Children; // This node's children, if any.
+ ConcreteTreeNode *Parent; // Parent of this node.
+ Payload Data; // Data held in this node.
protected:
void setChildren(const std::vector<ConcreteTreeNode*> &children) {
Modified: llvm/trunk/include/llvm/ADT/Trie.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/Trie.h?rev=65181&r1=65180&r2=65181&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/Trie.h (original)
+++ llvm/trunk/include/llvm/ADT/Trie.h Fri Feb 20 16:20:18 2009
@@ -279,9 +279,13 @@
typedef typename TrieType::Node NodeType;
typedef typename NodeType::iterator ChildIteratorType;
- static inline NodeType *getEntryNode(const TrieType& T) { return T.getRoot(); }
+ static inline NodeType *getEntryNode(const TrieType& T) {
+ return T.getRoot();
+ }
- static inline ChildIteratorType child_begin(NodeType *N) { return N->begin(); }
+ static inline ChildIteratorType child_begin(NodeType *N) {
+ return N->begin();
+ }
static inline ChildIteratorType child_end(NodeType *N) { return N->end(); }
typedef typename std::vector<NodeType*>::const_iterator nodes_iterator;
Modified: llvm/trunk/include/llvm/ADT/ilist.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/ilist.h?rev=65181&r1=65180&r2=65181&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/ilist.h (original)
+++ llvm/trunk/include/llvm/ADT/ilist.h Fri Feb 20 16:20:18 2009
@@ -370,7 +370,8 @@
}
iterator insert(iterator where, NodeTy *New) {
- NodeTy *CurNode = where.getNodePtrUnchecked(), *PrevNode = this->getPrev(CurNode);
+ NodeTy *CurNode = where.getNodePtrUnchecked();
+ NodeTy *PrevNode = this->getPrev(CurNode);
this->setNext(New, CurNode);
this->setPrev(New, PrevNode);
More information about the llvm-commits
mailing list