/arkcompiler/runtime_core/compiler/tests/ |
D | graph_comparator.h | 30 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->GetBlocksR… in Compare() 42 … graph2->GetBlocksRPO().end(), [this](auto bb1, auto bb2) { return Compare(bb1, bb2); }); in Compare()
|
D | compiler_basicblock_test.cpp | 59 for (auto bb : graph->GetBlocksRPO()) { in __anon9f1e038e0102() 87 for (auto bb : graph->GetBlocksRPO()) { in __anon9f1e038e0202() 116 for (auto bb : graph->GetBlocksRPO()) { in __anon9f1e038e0302() 191 for (auto bb : graph->GetBlocksRPO()) { in __anon9f1e038e0602() 223 for (auto bb : graph->GetBlocksRPO()) { in __anon9f1e038e0702() 277 for (auto bb : graph->GetBlocksRPO()) { in __anon9f1e038e0902() 305 auto block = graph->GetBlocksRPO()[0]; in __anon9f1e038e0a02() 333 for (auto block : graph->GetBlocksRPO()) { in __anon9f1e038e0b02() 382 for (auto block : graph->GetBlocksRPO()) { in __anon9f1e038e0c02() 443 for (auto bb : graph->GetBlocksRPO()) { in __anon9f1e038e0e02() [all …]
|
D | compiler_inst_test.cpp | 85 for (auto bb : graph->GetBlocksRPO()) { in __anon7b7a1abf0102() 136 for (auto bb : graph->GetBlocksRPO()) { in __anon7b7a1abf0202() 173 for (auto bb : graph->GetBlocksRPO()) { in __anon7b7a1abf0302() 204 for (auto bb : graph->GetBlocksRPO()) { in __anon7b7a1abf0402() 238 for (auto bb : graph->GetBlocksRPO()) { in __anon7b7a1abf0502() 312 for (auto bb : graph->GetBlocksRPO()) { in __anon7b7a1abf0602() 343 for (auto bb : graph->GetBlocksRPO()) { in __anon7b7a1abf0702() 411 for (auto bb : graph->GetBlocksRPO()) { in __anon7b7a1abf0902() 443 for (auto bb : graph->GetBlocksRPO()) { in __anon7b7a1abf0a02() 483 for (auto bb : graph->GetBlocksRPO()) { in __anon7b7a1abf0b02() [all …]
|
D | loop_analyzer_new_test.cpp | 79 for (auto bb : graph->GetBlocksRPO()) { in __anon55843b6f0202() 113 for (auto bb : graph->GetBlocksRPO()) { in __anon55843b6f0302() 147 for (auto bb : graph->GetBlocksRPO()) { in __anon55843b6f0402() 181 for (auto bb : graph->GetBlocksRPO()) { in __anon55843b6f0502()
|
D | dominators_tree_new_test.cpp | 55 for (auto bb : graph->GetBlocksRPO()) { in __anona6f8c39f0102() 90 for (auto bb : graph->GetBlocksRPO()) { in __anona6f8c39f0202()
|
D | dump_test.cpp | 68 for (auto bb : graph->GetBlocksRPO()) { in __anonb8e9e89d0102() 131 for (auto block : graph->GetBlocksRPO()) { in __anonb8e9e89d0202() 405 for (auto bb : graph->GetBlocksRPO()) { in __anonb8e9e89d0602() 511 for (auto bb : graph->GetBlocksRPO()) { in __anonb8e9e89d0902() 547 for (auto bb : graph->GetBlocksRPO()) { in __anonb8e9e89d0a02() 582 for (auto bb : graph->GetBlocksRPO()) { in __anonb8e9e89d0b02() 618 for (auto bb : graph->GetBlocksRPO()) { in __anonb8e9e89d0c02() 691 for (auto bb : graph->GetBlocksRPO()) { in __anonb8e9e89d0e02() 887 for (auto bb : graph->GetBlocksRPO()) { in __anonb8e9e89d1102() 953 for (auto bb : graph->GetBlocksRPO()) { in __anonb8e9e89d1302()
|
D | call_input_types_test.cpp | 23 for (const auto *bb : graph->GetBlocksRPO()) { in GetCallInstruction()
|
D | compiler_graph_test.cpp | 188 auto size = graph->GetBlocksRPO().size(); in __anon65fffef30502() 190 EXPECT_EQ(graph->GetBlocksRPO().size(), size); in __anon65fffef30502() 214 for (auto bb : graph->GetBlocksRPO()) { in __anon65fffef30602() 386 for (auto bb : graph->GetBlocksRPO()) { in __anon65fffef30c02() 569 for (auto bb : graph->GetBlocksRPO()) { in __anon65fffef30f02() 655 for (auto block : graph->GetBlocksRPO()) { in __anon65fffef31202()
|
D | linear_order_new_test.cpp | 80 for (auto bb : graph->GetBlocksRPO()) { in __anon08df7aa60202()
|
D | irBuilder_tests.cpp | 155 for (auto bb : graph->GetBlocksRPO()) { in __anon1538a8fc0302() 295 for (auto bb : graph->GetBlocksRPO()) { in __anon1538a8fc0402() 453 for (auto bb : graph->GetBlocksRPO()) { in __anon1538a8fc0502() 532 for (auto bb : graph->GetBlocksRPO()) { in __anon1538a8fc0602()
|
/arkcompiler/runtime_core/bytecode_optimizer/ |
D | reg_acc_alloc.cpp | 199 for (auto block : GetGraph()->GetBlocksRPO()) { in RunImpl() 217 for (auto block : GetGraph()->GetBlocksRPO()) { in RunImpl() 226 for (auto block : GetGraph()->GetBlocksRPO()) { in RunImpl()
|
D | reg_encoder.cpp | 64 for (auto bb : graph->GetBlocksRPO()) { in CalculateNumNeededRangeTemps() 178 for (auto *bb : GetGraph()->GetBlocksRPO()) { in RenumberRegs() 289 for (auto *bb : GetGraph()->GetBlocksRPO()) { in InsertSpills() 305 for (auto bb : GetGraph()->GetBlocksRPO()) { in CalculateNumNeededTemps()
|
D | reg_encoder.h | 121 return GetGraph()->GetBlocksRPO(); in GetBlocksToVisit()
|
/arkcompiler/runtime_core/bytecode_optimizer/tests/ |
D | codegen_test.cpp | 103 for (auto bb : graph->GetBlocksRPO()) { in __anon0774c0120102() 140 for (auto bb : graph->GetBlocksRPO()) { in __anon0774c0120202() 177 for (auto bb : graph->GetBlocksRPO()) { in __anon0774c0120302() 240 for (auto bb : graph->GetBlocksRPO()) { in __anon0774c0120402() 334 for (auto bb : graph->GetBlocksRPO()) { in __anon0774c0120602() 537 for (auto bb : graph->GetBlocksRPO()) { in __anon0774c0120802()
|
D | common.h | 277 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->GetBlocksR… in Compare() 283 … graph2->GetBlocksRPO().end(), [this](auto bb1, auto bb2) { return Compare(bb1, bb2); }); in Compare() 781 for (auto bb : GetGraph()->GetBlocksRPO()) { in CheckConstArray()
|
/arkcompiler/runtime_core/compiler/optimizer/optimizations/ |
D | lowering.h | 51 return GetGraph()->GetBlocksRPO(); in GetBlocksToVisit()
|
D | vn.cpp | 154 for (auto bb : GetGraph()->GetBlocksRPO()) { in RunImpl() 159 for (auto bb : GetGraph()->GetBlocksRPO()) { in RunImpl()
|
D | cleanup.cpp | 271 for (auto bb : GetGraph()->GetBlocksRPO()) { in Dce() 279 for (auto bb : GetGraph()->GetBlocksRPO()) { in Dce() 439 for (auto bb : GetGraph()->GetBlocksRPO()) { in BuildDominators() 454 for (auto bb : GetGraph()->GetBlocksRPO()) { in BuildDominators() 632 for (auto bb : GetGraph()->GetBlocksRPO()) { in PhiChecker()
|
/arkcompiler/runtime_core/libark_defect_scan_aux/ |
D | graph.cpp | 188 auto &blocks = graph_->GetBlocksRPO(); in GetBasicBlockList() 197 for (auto &bb : graph_->GetBlocksRPO()) { in VisitAllInstructions()
|
/arkcompiler/runtime_core/compiler/optimizer/ir/ |
D | graph_checker.cpp | 113 ASSERT_PRINT(blocks_count == GetGraph()->GetBlocksRPO().size(), "There is disconnected block"); in Check() 302 for (auto &bb : GetGraph()->GetBlocksRPO()) { in CheckGraph() 419 for ([[maybe_unused]] auto block : GetGraph()->GetBlocksRPO()) { in CheckLoops() 450 for (auto block : GetGraph()->GetBlocksRPO()) { in CheckDomTree() 457 for ([[maybe_unused]] auto block : GetGraph()->GetBlocksRPO()) { in CheckDomTree() 472 for (auto block : GetGraph()->GetBlocksRPO()) { in CheckLoopAnalysis() 623 for (auto &block : GetGraph()->GetBlocksRPO()) { in CheckSaveStatesWithRuntimeCallUsers() 644 for (auto &block : GetGraph()->GetBlocksRPO()) { in CheckSaveStateInputs()
|
D | graph_checker.h | 109 return GetGraph()->GetBlocksRPO(); in GetBlocksToVisit()
|
/arkcompiler/runtime_core/compiler/optimizer/analysis/ |
D | dominators_tree.cpp | 26 for (auto block : GetGraph()->GetBlocksRPO()) { in RunImpl() 34 …ASSERT_PRINT(dfs_blocks == (GetGraph()->GetBlocksRPO().size() - 1), "There is an unreachable block… in RunImpl()
|
D | loop_analyzer.cpp | 234 …for (auto it = GetGraph()->GetBlocksRPO().rbegin(); it != GetGraph()->GetBlocksRPO().rend(); it++)… in PopulateLoops() 260 for (auto block : GetGraph()->GetBlocksRPO()) { in PopulateLoops()
|
/arkcompiler/runtime_core/compiler/optimizer/ir_builder/ |
D | inst_builder.cpp | 221 for (auto bb : GetGraph()->GetBlocksRPO()) { in FixInstructions() 240 for (auto bb : GetGraph()->GetBlocksRPO()) { in FixInstructions() 322 for (auto block : GetGraph()->GetBlocksRPO()) { in CleanupCatchPhis()
|
/arkcompiler/runtime_core/compiler/optimizer/optimizations/regalloc/ |
D | reg_alloc_resolver.cpp | 33 for (auto block : GetGraph()->GetBlocksRPO()) { in Resolve() 255 for (auto block : GetGraph()->GetBlocksRPO()) { in ResolveCatchPhis()
|