diff options
author | Tim Shen <timshen91@gmail.com> | 2016-08-22 21:09:30 +0000 |
---|---|---|
committer | Tim Shen <timshen91@gmail.com> | 2016-08-22 21:09:30 +0000 |
commit | f2187ed3210377902124b326957f8721bb58733a (patch) | |
tree | 4505affdaf0d52c11907f4132beb6b21aae6a92c /llvm/unittests/Analysis/CallGraphTest.cpp | |
parent | b29ec1e040fb798418eee8a14e13f9df7c372658 (diff) | |
download | bcm5719-llvm-f2187ed3210377902124b326957f8721bb58733a.tar.gz bcm5719-llvm-f2187ed3210377902124b326957f8721bb58733a.zip |
[GraphTraits] Replace all NodeType usage with NodeRef
This should finish the GraphTraits migration.
Differential Revision: http://reviews.llvm.org/D23730
llvm-svn: 279475
Diffstat (limited to 'llvm/unittests/Analysis/CallGraphTest.cpp')
-rw-r--r-- | llvm/unittests/Analysis/CallGraphTest.cpp | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/llvm/unittests/Analysis/CallGraphTest.cpp b/llvm/unittests/Analysis/CallGraphTest.cpp index 0c9280446bc..2d4e63facf3 100644 --- a/llvm/unittests/Analysis/CallGraphTest.cpp +++ b/llvm/unittests/Analysis/CallGraphTest.cpp @@ -17,29 +17,29 @@ using namespace llvm; namespace { template <typename Ty> void canSpecializeGraphTraitsIterators(Ty *G) { - typedef typename GraphTraits<Ty *>::NodeType NodeTy; + typedef typename GraphTraits<Ty *>::NodeRef NodeRef; auto I = GraphTraits<Ty *>::nodes_begin(G); auto E = GraphTraits<Ty *>::nodes_end(G); auto X = ++I; // Should be able to iterate over all nodes of the graph. - static_assert(std::is_same<decltype(*I), NodeTy *>::value, + static_assert(std::is_same<decltype(*I), NodeRef>::value, "Node type does not match"); - static_assert(std::is_same<decltype(*X), NodeTy *>::value, + static_assert(std::is_same<decltype(*X), NodeRef>::value, "Node type does not match"); - static_assert(std::is_same<decltype(*E), NodeTy *>::value, + static_assert(std::is_same<decltype(*E), NodeRef>::value, "Node type does not match"); - NodeTy *N = GraphTraits<Ty *>::getEntryNode(G); + NodeRef N = GraphTraits<Ty *>::getEntryNode(G); - auto S = GraphTraits<NodeTy *>::child_begin(N); - auto F = GraphTraits<NodeTy *>::child_end(N); + auto S = GraphTraits<NodeRef>::child_begin(N); + auto F = GraphTraits<NodeRef>::child_end(N); // Should be able to iterate over immediate successors of a node. - static_assert(std::is_same<decltype(*S), NodeTy *>::value, + static_assert(std::is_same<decltype(*S), NodeRef>::value, "Node type does not match"); - static_assert(std::is_same<decltype(*F), NodeTy *>::value, + static_assert(std::is_same<decltype(*F), NodeRef>::value, "Node type does not match"); } |