Home
last modified time | relevance | path

Searched refs:GetBlocksRPO (Results 1 - 25 of 132) sorted by relevance

123456

/arkcompiler/runtime_core/compiler/tests/
H A Dgraph_comparator.h36 if (graph1->GetBlocksRPO().size() != graph2->GetBlocksRPO().size()) { in Compare()
40 for (auto it1 = graph1->GetBlocksRPO().begin(), it2 = graph2->GetBlocksRPO().begin(); in Compare()
41 it1 != graph1->GetBlocksRPO().end(); it1++, it2++) { in Compare()
47 return std::equal(graph1->GetBlocksRPO().begin(), graph1->GetBlocksRPO().end(), graph2->GetBlocksRPO().begin(), in Compare()
48 graph2->GetBlocksRPO().end(), [this](auto bb1, auto bb2) { return Compare(bb1, bb2); }); in Compare()
H A Dcompiler_basicblock_test.cpp59 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
87 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
116 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
191 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
223 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
277 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
305 auto block = graph->GetBlocksRPO()[0]; in HWTEST_F()
333 for (auto block : graph->GetBlocksRPO()) { in HWTEST_F()
382 for (auto block : graph->GetBlocksRPO()) { in HWTEST_F()
443 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
[all...]
H A Dcompiler_inst_test.cpp98 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
149 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
186 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
217 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
251 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
325 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
356 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
424 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
456 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
496 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
[all...]
H A Dbranch_elimination_new_test.cpp116 for (auto dom_bb : graph->GetBlocksRPO()) { in CollectDominatedDeadBlocks()
129 for (auto bb : graph->GetBlocksRPO()) { in CollectDeadBlocksWithIfInst()
173 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
H A Dloop_analyzer_new_test.cpp79 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
113 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
147 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
181 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
H A Ddump_test.cpp68 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
131 for (auto block : graph->GetBlocksRPO()) { in HWTEST_F()
405 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
511 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
547 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
582 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
619 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
692 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
888 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
954 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
[all...]
H A Ddominators_tree_new_test.cpp55 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
90 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
H A Dcall_input_types_test.cpp23 for (const auto *bb : graph->GetBlocksRPO()) { in GetCallInstruction()
/arkcompiler/runtime_core/static_core/compiler/tests/
H A Dgraph_comparator.h30 if (graph1->GetBlocksRPO().size() != graph2->GetBlocksRPO().size()) { in Compare()
34 for (auto it1 = graph1->GetBlocksRPO().begin(), it2 = graph2->GetBlocksRPO().begin(); in Compare()
35 it1 != graph1->GetBlocksRPO().end(); it1++, it2++) { in Compare()
41 return std::equal(graph1->GetBlocksRPO().begin(), graph1->GetBlocksRPO().end(), graph2->GetBlocksRPO().begin(), in Compare()
42 graph2->GetBlocksRPO().end(), [this](auto bb1, auto bb2) { return Compare(bb1, bb2); }); in Compare()
/arkcompiler/runtime_core/static_core/compiler/optimizer/analysis/
H A Dmonitor_analysis.cpp78 for (auto bb : GetGraph()->GetBlocksRPO()) { in RunImpl()
90 for (auto bb : GetGraph()->GetBlocksRPO()) { in RunImpl()
H A Dtypes_analysis.h41 return GetGraph()->GetBlocksRPO();
/arkcompiler/runtime_core/bytecode_optimizer/tests/
H A Dcodegen_test.cpp107 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
144 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
181 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
244 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
338 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
534 for (auto bb : graph->GetBlocksRPO()) { in HWTEST_F()
H A Dcommon.h277 if (graph1->GetBlocksRPO().size() != graph2->GetBlocksRPO().size()) { in Compare()
278 std::cerr << "Different number of blocks: " << graph1->GetBlocksRPO().size() << " and " in Compare()
279 << graph2->GetBlocksRPO().size() << std::endl; in Compare()
282 return std::equal(graph1->GetBlocksRPO().begin(), graph1->GetBlocksRPO().end(), graph2->GetBlocksRPO().begin(), in Compare()
283 graph2->GetBlocksRPO().end(), [this](auto bb1, auto bb2) { return Compare(bb1, bb2); }); in Compare()
781 for (auto bb : GetGraph()->GetBlocksRPO()) {
/arkcompiler/runtime_core/static_core/bytecode_optimizer/
H A Dreg_acc_alloc.cpp300 for (auto block : graph->GetBlocksRPO()) { in InitRegisters()
312 for (auto block : graph->GetBlocksRPO()) { in HasUnsupportedOpcode()
324 for (auto block : GetGraph()->GetBlocksRPO()) { in MarkPhiInstructions()
381 for (auto block : GetGraph()->GetBlocksRPO()) { in MarkInstructions()
H A Dbytecodeopt_peepholes.h68 return GetGraph()->GetBlocksRPO();
H A Dcanonicalization.h55 return GetGraph()->GetBlocksRPO();
/arkcompiler/runtime_core/bytecode_optimizer/
H A Dreg_acc_alloc.cpp189 for (auto block : GetGraph()->GetBlocksRPO()) { in InitializeSourceRegisters()
209 for (auto block : GetGraph()->GetBlocksRPO()) { in MarkAccForPhiInstructions()
307 for (auto block : GetGraph()->GetBlocksRPO()) { in RunImpl()
/arkcompiler/runtime_core/compiler/optimizer/optimizations/
H A Dbranch_elimination.cpp39 for (auto block : GetGraph()->GetBlocksRPO()) { in RunImpl()
199 for (auto block : GetGraph()->GetBlocksRPO()) { in DisconnectBlocks()
205 const auto &rpoBlocks = GetGraph()->GetBlocksRPO(); in DisconnectBlocks()
H A Dlowering.h51 return GetGraph()->GetBlocksRPO();
H A Dvn.cpp155 for (auto bb : GetGraph()->GetBlocksRPO()) { in RunImpl()
160 for (auto bb : GetGraph()->GetBlocksRPO()) { in RunImpl()
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/
H A Dcse.cpp28 for (auto bb : GetGraph()->GetBlocksRPO()) { in LocalCse()
75 for (auto bb : GetGraph()->GetBlocksRPO()) { in CollectTreeForest()
195 for (auto bb : GetGraph()->GetBlocksRPO()) { in GlobalCse()
H A Dsavestate_optimization.h54 return GetGraph()->GetBlocksRPO();
/arkcompiler/runtime_core/static_core/bytecode_optimizer/tests/
H A Dcommon.h286 if (graph1->GetBlocksRPO().size() != graph2->GetBlocksRPO().size()) { in Compare()
287 std::cerr << "Different number of blocks: " << graph1->GetBlocksRPO().size() << " and " in Compare()
288 << graph2->GetBlocksRPO().size() << std::endl; in Compare()
291 return std::equal(graph1->GetBlocksRPO().begin(), graph1->GetBlocksRPO().end(), graph2->GetBlocksRPO().begin(), in Compare()
292 graph2->GetBlocksRPO().end(), [this](auto bb1, auto bb2) { return Compare(bb1, bb2); }); in Compare()
809 for (auto bb : GetGraph()->GetBlocksRPO()) { in CheckConstArray()
/arkcompiler/runtime_core/libark_defect_scan_aux/
H A Dgraph.cpp193 auto &blocks = graph_->GetBlocksRPO(); in GetBasicBlockList()
202 for (auto &bb : graph_->GetBlocksRPO()) { in VisitAllInstructions()
/arkcompiler/runtime_core/compiler/optimizer/ir/
H A Dgraph_checker.cpp106 ASSERT_PRINT(blocks_count == GetGraph()->GetBlocksRPO().size(), "There is disconnected block"); in Check()
295 for (auto &bb : GetGraph()->GetBlocksRPO()) {
412 for ([[maybe_unused]] auto block : GetGraph()->GetBlocksRPO()) { in CheckLoops()
443 for (auto block : GetGraph()->GetBlocksRPO()) { in CheckDomTree()
450 for ([[maybe_unused]] auto block : GetGraph()->GetBlocksRPO()) { in CheckDomTree()
465 for (auto block : GetGraph()->GetBlocksRPO()) { in CheckLoopAnalysis()
616 for (auto &block : GetGraph()->GetBlocksRPO()) { in CheckSaveStatesWithRuntimeCallUsers()
637 for (auto &block : GetGraph()->GetBlocksRPO()) { in CheckSaveStateInputs()

Completed in 17 milliseconds

123456