| /external/llvm/unittests/Analysis/ |
| D | LazyCallGraphTest.cpp | 125 LazyCallGraph CG(*M); in TEST() local
130 auto I = CG.begin(); in TEST()
155 EXPECT_EQ(CG.end(), I); in TEST()
206 auto SCCI = CG.postorder_scc_begin(); in TEST()
268 EXPECT_EQ(CG.postorder_scc_end(), SCCI); in TEST()
294 LazyCallGraph CG(*M); in TEST() local
296 LazyCallGraph::Node &A = CG.get(lookupFunction(*M, "a")); in TEST()
297 LazyCallGraph::Node &B = CG.get(lookupFunction(*M, "b")); in TEST()
301 CG.insertEdge(B, lookupFunction(*M, "c")); in TEST()
306 CG.insertEdge(C, B.getFunction()); in TEST()
[all …]
|
| D | CallGraphTest.cpp | 48 CallGraph CG(M); in TEST() local
50 canSpecializeGraphTraitsIterators(&CG); in TEST()
55 CallGraph CG(M); in TEST() local
57 canSpecializeGraphTraitsIterators(const_cast<const CallGraph *>(&CG)); in TEST()
|
| /external/llvm/lib/Analysis/IPA/ |
| 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() argument
120 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG, false); in RunPassOnSCC()
133 RefreshCallGraph(CurSCC, CG, true); in RunPassOnSCC()
178 CallGraph &CG, bool CheckingMode) { in RefreshCallGraph() argument
299 CalleeNode = CG.getOrInsertFunction(Callee); in RefreshCallGraph()
[all …]
|
| /external/llvm/test/Other/ |
| D | pass-pipeline-parsing.ll | 106 ; RUN: | FileCheck %s --check-prefix=CHECK-TWO-NOOP-CG
107 ; CHECK-TWO-NOOP-CG: Starting pass manager
108 ; CHECK-TWO-NOOP-CG: Running pass: ModuleToPostOrderCGSCCPassAdaptor
109 ; CHECK-TWO-NOOP-CG: Starting pass manager
110 ; CHECK-TWO-NOOP-CG: Running pass: NoOpCGSCCPass
111 ; CHECK-TWO-NOOP-CG: Running pass: NoOpCGSCCPass
112 ; CHECK-TWO-NOOP-CG: Finished pass manager
113 ; CHECK-TWO-NOOP-CG: Finished pass manager
117 ; RUN: | FileCheck %s --check-prefix=CHECK-NESTED-MP-CG-FP
118 ; CHECK-NESTED-MP-CG-FP: Starting pass manager
[all …]
|
| D | new-pass-manager.ll | 230 ; RUN: | FileCheck %s --check-prefix=CHECK-INVALIDATE-ALL-CG
231 ; CHECK-INVALIDATE-ALL-CG: Starting pass manager
232 ; CHECK-INVALIDATE-ALL-CG: Running pass: RequireAnalysisPass
233 ; CHECK-INVALIDATE-ALL-CG: Running analysis: NoOpModuleAnalysis
234 ; CHECK-INVALIDATE-ALL-CG: Starting pass manager
235 ; CHECK-INVALIDATE-ALL-CG: Running pass: RequireAnalysisPass
236 ; CHECK-INVALIDATE-ALL-CG-NOT: Running analysis: NoOpModuleAnalysis
237 ; CHECK-INVALIDATE-ALL-CG: Starting pass manager
238 ; CHECK-INVALIDATE-ALL-CG: Running pass: RequireAnalysisPass
239 ; CHECK-INVALIDATE-ALL-CG: Running analysis: NoOpCGSCCAnalysis
[all …]
|
| 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/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/clang/lib/StaticAnalyzer/Checkers/ |
| D | DebugCheckers.cpp | 124 CallGraph CG; in checkASTDecl() local
125 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU)); in checkASTDecl()
126 CG.viewGraph(); in checkASTDecl()
144 CallGraph CG; in checkASTDecl() local
145 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU)); in checkASTDecl()
146 CG.dump(); in checkASTDecl()
|
| /external/llvm/lib/Transforms/IPO/ |
| D | Inliner.cpp | 426 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in runOnSCC() local
489 InlineFunctionInfo InlineInfo(&CG, AA, ACT); in runOnSCC()
513 CG[Caller]->removeCallEdgeFor(CS); in runOnSCC()
586 CG[Callee]->getNumReferences() == 0) { in runOnSCC()
589 CallGraphNode *CalleeNode = CG[Callee]; in runOnSCC()
595 delete CG.removeFunctionFromModule(CalleeNode); in runOnSCC()
621 bool Inliner::doFinalization(CallGraph &CG) { in doFinalization() argument
622 return removeDeadFunctions(CG); in doFinalization()
626 bool Inliner::removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly) { in removeDeadFunctions() argument
631 for (CallGraph::iterator I = CG.begin(), E = CG.end(); I != E; ++I) { in removeDeadFunctions()
[all …]
|
| D | Internalize.cpp | 135 CallGraph *CG = CGPass ? &CGPass->getCallGraph() : nullptr; in runOnModule() local
136 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : nullptr; in runOnModule()
165 ExternalNode->removeOneAbstractEdgeTo((*CG)[I]); in runOnModule()
|
| D | PruneEH.cpp | 66 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in runOnSCC() local
122 CallGraphNode *CalleeNode = CG[Callee]; in runOnSCC()
240 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in DeleteBasicBlock() local
242 CallGraphNode *CGN = CG[BB->getParent()]; in DeleteBasicBlock()
|
| D | InlineAlways.cpp | 60 bool doFinalization(CallGraph &CG) override { in doFinalization() argument
61 return removeDeadFunctions(CG, /*AlwaysInlineOnly=*/ true); in doFinalization()
|
| D | ArgumentPromotion.cpp | 89 bool doInitialization(CallGraph &CG) override;
733 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in DoPromotion() local
736 CallGraphNode *NF_CGN = CG.getOrInsertFunction(NF); in DoPromotion()
864 CallGraphNode *CalleeNode = CG[Call->getParent()->getParent()]; in DoPromotion()
1003 NF_CGN->stealCalledFunctionsFrom(CG[F]); in DoPromotion()
1008 CallGraphNode *CGN = CG[F]; in DoPromotion()
1010 delete CG.removeFunctionFromModule(CGN); in DoPromotion()
1017 bool ArgPromotion::doInitialization(CallGraph &CG) { in doInitialization() argument
1018 FunctionDIs = makeSubprogramMap(CG.getModule()); in doInitialization()
1019 return CallGraphSCCPass::doInitialization(CG); in doInitialization()
|
| /external/llvm/include/llvm/Analysis/ |
| D | CallGraph.h | 450 static nodes_iterator nodes_begin(CallGraph *CG) {
451 return map_iterator(CG->begin(), DerefFun(CGdereference));
453 static nodes_iterator nodes_end(CallGraph *CG) {
454 return map_iterator(CG->end(), DerefFun(CGdereference));
472 static nodes_iterator nodes_begin(const CallGraph *CG) {
473 return map_iterator(CG->begin(), DerefFun(CGdereference));
475 static nodes_iterator nodes_end(const CallGraph *CG) {
476 return map_iterator(CG->end(), DerefFun(CGdereference));
|
| D | CallGraphSCCPass.h | 48 virtual bool doInitialization(CallGraph &CG) { in doInitialization() argument
64 virtual bool doFinalization(CallGraph &CG) { in doFinalization() argument
|
| /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.
119 ; Check the comparison can be reversed if that allows CG to be used.
|
| /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/tools/opt/ |
| D | PrintSCC.cpp | 94 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in runOnModule() local
97 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd(); in runOnModule()
|
| /external/icu/icu4c/source/data/region/ |
| D | pt_PT.txt | 20 CG{"Congo-Brazzaville"}
58 CG{"República do Congo"}
|
| D | ko.txt | 84 CG{"콩고"}
308 CG{"콩고 공화국"}
|
| D | he.txt | 84 CG{"קונגו - ברזאויל"}
308 CG{"קונגו (רפובליקה)"}
|
| D | zh.txt | 84 CG{"刚果（布）"}
308 CG{"刚果共和国"}
|
| D | uk.txt | 84 CG{"Конго – Браззавіль"}
308 CG{"Конго (Республіка)"}
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| D | Cloning.h | 197 : CG(cg), AA(AA), ACT(ACT) {} in CG() function
201 CallGraph *CG; variable
|
| /external/llvm/tools/lto/ |
| D | lto.cpp | 81 LTOCodeGenerator *CG = unwrap(cg); in DEFINE_SIMPLE_CONVERSION_FUNCTIONS() local
90 CG->setAttr(attrs.c_str()); in DEFINE_SIMPLE_CONVERSION_FUNCTIONS()
95 CG->setOptLevel(OptLevel - '0'); in DEFINE_SIMPLE_CONVERSION_FUNCTIONS()
|