Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dsuperblock_cloner_test.cc124 graph_->BuildDominatorTree(); in TEST_F()
156 graph_->BuildDominatorTree(); in TEST_F()
237 graph_->BuildDominatorTree(); in TEST_F()
299 graph_->BuildDominatorTree(); in TEST_F()
336 graph_->BuildDominatorTree(); in TEST_F()
373 graph_->BuildDominatorTree(); in TEST_F()
443 graph_->BuildDominatorTree(); in TEST_F()
488 graph_->BuildDominatorTree(); in TEST_F()
539 graph_->BuildDominatorTree(); in TEST_F()
601 graph_->BuildDominatorTree(); in TEST_F()
[all …]
Dbuilder.cc130 GraphAnalysisResult result = graph_->BuildDominatorTree(); in BuildGraph()
188 GraphAnalysisResult bdt_result = graph_->BuildDominatorTree(); in BuildIntrinsicGraph()
Dgraph_test.cc160 graph->BuildDominatorTree(); in TEST_F()
192 graph->BuildDominatorTree(); in TEST_F()
228 graph->BuildDominatorTree(); in TEST_F()
263 graph->BuildDominatorTree(); in TEST_F()
Dssa_liveness_analysis_test.cc70 graph_->BuildDominatorTree(); in TEST_F()
121 graph_->BuildDominatorTree(); in TEST_F()
194 graph_->BuildDominatorTree(); in TEST_F()
Dgvn_test.cc101 graph->BuildDominatorTree(); in TEST_F()
179 graph->BuildDominatorTree(); in TEST_F()
281 graph->BuildDominatorTree(); in TEST_F()
355 graph->BuildDominatorTree(); in TEST_F()
Dloop_optimization_test.cc96 graph_->BuildDominatorTree(); in PerformAnalysis()
246 graph_->BuildDominatorTree(); in TEST_F()
317 graph_->BuildDominatorTree(); in TEST_F()
Dselect_generator_test.cc71 graph_->BuildDominatorTree(); in CheckGraphAndTrySelectGenerator()
Dnodes_test.cc58 graph_->BuildDominatorTree(); in TEST_F()
114 graph_->BuildDominatorTree(); in TEST_F()
Dgraph_checker_test.cc48 graph->BuildDominatorTree(); in CreateSimpleCFG()
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.cc523 graph->BuildDominatorTree(); in BuildIfElseWithPhi()
634 graph->BuildDominatorTree(); in BuildFieldReturn()
696 graph->BuildDominatorTree(); in BuildTwoSubs()
761 graph->BuildDominatorTree(); in BuildDiv()
Dlicm_test.cc93 graph_->BuildDominatorTree(); in PerformLICM()
Dinstruction_simplifier_test.cc60 graph_->BuildDominatorTree(); in PerformSimplification()
Dload_store_analysis_test.cc319 graph_->BuildDominatorTree(); in TEST_F()
531 graph_->BuildDominatorTree(); in TEST_F()
1206 graph_->BuildDominatorTree(); in TEST_F()
Dscheduler_test.cc206 graph_->BuildDominatorTree(); in TestDependencyGraphOnAliasingArrayAccesses()
Dconstant_folding_test.cc779 graph_->BuildDominatorTree(); in TEST_F()
Dinduction_var_analysis_test.cc198 graph_->BuildDominatorTree(); in PerformInductionVarAnalysis()
241 graph_->BuildDominatorTree(); in TEST_F()
Dbounds_check_elimination_test.cc45 graph_->BuildDominatorTree(); in RunBCE()
Dnodes.cc216 GraphAnalysisResult HGraph::BuildDominatorTree() { in BuildDominatorTree() function in art::HGraph
263 return BuildDominatorTree(); in RecomputeDominatorTree()
Dinduction_var_range_test.cc124 graph_->BuildDominatorTree(); in PerformInductionVarAnalysis()
Dload_store_elimination_test.cc72 graph_->BuildDominatorTree(); in PerformLSE()
Dnodes.h469 GraphAnalysisResult BuildDominatorTree();