| /external/clang/lib/Analysis/ |
| D | CallGraph.cpp | 32 CallGraph *G;
36 CGBuilder(CallGraph *g, CallGraphNode *N) in CGBuilder()
94 void CallGraph::addNodesForBlocks(DeclContext *D) { in addNodesForBlocks()
103 CallGraph::CallGraph() { in CallGraph() function in CallGraph
107 CallGraph::~CallGraph() { in ~CallGraph()
111 bool CallGraph::includeInGraph(const Decl *D) { in includeInGraph()
130 void CallGraph::addNodeForDecl(Decl* D, bool IsGlobal) { in addNodeForDecl()
142 CallGraphNode *CallGraph::getNode(const Decl *F) const { in getNode()
148 CallGraphNode *CallGraph::getOrInsertNode(Decl *F) { in getOrInsertNode()
163 void CallGraph::print(raw_ostream &OS) const { in print()
[all …]
|
| D | CMakeLists.txt | 11 CallGraph.cpp
|
| D | Android.mk | 19 CallGraph.cpp \
|
| /external/llvm/include/llvm/Analysis/ |
| D | CallGraph.h | 74 class CallGraph {
106 CallGraph(Module &M);
107 ~CallGraph();
266 friend class CallGraph;
294 typedef CallGraph Result;
301 CallGraph run(Module *M) { return CallGraph(*M); } in run()
315 std::unique_ptr<CallGraph> G;
325 const CallGraph &getCallGraph() const { return *G; } in getCallGraph()
326 CallGraph &getCallGraph() { return *G; } in getCallGraph()
328 typedef CallGraph::iterator iterator;
[all …]
|
| D | CallGraphSCCPass.h | 30 class CallGraph; variable
48 virtual bool doInitialization(CallGraph &CG) { in doInitialization()
64 virtual bool doFinalization(CallGraph &CG) { in doFinalization()
|
| /external/clang/include/clang/Analysis/ |
| D | CallGraph.h | 34 class CallGraph : public RecursiveASTVisitor<CallGraph> {
46 CallGraph();
47 ~CallGraph();
159 void addCallee(CallGraphNode *N, CallGraph *CG) { in addCallee()
199 template <> struct GraphTraits<clang::CallGraph*>
202 static NodeType *getEntryNode(clang::CallGraph *CGN) {
208 typedef mapped_iterator<clang::CallGraph::iterator, DerefFun> nodes_iterator;
210 static nodes_iterator nodes_begin(clang::CallGraph *CG) {
213 static nodes_iterator nodes_end (clang::CallGraph *CG) {
220 static unsigned size(clang::CallGraph *CG) {
[all …]
|
| /external/llvm/lib/Analysis/IPA/ |
| D | CallPrinter.cpp | 25 template <> struct DOTGraphTraits<CallGraph *> : public DefaultDOTGraphTraits {
28 static std::string getGraphName(CallGraph *Graph) { return "Call graph"; } in getGraphName()
30 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) { in getNodeLabel()
39 static CallGraph *getGraph(CallGraphWrapperPass *P) { in getGraph()
49 : public DOTGraphTraitsModuleViewer<CallGraphWrapperPass, true, CallGraph *,
54 : DOTGraphTraitsModuleViewer<CallGraphWrapperPass, true, CallGraph *, in CallGraphViewer()
62 CallGraphWrapperPass, true, CallGraph *,
67 : DOTGraphTraitsModulePrinter<CallGraphWrapperPass, true, CallGraph *, in CallGraphPrinter()
|
| D | CallGraph.cpp | 23 CallGraph::CallGraph(Module &M) in CallGraph() function in CallGraph
35 CallGraph::~CallGraph() { in ~CallGraph()
52 void CallGraph::addToCallGraph(Function *F) { in addToCallGraph()
93 void CallGraph::print(raw_ostream &OS) const { in print()
101 for (CallGraph::const_iterator I = begin(), E = end(); I != E; ++I) in print()
106 void CallGraph::dump() const { print(dbgs()); } in dump()
115 Function *CallGraph::removeFunctionFromModule(CallGraphNode *CGN) { in removeFunctionFromModule()
131 void CallGraph::spliceFunction(const Function *From, const Function *To) { in spliceFunction()
144 CallGraphNode *CallGraph::getOrInsertFunction(const Function *F) { in getOrInsertFunction()
261 G.reset(new CallGraph(M)); in runOnModule()
|
| D | CallGraphSCCPass.cpp | 59 bool doInitialization(CallGraph &CG);
60 bool doFinalization(CallGraph &CG);
96 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
100 CallGraph &CG, bool &CallGraphUpToDate,
102 bool RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG,
112 CallGraph &CG, bool &CallGraphUpToDate, in RunPassOnSCC()
178 CallGraph &CG, bool CheckingMode) { in RefreshCallGraph()
378 bool CGPassManager::RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG, in RunAllPassesOnSCC()
439 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in runOnModule()
443 scc_iterator<CallGraph*> CGI = scc_begin(&CG); in runOnModule()
[all …]
|
| D | CMakeLists.txt | 2 CallGraph.cpp
|
| D | Android.mk | 4 CallGraph.cpp \
|
| D | GlobalsModRef.cpp | 185 void AnalyzeCallGraph(CallGraph &CG, Module &M);
359 void GlobalsModRef::AnalyzeCallGraph(CallGraph &CG, Module &M) { in AnalyzeCallGraph()
362 for (scc_iterator<CallGraph*> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in AnalyzeCallGraph()
|
| /external/llvm/unittests/Analysis/ |
| D | CallGraphTest.cpp | 48 CallGraph CG(M); in TEST()
55 CallGraph CG(M); in TEST()
57 canSpecializeGraphTraitsIterators(const_cast<const CallGraph *>(&CG)); in TEST()
|
| /external/llvm/include/llvm/Transforms/IPO/ |
| D | InlinerPass.h | 48 bool doFinalization(CallGraph &CG) override;
75 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| D | Cloning.h | 41 class CallGraph; variable
194 explicit InlineFunctionInfo(CallGraph *cg = nullptr,
201 CallGraph *CG;
|
| /external/llvm/tools/opt/ |
| D | PrintSCC.cpp | 94 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in runOnModule()
97 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd(); in runOnModule()
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| D | DebugCheckers.cpp | 124 CallGraph CG; in checkASTDecl()
144 CallGraph CG; in checkASTDecl()
|
| /external/llvm/lib/Transforms/IPO/ |
| D | Inliner.cpp | 426 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in runOnSCC()
621 bool Inliner::doFinalization(CallGraph &CG) { in doFinalization()
626 bool Inliner::removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly) { in removeDeadFunctions()
631 for (CallGraph::iterator I = CG.begin(), E = CG.end(); I != E; ++I) { in removeDeadFunctions()
|
| D | PruneEH.cpp | 66 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in runOnSCC()
240 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in DeleteBasicBlock()
|
| D | InlineAlways.cpp | 60 bool doFinalization(CallGraph &CG) override { in doFinalization()
|
| D | Internalize.cpp | 135 CallGraph *CG = CGPass ? &CGPass->getCallGraph() : nullptr; in runOnModule()
|
| D | ArgumentPromotion.cpp | 89 bool doInitialization(CallGraph &CG) override;
733 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in DoPromotion()
1017 bool ArgPromotion::doInitialization(CallGraph &CG) { in doInitialization()
|
| /external/clang/lib/StaticAnalyzer/Frontend/ |
| D | AnalysisConsumer.cpp | 458 CallGraph CG; in HandleDeclsCallGraph()
471 llvm::ReversePostOrderTraversal<clang::CallGraph*> RPOT(&CG); in HandleDeclsCallGraph()
472 for (llvm::ReversePostOrderTraversal<clang::CallGraph*>::rpo_iterator in HandleDeclsCallGraph()
|
| /external/llvm/unittests/IR/ |
| D | LegacyPassManagerTest.cpp | 171 struct CGPass : public PassTest<CallGraph, CallGraphSCCPass> {
|
| /external/llvm/docs/ |
| D | WritingAnLLVMPass.rst | 376 for building and traversing the ``CallGraph``, but also allows the system to
389 #. ... *required* to preserve the current ``CallGraph`` object, updating it to
402 The ``doInitialization(CallGraph &)`` method
407 virtual bool doInitialization(CallGraph &CG);
429 The ``doFinalization(CallGraph &)`` method
434 virtual bool doFinalization(CallGraph &CG);
|