| /external/llvm/lib/Transforms/IPO/ |
| H A D | InlineSimple.cpp | 45 virtual bool doInitialization(CallGraph &CG);
64 bool SimpleInliner::doInitialization(CallGraph &CG) { argument
|
| H A D | InlineAlways.cpp | 46 virtual bool doFinalization(CallGraph &CG) { argument
47 return removeDeadFunctions(CG, /*AlwaysInlineOnly=*/true);
49 virtual bool doInitialization(CallGraph &CG);
130 bool AlwaysInliner::doInitialization(CallGraph &CG) { argument
|
| H A D | Internalize.cpp | 104 CallGraph *CG = getAnalysisIfAvailable<CallGraph>(); local
105 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : 0;
140 if (ExternalNode) ExternalNode->removeOneAbstractEdgeTo((*CG)[I]);
|
| H A D | PruneEH.cpp | 63 CallGraph &CG = getAnalysis<CallGraph>(); local
119 CallGraphNode *CalleeNode = CG[Callee];
235 CallGraph &CG = getAnalysis<CallGraph>(); local
237 CallGraphNode *CGN = CG[BB->getParent()];
|
| H A D | Inliner.cpp | 341 CallGraph &CG = getAnalysis<CallGraph>(); local
402 InlineFunctionInfo InlineInfo(&CG, TD);
426 CG[Caller]->removeCallEdgeFor(CS);
480 CG[Callee]->getNumReferences() == 0) {
483 CallGraphNode *CalleeNode = CG[Callee];
489 delete CG.removeFunctionFromModule(CalleeNode);
515 bool Inliner::doFinalization(CallGraph &CG) { argument
516 return removeDeadFunctions(CG);
521 bool Inliner::removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly) { argument
526 for (CallGraph::iterator I = CG
[all...] |
| H A D | ArgumentPromotion.cpp | 628 CallGraph &CG = getAnalysis<CallGraph>(); local
631 CallGraphNode *NF_CGN = CG.getOrInsertFunction(NF);
749 CallGraphNode *CalleeNode = CG[Call->getParent()->getParent()];
887 NF_CGN->stealCalledFunctionsFrom(CG[F]);
892 CallGraphNode *CGN = CG[F];
894 delete CG.removeFunctionFromModule(CGN);
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| H A D | Cloning.h | 169 : CG(cg), TD(td) {}
171 /// CG - If non-null, InlineFunction will update the callgraph to reflect the
173 CallGraph *CG; member in class:llvm::InlineFunctionInfo
181 /// inlined from the callee. This is only filled in if CG is non-null.
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | DebugCheckers.cpp | 117 CallGraph CG; local
118 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU));
119 CG.viewGraph();
137 CallGraph CG; local
138 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU));
139 CG.dump();
|
| /external/llvm/include/llvm/ |
| H A D | CallGraphSCCPass.h | 44 virtual bool doInitialization(CallGraph &CG) { argument
60 virtual bool doFinalization(CallGraph &CG) { argument
|
| /external/clang/lib/Analysis/ |
| H A D | CallGraph.cpp | 175 const CallGraph *CG) {
176 if (CG->getRoot() == Node) {
174 getNodeLabel(const CallGraphNode *Node, const CallGraph *CG) argument
|
| /external/clang/include/clang/Analysis/ |
| H A D | CallGraph.h | 166 void addCallee(CallGraphNode *N, CallGraph *CG) { argument
168 CG->ParentlessNodes.remove(N);
220 static nodes_iterator nodes_begin(clang::CallGraph *CG) { argument
221 return map_iterator(CG->begin(), DerefFun(CGdereference));
223 static nodes_iterator nodes_end (clang::CallGraph *CG) { argument
224 return map_iterator(CG->end(), DerefFun(CGdereference));
230 static unsigned size(clang::CallGraph *CG) { argument
231 return CG->size();
246 static nodes_iterator nodes_begin(const clang::CallGraph *CG) { argument
247 return map_iterator(CG
249 nodes_end(const clang::CallGraph *CG) argument
256 size(const clang::CallGraph *CG) argument
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| H A D | CallGraph.h | 350 static nodes_iterator nodes_begin(CallGraph *CG) { argument
351 return map_iterator(CG->begin(), DerefFun(CGdereference));
353 static nodes_iterator nodes_end (CallGraph *CG) { argument
354 return map_iterator(CG->end(), DerefFun(CGdereference));
369 static nodes_iterator nodes_begin(const CallGraph *CG) { return CG->begin(); } argument
370 static nodes_iterator nodes_end (const CallGraph *CG) { return CG->end(); } argument
|
| /external/llvm/lib/Analysis/IPA/ |
| H A D | CallGraphSCCPass.cpp | 54 bool doInitialization(CallGraph &CG);
55 bool doFinalization(CallGraph &CG);
91 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
95 CallGraph &CG, bool &CallGraphUpToDate,
97 bool RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG,
107 CallGraph &CG, bool &CallGraphUpToDate,
115 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG, false);
128 RefreshCallGraph(CurSCC, CG, true);
171 CallGraph &CG, bool CheckingMode) {
283 CalleeNode = CG
170 RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG, bool CheckingMode) argument
363 RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG, bool &DevirtualizedCall) argument
424 CallGraph &CG = getAnalysis<CallGraph>(); local
474 doInitialization(CallGraph &CG) argument
489 doFinalization(CallGraph &CG) argument
[all...] |
| H A D | GlobalsModRef.cpp | 100 AnalyzeCallGraph(getAnalysis<CallGraph>(), M); // Propagate on CG
180 void AnalyzeCallGraph(CallGraph &CG, Module &M);
363 void GlobalsModRef::AnalyzeCallGraph(CallGraph &CG, Module &M) { argument
366 for (scc_iterator<CallGraph*> I = scc_begin(&CG), E = scc_end(&CG); I != E;
428 CallGraphNode *CalleeNode = CG[Callee];
|
| /external/llvm/lib/Transforms/Utils/ |
| H A D | InlineFunction.cpp | 272 CallGraph &CG = *IFI.CG; local
275 CallGraphNode *CalleeNode = CG[Callee];
276 CallGraphNode *CallerNode = CG[Caller];
315 CallerNode->addCalledFunction(CallSite(NewCall), CG[F]); local
611 if (IFI.CG)
|
| /external/clang/lib/StaticAnalyzer/Frontend/ |
| H A D | AnalysisConsumer.cpp | 369 CallGraph CG; local
374 // We rely on random access to add the initially processed Decls to CG.
376 CG.addToCallGraph(LocalTUDecls[i]);
382 for (CallGraph::nodes_iterator TI = CG.parentless_begin(),
383 TE = CG.parentless_end(); TI != TE; ++TI) {
387 CallGraphNode *Entry = CG.getRoot();
434 CallGraphNode *VN = CG.getNode(*I);
|