/external/llvm/lib/Analysis/IPA/ |
H A D | CallPrinter.cpp | 17 #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 D | CallGraph.cpp | 1 //===- CallGraph.cpp - Build a Module's call graph ------------------------===// 10 // This file implements the CallGraph class and provides the BasicCallGraph 15 #include "llvm/Analysis/CallGraph.h" 29 class BasicCallGraph : public ModulePass, public CallGraph { 52 CallGraph::initialize(M); 73 OS << "CallGraph Root is: "; 80 CallGraph::print(OS, 0); 92 if (PI == &CallGraph::ID) 93 return (CallGraph*)this; 108 // Implementation of CallGraph constructio [all...] |
H A D | CallGraphSCCPass.cpp | 22 #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 D | Android.mk | 4 CallGraph.cpp \
|
H A D | GlobalsModRef.cpp | 22 #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_AG_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;
|
/external/clang/lib/Analysis/ |
H A D | CallGraph.cpp | 1 //== 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...] |
H A D | Android.mk | 21 CallGraph.cpp \
|
/external/clang/include/clang/Analysis/ |
H A D | CallGraph.h | 1 //== 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...] |
/external/llvm/include/llvm/Analysis/ |
H A D | CallGraph.h | 1 //===- 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 { class in namespace:llvm 152 CallGraph() {} function in class:llvm::CallGraph 155 virtual ~CallGraph() { destroy(); } 158 /// re/initializes the state of the CallGraph. 173 friend class CallGraph; [all...] |
H A D | CallGraphSCCPass.h | 24 #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) {
|
/external/llvm/include/llvm/Transforms/IPO/ |
H A D | InlinerPass.h | 48 virtual bool doFinalization(CallGraph &CG); 75 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
|
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | Cloning.h | 41 class CallGraph; 162 explicit InlineFunctionInfo(CallGraph *cg = 0, const DataLayout *td = 0) 167 CallGraph *CG;
|
/external/llvm/lib/Transforms/IPO/ |
H A D | InlineAlways.cpp | 18 #include "llvm/Analysis/CallGraph.h" 56 virtual bool doFinalization(CallGraph &CG) { 66 INITIALIZE_AG_DEPENDENCY(CallGraph)
|
H A D | InlineSimple.cpp | 16 #include "llvm/Analysis/CallGraph.h" 64 INITIALIZE_AG_DEPENDENCY(CallGraph)
|
H A D | PruneEH.cpp | 22 #include "llvm/Analysis/CallGraph.h" 54 INITIALIZE_AG_DEPENDENCY(CallGraph) 63 CallGraph &CG = getAnalysis<CallGraph>(); 237 CallGraph &CG = getAnalysis<CallGraph>();
|
H A D | Internalize.cpp | 20 #include "llvm/Analysis/CallGraph.h" 61 AU.addPreserved<CallGraph>(); 113 CallGraph *CG = getAnalysisIfAvailable<CallGraph>();
|
H A D | Inliner.cpp | 20 #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 D | ArgumentPromotion.cpp | 38 #include "llvm/Analysis/CallGraph.h" 91 INITIALIZE_AG_DEPENDENCY(CallGraph) 622 CallGraph &CG = getAnalysis<CallGraph>();
|
H A D | FunctionAttrs.cpp | 28 #include "llvm/Analysis/CallGraph.h" 139 INITIALIZE_AG_DEPENDENCY(CallGraph)
|
/external/llvm/tools/opt/ |
H A D | AnalysisWrappers.cpp | 20 #include "llvm/Analysis/CallGraph.h" 83 AU.addRequiredTransitive<CallGraph>(); 86 getAnalysis<CallGraph>().print(errs(), &M);
|
H A D | PrintSCC.cpp | 10 // 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();
|
/external/clang/lib/StaticAnalyzer/Checkers/ |
H A D | DebugCheckers.cpp | 17 #include "clang/Analysis/CallGraph.h" 119 CallGraph CG; 139 CallGraph CG;
|
/external/clang/lib/StaticAnalyzer/Frontend/ |
H A D | AnalysisConsumer.cpp | 25 #include "clang/Analysis/CallGraph.h" 431 // Note: CallGraph can trigger deserialization of more items from a pch 434 CallGraph CG; 447 llvm::ReversePostOrderTraversal<clang::CallGraph*> RPOT(&CG); 448 for (llvm::ReversePostOrderTraversal<clang::CallGraph*>::rpo_iterator
|
/external/llvm/unittests/IR/ |
H A D | PassManagerTest.cpp | 166 struct CGPass : public PassTest<CallGraph, CallGraphSCCPass> { 546 INITIALIZE_AG_DEPENDENCY(CallGraph)
|
/external/llvm/lib/Transforms/Utils/ |
H A D | InlineFunction.cpp | 18 #include "llvm/Analysis/CallGraph.h" 216 // updates the CallGraph if present, because it uses a WeakVH. 282 CallGraph &CG = *IFI.CG;
|