| /external/llvm/lib/Analysis/IPA/ |
| D | CallGraphSCCPass.cpp | 57 bool doInitialization(CallGraph &CG);
58 bool doFinalization(CallGraph &CG);
94 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
98 CallGraph &CG, bool &CallGraphUpToDate,
100 bool RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG,
110 CallGraph &CG, bool &CallGraphUpToDate, in RunPassOnSCC() argument
118 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG, false); in RunPassOnSCC()
131 RefreshCallGraph(CurSCC, CG, true); in RunPassOnSCC()
174 CallGraph &CG, bool CheckingMode) { in RefreshCallGraph() argument
286 CalleeNode = CG.getOrInsertFunction(Callee); in RefreshCallGraph()
[all …]
|
| D | GlobalsModRef.cpp | 180 void AnalyzeCallGraph(CallGraph &CG, Module &M);
363 void GlobalsModRef::AnalyzeCallGraph(CallGraph &CG, Module &M) { in AnalyzeCallGraph() argument
366 for (scc_iterator<CallGraph*> I = scc_begin(&CG), E = scc_end(&CG); I != E; in AnalyzeCallGraph()
428 CallGraphNode *CalleeNode = CG[Callee]; in AnalyzeCallGraph()
|
| /external/clang/include/clang/Analysis/ |
| D | CallGraph.h | 159 void addCallee(CallGraphNode *N, CallGraph *CG) { in addCallee() argument
210 static nodes_iterator nodes_begin(clang::CallGraph *CG) {
211 return map_iterator(CG->begin(), DerefFun(CGdereference));
213 static nodes_iterator nodes_end (clang::CallGraph *CG) {
214 return map_iterator(CG->end(), DerefFun(CGdereference));
220 static unsigned size(clang::CallGraph *CG) {
221 return CG->size();
236 static nodes_iterator nodes_begin(const clang::CallGraph *CG) {
237 return map_iterator(CG->begin(), DerefFun(CGdereference));
239 static nodes_iterator nodes_end(const clang::CallGraph *CG) {
[all …]
|
| /external/llvm/lib/Transforms/IPO/ |
| D | Inliner.cpp | 398 CallGraph &CG = getAnalysis<CallGraph>(); in runOnSCC() local
459 InlineFunctionInfo InlineInfo(&CG, TD); in runOnSCC()
483 CG[Caller]->removeCallEdgeFor(CS); in runOnSCC()
537 CG[Callee]->getNumReferences() == 0) { in runOnSCC()
540 CallGraphNode *CalleeNode = CG[Callee]; in runOnSCC()
546 delete CG.removeFunctionFromModule(CalleeNode); in runOnSCC()
572 bool Inliner::doFinalization(CallGraph &CG) { in doFinalization() argument
573 return removeDeadFunctions(CG); in doFinalization()
578 bool Inliner::removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly) { in removeDeadFunctions() argument
583 for (CallGraph::iterator I = CG.begin(), E = CG.end(); I != E; ++I) { in removeDeadFunctions()
[all …]
|
| D | Internalize.cpp | 113 CallGraph *CG = getAnalysisIfAvailable<CallGraph>(); in runOnModule() local
114 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : 0; in runOnModule()
150 if (ExternalNode) ExternalNode->removeOneAbstractEdgeTo((*CG)[I]); in runOnModule()
|
| D | InlineAlways.cpp | 56 virtual bool doFinalization(CallGraph &CG) { in doFinalization() argument
57 return removeDeadFunctions(CG, /*AlwaysInlineOnly=*/ true); in doFinalization()
|
| D | PruneEH.cpp | 63 CallGraph &CG = getAnalysis<CallGraph>(); in runOnSCC() local
119 CallGraphNode *CalleeNode = CG[Callee]; in runOnSCC()
237 CallGraph &CG = getAnalysis<CallGraph>(); in DeleteBasicBlock() local
239 CallGraphNode *CGN = CG[BB->getParent()]; in DeleteBasicBlock()
|
| D | ArgumentPromotion.cpp | 622 CallGraph &CG = getAnalysis<CallGraph>(); in DoPromotion() local
625 CallGraphNode *NF_CGN = CG.getOrInsertFunction(NF); in DoPromotion()
749 CallGraphNode *CalleeNode = CG[Call->getParent()->getParent()]; in DoPromotion()
880 NF_CGN->stealCalledFunctionsFrom(CG[F]); in DoPromotion()
885 CallGraphNode *CGN = CG[F]; in DoPromotion()
887 delete CG.removeFunctionFromModule(CGN); in DoPromotion()
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| D | DebugCheckers.cpp | 119 CallGraph CG; in checkASTDecl() local
120 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU)); in checkASTDecl()
121 CG.viewGraph(); in checkASTDecl()
139 CallGraph CG; in checkASTDecl() local
140 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU)); in checkASTDecl()
141 CG.dump(); in checkASTDecl()
|
| /external/llvm/include/llvm/Analysis/ |
| D | CallGraph.h | 350 static nodes_iterator nodes_begin(CallGraph *CG) {
351 return map_iterator(CG->begin(), DerefFun(CGdereference));
353 static nodes_iterator nodes_end (CallGraph *CG) {
354 return map_iterator(CG->end(), DerefFun(CGdereference));
369 static nodes_iterator nodes_begin(const CallGraph *CG) { return CG->begin(); }
370 static nodes_iterator nodes_end (const CallGraph *CG) { return CG->end(); }
|
| D | CallGraphSCCPass.h | 47 virtual bool doInitialization(CallGraph &CG) { in doInitialization() argument
63 virtual bool doFinalization(CallGraph &CG) { in doFinalization() argument
|
| /external/llvm/include/llvm/Transforms/IPO/ |
| D | InlinerPass.h | 48 virtual bool doFinalization(CallGraph &CG);
75 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
|
| /external/llvm/test/CodeGen/SystemZ/ |
| D | int-cmp-07.ll | 16 ; Check CG with no displacement.
29 ; Check the high end of the aligned CG range.
59 ; Check the high end of the negative aligned CG range.
73 ; Check the low end of the CG range.
103 ; Check that CG allows an index.
|
| /external/llvm/test/Other/ |
| D | lint.ll | 11 @CG = constant i32 7
60 store i32 8, i32* @CG
72 call void @has_noaliases(i32* @CG, i32* @CG)
81 …call void @llvm.memcpy.p0i8.p0i8.i64(i8* bitcast (i32* @CG to i8*), i8* bitcast (i32* @CG to i8*),…
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| D | Cloning.h | 163 : CG(cg), TD(td) {} in CG() function
167 CallGraph *CG; variable
|
| /external/llvm/lib/Transforms/Utils/ |
| D | InlineFunction.cpp | 282 CallGraph &CG = *IFI.CG; in UpdateCallGraphAfterInlining() local
285 CallGraphNode *CalleeNode = CG[Callee]; in UpdateCallGraphAfterInlining()
286 CallGraphNode *CallerNode = CG[Caller]; in UpdateCallGraphAfterInlining()
325 CallerNode->addCalledFunction(CallSite(NewCall), CG[F]); in UpdateCallGraphAfterInlining()
621 if (IFI.CG) in InlineFunction()
|
| /external/clang/lib/Analysis/ |
| D | CallGraph.cpp | 226 const CallGraph *CG) { in getNodeLabel()
227 if (CG->getRoot() == Node) { in getNodeLabel()
|
| /external/chromium_org/third_party/icu/source/data/region/ |
| D | fa_AF.txt | 29 CG{"کانگو"}
|
| D | km.txt | 43 CG{"កុងហ្គោ"}
|
| D | hy.txt | 44 CG{"Կոնգո"}
|
| /external/icu4c/data/region/ |
| D | fa_AF.txt | 28 CG{"کانگو"}
|
| D | nus.txt | 47 CG{"Kɔŋgɔ"}
|
| D | pt_PT.txt | 24 CG{"Congo-Brazzaville"}
|
| /external/chromium_org/ui/gfx/image/ |
| D | image_ios.mm | 32 NULL, // Allow CG to allocate memory.
36 0, // CG will calculate by default.
|
| /external/clang/lib/StaticAnalyzer/Frontend/ |
| D | AnalysisConsumer.cpp | 434 CallGraph CG; in HandleDeclsCallGraph() local
436 CG.addToCallGraph(LocalTUDecls[i]); in HandleDeclsCallGraph()
447 llvm::ReversePostOrderTraversal<clang::CallGraph*> RPOT(&CG); in HandleDeclsCallGraph()
|