Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dsuperblock_cloner_test.cc127 graph_->BuildDominatorTree(); in TEST_F()
159 graph_->BuildDominatorTree(); in TEST_F()
240 graph_->BuildDominatorTree(); in TEST_F()
325 graph_->BuildDominatorTree(); in TEST_F()
384 graph_->BuildDominatorTree(); in TEST_F()
444 graph_->BuildDominatorTree(); in TEST_F()
489 graph_->BuildDominatorTree(); in TEST_F()
540 graph_->BuildDominatorTree(); in TEST_F()
603 graph_->BuildDominatorTree(); in TEST_F()
634 graph_->BuildDominatorTree(); in TEST_F()
[all …]
Dssa_liveness_analysis_test.cc67 graph_->BuildDominatorTree(); in TEST_F()
118 graph_->BuildDominatorTree(); in TEST_F()
191 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()
Dbuilder.cc151 GraphAnalysisResult result = graph_->BuildDominatorTree(); in BuildGraph()
213 GraphAnalysisResult bdt_result = graph_->BuildDominatorTree(); in BuildIntrinsicGraph()
Dloop_optimization_test.cc79 graph_->BuildDominatorTree(); in PerformAnalysis()
229 graph_->BuildDominatorTree(); in TEST_F()
300 graph_->BuildDominatorTree(); in TEST_F()
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()
Dselect_generator_test.cc74 graph_->BuildDominatorTree(); in CheckGraphAndTrySelectGenerator()
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.cc447 graph->BuildDominatorTree(); in TEST_F()
497 graph->BuildDominatorTree(); in TEST_F()
565 graph->BuildDominatorTree(); in TEST_F()
681 graph->BuildDominatorTree(); in TestComparison()
Dregister_allocator_test.cc552 graph->BuildDominatorTree(); in BuildIfElseWithPhi()
669 graph->BuildDominatorTree(); in BuildFieldReturn()
737 graph->BuildDominatorTree(); in BuildTwoSubs()
808 graph->BuildDominatorTree(); in BuildDiv()
Dload_store_analysis_test.cc196 graph_->BuildDominatorTree(); in TEST_F()
288 graph_->BuildDominatorTree(); in TEST_F()
498 graph_->BuildDominatorTree(); in TEST_F()
Dscheduler_test.cc204 graph_->BuildDominatorTree(); in TestDependencyGraphOnAliasingArrayAccesses()
Dconstant_folding_test.cc777 graph_->BuildDominatorTree(); in TEST_F()
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.cc182 GraphAnalysisResult HGraph::BuildDominatorTree() { in BuildDominatorTree() function in art::HGraph
2597 outer_graph->BuildDominatorTree(); in InlineInto()
Dinduction_var_range_test.cc123 graph_->BuildDominatorTree(); in PerformInductionVarAnalysis()
Dbounds_check_elimination_test.cc44 graph_->BuildDominatorTree(); in RunBCE()