| /arkcompiler/runtime_core/compiler/tests/ |
| D | irBuilder_tests.cpp | 160 EXPECT_TRUE(bb->GetSuccessor(0)->IsTry()); in __anon32a3985d0302()
161 EXPECT_TRUE(bb->GetSuccessor(1)->IsCatch()); in __anon32a3985d0302()
162 EXPECT_TRUE(bb->GetSuccessor(1)->IsCatchBegin()); in __anon32a3985d0302()
184 EXPECT_TRUE(bb->GetSuccessor(0)->GetGuestPc() == bb->GetGuestPc()); in __anon32a3985d0302()
185 EXPECT_TRUE(!bb->GetSuccessor(0)->IsCatch()); in __anon32a3985d0302()
186 EXPECT_TRUE(!bb->GetSuccessor(0)->IsCatchBegin()); in __anon32a3985d0302()
187 EXPECT_TRUE(bb->GetSuccessor(1)->IsCatch()); in __anon32a3985d0302()
188 EXPECT_TRUE(bb->GetSuccessor(1)->IsCatchBegin()); in __anon32a3985d0302()
198 EXPECT_TRUE(bb->GetSuccessor(0)->IsCatch()); in __anon32a3985d0302()
208 EXPECT_TRUE(bb->GetSuccessor(0)->GetFirstInst()->IsSaveState()); in __anon32a3985d0302()
[all …]
|
| D | loop_analyzer_new_test.cpp | 84 Loop loop(graph->GetAllocator(), bb->GetSuccessor(0), 1); in __anonf25df3b00202()
85 Loop other(graph->GetAllocator(), bb->GetSuccessor(0), 1); in __anonf25df3b00202()
118 Loop loop(graph->GetAllocator(), bb->GetSuccessor(0), 1); in __anonf25df3b00302()
119 loop.AppendBackEdge(bb->GetSuccessor(1)); in __anonf25df3b00302()
120 loop.GetBackEdges()[0]->AddSucc(bb->GetSuccessor(0)); in __anonf25df3b00302()
152 Loop loop(graph->GetAllocator(), bb->GetSuccessor(0), 1); in __anonf25df3b00402()
186 Loop loop(graph->GetAllocator(), bb->GetSuccessor(0), 1); in __anonf25df3b00502()
188 loop.AppendBackEdge(bb->GetSuccessor(1)); in __anonf25df3b00502()
189 loop.AppendBlock(bb->GetSuccessor(1)); in __anonf25df3b00502()
192 loop.AppendBlock(bb->GetSuccessor(0)); in __anonf25df3b00502()
|
| D | linear_order_new_test.cpp | 82 graph->SetStartBlock(bb->GetSuccessor(1)); in __anond752aec70202()
|
| D | dominators_tree_new_test.cpp | 99 bb->GetSuccessor(0)); in __anone12190200202()
|
| D | compiler_basicblock_test.cpp | 64 EXPECT_TRUE(BlocksPathDfsSearch(mrk, start_block, end_block, bb->GetSuccessor(0))); in __anond946d00f0102()
65 EXPECT_FALSE(BlocksPathDfsSearch(mrk, start_block, bb->GetSuccessor(0), end_block)); in __anond946d00f0102()
66 EXPECT_FALSE(BlocksPathDfsSearch(mrk, end_block, start_block, bb->GetSuccessor(0))); in __anond946d00f0102()
|
| D | branch_elimination_test.cpp | 229 EXPECT_EQ(BB(2).GetSuccessor(0), &BB(3)); in TEST_F()
239 EXPECT_EQ(BB(2).GetSuccessor(0), &BB(4)); in TEST_F()
273 EXPECT_EQ(BB(2).GetSuccessor(0), &BB(4)); in TEST_F()
288 EXPECT_EQ(BB(2).GetSuccessor(0), &BB(3)); in TEST_F()
318 EXPECT_EQ(BB(4).GetSuccessor(0), &BB(5)); in TEST_F()
352 EXPECT_EQ(BB(4).GetSuccessor(0), &BB(6)); in TEST_F()
386 EXPECT_EQ(BB(2).GetSuccessor(0), &BB(3)); in TEST_F()
421 EXPECT_EQ(BB(4).GetSuccessor(0), &BB(6)); in TEST_F()
544 EXPECT_EQ(BB(3).GetSuccessor(0), &BB(5)); in TEST_F()
546 EXPECT_EQ(BB(4).GetSuccessor(0), &BB(8)); in TEST_F()
|
| D | reg_alloc_common_test.cpp | 214 auto bb = check_graph->GetStartBlock()->GetSuccessor(0); in TEST_F()
|
| D | ir_builder_test.cpp | 6130 auto try_bb = bb->GetSuccessor(0); in TEST_F()
|
| /arkcompiler/runtime_core/compiler/optimizer/optimizations/ |
| D | cleanup.cpp | 87 … while (bb->GetSuccsBlocks().size() == 1 && bb->GetSuccessor(0)->GetPredsBlocks().size() == 1 && in RunImpl()
88 … !bb->GetSuccessor(0)->IsPseudoControlFlowBlock() && bb->IsTry() == bb->GetSuccessor(0)->IsTry()) { in RunImpl()
89 ASSERT(!bb->GetSuccessor(0)->HasPhi()); in RunImpl()
90 …COMPILER_LOG(DEBUG, CLEANUP) << "Merged block " << bb->GetSuccessor(0)->GetId() << " into " << bb-… in RunImpl()
111 auto succ = bb->GetSuccessor(0); in RunOnce()
146 auto succ = bb->GetSuccessor(0); in CheckSpecialTriangle()
149 if (pred->GetSuccessor(0) == succ || in CheckSpecialTriangle()
150 (pred->GetSuccsBlocks().size() == MAX_SUCCS_NUM && pred->GetSuccessor(1) == succ)) { in CheckSpecialTriangle()
197 auto succ = bb->GetSuccessor(0); in ProcessBB()
|
| /arkcompiler/runtime_core/compiler/optimizer/analysis/ |
| D | linear_order.cpp | 63 … if (block != prev_block->GetSuccessor(0) && !prev_block->GetLastInst()->IsControlFlow()) { in HandlePrevInstruction()
68 } else if (!prev_block->IsEndBlock() && block != prev_block->GetSuccessor(0) && in HandlePrevInstruction()
69 !prev_block->GetSuccessor(0)->IsEndBlock()) { in HandlePrevInstruction()
|
| D | loop_analyzer.cpp | 360 header_ = header_->GetSuccessor(0); in MoveHeaderToSucc()
395 auto outside_block = back_edge->GetSuccessor(1 - header_succ_idx); in GetLoopOutsideSuccessor()
|
| /arkcompiler/runtime_core/compiler/optimizer/ir/ |
| D | graph.cpp | 241 ASSERT(pred->GetSuccsBlocks().size() == 1 && pred->GetSuccessor(0) == block); in RemovePredecessors()
437 if (block->GetSuccessor(0)->GetLoop() != block->GetSuccessor(1)->GetLoop()) { in MarkLoopExits()
442 auto loop = block->GetSuccessor(0)->GetLoop(); in MarkLoopExits()
444 if (loop != block->GetSuccessor(i)->GetLoop()) { in MarkLoopExits()
|
| D | inst.cpp | 453 return GetBasicBlock()->GetSuccessor(GetTrueInputEdgeIdx()); in GetEdgeIfInputTrue()
458 return GetBasicBlock()->GetSuccessor(1 - GetTrueInputEdgeIdx()); in GetEdgeIfInputFalse()
|
| D | basicblock.h | 93 BasicBlock *GetSuccessor(size_t index) const in GetSuccessor() function
531 auto succ = GetSuccessor(catch_indexes->at(idx)); in EnumerateCatchHandlers()
534 succ = succ->GetSuccessor(0); in EnumerateCatchHandlers()
|
| D | graph_checker.cpp | 176 …ASSERT_PRINT(block->GetSuccessor(0) != block->GetSuccessor(1), "Wrong CFG - block with two same su… in CheckControlFlow()
|
| D | ir_constructor.h | 1000 bb->GetSuccessor(0)->SetTry(true); in UpdateSpecialFlags()
1002 bb->GetSuccessor(idx)->SetCatchBegin(true); in UpdateSpecialFlags()
|
| D | basicblock.cpp | 266 auto succ = GetSuccessor(0); in JoinSuccessorBlock()
|
| D | graph_cloner.cpp | 330 auto outer_bb = unroll_data->backedge->GetSuccessor(outer_idx); in UpdateUsersAfterNoSideExitsUnroll()
|
| /arkcompiler/runtime_core/compiler/optimizer/ir_builder/ |
| D | ir_builder.cpp | 425 bb->SetCatch(bb->GetSuccessor(0)->IsCatch()); in MarkTryCatchBlocks()
504 last_try_bb->InsertBlockBeforeSucc(try_end, last_try_bb->GetSuccessor(0)); in ConnectTryCodeBlock()
535 last_try_bb->InsertBlockBeforeSucc(try_block.end_bb, last_try_bb->GetSuccessor(0)); in RestoreTryEnd()
|
| /arkcompiler/runtime_core/bytecode_optimizer/ |
| D | reg_acc_alloc.cpp | 43 block = block->GetSuccessor(0); in IsAccWriteBetween()
|
| /arkcompiler/runtime_core/bytecode_optimizer/tests/ |
| D | codegen_test.cpp | 111 bc_gen.EmitJump(bb->GetSuccessor(1)); in __anona44e78530102()
114 bc_gen.EmitJump(bb->GetSuccessor(0)); in __anona44e78530102()
|
| /arkcompiler/ets_runtime/ecmascript/ |
| D | tagged_tree.cpp | 197 successor = tree->GetSuccessor(entry); in Remove()
295 int TaggedTree<Derived>::GetSuccessor(int entry) const in GetSuccessor() function in panda::ecmascript::TaggedTree
|
| D | tagged_tree.h | 359 int GetSuccessor(int entry) const;
|
| /arkcompiler/runtime_core/compiler/docs/ |
| D | cleanup_doc.md | 131 auto succ = bb->GetSuccessor(0);
|