Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dbounds_check_elimination_test.cc132 graph->BuildDominatorTree(); in TEST()
206 graph->BuildDominatorTree(); in TEST()
280 graph->BuildDominatorTree(); in TEST()
352 graph->BuildDominatorTree(); in TEST()
442 graph->BuildDominatorTree(); in TEST()
451 graph->BuildDominatorTree(); in TEST()
460 graph->BuildDominatorTree(); in TEST()
469 graph->BuildDominatorTree(); in TEST()
479 graph->BuildDominatorTree(); in TEST()
488 graph->BuildDominatorTree(); in TEST()
[all …]
Dgraph_test.cc160 graph->BuildDominatorTree(); in TEST()
195 graph->BuildDominatorTree(); in TEST()
234 graph->BuildDominatorTree(); in TEST()
272 graph->BuildDominatorTree(); in TEST()
Dgraph_checker_test.cc64 graph->BuildDominatorTree(); in TestCodeSSA()
Ddominator_test.cc35 graph->BuildDominatorTree(); in TestCode()
Dregister_allocator_test.cc507 graph->BuildDominatorTree(); in BuildIfElseWithPhi()
618 graph->BuildDominatorTree(); in BuildFieldReturn()
685 graph->BuildDominatorTree(); in BuildTwoSubs()
752 graph->BuildDominatorTree(); in BuildDiv()
Dssa_test.cc87 graph->BuildDominatorTree(); in TestCode()
Dcodegen_test.cc197 graph->BuildDominatorTree(); in RunCodeOptimized()
559 graph->BuildDominatorTree(); in TEST()
Dfind_loops_test.cc35 graph->BuildDominatorTree(); in TestCode()
Dnodes.cc99 void HGraph::BuildDominatorTree() { in BuildDominatorTree() function in art::HGraph
Dnodes.h163 BuildDominatorTree(); in TryBuildingSsa()
176 void BuildDominatorTree();