| /third_party/skia/third_party/externals/microhttpd/ |
| 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 …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | CallGraphSCCPass.cpp | 69 bool doInitialization(CallGraph &CG);
70 bool doFinalization(CallGraph &CG);
104 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
108 CallGraph &CG, bool &CallGraphUpToDate,
110 bool RefreshCallGraph(const CallGraphSCC &CurSCC, CallGraph &CG,
119 CallGraph &CG, bool &CallGraphUpToDate, in RunPassOnSCC() argument
123 Module &M = CG.getModule(); in RunPassOnSCC()
128 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG, false); in RunPassOnSCC()
160 RefreshCallGraph(CurSCC, CG, true); in RunPassOnSCC()
201 bool CGPassManager::RefreshCallGraph(const CallGraphSCC &CurSCC, CallGraph &CG, in RefreshCallGraph() argument
[all …]
|
| D | SyntheticCountsUtils.cpp | 87 void SyntheticCountsUtils<CallGraphType>::propagate(const CallGraphType &CG, in propagate() argument
93 for (auto I = scc_begin(CG); !I.isAtEnd(); ++I) in propagate()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/ |
| D | PruneEH.cpp | 51 static bool SimplifyFunction(Function *F, CallGraph &CG);
52 static void DeleteBasicBlock(BasicBlock *BB, CallGraph &CG);
63 static bool runImpl(CallGraphSCC &SCC, CallGraph &CG) { in runImpl() argument
76 MadeChange |= SimplifyFunction(F, CG); in runImpl()
128 CallGraphNode *CalleeNode = CG[Callee]; in runImpl()
171 MadeChange |= SimplifyFunction(F, CG); in runImpl()
181 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in runOnSCC() local
182 return runImpl(SCC, CG); in runOnSCC()
189 static bool SimplifyFunction(Function *F, CallGraph &CG) { in SimplifyFunction() argument
199 DeleteBasicBlock(UnwindBlock, CG); // Delete the new BB. in SimplifyFunction()
[all …]
|
| D | Inliner.cpp | 495 bool LegacyInlinerBase::doInitialization(CallGraph &CG) { in doInitialization() argument
497 ImportedFunctionsStats.setModuleInfo(CG.getModule()); in doInitialization()
528 inlineCallsImpl(CallGraphSCC &SCC, CallGraph &CG, in inlineCallsImpl() argument
607 InlineFunctionInfo InlineInfo(&CG, &GetAssumptionCache, PSI); in inlineCallsImpl()
676 CG[Caller]->removeCallEdgeFor(*cast<CallBase>(CS.getInstruction())); in inlineCallsImpl()
725 CG[Callee]->getNumReferences() == 0) { in inlineCallsImpl()
728 CallGraphNode *CalleeNode = CG[Callee]; in inlineCallsImpl()
734 delete CG.removeFunctionFromModule(CalleeNode); in inlineCallsImpl()
759 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in inlineCalls() local
769 SCC, CG, GetAssumptionCache, PSI, GetTLI, InsertLifetime, in inlineCalls()
[all …]
|
| D | Internalize.cpp | 150 bool InternalizePass::internalizeModule(Module &M, CallGraph *CG) { in internalizeModule() argument
152 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : nullptr; in internalizeModule()
189 ExternalNode->removeOneAbstractEdgeTo((*CG)[&I]); in internalizeModule()
269 CallGraph *CG = CGPass ? &CGPass->getCallGraph() : nullptr; in runOnModule() local
270 return internalizeModule(M, MustPreserveGV, CG); in runOnModule()
|
| D | ArgumentPromotion.cpp | 1023 LazyCallGraph &CG, in run() argument
1035 AM.getResult<FunctionAnalysisManagerCGSCCProxy>(C, CG).getManager(); in run()
1093 bool doInitialization(CallGraph &CG) override;
1123 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in runOnSCC() local
1141 CG.getOrInsertFunction(NewCS.getCalledFunction()); in runOnSCC()
1142 CallGraphNode *CallerNode = CG[Caller]; in runOnSCC()
1155 CallGraphNode *NewNode = CG.getOrInsertFunction(NewF); in runOnSCC()
1158 delete CG.removeFunctionFromModule(OldNode); in runOnSCC()
1173 bool ArgPromotion::doInitialization(CallGraph &CG) { in doInitialization() argument
1174 return CallGraphSCCPass::doInitialization(CG); in doInitialization()
|
| D | AlwaysInliner.cpp | 122 bool doFinalization(CallGraph &CG) override { in doFinalization() argument
123 return removeDeadFunctions(CG, /*AlwaysInlineOnly=*/true); in doFinalization()
|
| D | SyntheticCountsPropagation.cpp | 128 CallGraph CG(M); in run() local
131 &CG, GetCallSiteProfCount, [&](const CallGraphNode *N, Scaled64 New) { in run()
|
| /third_party/boost/libs/geometry/test/iterators/ |
| D | segment_iterator.cpp | 358 typedef ring_cw_closed_type CG; in BOOST_AUTO_TEST_CASE() typedef
360 typedef dual_tester<CG, TML> tester; in BOOST_AUTO_TEST_CASE()
397 tester::apply(from_wkt<CG>("POLYGON((0 0,0 10,10 10,10 0,0 0))"), in BOOST_AUTO_TEST_CASE()
406 tester::apply(from_wkt<CG>("POLYGON(())"), in BOOST_AUTO_TEST_CASE()
411 tester::apply(from_wkt<CG>("POLYGON((0 0))"), in BOOST_AUTO_TEST_CASE()
418 tester::apply(from_wkt<CG>("POLYGON((0 0,0 0))"), in BOOST_AUTO_TEST_CASE()
424 tester::apply(from_wkt<CG>("POLYGON((0 0,0 10,0 0))"), in BOOST_AUTO_TEST_CASE()
431 tester::apply(from_wkt<CG>("POLYGON((0 0,0 10,10 10,0 0))"), in BOOST_AUTO_TEST_CASE()
454 typedef polygon_cw_closed_type CG; in BOOST_AUTO_TEST_CASE() typedef
456 typedef dual_tester<CG, TML> tester; in BOOST_AUTO_TEST_CASE()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | CGSCCPassManager.h | 160 LazyCallGraph &CG, CGSCCUpdateResult &) {
161 (void)AM.template getResult<AnalysisT>(C, CG);
456 LazyCallGraph &CG, CGSCCUpdateResult &UR) {
459 AM.getResult<FunctionAnalysisManagerCGSCCProxy>(C, CG).getManager();
478 if (CG.lookupSCC(*N) != CurrentC)
505 CurrentC = &updateCGAndAnalysisManagerForFunctionPass(CG, *CurrentC, *N,
508 CG.lookupSCC(*N) == CurrentC &&
562 LazyCallGraph &CG, CGSCCUpdateResult &UR) {
565 AM.getResult<PassInstrumentationAnalysis>(InitialC, CG);
615 PreservedAnalyses PassPA = Pass.run(*C, AM, CG, UR);
[all …]
|
| D | CallGraphSCCPass.h | 48 virtual bool doInitialization(CallGraph &CG) { in doInitialization() argument
63 virtual bool doFinalization(CallGraph &CG) { in doFinalization() argument
88 const CallGraph &CG; // The call graph for this SCC. variable
93 CallGraphSCC(CallGraph &cg, void *context) : CG(cg), Context(context) {} in CallGraphSCC()
111 const CallGraph &getCallGraph() { return CG; } in getCallGraph()
|
| D | CallGraph.h | 471 static nodes_iterator nodes_begin(CallGraph *CG) {
472 return nodes_iterator(CG->begin(), &CGGetValuePtr);
475 static nodes_iterator nodes_end(CallGraph *CG) {
476 return nodes_iterator(CG->end(), &CGGetValuePtr);
498 static nodes_iterator nodes_begin(const CallGraph *CG) {
499 return nodes_iterator(CG->begin(), &CGGetValuePtr);
502 static nodes_iterator nodes_end(const CallGraph *CG) {
503 return nodes_iterator(CG->end(), &CGGetValuePtr);
|
| D | GlobalsModRef.h | 89 CallGraph &CG);
115 void AnalyzeCallGraph(CallGraph &CG, Module &M);
121 void CollectSCCMembership(CallGraph &CG);
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Coroutines/ |
| D | Coroutines.cpp | 189 static void buildCGN(CallGraph &CG, CallGraphNode *Node) { in buildCGN() argument
200 Node->addCalledFunction(Call, CG.getCallsExternalNode()); in buildCGN()
202 Node->addCalledFunction(Call, CG.getOrInsertFunction(Callee)); in buildCGN()
209 CallGraph &CG, CallGraphSCC &SCC) { in updateCallGraph() argument
211 auto *ParentNode = CG[&ParentFunc]; in updateCallGraph()
213 buildCGN(CG, ParentNode); in updateCallGraph()
218 CallGraphNode *Callee = CG.getOrInsertFunction(F); in updateCallGraph()
220 buildCGN(CG, Callee); in updateCallGraph()
494 static void addCallToCallGraph(CallGraph *CG, CallInst *Call, Function *Callee){ in addCallToCallGraph() argument
495 if (CG) in addCallToCallGraph()
[all …]
|
| D | CoroSplit.cpp | 163 CallGraph *CG) { in maybeFreeRetconStorage() argument
169 Shape.emitDealloc(Builder, FramePtr, CG); in maybeFreeRetconStorage()
175 bool InResume, CallGraph *CG) { in replaceFallthroughCoroEnd() argument
193 maybeFreeRetconStorage(Builder, Shape, FramePtr, CG); in replaceFallthroughCoroEnd()
200 maybeFreeRetconStorage(Builder, Shape, FramePtr, CG); in replaceFallthroughCoroEnd()
224 Value *FramePtr, bool InResume, CallGraph *CG){ in replaceUnwindCoroEnd() argument
237 maybeFreeRetconStorage(Builder, Shape, FramePtr, CG); in replaceUnwindCoroEnd()
251 Value *FramePtr, bool InResume, CallGraph *CG) { in replaceCoroEnd() argument
253 replaceUnwindCoroEnd(End, Shape, FramePtr, InResume, CG); in replaceCoroEnd()
255 replaceFallthroughCoroEnd(End, Shape, FramePtr, InResume, CG); in replaceCoroEnd()
[all …]
|
| D | CoroInternal.h | 52 CallGraph &CG, CallGraphSCC &SCC);
227 Value *emitAlloc(IRBuilder<> &Builder, Value *Size, CallGraph *CG) const;
232 void emitDealloc(IRBuilder<> &Builder, Value *Ptr, CallGraph *CG) const;
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/IPO/ |
| D | Inliner.h | 39 bool doInitialization(CallGraph &CG) override;
49 bool doFinalization(CallGraph &CG) override;
62 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
104 LazyCallGraph &CG, CGSCCUpdateResult &UR);
|
| D | Internalize.h | 63 bool internalizeModule(Module &TheModule, CallGraph *CG = nullptr);
72 CallGraph *CG = nullptr) {
74 .internalizeModule(TheModule, CG);
|
| /third_party/boost/libs/geometry/test/algorithms/set_operations/intersection/ |
| D | intersection_areal_areal_linear.cpp | 107 typedef closed_ring_type CG; in BOOST_AUTO_TEST_CASE() typedef
110 typedef test_intersection_aal<OG, OG, CG, CG, ML> tester; in BOOST_AUTO_TEST_CASE()
202 typedef closed_polygon_type CG; in BOOST_AUTO_TEST_CASE() typedef
205 typedef test_intersection_aal<OG, OG, CG, CG, ML> tester; in BOOST_AUTO_TEST_CASE()
337 typedef closed_multipolygon_type CG; in BOOST_AUTO_TEST_CASE() typedef
340 typedef test_intersection_aal<OG, OG, CG, CG, ML> tester; in BOOST_AUTO_TEST_CASE()
|
| /third_party/boost/libs/geometry/test/algorithms/ |
| D | is_valid.cpp | 263 typedef bg::model::ring<Point, false, true> CG; // ccw, closed ring in test_open_rings() typedef
268 typedef test_valid<tester, OG, CG, CW_OG, CW_CG> test; in test_open_rings()
372 typedef bg::model::ring<Point, false, true> CG; // ccw, closed ring in test_closed_rings() typedef
376 typedef test_valid<tester, CG, CG, CW_CG> test; in test_closed_rings()
428 typedef bg::model::polygon<Point, false, true> CG; // ccw, closed in test_open_polygons() typedef
433 typedef test_valid<tester, OG, CG, CW_OG, CW_CG> test; in test_open_polygons()
845 typedef bg::model::multi_polygon<ccw_closed_polygon_type> CG; in test_open_multipolygons() typedef
850 typedef test_valid<tester, OG, CG, CW_OG, CW_CG> test; in test_open_multipolygons()
1000 CG mpoly = from_wkt<CG>(wkt); in test_open_multipolygons()
1022 CG mpoly = from_wkt<CG>(wkt); in test_open_multipolygons()
[all …]
|
| /third_party/skia/third_party/externals/icu/patches/ |
| D | locale_google.patch | 1470 CG{"Kongo (Republiek die)"}
1526 CG{"ኮንጎ (ሪፑብሊክ)"}
1584 CG{"جمهورية الكونغو"}
1661 CG{"কঙ্গো (প্রজাতন্ত্র)"}
1719 CG{"Congu (República del)"}
1777 CG{"Konqo (Respublika)"}
1825 CG{"Конго (Республика)"}
1881 CG{"Рэспубліка Конга"}
1939 CG{"Конго (Република)"}
1999 CG{"কঙ্গো (প্রজাতন্ত্র)"}
[all …]
|
| /third_party/boost/libs/graph/doc/ |
| D | transitive_closure.w | 188 the SCC numbers for vertices in the condensation graph (CG), so we use
211 one vertex in the CG for every strongly connected component in the
212 original graph. We will add an edge to the CG whenever there is one or
214 its target in another SCC. The data structure we will use for the CG
224 CG_t CG(num_scc);
232 CG[s].insert(t); // add edge (s,t) to the condensation graph
247 CG_t CG(num_scc);
263 CG[s] = adj;
337 std::vector<cg_vertex> topo_number(num_vertices(CG));
338 topological_sort(CG, std::back_inserter(topo_order),
[all …]
|
| /third_party/flutter/skia/third_party/externals/icu/patches/ |
| D | locale_google.patch | 260 CG{"Kongo (Republiek die)"}
323 CG{"ኮንጎ (ሪፐብሊክ)"}
387 CG{"جمهورية الكونغو"}
470 CG{"কঙ্গো (প্রজাতন্ত্র)"}
534 CG{"Congu (República del)"}
598 CG{"Konqo (Respublika)"}
651 CG{"Конго (Республика)"}
714 CG{"Рэспубліка Конга"}
778 CG{"Конго (Република)"}
841 CG{"কঙ্গো (প্রজাতন্ত্র)"}
[all …]
|
| /third_party/boost/boost/graph/ |
| D | transitive_closure.hpp | 93 CG_t CG(num_scc); in transitive_closure() local
117 add_edge(s, *i, CG); in transitive_closure()
122 std::vector< cg_vertex > topo_number(num_vertices(CG)); in transitive_closure()
123 topological_sort(CG, std::back_inserter(topo_order), in transitive_closure()
131 std::vector< std::vector< cg_vertex > > CG_vec(num_vertices(CG)); in transitive_closure()
132 for (size_type i = 0; i < num_vertices(CG); ++i) in transitive_closure()
136 std::pair< cg_adj_iter, cg_adj_iter > pr = adjacent_vertices(i, CG); in transitive_closure()
|