diff options
| author | 2020-08-03 15:06:44 +0000 | |
|---|---|---|
| committer | 2020-08-03 15:06:44 +0000 | |
| commit | b64793999546ed8adebaeebd9d8345d18db8927d (patch) | |
| tree | 4357c27b561d73b0e089727c6ed659f2ceff5f47 /gnu/llvm/unittests/Analysis/CallGraphTest.cpp | |
| parent | Add support for UTF-8 DISPLAY-HINTs with octet length. For now only (diff) | |
| download | wireguard-openbsd-b64793999546ed8adebaeebd9d8345d18db8927d.tar.xz wireguard-openbsd-b64793999546ed8adebaeebd9d8345d18db8927d.zip | |
Remove LLVM 8.0.1 files.
Diffstat (limited to 'gnu/llvm/unittests/Analysis/CallGraphTest.cpp')
| -rw-r--r-- | gnu/llvm/unittests/Analysis/CallGraphTest.cpp | 61 |
1 files changed, 0 insertions, 61 deletions
diff --git a/gnu/llvm/unittests/Analysis/CallGraphTest.cpp b/gnu/llvm/unittests/Analysis/CallGraphTest.cpp deleted file mode 100644 index 2d4e63facf3..00000000000 --- a/gnu/llvm/unittests/Analysis/CallGraphTest.cpp +++ /dev/null @@ -1,61 +0,0 @@ -//=======- 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 *>::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), NodeRef>::value, - "Node type does not match"); - static_assert(std::is_same<decltype(*X), NodeRef>::value, - "Node type does not match"); - static_assert(std::is_same<decltype(*E), NodeRef>::value, - "Node type does not match"); - - NodeRef N = GraphTraits<Ty *>::getEntryNode(G); - - 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), NodeRef>::value, - "Node type does not match"); - static_assert(std::is_same<decltype(*F), NodeRef>::value, - "Node type does not match"); -} - -TEST(CallGraphTest, GraphTraitsSpecialization) { - LLVMContext Context; - Module M("", Context); - CallGraph CG(M); - - canSpecializeGraphTraitsIterators(&CG); -} - -TEST(CallGraphTest, GraphTraitsConstSpecialization) { - LLVMContext Context; - Module M("", Context); - CallGraph CG(M); - - canSpecializeGraphTraitsIterators(const_cast<const CallGraph *>(&CG)); -} -} |
