Home
last modified time | relevance | path

Searched refs:SetEntryBlock (Results 1 – 19 of 19) sorted by relevance

/art/compiler/optimizing/
Dnodes_test.cc148 graph->SetEntryBlock(entry); in TEST_F()
188 graph->SetEntryBlock(entry); in TEST_F()
213 graph->SetEntryBlock(entry); in TEST_F()
231 graph->SetEntryBlock(entry); in TEST_F()
Dgvn_test.cc33 graph->SetEntryBlock(entry); in TEST_F()
114 graph->SetEntryBlock(entry); in TEST_F()
193 graph->SetEntryBlock(entry); in TEST_F()
314 graph->SetEntryBlock(entry); in TEST_F()
Dbounds_check_elimination_test.cc69 graph_->SetEntryBlock(entry); in TEST_F()
166 graph_->SetEntryBlock(entry); in TEST_F()
231 graph_->SetEntryBlock(entry); in TEST_F()
296 graph_->SetEntryBlock(entry); in TEST_F()
365 graph->SetEntryBlock(entry); in BuildSSAGraph1()
480 graph->SetEntryBlock(entry); in BuildSSAGraph2()
590 graph->SetEntryBlock(entry); in BuildSSAGraph3()
692 graph->SetEntryBlock(entry); in BuildSSAGraph4()
795 graph_->SetEntryBlock(entry); in TEST_F()
966 graph_->SetEntryBlock(entry); in TEST_F()
Dgraph_checker_test.cc41 graph->SetEntryBlock(entry_block); in CreateSimpleCFG()
Dcodegen_test.cc419 graph->SetEntryBlock(entry); in TEST_F()
481 graph->SetEntryBlock(entry_block); in TEST_F()
530 graph->SetEntryBlock(entry_block); in TEST_F()
543 graph->SetEntryBlock(entry_block); in TEST_F()
612 graph->SetEntryBlock(entry_block); in TestComparison()
Dregister_allocator_test.cc494 graph->SetEntryBlock(entry); in BuildIfElseWithPhi()
644 graph->SetEntryBlock(entry); in BuildFieldReturn()
720 graph->SetEntryBlock(entry); in BuildTwoSubs()
792 graph->SetEntryBlock(entry); in BuildDiv()
845 graph->SetEntryBlock(entry); in TEST_F()
Dblock_builder.cc447 graph_->SetEntryBlock(new (allocator_) HBasicBlock(graph_, kNoDexPc)); in Build()
478 graph_->SetEntryBlock(entry_block); in BuildIntrinsic()
Dlicm_test.cc64 graph_->SetEntryBlock(entry_); in BuildLoop()
Dscheduler_test.cc78 graph_->SetEntryBlock(entry); in TestBuildDependencyGraphAndSchedule()
204 graph_->SetEntryBlock(entry); in TestDependencyGraphOnAliasingArrayAccesses()
Dssa_liveness_analysis_test.cc41 graph_->SetEntryBlock(entry_); in SetUp()
Dload_store_analysis_test.cc67 graph_->SetEntryBlock(entry); in TEST_F()
150 graph_->SetEntryBlock(entry); in TEST_F()
231 graph_->SetEntryBlock(entry); in TEST_F()
325 graph_->SetEntryBlock(entry); in TEST_F()
537 graph_->SetEntryBlock(entry); in TEST_F()
656 graph_->SetEntryBlock(entry); in TEST_F()
Dloop_optimization_test.cc64 graph_->SetEntryBlock(entry_block_); in BuildGraph()
Dgraph_test.cc57 graph->SetEntryBlock(block); in CreateEntryBlock()
Doptimizing_unit_test.h157 graph_->SetEntryBlock(entry); in AdjacencyListGraph()
299 graph_->SetEntryBlock(entry_block_);
Dconstant_folding_test.cc739 graph_->SetEntryBlock(entry_block); in TEST_F()
Dnodes_vector_test.cc41 graph_->SetEntryBlock(entry_block_); in BuildGraph()
Dinduction_var_analysis_test.cc90 graph_->SetEntryBlock(entry_); in BuildLoopNest()
Dinduction_var_range_test.cc66 graph_->SetEntryBlock(entry_block_); in BuildGraph()
Dnodes.h452 void SetEntryBlock(HBasicBlock* block) { entry_block_ = block; } in SetEntryBlock() function