Searched refs:start_block (Results 1 - 4 of 4) sorted by relevance
| /arkcompiler/runtime_core/compiler/tests/ |
| H A D | compiler_basicblock_test.cpp | 55 auto start_block = graph->GetStartBlock(); in HWTEST_F()
57 auto value = BlocksPathDfsSearch(mrk, start_block, start_block, end_block); in HWTEST_F()
64 EXPECT_TRUE(BlocksPathDfsSearch(mrk, start_block, end_block, bb->GetSuccessor(0))); in HWTEST_F()
65 EXPECT_FALSE(BlocksPathDfsSearch(mrk, start_block, bb->GetSuccessor(0), end_block)); in HWTEST_F()
66 EXPECT_FALSE(BlocksPathDfsSearch(mrk, end_block, start_block, bb->GetSuccessor(0))); in HWTEST_F()
164 auto start_block = graph->GetStartBlock(); in HWTEST_F()
167 EXPECT_TRUE(start_block->IsDominate(end_block)); in HWTEST_F()
168 EXPECT_FALSE(end_block->IsDominate(start_block)); in HWTEST_F()
221 auto start_block in HWTEST_F()
[all...] |
| H A D | compiler_graph_test.cpp | 74 auto start_block = graph->GetStartBlock(); in HWTEST_F()
76 MarkBlocksRec(mrk, start_block); in HWTEST_F()
77 EXPECT_TRUE(start_block->IsMarked(mrk)); in HWTEST_F()
|
| /arkcompiler/runtime_core/compiler/optimizer/analysis/ |
| H A D | dominators_tree.cpp | 194 * Check if there is path from `start_block` to `target_block` excluding `exclude_block`
196 static bool IsPathBetweenBlocks(BasicBlock *start_block, BasicBlock *target_block, BasicBlock *exclude_block) in IsPathBetweenBlocks() argument
200 return BlocksPathDfsSearch(marker, start_block, target_block, exclude_block); in IsPathBetweenBlocks()
|
| /arkcompiler/runtime_core/compiler/optimizer/ir/ |
| H A D | graph.h | 239 void SetStartBlock(BasicBlock *start_block) in SetStartBlock() argument
241 start_block_ = start_block; in SetStartBlock()
|
Completed in 4 milliseconds