| /aosp12/art/compiler/optimizing/ |
| H A D | superblock_cloner_test.cc | 123 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 …]
|
| H A D | graph_test.cc | 159 graph->BuildDominatorTree(); in TEST_F()
191 graph->BuildDominatorTree(); in TEST_F()
227 graph->BuildDominatorTree(); in TEST_F()
262 graph->BuildDominatorTree(); in TEST_F()
|
| H A D | instruction_simplifier_test.cc | 198 graph_->BuildDominatorTree(); in TEST_F()
290 graph_->BuildDominatorTree(); in TEST_F()
374 graph_->BuildDominatorTree(); in TEST_F()
468 graph_->BuildDominatorTree(); in TEST_P()
536 graph_->BuildDominatorTree(); in TEST_P()
|
| H A D | ssa_liveness_analysis_test.cc | 69 graph_->BuildDominatorTree(); in TEST_F()
120 graph_->BuildDominatorTree(); in TEST_F()
193 graph_->BuildDominatorTree(); in TEST_F()
|
| H A D | builder.cc | 141 GraphAnalysisResult result = graph_->BuildDominatorTree(); in BuildGraph()
200 GraphAnalysisResult bdt_result = graph_->BuildDominatorTree(); in BuildIntrinsicGraph()
|
| H A D | gvn_test.cc | 100 graph->BuildDominatorTree(); in TEST_F()
178 graph->BuildDominatorTree(); in TEST_F()
280 graph->BuildDominatorTree(); in TEST_F()
354 graph->BuildDominatorTree(); in TEST_F()
|
| H A D | loop_optimization_test.cc | 95 graph_->BuildDominatorTree(); in PerformAnalysis()
248 graph_->BuildDominatorTree(); in TEST_F()
319 graph_->BuildDominatorTree(); in TEST_F()
|
| H A D | dead_code_elimination.cc | 278 graph_->BuildDominatorTree(); in SimplifyAlwaysThrows()
414 graph_->BuildDominatorTree(); in SimplifyIfs()
480 graph_->BuildDominatorTree(); in RemoveDeadBlocks()
|
| H A D | nodes_test.cc | 57 graph_->BuildDominatorTree(); in TEST_F()
113 graph_->BuildDominatorTree(); in TEST_F()
|
| H A D | select_generator_test.cc | 70 graph_->BuildDominatorTree(); in CheckGraphAndTrySelectGenerator()
|
| H A D | graph_checker_test.cc | 47 graph->BuildDominatorTree(); in CreateSimpleCFG()
|
| H A D | codegen_test.cc | 449 graph->BuildDominatorTree(); in TEST_F()
500 graph->BuildDominatorTree(); in TEST_F()
569 graph->BuildDominatorTree(); in TEST_F()
686 graph->BuildDominatorTree(); in TestComparison()
|
| H A D | register_allocator_test.cc | 554 graph->BuildDominatorTree(); in BuildIfElseWithPhi()
671 graph->BuildDominatorTree(); in BuildFieldReturn()
739 graph->BuildDominatorTree(); in BuildTwoSubs()
810 graph->BuildDominatorTree(); in BuildDiv()
|
| H A D | licm_test.cc | 92 graph_->BuildDominatorTree(); in PerformLICM()
|
| H A D | load_store_analysis_test.cc | 232 graph_->BuildDominatorTree(); in TEST_F()
326 graph_->BuildDominatorTree(); in TEST_F()
538 graph_->BuildDominatorTree(); in TEST_F()
1438 graph_->BuildDominatorTree(); in TEST_F()
1539 graph_->BuildDominatorTree(); in TEST_F()
2050 graph_->BuildDominatorTree(); in TEST_F()
|
| H A D | constant_folding_test.cc | 777 graph_->BuildDominatorTree(); in TEST_F()
|
| H A D | scheduler_test.cc | 205 graph_->BuildDominatorTree(); in TestDependencyGraphOnAliasingArrayAccesses()
|
| H A D | induction_var_analysis_test.cc | 197 graph_->BuildDominatorTree(); in PerformInductionVarAnalysis()
240 graph_->BuildDominatorTree(); in TEST_F()
|
| H A D | bounds_check_elimination_test.cc | 44 graph_->BuildDominatorTree(); in RunBCE()
|
| H A D | induction_var_range_test.cc | 123 graph_->BuildDominatorTree(); in PerformInductionVarAnalysis()
|
| H A D | nodes.cc | 190 GraphAnalysisResult HGraph::BuildDominatorTree() { in BuildDominatorTree() function in art::HGraph
2872 outer_graph->BuildDominatorTree(); in InlineInto()
|
| H A D | load_store_elimination.cc | 2931 GetGraph()->BuildDominatorTree(); in ~PartialLoadStoreEliminationHelper()
|
| H A D | nodes.h | 463 GraphAnalysisResult BuildDominatorTree();
|
| H A D | load_store_elimination_test.cc | 62 graph_->BuildDominatorTree(); in PerformLSE()
|