diff options
author | Stephen Hines <srhines@google.com> | 2014-12-01 14:51:49 -0800 |
---|---|---|
committer | Stephen Hines <srhines@google.com> | 2014-12-02 16:08:10 -0800 |
commit | 37ed9c199ca639565f6ce88105f9e39e898d82d0 (patch) | |
tree | 8fb36d3910e3ee4c4e1b7422f4f017108efc52f5 /unittests/Analysis/CallGraphTest.cpp | |
parent | d2327b22152ced7bc46dc629fc908959e8a52d03 (diff) | |
download | external_llvm-37ed9c199ca639565f6ce88105f9e39e898d82d0.zip external_llvm-37ed9c199ca639565f6ce88105f9e39e898d82d0.tar.gz external_llvm-37ed9c199ca639565f6ce88105f9e39e898d82d0.tar.bz2 |
Update aosp/master LLVM for rebase to r222494.
Change-Id: Ic787f5e0124df789bd26f3f24680f45e678eef2d
Diffstat (limited to 'unittests/Analysis/CallGraphTest.cpp')
-rw-r--r-- | unittests/Analysis/CallGraphTest.cpp | 59 |
1 files changed, 59 insertions, 0 deletions
diff --git a/unittests/Analysis/CallGraphTest.cpp b/unittests/Analysis/CallGraphTest.cpp new file mode 100644 index 0000000..777907a --- /dev/null +++ b/unittests/Analysis/CallGraphTest.cpp @@ -0,0 +1,59 @@ +//=======- CallGraphTest.cpp - Unit tests for the CG analysis -------------===// +// +// The LLVM Compiler Infrastructure +// +// This file is distributed under the University of Illinois Open Source +// License. See LICENSE.TXT for details. +// +//===----------------------------------------------------------------------===// + +#include "llvm/Analysis/CallGraph.h" +#include "llvm/IR/LLVMContext.h" +#include "llvm/IR/Module.h" +#include "gtest/gtest.h" + +using namespace llvm; + +namespace { + +template <typename Ty> void canSpecializeGraphTraitsIterators(Ty *G) { + typedef typename GraphTraits<Ty *>::NodeType NodeTy; + + 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, + "Node type does not match"); + static_assert(std::is_same<decltype(*X), NodeTy &>::value, + "Node type does not match"); + static_assert(std::is_same<decltype(*E), NodeTy &>::value, + "Node type does not match"); + + NodeTy *N = GraphTraits<Ty *>::getEntryNode(G); + + auto S = GraphTraits<NodeTy *>::child_begin(N); + auto F = GraphTraits<NodeTy *>::child_end(N); + + // Should be able to iterate over immediate successors of a node. + static_assert(std::is_same<decltype(*S), NodeTy *>::value, + "Node type does not match"); + static_assert(std::is_same<decltype(*F), NodeTy *>::value, + "Node type does not match"); +} + +TEST(CallGraphTest, GraphTraitsSpecialization) { + Module M("", getGlobalContext()); + CallGraph CG(M); + + canSpecializeGraphTraitsIterators(&CG); +} + +TEST(CallGraphTest, GraphTraitsConstSpecialization) { + Module M("", getGlobalContext()); + CallGraph CG(M); + + canSpecializeGraphTraitsIterators(const_cast<const CallGraph *>(&CG)); +} +} |