[llvm] r280257 - s/static inline/static/ for headers I have changed in r279475. NFC.
Tim Shen via llvm-commits
llvm-commits at lists.llvm.org
Wed Aug 31 09:48:14 PDT 2016
Author: timshen
Date: Wed Aug 31 11:48:13 2016
New Revision: 280257
URL: http://llvm.org/viewvc/llvm-project?rev=280257&view=rev
Log:
s/static inline/static/ for headers I have changed in r279475. NFC.
Modified:
llvm/trunk/include/llvm/Analysis/CallGraph.h
llvm/trunk/include/llvm/Analysis/Interval.h
llvm/trunk/include/llvm/Analysis/LoopInfo.h
llvm/trunk/include/llvm/CodeGen/MachineBasicBlock.h
llvm/trunk/include/llvm/CodeGen/MachineDominators.h
llvm/trunk/include/llvm/CodeGen/MachineLoopInfo.h
llvm/trunk/include/llvm/CodeGen/ScheduleDAG.h
llvm/trunk/include/llvm/CodeGen/SelectionDAGNodes.h
llvm/trunk/include/llvm/IR/CFG.h
llvm/trunk/include/llvm/IR/Dominators.h
llvm/trunk/include/llvm/IR/Type.h
llvm/trunk/include/llvm/Transforms/Utils/MemorySSA.h
llvm/trunk/lib/Analysis/BlockFrequencyInfo.cpp
llvm/trunk/lib/CodeGen/MachineBlockFrequencyInfo.cpp
llvm/trunk/lib/Transforms/IPO/FunctionAttrs.cpp
llvm/trunk/unittests/ADT/TestGraph.h
Modified: llvm/trunk/include/llvm/Analysis/CallGraph.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/Analysis/CallGraph.h?rev=280257&r1=280256&r2=280257&view=diff
==============================================================================
--- llvm/trunk/include/llvm/Analysis/CallGraph.h (original)
+++ llvm/trunk/include/llvm/Analysis/CallGraph.h Wed Aug 31 11:48:13 2016
@@ -420,10 +420,10 @@ template <> struct GraphTraits<CallGraph
typedef mapped_iterator<CallGraphNode::iterator, decltype(&CGNGetValue)>
ChildIteratorType;
- static inline ChildIteratorType child_begin(NodeRef N) {
+ static ChildIteratorType child_begin(NodeRef N) {
return ChildIteratorType(N->begin(), &CGNGetValue);
}
- static inline ChildIteratorType child_end(NodeRef N) {
+ static ChildIteratorType child_end(NodeRef N) {
return ChildIteratorType(N->end(), &CGNGetValue);
}
};
@@ -440,10 +440,10 @@ template <> struct GraphTraits<const Cal
typedef mapped_iterator<CallGraphNode::const_iterator, decltype(&CGNGetValue)>
ChildIteratorType;
- static inline ChildIteratorType child_begin(NodeRef N) {
+ static ChildIteratorType child_begin(NodeRef N) {
return ChildIteratorType(N->begin(), &CGNGetValue);
}
- static inline ChildIteratorType child_end(NodeRef N) {
+ static ChildIteratorType child_end(NodeRef N) {
return ChildIteratorType(N->end(), &CGNGetValue);
}
};
Modified: llvm/trunk/include/llvm/Analysis/Interval.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/Analysis/Interval.h?rev=280257&r1=280256&r2=280257&view=diff
==============================================================================
--- llvm/trunk/include/llvm/Analysis/Interval.h (original)
+++ llvm/trunk/include/llvm/Analysis/Interval.h Wed Aug 31 11:48:13 2016
@@ -127,20 +127,16 @@ template <> struct GraphTraits<Interval*
static NodeRef getEntryNode(Interval *I) { return I; }
/// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
- static inline ChildIteratorType child_begin(NodeRef N) {
- return succ_begin(N);
- }
- static inline ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
+ static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
+ static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
};
template <> struct GraphTraits<Inverse<Interval*> > {
typedef Interval *NodeRef;
typedef Interval::pred_iterator ChildIteratorType;
static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
- static inline ChildIteratorType child_begin(NodeRef N) {
- return pred_begin(N);
- }
- static inline ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
+ static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); }
+ static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
};
} // End llvm namespace
Modified: llvm/trunk/include/llvm/Analysis/LoopInfo.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/Analysis/LoopInfo.h?rev=280257&r1=280256&r2=280257&view=diff
==============================================================================
--- llvm/trunk/include/llvm/Analysis/LoopInfo.h (original)
+++ llvm/trunk/include/llvm/Analysis/LoopInfo.h Wed Aug 31 11:48:13 2016
@@ -765,8 +765,8 @@ template <> struct GraphTraits<const Loo
typedef LoopInfo::iterator ChildIteratorType;
static NodeRef getEntryNode(const Loop *L) { return L; }
- static inline ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
- static inline ChildIteratorType child_end(NodeRef N) { return N->end(); }
+ static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
+ static ChildIteratorType child_end(NodeRef N) { return N->end(); }
};
template <> struct GraphTraits<Loop*> {
@@ -774,8 +774,8 @@ template <> struct GraphTraits<Loop*> {
typedef LoopInfo::iterator ChildIteratorType;
static NodeRef getEntryNode(Loop *L) { return L; }
- static inline ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
- static inline ChildIteratorType child_end(NodeRef N) { return N->end(); }
+ static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
+ static ChildIteratorType child_end(NodeRef N) { return N->end(); }
};
/// \brief Analysis pass that exposes the \c LoopInfo for a function.
Modified: llvm/trunk/include/llvm/CodeGen/MachineBasicBlock.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/CodeGen/MachineBasicBlock.h?rev=280257&r1=280256&r2=280257&view=diff
==============================================================================
--- llvm/trunk/include/llvm/CodeGen/MachineBasicBlock.h (original)
+++ llvm/trunk/include/llvm/CodeGen/MachineBasicBlock.h Wed Aug 31 11:48:13 2016
@@ -733,10 +733,8 @@ template <> struct GraphTraits<MachineBa
typedef MachineBasicBlock::succ_iterator ChildIteratorType;
static NodeRef getEntryNode(MachineBasicBlock *BB) { return BB; }
- static inline ChildIteratorType child_begin(NodeRef N) {
- return N->succ_begin();
- }
- static inline ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
+ static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); }
+ static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
};
template <> struct GraphTraits<const MachineBasicBlock *> {
@@ -744,10 +742,8 @@ template <> struct GraphTraits<const Mac
typedef MachineBasicBlock::const_succ_iterator ChildIteratorType;
static NodeRef getEntryNode(const MachineBasicBlock *BB) { return BB; }
- static inline ChildIteratorType child_begin(NodeRef N) {
- return N->succ_begin();
- }
- static inline ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
+ static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); }
+ static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
};
// Provide specializations of GraphTraits to be able to treat a
@@ -762,10 +758,8 @@ template <> struct GraphTraits<Inverse<M
static NodeRef getEntryNode(Inverse<MachineBasicBlock *> G) {
return G.Graph;
}
- static inline ChildIteratorType child_begin(NodeRef N) {
- return N->pred_begin();
- }
- static inline ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
+ static ChildIteratorType child_begin(NodeRef N) { return N->pred_begin(); }
+ static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
};
template <> struct GraphTraits<Inverse<const MachineBasicBlock*> > {
@@ -774,10 +768,8 @@ template <> struct GraphTraits<Inverse<c
static NodeRef getEntryNode(Inverse<const MachineBasicBlock *> G) {
return G.Graph;
}
- static inline ChildIteratorType child_begin(NodeRef N) {
- return N->pred_begin();
- }
- static inline ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
+ static ChildIteratorType child_begin(NodeRef N) { return N->pred_begin(); }
+ static ChildIteratorType child_end(NodeRef N) { return N->pred_end(); }
};
Modified: llvm/trunk/include/llvm/CodeGen/MachineDominators.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/CodeGen/MachineDominators.h?rev=280257&r1=280256&r2=280257&view=diff
==============================================================================
--- llvm/trunk/include/llvm/CodeGen/MachineDominators.h (original)
+++ llvm/trunk/include/llvm/CodeGen/MachineDominators.h Wed Aug 31 11:48:13 2016
@@ -275,8 +275,8 @@ struct MachineDomTreeGraphTraitsBase {
typedef ChildIterator ChildIteratorType;
static NodeRef getEntryNode(NodeRef N) { return N; }
- static inline ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
- static inline ChildIteratorType child_end(NodeRef N) { return N->end(); }
+ static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
+ static ChildIteratorType child_end(NodeRef N) { return N->end(); }
};
template <class T> struct GraphTraits;
Modified: llvm/trunk/include/llvm/CodeGen/MachineLoopInfo.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/CodeGen/MachineLoopInfo.h?rev=280257&r1=280256&r2=280257&view=diff
==============================================================================
--- llvm/trunk/include/llvm/CodeGen/MachineLoopInfo.h (original)
+++ llvm/trunk/include/llvm/CodeGen/MachineLoopInfo.h Wed Aug 31 11:48:13 2016
@@ -166,8 +166,8 @@ template <> struct GraphTraits<const Mac
typedef MachineLoopInfo::iterator ChildIteratorType;
static NodeRef getEntryNode(const MachineLoop *L) { return L; }
- static inline ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
- static inline ChildIteratorType child_end(NodeRef N) { return N->end(); }
+ static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
+ static ChildIteratorType child_end(NodeRef N) { return N->end(); }
};
template <> struct GraphTraits<MachineLoop*> {
@@ -175,8 +175,8 @@ template <> struct GraphTraits<MachineLo
typedef MachineLoopInfo::iterator ChildIteratorType;
static NodeRef getEntryNode(MachineLoop *L) { return L; }
- static inline ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
- static inline ChildIteratorType child_end(NodeRef N) { return N->end(); }
+ static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
+ static ChildIteratorType child_end(NodeRef N) { return N->end(); }
};
} // End llvm namespace
Modified: llvm/trunk/include/llvm/CodeGen/ScheduleDAG.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/CodeGen/ScheduleDAG.h?rev=280257&r1=280256&r2=280257&view=diff
==============================================================================
--- llvm/trunk/include/llvm/CodeGen/ScheduleDAG.h (original)
+++ llvm/trunk/include/llvm/CodeGen/ScheduleDAG.h Wed Aug 31 11:48:13 2016
@@ -681,11 +681,11 @@ namespace llvm {
template <> struct GraphTraits<SUnit*> {
typedef SUnit *NodeRef;
typedef SUnitIterator ChildIteratorType;
- static inline NodeRef getEntryNode(SUnit *N) { return N; }
- static inline ChildIteratorType child_begin(NodeRef N) {
+ static NodeRef getEntryNode(SUnit *N) { return N; }
+ static ChildIteratorType child_begin(NodeRef N) {
return SUnitIterator::begin(N);
}
- static inline ChildIteratorType child_end(NodeRef N) {
+ static ChildIteratorType child_end(NodeRef N) {
return SUnitIterator::end(N);
}
};
Modified: llvm/trunk/include/llvm/CodeGen/SelectionDAGNodes.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/CodeGen/SelectionDAGNodes.h?rev=280257&r1=280256&r2=280257&view=diff
==============================================================================
--- llvm/trunk/include/llvm/CodeGen/SelectionDAGNodes.h (original)
+++ llvm/trunk/include/llvm/CodeGen/SelectionDAGNodes.h Wed Aug 31 11:48:13 2016
@@ -2106,11 +2106,11 @@ public:
template <> struct GraphTraits<SDNode*> {
typedef SDNode *NodeRef;
typedef SDNodeIterator ChildIteratorType;
- static inline NodeRef getEntryNode(SDNode *N) { return N; }
- static inline ChildIteratorType child_begin(NodeRef N) {
+ static NodeRef getEntryNode(SDNode *N) { return N; }
+ static ChildIteratorType child_begin(NodeRef N) {
return SDNodeIterator::begin(N);
}
- static inline ChildIteratorType child_end(NodeRef N) {
+ static ChildIteratorType child_end(NodeRef N) {
return SDNodeIterator::end(N);
}
};
Modified: llvm/trunk/include/llvm/IR/CFG.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/IR/CFG.h?rev=280257&r1=280256&r2=280257&view=diff
==============================================================================
--- llvm/trunk/include/llvm/IR/CFG.h (original)
+++ llvm/trunk/include/llvm/IR/CFG.h Wed Aug 31 11:48:13 2016
@@ -158,10 +158,8 @@ template <> struct GraphTraits<BasicBloc
typedef succ_iterator ChildIteratorType;
static NodeRef getEntryNode(BasicBlock *BB) { return BB; }
- static inline ChildIteratorType child_begin(NodeRef N) {
- return succ_begin(N);
- }
- static inline ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
+ static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
+ static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
};
template <> struct GraphTraits<const BasicBlock*> {
@@ -170,10 +168,8 @@ template <> struct GraphTraits<const Bas
static NodeRef getEntryNode(const BasicBlock *BB) { return BB; }
- static inline ChildIteratorType child_begin(NodeRef N) {
- return succ_begin(N);
- }
- static inline ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
+ static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
+ static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
};
// Provide specializations of GraphTraits to be able to treat a function as a
@@ -185,20 +181,16 @@ template <> struct GraphTraits<Inverse<B
typedef BasicBlock *NodeRef;
typedef pred_iterator ChildIteratorType;
static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
- static inline ChildIteratorType child_begin(NodeRef N) {
- return pred_begin(N);
- }
- static inline ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
+ static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); }
+ static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
};
template <> struct GraphTraits<Inverse<const BasicBlock*> > {
typedef const BasicBlock *NodeRef;
typedef const_pred_iterator ChildIteratorType;
static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
- static inline ChildIteratorType child_begin(NodeRef N) {
- return pred_begin(N);
- }
- static inline ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
+ static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); }
+ static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
};
Modified: llvm/trunk/include/llvm/IR/Dominators.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/IR/Dominators.h?rev=280257&r1=280256&r2=280257&view=diff
==============================================================================
--- llvm/trunk/include/llvm/IR/Dominators.h (original)
+++ llvm/trunk/include/llvm/IR/Dominators.h Wed Aug 31 11:48:13 2016
@@ -160,8 +160,8 @@ template <class Node, class ChildIterato
typedef df_iterator<Node *, SmallPtrSet<NodeRef, 8>> nodes_iterator;
static NodeRef getEntryNode(NodeRef N) { return N; }
- static inline ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
- static inline ChildIteratorType child_end(NodeRef N) { return N->end(); }
+ static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
+ static ChildIteratorType child_end(NodeRef N) { return N->end(); }
static nodes_iterator nodes_begin(NodeRef N) {
return df_begin(getEntryNode(N));
Modified: llvm/trunk/include/llvm/IR/Type.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/IR/Type.h?rev=280257&r1=280256&r2=280257&view=diff
==============================================================================
--- llvm/trunk/include/llvm/IR/Type.h (original)
+++ llvm/trunk/include/llvm/IR/Type.h Wed Aug 31 11:48:13 2016
@@ -432,26 +432,18 @@ template <> struct GraphTraits<Type *> {
typedef Type *NodeRef;
typedef Type::subtype_iterator ChildIteratorType;
- static inline NodeRef getEntryNode(Type *T) { return T; }
- static inline ChildIteratorType child_begin(NodeRef N) {
- return N->subtype_begin();
- }
- static inline ChildIteratorType child_end(NodeRef N) {
- return N->subtype_end();
- }
+ static NodeRef getEntryNode(Type *T) { return T; }
+ static ChildIteratorType child_begin(NodeRef N) { return N->subtype_begin(); }
+ static ChildIteratorType child_end(NodeRef N) { return N->subtype_end(); }
};
template <> struct GraphTraits<const Type*> {
typedef const Type *NodeRef;
typedef Type::subtype_iterator ChildIteratorType;
- static inline NodeRef getEntryNode(NodeRef T) { return T; }
- static inline ChildIteratorType child_begin(NodeRef N) {
- return N->subtype_begin();
- }
- static inline ChildIteratorType child_end(NodeRef N) {
- return N->subtype_end();
- }
+ static NodeRef getEntryNode(NodeRef T) { return T; }
+ static ChildIteratorType child_begin(NodeRef N) { return N->subtype_begin(); }
+ static ChildIteratorType child_end(NodeRef N) { return N->subtype_end(); }
};
// Create wrappers for C Binding types (see CBindingWrapping.h).
Modified: llvm/trunk/include/llvm/Transforms/Utils/MemorySSA.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/Transforms/Utils/MemorySSA.h?rev=280257&r1=280256&r2=280257&view=diff
==============================================================================
--- llvm/trunk/include/llvm/Transforms/Utils/MemorySSA.h (original)
+++ llvm/trunk/include/llvm/Transforms/Utils/MemorySSA.h Wed Aug 31 11:48:13 2016
@@ -880,10 +880,8 @@ template <> struct GraphTraits<MemoryAcc
using ChildIteratorType = memoryaccess_def_iterator;
static NodeRef getEntryNode(NodeRef N) { return N; }
- static inline ChildIteratorType child_begin(NodeRef N) {
- return N->defs_begin();
- }
- static inline ChildIteratorType child_end(NodeRef N) { return N->defs_end(); }
+ static ChildIteratorType child_begin(NodeRef N) { return N->defs_begin(); }
+ static ChildIteratorType child_end(NodeRef N) { return N->defs_end(); }
};
template <> struct GraphTraits<Inverse<MemoryAccess *>> {
@@ -891,10 +889,8 @@ template <> struct GraphTraits<Inverse<M
using ChildIteratorType = MemoryAccess::iterator;
static NodeRef getEntryNode(NodeRef N) { return N; }
- static inline ChildIteratorType child_begin(NodeRef N) {
- return N->user_begin();
- }
- static inline ChildIteratorType child_end(NodeRef N) { return N->user_end(); }
+ static ChildIteratorType child_begin(NodeRef N) { return N->user_begin(); }
+ static ChildIteratorType child_end(NodeRef N) { return N->user_end(); }
};
/// \brief Provide an iterator that walks defs, giving both the memory access,
Modified: llvm/trunk/lib/Analysis/BlockFrequencyInfo.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Analysis/BlockFrequencyInfo.cpp?rev=280257&r1=280256&r2=280257&view=diff
==============================================================================
--- llvm/trunk/lib/Analysis/BlockFrequencyInfo.cpp (original)
+++ llvm/trunk/lib/Analysis/BlockFrequencyInfo.cpp Wed Aug 31 11:48:13 2016
@@ -64,7 +64,7 @@ struct GraphTraits<BlockFrequencyInfo *>
typedef succ_const_iterator ChildIteratorType;
typedef pointer_iterator<Function::const_iterator> nodes_iterator;
- static inline NodeRef getEntryNode(const BlockFrequencyInfo *G) {
+ static NodeRef getEntryNode(const BlockFrequencyInfo *G) {
return &G->getFunction()->front();
}
static ChildIteratorType child_begin(const NodeRef N) {
Modified: llvm/trunk/lib/CodeGen/MachineBlockFrequencyInfo.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/CodeGen/MachineBlockFrequencyInfo.cpp?rev=280257&r1=280256&r2=280257&view=diff
==============================================================================
--- llvm/trunk/lib/CodeGen/MachineBlockFrequencyInfo.cpp (original)
+++ llvm/trunk/lib/CodeGen/MachineBlockFrequencyInfo.cpp Wed Aug 31 11:48:13 2016
@@ -56,7 +56,7 @@ template <> struct GraphTraits<MachineBl
typedef MachineBasicBlock::const_succ_iterator ChildIteratorType;
typedef pointer_iterator<MachineFunction::const_iterator> nodes_iterator;
- static inline NodeRef getEntryNode(const MachineBlockFrequencyInfo *G) {
+ static NodeRef getEntryNode(const MachineBlockFrequencyInfo *G) {
return &G->getFunction()->front();
}
Modified: llvm/trunk/lib/Transforms/IPO/FunctionAttrs.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Transforms/IPO/FunctionAttrs.cpp?rev=280257&r1=280256&r2=280257&view=diff
==============================================================================
--- llvm/trunk/lib/Transforms/IPO/FunctionAttrs.cpp (original)
+++ llvm/trunk/lib/Transforms/IPO/FunctionAttrs.cpp Wed Aug 31 11:48:13 2016
@@ -335,11 +335,9 @@ template <> struct GraphTraits<ArgumentG
typedef ArgumentGraphNode *NodeRef;
typedef SmallVectorImpl<ArgumentGraphNode *>::iterator ChildIteratorType;
- static inline NodeRef getEntryNode(NodeRef A) { return A; }
- static inline ChildIteratorType child_begin(NodeRef N) {
- return N->Uses.begin();
- }
- static inline ChildIteratorType child_end(NodeRef N) { return N->Uses.end(); }
+ static NodeRef getEntryNode(NodeRef A) { return A; }
+ static ChildIteratorType child_begin(NodeRef N) { return N->Uses.begin(); }
+ static ChildIteratorType child_end(NodeRef N) { return N->Uses.end(); }
};
template <>
struct GraphTraits<ArgumentGraph *> : public GraphTraits<ArgumentGraphNode *> {
Modified: llvm/trunk/unittests/ADT/TestGraph.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/unittests/ADT/TestGraph.h?rev=280257&r1=280256&r2=280257&view=diff
==============================================================================
--- llvm/trunk/unittests/ADT/TestGraph.h (original)
+++ llvm/trunk/unittests/ADT/TestGraph.h Wed Aug 31 11:48:13 2016
@@ -237,13 +237,11 @@ struct GraphTraits<Graph<N> > {
typedef typename Graph<N>::NodeType *NodeRef;
typedef typename Graph<N>::ChildIterator ChildIteratorType;
- static inline NodeRef getEntryNode(const Graph<N> &G) {
- return G.AccessNode(0);
- }
- static inline ChildIteratorType child_begin(NodeRef Node) {
+ static NodeRef getEntryNode(const Graph<N> &G) { return G.AccessNode(0); }
+ static ChildIteratorType child_begin(NodeRef Node) {
return Graph<N>::child_begin(Node);
}
- static inline ChildIteratorType child_end(NodeRef Node) {
+ static ChildIteratorType child_end(NodeRef Node) {
return Graph<N>::child_end(Node);
}
};
More information about the llvm-commits
mailing list