Home
last modified time | relevance | path

Searched refs:AddBlock (Results 1 – 23 of 23) sorted by relevance

/art/compiler/optimizing/
Dgvn_test.cc33 graph->AddBlock(entry); in TEST_F()
42 graph->AddBlock(block); in TEST_F()
114 graph->AddBlock(entry); in TEST_F()
123 graph->AddBlock(block); in TEST_F()
139 graph->AddBlock(then); in TEST_F()
140 graph->AddBlock(else_); in TEST_F()
141 graph->AddBlock(join); in TEST_F()
193 graph->AddBlock(entry); in TEST_F()
203 graph->AddBlock(block); in TEST_F()
220 graph->AddBlock(loop_header); in TEST_F()
[all …]
Dbounds_check_elimination_test.cc69 graph_->AddBlock(entry); in TEST_F()
82 graph_->AddBlock(block1); in TEST_F()
90 graph_->AddBlock(block2); in TEST_F()
103 graph_->AddBlock(block3); in TEST_F()
114 graph_->AddBlock(block4); in TEST_F()
127 graph_->AddBlock(block5); in TEST_F()
140 graph_->AddBlock(exit); in TEST_F()
166 graph_->AddBlock(entry); in TEST_F()
180 graph_->AddBlock(block1); in TEST_F()
188 graph_->AddBlock(block2); in TEST_F()
[all …]
Dloop_optimization_test.cc62 graph_->AddBlock(entry_block_); in BuildGraph()
63 graph_->AddBlock(return_block_); in BuildGraph()
64 graph_->AddBlock(exit_block_); in BuildGraph()
82 graph_->AddBlock(header); in AddLoop()
83 graph_->AddBlock(body); in AddLoop()
221 graph_->AddBlock(header); in TEST_F()
222 graph_->AddBlock(body); in TEST_F()
273 graph_->AddBlock(if_block); in TEST_F()
274 graph_->AddBlock(preheader0); in TEST_F()
275 graph_->AddBlock(preheader1); in TEST_F()
Dlicm_test.cc58 graph_->AddBlock(entry_); in BuildLoop()
59 graph_->AddBlock(loop_preheader_); in BuildLoop()
60 graph_->AddBlock(loop_header_); in BuildLoop()
61 graph_->AddBlock(loop_body_); in BuildLoop()
62 graph_->AddBlock(return_); in BuildLoop()
63 graph_->AddBlock(exit_); in BuildLoop()
Dblock_builder.cc142 graph_->AddBlock(block); in ConnectBasicBlocks()
161 graph_->AddBlock(block); in ConnectBasicBlocks()
191 graph_->AddBlock(block); in ConnectBasicBlocks()
208 graph_->AddBlock(graph_->GetExitBlock()); in ConnectBasicBlocks()
329 graph_->AddBlock(new_catch_block); in InsertTryBoundaryBlocks()
418 graph_->AddBlock(loop_block); in InsertSynthesizedLoopsForOsr()
462 graph_->AddBlock(entry_block); in BuildIntrinsic()
463 graph_->AddBlock(body); in BuildIntrinsic()
464 graph_->AddBlock(exit_block); in BuildIntrinsic()
Dnodes_test.cc148 graph->AddBlock(entry); in TEST_F()
156 graph->AddBlock(first_block); in TEST_F()
163 graph->AddBlock(exit_block); in TEST_F()
188 graph->AddBlock(entry); in TEST_F()
213 graph->AddBlock(entry); in TEST_F()
231 graph->AddBlock(entry); in TEST_F()
Dcodegen_test.cc418 graph->AddBlock(entry); in TEST_F()
423 graph->AddBlock(first_block); in TEST_F()
436 graph->AddBlock(then_block); in TEST_F()
437 graph->AddBlock(else_block); in TEST_F()
438 graph->AddBlock(exit_block); in TEST_F()
480 graph->AddBlock(entry_block); in TEST_F()
484 graph->AddBlock(code_block); in TEST_F()
486 graph->AddBlock(exit_block); in TEST_F()
529 graph->AddBlock(entry_block); in TEST_F()
534 graph->AddBlock(if_block); in TEST_F()
[all …]
Dregister_allocator_test.cc462 graph->AddBlock(entry); in BuildIfElseWithPhi()
469 graph->AddBlock(block); in BuildIfElseWithPhi()
486 graph->AddBlock(then); in BuildIfElseWithPhi()
487 graph->AddBlock(else_); in BuildIfElseWithPhi()
488 graph->AddBlock(join); in BuildIfElseWithPhi()
606 graph->AddBlock(entry); in BuildFieldReturn()
613 graph->AddBlock(block); in BuildFieldReturn()
630 graph->AddBlock(exit); in BuildFieldReturn()
676 graph->AddBlock(entry); in BuildTwoSubs()
686 graph->AddBlock(block); in BuildTwoSubs()
[all …]
Dgraph_checker_test.cc41 graph->AddBlock(entry_block); in CreateSimpleCFG()
45 graph->AddBlock(exit_block); in CreateSimpleCFG()
Dgraph_test.cc39 graph->AddBlock(if_block); in CreateIfBlock()
50 graph->AddBlock(block); in CreateGotoBlock()
64 graph->AddBlock(block); in CreateReturnBlock()
72 graph->AddBlock(block); in CreateExitBlock()
Dssa_liveness_analysis_test.cc41 graph_->AddBlock(entry_); in SetUp()
49 graph->AddBlock(successor); in CreateSuccessor()
Dinduction_var_analysis_test.cc55 graph_->AddBlock(loop_preheader_[d]); in BuildForLoop()
57 graph_->AddBlock(loop_header_[d]); in BuildForLoop()
63 graph_->AddBlock(loop_body_[d]); in BuildForLoop()
82 graph_->AddBlock(entry_); in BuildLoopNest()
85 graph_->AddBlock(return_); in BuildLoopNest()
87 graph_->AddBlock(exit_); in BuildLoopNest()
130 graph_->AddBlock(cond); in BuildIf()
131 graph_->AddBlock(ifTrue); in BuildIf()
132 graph_->AddBlock(ifFalse); in BuildIf()
Dscheduler_test.cc77 graph_->AddBlock(entry); in TestBuildDependencyGraphAndSchedule()
78 graph_->AddBlock(block1); in TestBuildDependencyGraphAndSchedule()
204 graph_->AddBlock(entry); in TestDependencyGraphOnAliasingArrayAccesses()
Dconstant_folding_test.cc740 graph_->AddBlock(entry_block); in TEST_F()
743 graph_->AddBlock(block); in TEST_F()
745 graph_->AddBlock(exit_block); in TEST_F()
Dnodes.cc61 void HGraph::AddBlock(HBasicBlock* block) { in AddBlock() function in art::HGraph
395 AddBlock(new_block); in SplitEdge()
502 AddBlock(preheader); in TransformLoopToSinglePreheaderFormat()
2083 GetGraph()->AddBlock(new_block); in SplitBefore()
2100 GetGraph()->AddBlock(new_block); in CreateImmediateDominator()
2776 outer_graph->AddBlock(current); in InlineInto()
2787 outer_graph->AddBlock(to); in InlineInto()
2975 AddBlock(if_block); in TransformLoopHeaderForBCE()
2976 AddBlock(true_block); in TransformLoopHeaderForBCE()
2977 AddBlock(false_block); in TransformLoopHeaderForBCE()
[all …]
Dload_store_analysis_test.cc57 graph_->AddBlock(entry); in TEST_F()
141 graph_->AddBlock(entry); in TEST_F()
317 graph_->AddBlock(entry); in TEST_F()
529 graph_->AddBlock(entry); in TEST_F()
648 graph_->AddBlock(entry); in TEST_F()
Dnodes_vector_test.cc40 graph_->AddBlock(entry_block_); in BuildGraph()
41 graph_->AddBlock(exit_block_); in BuildGraph()
Dinduction_var_range_test.cc65 graph_->AddBlock(entry_block_); in BuildGraph()
66 graph_->AddBlock(exit_block_); in BuildGraph()
88 graph_->AddBlock(loop_preheader_); in BuildLoop()
90 graph_->AddBlock(loop_header_); in BuildLoop()
92 graph_->AddBlock(loop_body_); in BuildLoop()
94 graph_->AddBlock(return_block); in BuildLoop()
Doptimizing_unit_test.h153 graph_->AddBlock(blk); in AdjacencyListGraph()
316 graph_->AddBlock(block); in AddNewBlock()
Dcode_sinking.cc648 graph_->AddBlock(new_block); in ReturnSinking()
Dinliner.cc1164 graph_->AddBlock(then); in CreateDiamondPatternForPolymorphicInline()
1165 graph_->AddBlock(otherwise); in CreateDiamondPatternForPolymorphicInline()
1166 graph_->AddBlock(merge); in CreateDiamondPatternForPolymorphicInline()
Dsuperblock_cloner.cc1027 graph->AddBlock(copy_block); in CloneBasicBlock()
Dnodes.h463 void AddBlock(HBasicBlock* block);