llvm.org GIT mirror llvm / a2769a3
Fixed lint errors: * Alphabetized #includes * Removed trailing whitespace * Wrapped or shortened lines over 80 chars git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@65181 91177308-0d34-0410-b5e6-96231b3b80d8 Misha Brukman 11 years ago
15 changed file(s) with 31 addition(s) and 24 deletion(s). Raw diff Collapse all Expand all
12741274 /// srcLSB, to DST, of dstCOUNT parts, such that the bit srcLSB
12751275 /// becomes the least significant bit of DST. All high bits above
12761276 /// srcBITS in DST are zero-filled.
1277 static void tcExtract(integerPart *, unsigned int dstCount, const integerPart *,
1277 static void tcExtract(integerPart *, unsigned int dstCount,
1278 const integerPart *,
12781279 unsigned int srcBits, unsigned int srcLSB);
12791280
12801281 /// Set the given bit of a bignum. Zero-based.
3535 #include "llvm/ADT/GraphTraits.h"
3636 #include "llvm/ADT/iterator.h"
3737 #include "llvm/ADT/SmallPtrSet.h"
38 #include
3839 #include
39 #include
4040
4141 namespace llvm {
4242
7777 inline Inverse(const GraphType &G) : Graph(G) {}
7878 };
7979
80 // Provide a partial specialization of GraphTraits so that the inverse of an inverse
81 // falls back to the original graph.
80 // Provide a partial specialization of GraphTraits so that the inverse of an
81 // inverse falls back to the original graph.
8282 template
8383 struct GraphTraits > > {
8484 typedef typename GraphTraits::NodeType NodeType;
1717
1818 namespace llvm {
1919
20 /// ImutKeyValueInfo -Traits class used by ImmutableMap. While both the first and
21 /// second elements in a pair are used to generate profile information,
20 /// ImutKeyValueInfo -Traits class used by ImmutableMap. While both the first
21 /// and second elements in a pair are used to generate profile information,
2222 /// only the first element (the key) is used by isEqual and isLess.
2323 template
2424 struct ImutKeyValueInfo {
1919 #ifndef LLVM_ADT_INDEXEDMAP_H
2020 #define LLVM_ADT_INDEXEDMAP_H
2121
22 #include
2223 #include
2324 #include
24 #include
2525
2626 namespace llvm {
2727
None //== llvm/ADT/IntrusiveRefCntPtr.h - Smart Refcounting Pointer ----*- C++ -*-==//
0 //== llvm/ADT/IntrusiveRefCntPtr.h - Smart Refcounting Pointer ---*- C++ -*-==//
11 //
22 // The LLVM Compiler Infrastructure
33 //
2525 template
2626 class OwningPtr {
2727 OwningPtr(OwningPtr const &); // DO NOT IMPLEMENT
28 OwningPtr &operator=(OwningPtr const &); // DO NOT IMPLEMENT
28 OwningPtr &operator=(OwningPtr const &); // DO NOT IMPLEMENT
2929 T *Ptr;
3030 public:
3131 explicit OwningPtr(T *P = 0) : Ptr(P) {}
1717
1818 #include "llvm/ADT/GraphTraits.h"
1919 #include "llvm/ADT/iterator.h"
20 #include
2021 #include
21 #include
2222 #include
2323
2424 namespace llvm {
164164 }
165165
166166 //Provide global definitions of external inverse postorder iterators...
167 template class SetType = std::set::NodeType*> >
167 template
168 class SetType = std::set::NodeType*> >
168169 struct ipo_ext_iterator : public ipo_iterator {
169170 ipo_ext_iterator(const ipo_iterator &V) :
170171 ipo_iterator(&V) {}
2222
2323 #include "llvm/ADT/GraphTraits.h"
2424 #include "llvm/ADT/iterator.h"
25 #include
2526 #include
26 #include
2727
2828 namespace llvm {
2929
1616 #ifndef LLVM_ADT_STLEXTRAS_H
1717 #define LLVM_ADT_STLEXTRAS_H
1818
19 #include // for std::size_t
1920 #include
2021 #include // for std::pair
21 #include // for std::size_t
2222 #include "llvm/ADT/iterator.h"
2323
2424 namespace llvm {
2020 #define LLVM_ADT_SETVECTOR_H
2121
2222 #include "llvm/ADT/SmallSet.h"
23 #include
24 #include
2325 #include
24 #include
25 #include
2626
2727 namespace llvm {
2828
1616 #include "llvm/ADT/iterator.h"
1717 #include "llvm/Support/type_traits.h"
1818 #include
19 #include
1920 #include
2021 #include
21 #include
2222
2323 #ifdef _MSC_VER
2424 namespace std {
66 //
77 //===----------------------------------------------------------------------===//
88 //
9 // This class defines a generic N way tree node structure. The tree structure
9 // This class defines a generic N-way tree node structure. The tree structure
1010 // is immutable after creation, but the payload contained within it is not.
1111 //
1212 //===----------------------------------------------------------------------===//
2020
2121 template
2222 class Tree {
23 std::vector Children; // This nodes children, if any
24 ConcreteTreeNode *Parent; // Parent of this node...
25 Payload Data; // Data held in this node...
23 std::vector Children; // This node's children, if any.
24 ConcreteTreeNode *Parent; // Parent of this node.
25 Payload Data; // Data held in this node.
2626
2727 protected:
2828 void setChildren(const std::vector &children) {
278278 typedef typename TrieType::Node NodeType;
279279 typedef typename NodeType::iterator ChildIteratorType;
280280
281 static inline NodeType *getEntryNode(const TrieType& T) { return T.getRoot(); }
282
283 static inline ChildIteratorType child_begin(NodeType *N) { return N->begin(); }
281 static inline NodeType *getEntryNode(const TrieType& T) {
282 return T.getRoot();
283 }
284
285 static inline ChildIteratorType child_begin(NodeType *N) {
286 return N->begin();
287 }
284288 static inline ChildIteratorType child_end(NodeType *N) { return N->end(); }
285289
286290 typedef typename std::vector::const_iterator nodes_iterator;
369369 }
370370
371371 iterator insert(iterator where, NodeTy *New) {
372 NodeTy *CurNode = where.getNodePtrUnchecked(), *PrevNode = this->getPrev(CurNode);
372 NodeTy *CurNode = where.getNodePtrUnchecked();
373 NodeTy *PrevNode = this->getPrev(CurNode);
373374 this->setNext(New, CurNode);
374375 this->setPrev(New, PrevNode);
375376