| /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/libmicrohttpd/ |
| D | ChangeLog | 2 Releasing libmicrohttpd 0.9.42. -CG
7 reason. -CG/JC
16 Releasing libmicrohttpd 0.9.41. -CG
21 event-loop modes. Thanks to Mike Castillo for reporting. -CG
24 Fixing issue #3753 (testcase issue). -CG
32 with HTTPS and slow clients. -CG
36 when adding MHD_RF_HTTP_VERSION_1_0_ONLY. -CG
40 mode on W32 by using signal pipe. -CG
48 Releasing libmicrohttpd 0.9.40. -CG
52 mode if shutdown is initiated while connections are active. -CG
[all …]
|
| /external/llvm/lib/Analysis/ |
| 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
301 CalleeNode = CG.getOrInsertFunction(Callee); in RefreshCallGraph()
[all …]
|
| D | GlobalsModRef.cpp | 471 void GlobalsAAResult::CollectSCCMembership(CallGraph &CG) { in CollectSCCMembership() argument
475 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in CollectSCCMembership()
490 void GlobalsAAResult::AnalyzeCallGraph(CallGraph &CG, Module &M) { in AnalyzeCallGraph() argument
493 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in AnalyzeCallGraph()
551 CallGraphNode *CalleeNode = CG[Callee]; in AnalyzeCallGraph()
947 CallGraph &CG) { in analyzeModule() argument
951 Result.CollectSCCMembership(CG); in analyzeModule()
957 Result.AnalyzeCallGraph(CG, M); in analyzeModule()
|
| D | LoopAccessAnalysis.cpp | 403 const auto &CG = CheckingGroups[I]; in print() local
405 OS.indent(Depth + 2) << "Group " << &CG << ":\n"; in print()
406 OS.indent(Depth + 4) << "(Low: " << *CG.Low << " High: " << *CG.High in print()
408 for (unsigned J = 0; J < CG.Members.size(); ++J) { in print()
409 OS.indent(Depth + 6) << "Member: " << *Pointers[CG.Members[J]].Expr in print()
1630 expandBounds(const RuntimePointerChecking::CheckingPtrGroup *CG, Loop *TheLoop, in expandBounds() argument
1633 Value *Ptr = PtrRtChecking.Pointers[CG->Members[0]].PointerValue; in expandBounds()
1649 Start = Exp.expandCodeFor(CG->Low, PtrArithTy, Loc); in expandBounds()
1650 End = Exp.expandCodeFor(CG->High, PtrArithTy, Loc); in expandBounds()
1651 DEBUG(dbgs() << "Start: " << *CG->Low << " End: " << *CG->High << "\n"); in expandBounds()
|
| /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/llvm/tools/lto/ |
| D | lto.cpp | 142 LTOCodeGenerator *CG = unwrap(cg); in DEFINE_SIMPLE_CONVERSION_FUNCTIONS() local
151 CG->setAttr(attrs.c_str()); in DEFINE_SIMPLE_CONVERSION_FUNCTIONS()
156 CG->setOptLevel(OptLevel - '0'); in DEFINE_SIMPLE_CONVERSION_FUNCTIONS()
390 LibLTOCodeGenerator *CG = unwrap(cg); in lto_codegen_compile() local
391 CG->NativeObjectFile = in lto_codegen_compile()
392 CG->compile(DisableVerify, DisableInline, DisableGVNLoadPRE, in lto_codegen_compile()
394 if (!CG->NativeObjectFile) in lto_codegen_compile()
396 *length = CG->NativeObjectFile->getBufferSize(); in lto_codegen_compile()
397 return CG->NativeObjectFile->getBufferStart(); in lto_codegen_compile()
408 LibLTOCodeGenerator *CG = unwrap(cg); in lto_codegen_compile_optimized() local
[all …]
|
| /external/llvm/lib/Transforms/IPO/ |
| D | Inliner.cpp | 474 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in runOnSCC() local
536 InlineFunctionInfo InlineInfo(&CG, ACT); in runOnSCC()
561 CG[Caller]->removeCallEdgeFor(CS); in runOnSCC()
631 CG[Callee]->getNumReferences() == 0) { in runOnSCC()
634 CallGraphNode *CalleeNode = CG[Callee]; in runOnSCC()
640 delete CG.removeFunctionFromModule(CalleeNode); in runOnSCC()
666 bool Inliner::doFinalization(CallGraph &CG) { in doFinalization() argument
667 return removeDeadFunctions(CG); in doFinalization()
671 bool Inliner::removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly) { in removeDeadFunctions() argument
683 CG.getExternalCallingNode()->removeAnyCallEdgeTo(CGN); in removeDeadFunctions()
[all …]
|
| D | Internalize.cpp | 174 CallGraph *CG = CGPass ? &CGPass->getCallGraph() : nullptr; in runOnModule() local
175 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : nullptr; in runOnModule()
211 ExternalNode->removeOneAbstractEdgeTo((*CG)[&I]); in runOnModule()
|
| D | PruneEH.cpp | 67 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in runOnSCC() local
131 CallGraphNode *CalleeNode = CG[Callee]; in runOnSCC()
252 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in DeleteBasicBlock() local
254 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 | 95 bool doInitialization(CallGraph &CG) override;
750 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in DoPromotion() local
753 CallGraphNode *NF_CGN = CG.getOrInsertFunction(NF); in DoPromotion()
875 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 return CallGraphSCCPass::doInitialization(CG); in doInitialization()
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| D | DebugCheckers.cpp | 127 CallGraph CG; in checkASTDecl() local
128 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU)); in checkASTDecl()
129 CG.viewGraph(); in checkASTDecl()
147 CallGraph CG; in checkASTDecl() local
148 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU)); in checkASTDecl()
149 CG.dump(); in checkASTDecl()
|
| /external/llvm/include/llvm/Analysis/ |
| D | CallGraph.h | 458 static nodes_iterator nodes_begin(CallGraph *CG) {
459 return map_iterator(CG->begin(), DerefFun(CGdereference));
461 static nodes_iterator nodes_end(CallGraph *CG) {
462 return map_iterator(CG->end(), DerefFun(CGdereference));
481 static nodes_iterator nodes_begin(const CallGraph *CG) {
482 return map_iterator(CG->begin(), DerefFun(CGdereference));
484 static nodes_iterator nodes_end(const CallGraph *CG) {
485 return map_iterator(CG->end(), DerefFun(CGdereference));
|
| D | GlobalsModRef.h | 81 CallGraph &CG);
105 void AnalyzeCallGraph(CallGraph &CG, Module &M);
111 void CollectSCCMembership(CallGraph &CG);
|
| 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/opencv3/modules/core/src/ |
| D | conjugate_gradient.cpp | 199 Ptr<ConjGradSolver> CG = makePtr<ConjGradSolverImpl>(); in create() local
200 CG->setFunction(f); in create()
201 CG->setTermCriteria(termcrit); in create()
202 return CG; in create()
|
| /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 | 24 CG{"Congo-Brazzaville"}
76 CG{"República do Congo"}
|