6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-06-14 14:24:05 +00:00
Code Issues Projects Releases Wiki Activity

Fix GraphTraits for "const CallGraphNode *" and "const CallGraph *"

Browse Source 
The specializations were broken. For example,

void foo(const CallGraph *G) {
  auto I = GraphTraits<const CallGraph *>::nodes_begin(G);
  auto K = I++;

  ...
}

or

void bar(const CallGraphNode *N) {
  auto I = GraphTraits<const CallGraphNode *>::nodes_begin(G);
  auto K = I++;

  ....
}

would not compile.

Patch by Speziale Ettore!

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@222149 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Rafael Espindola
2014-11-17 17:51:45 +00:00
parent 29e8a627ba
commit 95764ec6ed
4 changed files with 93 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

62
unittests/Analysis/CallGraphTest.cpp Normal file
View File

@ -0,0 +1,62 @@
//=======- 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);
auto Y = ++S;
// 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");
static_assert(std::is_same<decltype(*Y), 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));
}
}