Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dgvn_test.cc34 graph->AddBlock(entry); in TEST()
40 graph->AddBlock(block); in TEST()
83 graph->AddBlock(entry); in TEST()
89 graph->AddBlock(block); in TEST()
99 graph->AddBlock(then); in TEST()
100 graph->AddBlock(else_); in TEST()
101 graph->AddBlock(join); in TEST()
138 graph->AddBlock(entry); in TEST()
145 graph->AddBlock(block); in TEST()
156 graph->AddBlock(loop_header); in TEST()
[all …]
Dbounds_check_elimination_test.cc49 graph->AddBlock(entry); in TEST()
62 graph->AddBlock(block1); in TEST()
70 graph->AddBlock(block2); in TEST()
83 graph->AddBlock(block3); in TEST()
94 graph->AddBlock(block4); in TEST()
107 graph->AddBlock(block5); in TEST()
120 graph->AddBlock(exit); in TEST()
154 graph->AddBlock(entry); in TEST()
168 graph->AddBlock(block1); in TEST()
176 graph->AddBlock(block2); in TEST()
[all …]
Dnodes_test.cc35 graph->AddBlock(entry); in TEST()
42 graph->AddBlock(first_block); in TEST()
49 graph->AddBlock(exit_block); in TEST()
77 graph->AddBlock(entry); in TEST()
103 graph->AddBlock(entry); in TEST()
123 graph->AddBlock(entry); in TEST()
Dcodegen_test.cc529 graph->AddBlock(entry); in TEST()
534 graph->AddBlock(first_block); in TEST()
546 graph->AddBlock(then); in TEST()
547 graph->AddBlock(else_); in TEST()
548 graph->AddBlock(exit); in TEST()
649 graph->AddBlock(entry_block); in TEST()
653 graph->AddBlock(code_block); in TEST()
655 graph->AddBlock(exit_block); in TEST()
695 graph->AddBlock(entry_block); in TEST()
700 graph->AddBlock(if_block); in TEST()
[all …]
Dregister_allocator_test.cc468 graph->AddBlock(entry); in BuildIfElseWithPhi()
474 graph->AddBlock(block); in BuildIfElseWithPhi()
484 graph->AddBlock(then); in BuildIfElseWithPhi()
485 graph->AddBlock(else_); in BuildIfElseWithPhi()
486 graph->AddBlock(join); in BuildIfElseWithPhi()
598 graph->AddBlock(entry); in BuildFieldReturn()
604 graph->AddBlock(block); in BuildFieldReturn()
614 graph->AddBlock(exit); in BuildFieldReturn()
666 graph->AddBlock(entry); in BuildTwoSubs()
675 graph->AddBlock(block); in BuildTwoSubs()
[all …]
Dgraph_checker_test.cc36 graph->AddBlock(entry_block); in CreateSimpleCFG()
40 graph->AddBlock(exit_block); in CreateSimpleCFG()
Dgraph_test.cc30 graph->AddBlock(if_block); in createIfBlock()
41 graph->AddBlock(block); in createGotoBlock()
55 graph->AddBlock(block); in createReturnBlock()
63 graph->AddBlock(block); in createExitBlock()
Dnodes.cc27 void HGraph::AddBlock(HBasicBlock* block) { in AddBlock() function in art::HGraph
195 AddBlock(new_block); in SplitCriticalEdge()
219 AddBlock(pre_header); in SimplifyLoop()
1324 outer_graph->AddBlock(current); in InlineInto()
1337 outer_graph->AddBlock(to); in InlineInto()
1417 AddBlock(if_block); in TransformLoopHeaderForBCE()
1418 AddBlock(dummy_block); in TransformLoopHeaderForBCE()
1419 AddBlock(deopt_block); in TransformLoopHeaderForBCE()
1420 AddBlock(new_pre_header); in TransformLoopHeaderForBCE()
Dbuilder.cc271 graph_->AddBlock(entry_block_); in BuildGraph()
329 graph_->AddBlock(exit_block_); in BuildGraph()
351 graph_->AddBlock(block); in MaybeUpdateCurrentBlock()
1288 graph_->AddBlock(next_case_target); in BuildSwitchCaseHelper()
Dnodes.h158 void AddBlock(HBasicBlock* block);