Searched refs:CallGraph (Results 1 - 24 of 24) sorted by relevance

/freebsd-10.2-release/contrib/llvm/lib/Analysis/IPA/
H A DCallPrinter.cpp17 #include "llvm/Analysis/CallGraph.h"
26 struct DOTGraphTraits<CallGraph*> : public DefaultDOTGraphTraits {
29 static std::string getGraphName(CallGraph *Graph) {
33 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) {
46 : public DOTGraphTraitsModuleViewer<CallGraph, true> {
50 : DOTGraphTraitsModuleViewer<CallGraph, true>("callgraph", ID) {
56 : public DOTGraphTraitsModulePrinter<CallGraph, true> {
60 : DOTGraphTraitsModulePrinter<CallGraph, true>("callgraph", ID) {
H A DCallGraph.cpp1 //===- CallGraph.cpp - Build a Module's call graph ------------------------===//
10 #include "llvm/Analysis/CallGraph.h"
19 CallGraph::CallGraph() function in class:CallGraph
24 void CallGraph::addToCallGraph(Function *F) {
65 void CallGraph::getAnalysisUsage(AnalysisUsage &AU) const {
69 bool CallGraph::runOnModule(Module &M) {
88 INITIALIZE_PASS(CallGraph, "basiccg", "CallGraph Construction", false, true)
90 char CallGraph
[all...]
H A DCallGraphSCCPass.cpp22 #include "llvm/Analysis/CallGraph.h"
57 bool doInitialization(CallGraph &CG);
58 bool doFinalization(CallGraph &CG);
62 // CGPassManager walks SCC and it needs CallGraph.
63 Info.addRequired<CallGraph>();
68 return "CallGraph Pass Manager";
94 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
98 CallGraph &CG, bool &CallGraphUpToDate,
100 bool RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG,
110 CallGraph
[all...]
H A DGlobalsModRef.cpp22 #include "llvm/Analysis/CallGraph.h"
100 AnalyzeCallGraph(getAnalysis<CallGraph>(), M); // Propagate on CG
106 AU.addRequired<CallGraph>();
180 void AnalyzeCallGraph(CallGraph &CG, Module &M);
192 INITIALIZE_PASS_DEPENDENCY(CallGraph)
363 void GlobalsModRef::AnalyzeCallGraph(CallGraph &CG, Module &M) {
366 for (scc_iterator<CallGraph*> I = scc_begin(&CG), E = scc_end(&CG); I != E;
/freebsd-10.2-release/contrib/llvm/tools/clang/lib/Analysis/
H A DCallGraph.cpp1 //== CallGraph.cpp - AST-based Call graph ----------------------*- C++ -*--==//
10 // This file defines the AST-based CallGraph.
13 #define DEBUG_TYPE "CallGraph"
15 #include "clang/Analysis/CallGraph.h"
32 CallGraph *G;
36 CGBuilder(CallGraph *g, CallGraphNode *N)
94 void CallGraph::addNodesForBlocks(DeclContext *D) {
104 CallGraph::CallGraph() { function in class:CallGraph
108 CallGraph
[all...]
/freebsd-10.2-release/contrib/llvm/tools/clang/include/clang/Analysis/
H A DCallGraph.h1 //== CallGraph.h - AST-based Call graph ------------------------*- C++ -*--==//
10 // This file declares the AST-based CallGraph.
34 class CallGraph : public RecursiveASTVisitor<CallGraph> { class in namespace:clang
46 CallGraph();
47 ~CallGraph();
159 void addCallee(CallGraphNode *N, CallGraph *CG) {
199 template <> struct GraphTraits<clang::CallGraph*>
202 static NodeType *getEntryNode(clang::CallGraph *CGN) {
208 typedef mapped_iterator<clang::CallGraph
[all...]
/freebsd-10.2-release/lib/clang/libllvmipa/
H A DMakefile8 SRCS= CallGraph.cpp \
/freebsd-10.2-release/contrib/llvm/include/llvm/Analysis/
H A DCallGraph.h1 //===- CallGraph.h - Build a Module's call graph ----------------*- C++ -*-===//
39 // Because of these properties, the CallGraph captures a conservative superset
43 // The CallGraph class also attempts to figure out what the root of the
44 // CallGraph is, which it currently does by looking for a function named 'main'.
70 // CallGraph class definition
72 class CallGraph : public ModulePass { class in namespace:llvm
160 CallGraph();
161 virtual ~CallGraph() { releaseMemory(); }
174 friend class CallGraph;
222 /// CallGraph tha
[all...]
H A DCallGraphSCCPass.h24 #include "llvm/Analysis/CallGraph.h"
30 class CallGraph;
39 /// corresponding to a CallGraph.
47 virtual bool doInitialization(CallGraph &CG) {
63 virtual bool doFinalization(CallGraph &CG) {
/freebsd-10.2-release/contrib/llvm/include/llvm/Transforms/IPO/
H A DInlinerPass.h48 virtual bool doFinalization(CallGraph &CG);
75 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
/freebsd-10.2-release/contrib/llvm/include/llvm/Transforms/Utils/
H A DCloning.h41 class CallGraph;
162 explicit InlineFunctionInfo(CallGraph *cg = 0, const DataLayout *td = 0)
167 CallGraph *CG;
/freebsd-10.2-release/contrib/llvm/tools/opt/
H A DAnalysisWrappers.cpp20 #include "llvm/Analysis/CallGraph.h"
83 AU.addRequiredTransitive<CallGraph>();
86 getAnalysis<CallGraph>().print(errs(), &M);
H A DPrintSCC.cpp10 // This file provides passes to print out SCCs in a CFG or a CallGraph.
16 // (2) To print out the SCCs for a CFG or a CallGraph:
22 // analyze -print-callgraph-sccs [-stats] [-debug] to print SCCs in the CallGraph
29 #include "llvm/Analysis/CallGraph.h"
58 // getAnalysisUsage - This pass requires the CallGraph.
61 AU.addRequired<CallGraph>();
95 CallGraphNode* rootNode = getAnalysis<CallGraph>().getRoot();
/freebsd-10.2-release/contrib/llvm/lib/Transforms/IPO/
H A DInlineAlways.cpp18 #include "llvm/Analysis/CallGraph.h"
56 virtual bool doFinalization(CallGraph &CG) {
66 INITIALIZE_PASS_DEPENDENCY(CallGraph)
H A DInlineSimple.cpp16 #include "llvm/Analysis/CallGraph.h"
64 INITIALIZE_PASS_DEPENDENCY(CallGraph)
H A DPruneEH.cpp22 #include "llvm/Analysis/CallGraph.h"
54 INITIALIZE_PASS_DEPENDENCY(CallGraph)
63 CallGraph &CG = getAnalysis<CallGraph>();
237 CallGraph &CG = getAnalysis<CallGraph>();
H A DInternalize.cpp26 #include "llvm/Analysis/CallGraph.h"
66 AU.addPreserved<CallGraph>();
130 CallGraph *CG = getAnalysisIfAvailable<CallGraph>();
H A DInliner.cpp20 #include "llvm/Analysis/CallGraph.h"
110 /// do so and update the CallGraph for this operation.
398 CallGraph &CG = getAnalysis<CallGraph>();
572 bool Inliner::doFinalization(CallGraph &CG) {
578 bool Inliner::removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly) {
583 for (CallGraph::iterator I = CG.begin(), E = CG.end(); I != E; ++I) {
619 // this inline, because that would invalidate our CallGraph::iterator
H A DArgumentPromotion.cpp38 #include "llvm/Analysis/CallGraph.h"
91 INITIALIZE_PASS_DEPENDENCY(CallGraph)
624 CallGraph &CG = getAnalysis<CallGraph>();
H A DFunctionAttrs.cpp28 #include "llvm/Analysis/CallGraph.h"
140 INITIALIZE_PASS_DEPENDENCY(CallGraph)
/freebsd-10.2-release/lib/clang/libclanganalysis/
H A DMakefile13 CallGraph.cpp \
/freebsd-10.2-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/
H A DDebugCheckers.cpp17 #include "clang/Analysis/CallGraph.h"
119 CallGraph CG;
139 CallGraph CG;
/freebsd-10.2-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Frontend/
H A DAnalysisConsumer.cpp25 #include "clang/Analysis/CallGraph.h"
467 // Note: CallGraph can trigger deserialization of more items from a pch
470 CallGraph CG;
483 llvm::ReversePostOrderTraversal<clang::CallGraph*> RPOT(&CG);
484 for (llvm::ReversePostOrderTraversal<clang::CallGraph*>::rpo_iterator
/freebsd-10.2-release/contrib/llvm/lib/Transforms/Utils/
H A DInlineFunction.cpp18 #include "llvm/Analysis/CallGraph.h"
217 // updates the CallGraph if present, because it uses a WeakVH.
283 CallGraph &CG = *IFI.CG;

Completed in 275 milliseconds