Home
last modified time | relevance | path

Searched refs:GetStartBlock (Results 1 - 25 of 56) sorted by relevance

123

/arkcompiler/runtime_core/compiler/tests/
H A Dcompiler_basicblock_test.cpp55 auto start_block = graph->GetStartBlock(); in HWTEST_F()
92 graph->GetStartBlock()->InsertBlockBefore(bb->GetPredecessor(0)); in HWTEST_F()
95 EXPECT_TRUE(graph->GetStartBlock()->IsDominate(graph->GetStartBlock())); in HWTEST_F()
143 EXPECT_TRUE(graph->GetStartBlock()->CreateImmediateDominator()->IsEmpty()); in HWTEST_F()
164 auto start_block = graph->GetStartBlock(); in HWTEST_F()
221 auto start_block = graph->GetStartBlock(); in HWTEST_F()
250 auto bb = graph->GetStartBlock(); in HWTEST_F()
411 auto start_block = graph->GetStartBlock(); in HWTEST_F()
521 auto bb = graph->GetStartBlock(); in HWTEST_F()
[all...]
H A Dliveness_analyzer_new_test.cpp261 auto bb = graph->GetStartBlock(); in HWTEST_F()
298 auto bb = graph->GetStartBlock(); in HWTEST_F()
330 auto bb = graph->GetStartBlock(); in HWTEST_F()
362 auto bb = graph->GetStartBlock(); in HWTEST_F()
390 auto bb = graph->GetStartBlock(); in HWTEST_F()
420 auto bb = graph->GetStartBlock(); in HWTEST_F()
449 auto bb = graph->GetStartBlock(); in HWTEST_F()
487 auto bb = graph->GetStartBlock(); in HWTEST_F()
522 auto bb = graph->GetStartBlock(); in HWTEST_F()
551 auto bb = graph->GetStartBlock(); in HWTEST_F()
[all...]
H A Ddom_tree_test.cpp61 auto block = GetGraph()->GetStartBlock(); in TEST_F()
134 auto entry = GetGraph()->GetStartBlock(); in TEST_F()
284 auto entry = GetGraph()->GetStartBlock(); in TEST_F()
303 CheckImmediateDominators(GetGraph()->GetStartBlock(), {BB(2).GetLoop()->GetPreHeader()}); in TEST_F()
H A Dsplit_resolver_new_test.cpp137 auto start_bb = graph->GetStartBlock(); in HWTEST_F()
196 auto bb = graph->GetStartBlock()->GetSuccessor(0); in HWTEST_F()
207 la, graph->GetStartBlock(), [](Inst *inst) { return inst->IsParameter() && inst->HasUsers(); }); in HWTEST_F()
258 la, graph->GetStartBlock(), [](Inst *inst) { return inst->IsParameter() && inst->HasUsers(); }); in HWTEST_F()
H A Ddump_test.cpp104 BlockProps(graph->GetStartBlock(), &data); in HWTEST_F()
113 Loop loop2(graph->GetAllocator(), graph->GetStartBlock(), 0); in HWTEST_F()
114 Loop loop3(graph->GetAllocator(), graph->GetStartBlock(), 1); in HWTEST_F()
177 auto value = BBId(graph->GetStartBlock(), graph->GetAllocator()); in HWTEST_F()
378 auto inst = graph->GetStartBlock()->GetFirstInst(); in HWTEST_F()
H A Dreg_alloc_common_test.cpp214 auto bb = check_graph->GetStartBlock()->GetSuccessor(0); in TEST_F()
257 for (auto inst : check_graph->GetStartBlock()->Insts()) { in TEST_F()
H A Dinst_test.cpp190 auto start = GetGraph()->GetStartBlock(); in TEST_F()
245 auto start = graph->GetStartBlock(); in TEST_F()
559 graph->GetStartBlock()->AddSucc(graph->GetEndBlock()); in TEST_F()
/arkcompiler/runtime_core/static_core/compiler/tests/
H A Dmonitor_analysis_test.cpp42 EXPECT_FALSE(GetGraph()->GetStartBlock()->GetMonitorEntryBlock()); in TEST_F()
43 EXPECT_FALSE(GetGraph()->GetStartBlock()->GetMonitorExitBlock()); in TEST_F()
44 EXPECT_FALSE(GetGraph()->GetStartBlock()->GetMonitorBlock()); in TEST_F()
93 EXPECT_FALSE(GetGraph()->GetStartBlock()->GetMonitorEntryBlock()); in TEST_F()
94 EXPECT_FALSE(GetGraph()->GetStartBlock()->GetMonitorExitBlock()); in TEST_F()
95 EXPECT_FALSE(GetGraph()->GetStartBlock()->GetMonitorBlock()); in TEST_F()
153 EXPECT_FALSE(GetGraph()->GetStartBlock()->GetMonitorEntryBlock()); in TEST_F()
154 EXPECT_FALSE(GetGraph()->GetStartBlock()->GetMonitorExitBlock()); in TEST_F()
155 EXPECT_FALSE(GetGraph()->GetStartBlock()->GetMonitorBlock()); in TEST_F()
217 EXPECT_FALSE(GetGraph()->GetStartBlock() in TEST_F()
[all...]
H A Dsavestate_optimization_tests.cpp106 GetGraph()->GetStartBlock()->AddSucc(block); in TEST_F()
110 GetGraph()->GetStartBlock()->AppendInst(param1); in TEST_F()
111 GetGraph()->GetStartBlock()->AppendInst(param2); in TEST_F()
117 GetGraph()->GetStartBlock()->AppendInst(sp); in TEST_F()
H A Ddom_tree_test.cpp62 auto block = GetGraph()->GetStartBlock(); in TEST_F()
139 auto entry = GetGraph()->GetStartBlock(); in TEST_F()
287 auto entry = GetGraph()->GetStartBlock(); in TEST_F()
306 CheckImmediateDominators(GetGraph()->GetStartBlock(), {BB(2U).GetLoop()->GetPreHeader()}); in TEST_F()
H A Dreg_alloc_common_test.cpp254 auto bb = checkGraph->GetStartBlock()->GetSuccessor(0U); in TEST_F()
300 for (auto inst : checkGraph->GetStartBlock()->Insts()) { in TEST_F()
331 auto bb = checkGraph->GetStartBlock()->GetSuccessor(0U); in TEST_F()
H A Dgraph_creation_test.cpp35 EXPECT_NE(graph->GetStartBlock(), nullptr); in TEST_F()
/arkcompiler/runtime_core/compiler/optimizer/optimizations/
H A Dmove_constants.cpp60 graph->GetStartBlock()->EraseInst(inst); in MoveFromStartBlock()
75 if (target_bb != graph->GetStartBlock()) { in MoveFromStartBlock()
76 graph->GetStartBlock()->EraseInst(inst); in MoveFromStartBlock()
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/
H A Dmove_constants.cpp74 graph->GetStartBlock()->EraseInst(inst); in MoveFromStartBlock()
89 if (targetBb != graph->GetStartBlock()) { in MoveFromStartBlock()
90 graph->GetStartBlock()->EraseInst(inst); in MoveFromStartBlock()
H A Dsavestate_optimization.cpp38 auto block = GetGraph()->GetStartBlock(); in RemoveSafePoints()
/arkcompiler/runtime_core/compiler/optimizer/analysis/
H A Drpo.cpp51 DFS(GetGraph()->GetStartBlock(), &blocks_count); in RunImpl()
/arkcompiler/runtime_core/static_core/compiler/optimizer/analysis/
H A Drpo.cpp51 DFS(GetGraph()->GetStartBlock(), &blocksCount); in RunImpl()
/arkcompiler/runtime_core/static_core/compiler/optimizer/ir/
H A Dgraph.cpp55 MarkBlocksRec(mrk, GetStartBlock()); in RemoveUnreachableBlocks()
88 GetStartBlock()->AppendInst(constInst); in AddConstInStartBlock()
94 GetStartBlock()->AppendInst(param); in AddNewParameter()
100 for (auto inst : GetStartBlock()->AllInsts()) { in FindParameter()
116 GetStartBlock()->AppendInst(nullptrInst_); in GetOrCreateNullPtr()
125 GetStartBlock()->AppendInst(undefinedInst_); in GetOrCreateUndefinedInst()
387 ASSERT(GetStartBlock() != block); in EraseBlock()
705 auto startBb = graph_->GetStartBlock(); in begin()
/arkcompiler/runtime_core/static_core/irtoc/backend/compiler/
H A Ddangling_pointers_checker.cpp73 for (auto inst : GetGraph()->GetStartBlock()->Insts()) { in InitLiveIns()
273 while (block != GetGraph()->GetStartBlock()) { in GetLastAccDefinition()
455 while (block != GetGraph()->GetStartBlock()) { in CheckStoreAcc()
478 while (block != GetGraph()->GetStartBlock()) { in CheckStoreAccTag()
/arkcompiler/runtime_core/compiler/optimizer/ir/
H A Dgraph.cpp41 MarkBlocksRec(mrk, GetStartBlock()); in RemoveUnreachableBlocks()
72 GetStartBlock()->AppendInst(const_inst); in AddConstInStartBlock()
78 GetStartBlock()->AppendInst(param); in AddNewParameter()
330 ASSERT(GetStartBlock() != block); in EraseBlock()
464 auto start_bb = graph_->GetStartBlock(); in begin()
H A Dgraph_checker.cpp185 if (block != graph->GetStartBlock()) { in CheckDataFlow()
259 ASSERT(GetGraph()->GetStartBlock()); in CheckStartBlock()
260 ASSERT_PRINT(GetGraph()->GetStartBlock()->GetPredsBlocks().empty(), "Start block can't have predecessors"); in CheckStartBlock()
261 ASSERT_PRINT(GetGraph()->GetStartBlock()->GetSuccsBlocks().size() == 1, "Start block should have one successor"); in CheckStartBlock()
262 for (auto inst : GetGraph()->GetStartBlock()->AllInsts()) { in CheckStartBlock()
H A Dir_constructor.h75 if (graph_->GetStartBlock() == nullptr) { in SetGraph()
83 bb_map_[ID_ENTRY_BB] = graph_->GetStartBlock(); in SetGraph()
110 graph_->GetStartBlock()->AddSucc(bb); in NewBlock()
129 block = graph_->GetStartBlock(); in NewInst()
1036 for (auto inst : graph_->GetStartBlock()->Insts()) {
1042 for (auto inst : graph_->GetStartBlock()->Insts()) {
/arkcompiler/runtime_core/libark_defect_scan_aux/
H A Dgraph.cpp182 return BasicBlock(graph_->GetStartBlock()); in GetStartBasicBlock()
/arkcompiler/runtime_core/static_core/compiler/optimizer/ir_builder/
H A Dinst_builder.cpp83 currentBb_ != GetGraph()->GetStartBlock() && currentDefs_ != nullptr) { in SetCurrentBlock()
132 SetCurrentBlock(GetGraph()->GetStartBlock()); in Prepare()
170 GetGraph()->GetStartBlock()->AppendInst(CreateSafePoint(GetGraph()->GetStartBlock())); in Prepare()
/arkcompiler/runtime_core/static_core/plugins/ets/compiler/optimizer/optimizations/interop_js/
H A Dinterop_intrinsic_optimization.cpp142 bool isStart = bb == GetGraph()->GetStartBlock()->GetSuccessor(0); in TryCreateSingleScope()
202 auto *startBlock = GetGraph()->GetStartBlock()->GetSuccessor(0); in TryCreateSingleScope()
213 for (auto *inst : GetGraph()->GetStartBlock()->Insts()) { in TryCreateSingleScope()
723 CheckGraphRec(GetGraph()->GetStartBlock(), nullptr); in CheckGraphAndFindScopes()
1126 DomTreeDfs(GetGraph()->GetStartBlock()); in RedundancyElimination()

Completed in 20 milliseconds

123