| /external/clang/lib/Analysis/ |
| CallGraph.cpp | 1 //== CallGraph.cpp - AST-based Call graph ----------------------*- C++ -*--==//
10 // This file defines the AST-based CallGraph.
13 #include "clang/Analysis/CallGraph.h"
27 CallGraph *G;
32 CGBuilder(CallGraph *g, const Decl *D, CallGraphNode *N)
55 CallGraph::CallGraph() {
59 CallGraph::~CallGraph() {
68 bool CallGraph::includeInGraph(const Decl *D)
[all...] |
| Android.mk | 18 CallGraph.cpp \
|
| /external/llvm/tools/opt/ |
| GraphPrinters.cpp | 20 #include "llvm/Analysis/CallGraph.h"
53 struct DOTGraphTraits<CallGraph*> : public DefaultDOTGraphTraits {
57 static std::string getGraphName(CallGraph *F) {
61 static std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) {
76 WriteGraphToFile(llvm::errs(), "callgraph", &getAnalysis<CallGraph>());
83 AU.addRequired<CallGraph>();
90 static RegisterPass<CallGraphPrinter> P2("dot-callgraph",
|
| AnalysisWrappers.cpp | 23 #include "llvm/Analysis/CallGraph.h"
83 AU.addRequiredTransitive<CallGraph>();
86 getAnalysis<CallGraph>().print(errs(), &M);
94 P2("print-callgraph", "Print a call graph");
|
| 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
30 #include "llvm/Analysis/CallGraph.h"
58 // getAnalysisUsage - This pass requires the CallGraph.
61 AU.addRequired<CallGraph>();
72 Z("print-callgraph-sccs", "Print SCCs of the Call Graph");
95 CallGraphNode* rootNode = getAnalysis<CallGraph>().getRoot();
|
| /external/llvm/lib/Transforms/IPO/ |
| InlineSimple.cpp | 20 #include "llvm/Analysis/CallGraph.h"
45 virtual bool doInitialization(CallGraph &CG);
52 INITIALIZE_AG_DEPENDENCY(CallGraph)
64 bool SimpleInliner::doInitialization(CallGraph &CG) {
|
| InlineAlways.cpp | 21 #include "llvm/Analysis/CallGraph.h"
46 virtual bool doFinalization(CallGraph &CG) {
49 virtual bool doInitialization(CallGraph &CG);
56 INITIALIZE_AG_DEPENDENCY(CallGraph)
130 bool AlwaysInliner::doInitialization(CallGraph &CG) {
|
| PruneEH.cpp | 25 #include "llvm/Analysis/CallGraph.h"
54 INITIALIZE_AG_DEPENDENCY(CallGraph)
63 CallGraph &CG = getAnalysis<CallGraph>();
187 // callgraph edge is updated.
231 /// updating the callgraph to reflect any now-obsolete edges due to calls that
235 CallGraph &CG = getAnalysis<CallGraph>();
|
| Internalize.cpp | 17 #include "llvm/Analysis/CallGraph.h"
60 AU.addPreserved<CallGraph>();
104 CallGraph *CG = getAnalysisIfAvailable<CallGraph>();
139 // Remove a callgraph edge from the external node to this function.
|
| Inliner.cpp | 20 #include "llvm/Analysis/CallGraph.h"
75 /// do so and update the CallGraph for this operation.
337 CallGraph &CG = getAnalysis<CallGraph>();
473 // callgraph references to the node, we cannot delete it yet, this
510 bool Inliner::doFinalization(CallGraph &CG) {
516 bool Inliner::removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly) {
521 for (CallGraph::iterator I = CG.begin(), E = CG.end(); I != E; ++I) {
555 // this inline, because that would invalidate our CallGraph::iterator
|
| ArgumentPromotion.cpp | 41 #include "llvm/Analysis/CallGraph.h"
91 INITIALIZE_AG_DEPENDENCY(CallGraph)
630 // Get the callgraph information that we need to update to reflect our
632 CallGraph &CG = getAnalysis<CallGraph>();
634 // Get a new callgraph node for NF.
754 // Update the callgraph to know that the callsite has been transformed.
[all...] |
| FunctionAttrs.cpp | 28 #include "llvm/Analysis/CallGraph.h"
79 INITIALIZE_AG_DEPENDENCY(CallGraph)
|
| /external/llvm/include/llvm/Transforms/IPO/ |
| InlinerPass.h | 47 virtual bool doFinalization(CallGraph &CG);
74 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
|
| /external/llvm/lib/Analysis/IPA/ |
| 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...] |
| CallGraphSCCPass.cpp | 23 #include "llvm/Analysis/CallGraph.h"
54 bool doInitialization(CallGraph &CG);
55 bool doFinalization(CallGraph &CG);
59 // CGPassManager walks SCC and it needs CallGraph.
60 Info.addRequired<CallGraph>();
65 return "CallGraph Pass Manager";
91 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
95 CallGraph &CG, bool &CallGraphUpToDate,
97 bool RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG,
107 CallGraph &CG, bool &CallGraphUpToDate
[all...] |
| Android.mk | 4 CallGraph.cpp \
|
| GlobalsModRef.cpp | 26 #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)
370 void GlobalsModRef::AnalyzeCallGraph(CallGraph &CG, Module &M) {
373 for (scc_iterator<CallGraph*> I = scc_begin(&CG), E = scc_end(&CG); I != E;
472 // The callgraph doesn't include intrinsic calls.
|
| /external/clang/include/clang/Analysis/ |
| CallGraph.h | 1 //== CallGraph.h - AST-based Call graph ------------------------*- C++ -*--==//
10 // This file declares the AST-based CallGraph.
34 class CallGraph : public RecursiveASTVisitor<CallGraph> {
52 CallGraph();
53 ~CallGraph();
160 void addCallee(CallGraphNode *N, CallGraph *CG) {
203 template <> struct GraphTraits<clang::CallGraph*>
206 static NodeType *getEntryNode(clang::CallGraph *CGN) {
212 typedef mapped_iterator<clang::CallGraph::iterator, DerefFun> nodes_iterator
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| CallGraph.h | 1 //===- CallGraph.h - Build a Module's call graph ----------------*- C++ -*-===//
14 // callgraph node keeps track of which functions the are called by the function
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 {
100 assert(I != FunctionMap.end() && "Function not in callgraph!");
105 assert(I != FunctionMap.end() && "Function not in callgraph!");
110 /// into the callgraph. Override this if you want behavioral inheritance
[all...] |
| /external/llvm/include/llvm/ |
| CallGraphSCCPass.h | 25 #include "llvm/Analysis/CallGraph.h"
30 class CallGraph;
39 /// corresponding to a CallGraph.
44 virtual bool doInitialization(CallGraph &CG) {
60 virtual bool doFinalization(CallGraph &CG) {
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| Cloning.h | 41 class CallGraph;
168 explicit InlineFunctionInfo(CallGraph *cg = 0, const TargetData *td = 0)
171 /// CG - If non-null, InlineFunction will update the callgraph to reflect the
173 CallGraph *CG;
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| DebugCheckers.cpp | 19 #include "clang/Analysis/CallGraph.h"
117 CallGraph CG;
137 CallGraph CG;
|
| /external/llvm/unittests/VMCore/ |
| PassManagerTest.cpp | 164 struct CGPass : public PassTest<CallGraph, CallGraphSCCPass> {
364 SCOPED_TRACE("Callgraph pass");
542 INITIALIZE_AG_DEPENDENCY(CallGraph)
|
| /external/clang/lib/StaticAnalyzer/Frontend/ |
| AnalysisConsumer.cpp | 24 #include "clang/Analysis/CallGraph.h"
314 // Otherwise, use the Callgraph to derive the order.
316 CallGraph CG;
325 for (CallGraph::nodes_iterator TI = CG.parentless_begin(),
|
| /external/llvm/lib/Transforms/Utils/ |
| InlineFunction.cpp | 23 #include "llvm/Analysis/CallGraph.h"
203 // updates the CallGraph if present, because it uses a WeakVH.
265 /// into the caller, update the specified callgraph to reflect the changes we
267 /// some edges of the callgraph may remain.
272 CallGraph &CG = *IFI.CG;
610 // Update the callgraph if requested.
[all...] |
