Home
last modified time | relevance | path

Searched refs:BuildDominatorTree (Results 1 – 21 of 21) sorted by relevance

/art/compiler/optimizing/
Dsuperblock_cloner_test.cc123 graph_->BuildDominatorTree(); in TEST_F()
155 graph_->BuildDominatorTree(); in TEST_F()
236 graph_->BuildDominatorTree(); in TEST_F()
298 graph_->BuildDominatorTree(); in TEST_F()
335 graph_->BuildDominatorTree(); in TEST_F()
372 graph_->BuildDominatorTree(); in TEST_F()
442 graph_->BuildDominatorTree(); in TEST_F()
487 graph_->BuildDominatorTree(); in TEST_F()
538 graph_->BuildDominatorTree(); in TEST_F()
600 graph_->BuildDominatorTree(); in TEST_F()
[all …]
Dbuilder.cc145 GraphAnalysisResult result = graph_->BuildDominatorTree(); in BuildGraph()
205 GraphAnalysisResult bdt_result = graph_->BuildDominatorTree(); in BuildIntrinsicGraph()
Dssa_liveness_analysis_test.cc69 graph_->BuildDominatorTree(); in TEST_F()
120 graph_->BuildDominatorTree(); in TEST_F()
193 graph_->BuildDominatorTree(); in TEST_F()
Dgraph_test.cc159 graph->BuildDominatorTree(); in TEST_F()
191 graph->BuildDominatorTree(); in TEST_F()
227 graph->BuildDominatorTree(); in TEST_F()
262 graph->BuildDominatorTree(); in TEST_F()
Dselect_generator_test.cc70 graph_->BuildDominatorTree(); in CheckGraphAndTrySelectGenerator()
Dgvn_test.cc100 graph->BuildDominatorTree(); in TEST_F()
178 graph->BuildDominatorTree(); in TEST_F()
280 graph->BuildDominatorTree(); in TEST_F()
354 graph->BuildDominatorTree(); in TEST_F()
Dloop_optimization_test.cc95 graph_->BuildDominatorTree(); in PerformAnalysis()
248 graph_->BuildDominatorTree(); in TEST_F()
319 graph_->BuildDominatorTree(); in TEST_F()
Dgraph_checker_test.cc47 graph->BuildDominatorTree(); in CreateSimpleCFG()
Ddead_code_elimination.cc278 graph_->BuildDominatorTree(); in SimplifyAlwaysThrows()
414 graph_->BuildDominatorTree(); in SimplifyIfs()
480 graph_->BuildDominatorTree(); in RemoveDeadBlocks()
Dlicm_test.cc92 graph_->BuildDominatorTree(); in PerformLICM()
Dcodegen_test.cc449 graph->BuildDominatorTree(); in TEST_F()
500 graph->BuildDominatorTree(); in TEST_F()
569 graph->BuildDominatorTree(); in TEST_F()
686 graph->BuildDominatorTree(); in TestComparison()
Dregister_allocator_test.cc554 graph->BuildDominatorTree(); in BuildIfElseWithPhi()
671 graph->BuildDominatorTree(); in BuildFieldReturn()
739 graph->BuildDominatorTree(); in BuildTwoSubs()
810 graph->BuildDominatorTree(); in BuildDiv()
Dload_store_analysis_test.cc198 graph_->BuildDominatorTree(); in TEST_F()
291 graph_->BuildDominatorTree(); in TEST_F()
502 graph_->BuildDominatorTree(); in TEST_F()
Dconstant_folding_test.cc777 graph_->BuildDominatorTree(); in TEST_F()
Dscheduler_test.cc205 graph_->BuildDominatorTree(); in TestDependencyGraphOnAliasingArrayAccesses()
Dinduction_var_analysis_test.cc197 graph_->BuildDominatorTree(); in PerformInductionVarAnalysis()
240 graph_->BuildDominatorTree(); in TEST_F()
Dload_store_elimination_test.cc32 graph_->BuildDominatorTree(); in PerformLSE()
Dnodes.cc181 GraphAnalysisResult HGraph::BuildDominatorTree() { in BuildDominatorTree() function in art::HGraph
2597 outer_graph->BuildDominatorTree(); in InlineInto()
Dbounds_check_elimination_test.cc44 graph_->BuildDominatorTree(); in RunBCE()
Dinduction_var_range_test.cc123 graph_->BuildDominatorTree(); in PerformInductionVarAnalysis()
Dnodes.h446 GraphAnalysisResult BuildDominatorTree();