Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dgvn_test.cc32 graph->AddBlock(entry); in TEST_F()
41 graph->AddBlock(block); in TEST_F()
113 graph->AddBlock(entry); in TEST_F()
122 graph->AddBlock(block); in TEST_F()
138 graph->AddBlock(then); in TEST_F()
139 graph->AddBlock(else_); in TEST_F()
140 graph->AddBlock(join); in TEST_F()
192 graph->AddBlock(entry); in TEST_F()
202 graph->AddBlock(block); in TEST_F()
219 graph->AddBlock(loop_header); in TEST_F()
[all …]
Dbounds_check_elimination_test.cc68 graph_->AddBlock(entry); in TEST_F()
81 graph_->AddBlock(block1); in TEST_F()
89 graph_->AddBlock(block2); in TEST_F()
102 graph_->AddBlock(block3); in TEST_F()
113 graph_->AddBlock(block4); in TEST_F()
126 graph_->AddBlock(block5); in TEST_F()
139 graph_->AddBlock(exit); in TEST_F()
165 graph_->AddBlock(entry); in TEST_F()
179 graph_->AddBlock(block1); in TEST_F()
187 graph_->AddBlock(block2); in TEST_F()
[all …]
Dnodes_test.cc35 graph->AddBlock(entry); in TEST_F()
43 graph->AddBlock(first_block); in TEST_F()
50 graph->AddBlock(exit_block); in TEST_F()
75 graph->AddBlock(entry); in TEST_F()
100 graph->AddBlock(entry); in TEST_F()
118 graph->AddBlock(entry); in TEST_F()
Dloop_optimization_test.cc61 graph_->AddBlock(entry_block_); in BuildGraph()
62 graph_->AddBlock(return_block_); in BuildGraph()
63 graph_->AddBlock(exit_block_); in BuildGraph()
81 graph_->AddBlock(header); in AddLoop()
82 graph_->AddBlock(body); in AddLoop()
223 graph_->AddBlock(header); in TEST_F()
224 graph_->AddBlock(body); in TEST_F()
275 graph_->AddBlock(if_block); in TEST_F()
276 graph_->AddBlock(preheader0); in TEST_F()
277 graph_->AddBlock(preheader1); in TEST_F()
Dlicm_test.cc57 graph_->AddBlock(entry_); in BuildLoop()
58 graph_->AddBlock(loop_preheader_); in BuildLoop()
59 graph_->AddBlock(loop_header_); in BuildLoop()
60 graph_->AddBlock(loop_body_); in BuildLoop()
61 graph_->AddBlock(return_); in BuildLoop()
62 graph_->AddBlock(exit_); in BuildLoop()
Dblock_builder.cc148 graph_->AddBlock(block); in ConnectBasicBlocks()
170 graph_->AddBlock(block); in ConnectBasicBlocks()
204 graph_->AddBlock(block); in ConnectBasicBlocks()
221 graph_->AddBlock(graph_->GetExitBlock()); in ConnectBasicBlocks()
342 graph_->AddBlock(new_catch_block); in InsertTryBoundaryBlocks()
431 graph_->AddBlock(loop_block); in InsertSynthesizedLoopsForOsr()
475 graph_->AddBlock(entry_block); in BuildIntrinsic()
476 graph_->AddBlock(body); in BuildIntrinsic()
477 graph_->AddBlock(exit_block); in BuildIntrinsic()
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.cc493 graph->AddBlock(entry); in BuildIfElseWithPhi()
500 graph->AddBlock(block); in BuildIfElseWithPhi()
517 graph->AddBlock(then); in BuildIfElseWithPhi()
518 graph->AddBlock(else_); in BuildIfElseWithPhi()
519 graph->AddBlock(join); in BuildIfElseWithPhi()
643 graph->AddBlock(entry); in BuildFieldReturn()
650 graph->AddBlock(block); in BuildFieldReturn()
667 graph->AddBlock(exit); in BuildFieldReturn()
719 graph->AddBlock(entry); in BuildTwoSubs()
729 graph->AddBlock(block); in BuildTwoSubs()
[all …]
Dgraph_checker_test.cc40 graph->AddBlock(entry_block); in CreateSimpleCFG()
44 graph->AddBlock(exit_block); in CreateSimpleCFG()
Dgraph_test.cc38 graph->AddBlock(if_block); in CreateIfBlock()
49 graph->AddBlock(block); in CreateGotoBlock()
63 graph->AddBlock(block); in CreateReturnBlock()
71 graph->AddBlock(block); in CreateExitBlock()
Dssa_liveness_analysis_test.cc40 graph_->AddBlock(entry_); in SetUp()
48 graph->AddBlock(successor); in CreateSuccessor()
Dload_store_analysis_test.cc34 graph_->AddBlock(entry); in TEST_F()
116 graph_->AddBlock(entry); in TEST_F()
196 graph_->AddBlock(entry); in TEST_F()
289 graph_->AddBlock(entry); in TEST_F()
500 graph_->AddBlock(entry); in TEST_F()
618 graph_->AddBlock(entry); in TEST_F()
Dinduction_var_analysis_test.cc54 graph_->AddBlock(loop_preheader_[d]); in BuildForLoop()
56 graph_->AddBlock(loop_header_[d]); in BuildForLoop()
62 graph_->AddBlock(loop_body_[d]); in BuildForLoop()
81 graph_->AddBlock(entry_); in BuildLoopNest()
84 graph_->AddBlock(return_); in BuildLoopNest()
86 graph_->AddBlock(exit_); in BuildLoopNest()
129 graph_->AddBlock(cond); in BuildIf()
130 graph_->AddBlock(ifTrue); in BuildIf()
131 graph_->AddBlock(ifFalse); in BuildIf()
Dconstant_folding_test.cc738 graph_->AddBlock(entry_block); in TEST_F()
741 graph_->AddBlock(block); in TEST_F()
743 graph_->AddBlock(exit_block); in TEST_F()
Dscheduler_test.cc76 graph_->AddBlock(entry); in TestBuildDependencyGraphAndSchedule()
77 graph_->AddBlock(block1); in TestBuildDependencyGraphAndSchedule()
203 graph_->AddBlock(entry); in TestDependencyGraphOnAliasingArrayAccesses()
Dnodes.cc49 void HGraph::AddBlock(HBasicBlock* block) { in AddBlock() function in art::HGraph
351 AddBlock(new_block); in SplitEdge()
449 AddBlock(preheader); in TransformLoopToSinglePreheaderFormat()
1863 GetGraph()->AddBlock(new_block); in SplitBefore()
1880 GetGraph()->AddBlock(new_block); in CreateImmediateDominator()
2530 outer_graph->AddBlock(current); in InlineInto()
2538 outer_graph->AddBlock(to); in InlineInto()
2678 AddBlock(if_block); in TransformLoopHeaderForBCE()
2679 AddBlock(true_block); in TransformLoopHeaderForBCE()
2680 AddBlock(false_block); in TransformLoopHeaderForBCE()
[all …]
Dinduction_var_range_test.cc64 graph_->AddBlock(entry_block_); in BuildGraph()
65 graph_->AddBlock(exit_block_); in BuildGraph()
87 graph_->AddBlock(loop_preheader_); in BuildLoop()
89 graph_->AddBlock(loop_header_); in BuildLoop()
91 graph_->AddBlock(loop_body_); in BuildLoop()
93 graph_->AddBlock(return_block); in BuildLoop()
Doptimizing_unit_test.h209 graph_->AddBlock(block); in AddNewBlock()
Dnodes_vector_test.cc39 graph_->AddBlock(entry_block_); in BuildGraph()
40 graph_->AddBlock(exit_block_); in BuildGraph()
Dinliner.cc1144 graph_->AddBlock(then); in CreateDiamondPatternForPolymorphicInline()
1145 graph_->AddBlock(otherwise); in CreateDiamondPatternForPolymorphicInline()
1146 graph_->AddBlock(merge); in CreateDiamondPatternForPolymorphicInline()
Dsuperblock_cloner.cc1020 graph->AddBlock(copy_block); in CloneBasicBlock()
Dnodes.h440 void AddBlock(HBasicBlock* block);