| /art/compiler/optimizing/ |
| D | find_loops_test.cc | 31 HGraph* graph = CreateGraph(allocator); in TestCode() local
48 HGraph* graph = TestCode(data, &allocator); in TEST() local
61 HGraph* graph = TestCode(data, &allocator); in TEST() local
77 HGraph* graph = TestCode(data, &allocator); in TEST() local
94 HGraph* graph = TestCode(data, &allocator); in TEST() local
109 HGraph* graph = TestCode(data, &allocator); in TEST() local
115 static void TestBlock(HGraph* graph, in TestBlock()
155 HGraph* graph = TestCode(data, &allocator); in TEST() local
183 HGraph* graph = TestCode(data, &allocator); in TEST() local
208 HGraph* graph = TestCode(data, &allocator); in TEST() local
[all …]
|
| D | graph_test.cc | 28 static HBasicBlock* createIfBlock(HGraph* graph, ArenaAllocator* allocator) { in createIfBlock()
39 static HBasicBlock* createGotoBlock(HGraph* graph, ArenaAllocator* allocator) { in createGotoBlock()
47 static HBasicBlock* createEntryBlock(HGraph* graph, ArenaAllocator* allocator) { in createEntryBlock()
53 static HBasicBlock* createReturnBlock(HGraph* graph, ArenaAllocator* allocator) { in createReturnBlock()
61 static HBasicBlock* createExitBlock(HGraph* graph, ArenaAllocator* allocator) { in createExitBlock()
76 HGraph* graph = CreateGraph(&allocator); in TEST() local
111 HGraph* graph = CreateGraph(&allocator); in TEST() local
146 HGraph* graph = CreateGraph(&allocator); in TEST() local
181 HGraph* graph = CreateGraph(&allocator); in TEST() local
216 HGraph* graph = CreateGraph(&allocator); in TEST() local
[all …]
|
| D | register_allocator_test.cc | 41 HGraph* graph = CreateGraph(&allocator); in Check() local
63 HGraph* graph = CreateGraph(&allocator); in TEST() local
258 HGraph* graph = CreateGraph(allocator); in BuildSSAGraph() local
305 HGraph* graph = BuildSSAGraph(data, &allocator); in TEST() local
339 HGraph* graph = BuildSSAGraph(data, &allocator); in TEST() local
393 HGraph* graph = BuildSSAGraph(data, &allocator); in TEST() local
417 HGraph* graph = BuildSSAGraph(data, &allocator); in TEST() local
466 HGraph* graph = CreateGraph(allocator); in BuildIfElseWithPhi() local
519 HGraph* graph = BuildIfElseWithPhi(&allocator, &phi, &input1, &input2); in TEST() local
536 HGraph* graph = BuildIfElseWithPhi(&allocator, &phi, &input1, &input2); in TEST() local
[all …]
|
| D | live_ranges_test.cc | 35 HGraph* graph = CreateGraph(allocator); in BuildGraph() local
67 HGraph* graph = BuildGraph(data, &allocator); in TEST() local
116 HGraph* graph = BuildGraph(data, &allocator); in TEST() local
167 HGraph* graph = BuildGraph(data, &allocator); in TEST() local
245 HGraph* graph = BuildGraph(data, &allocator); in TEST() local
326 HGraph* graph = BuildGraph(data, &allocator); in TEST() local
404 HGraph* graph = BuildGraph(data, &allocator); in TEST() local
|
| D | graph_checker_test.cc | 33 HGraph* graph = CreateGraph(allocator); in CreateSimpleCFG() local
50 HGraph* graph = CreateCFG(&allocator, data); in TestCode() local
61 HGraph* graph = CreateCFG(&allocator, data); in TestCodeSSA() local
114 HGraph* graph = CreateSimpleCFG(&allocator); in TEST() local
132 HGraph* graph = CreateSimpleCFG(&allocator); in TEST() local
|
| D | ssa_phi_elimination.h | 31 explicit SsaDeadPhiElimination(HGraph* graph) in SsaDeadPhiElimination()
58 explicit SsaRedundantPhiElimination(HGraph* graph) in SsaRedundantPhiElimination()
|
| D | constant_folding_test.cc | 40 HGraph* graph = CreateCFG(&allocator, data, return_type); in TestCode() local
115 auto check_after_cf = [](HGraph* graph) { in TEST()
176 auto check_after_cf = [](HGraph* graph) { in TEST()
256 auto check_after_cf = [](HGraph* graph) { in TEST()
328 auto check_after_cf = [](HGraph* graph) { in TEST()
392 auto check_after_cf = [](HGraph* graph) { in TEST()
457 auto check_after_cf = [](HGraph* graph) { in TEST()
559 auto check_after_cf = [](HGraph* graph) { in TEST()
649 auto check_after_cf = [](HGraph* graph) { in TEST()
|
| D | nodes_test.cc | 33 HGraph* graph = CreateGraph(&allocator); in TEST() local
75 HGraph* graph = CreateGraph(&allocator); in TEST() local
101 HGraph* graph = CreateGraph(&allocator); in TEST() local
121 HGraph* graph = CreateGraph(&allocator); in TEST() local
|
| D | gvn_test.cc | 32 HGraph* graph = CreateGraph(&allocator); in TEST() local
81 HGraph* graph = CreateGraph(&allocator); in TEST() local
136 HGraph* graph = CreateGraph(&allocator); in TEST() local
223 HGraph* graph = CreateGraph(&allocator); in TEST() local
|
| D | bounds_check_elimination_test.cc | 30 static void RunSimplifierAndGvn(HGraph* graph) { in RunSimplifierAndGvn()
45 HGraph* graph = CreateGraph(&allocator); in TEST() local
150 HGraph* graph = CreateGraph(&allocator); in TEST() local
222 HGraph* graph = CreateGraph(&allocator); in TEST() local
294 HGraph* graph = CreateGraph(&allocator); in TEST() local
367 HGraph* graph = CreateGraph(allocator); in BuildSSAGraph1() local
441 HGraph* graph = BuildSSAGraph1(&allocator, &bounds_check, 0, 1); in TEST() local
502 HGraph* graph = CreateGraph(allocator); in BuildSSAGraph2() local
578 HGraph* graph = BuildSSAGraph2(&allocator, &bounds_check, 0); in TEST() local
630 HGraph* graph = CreateGraph(allocator); in BuildSSAGraph3() local
[all …]
|
| D | graph_checker.h | 31 : HGraphDelegateVisitor(graph), in HGraphDelegateVisitor() argument
99 SSAChecker(ArenaAllocator* allocator, HGraph* graph) in SSAChecker()
|
| D | prepare_for_register_allocation.h | 31 explicit PrepareForRegisterAllocation(HGraph* graph) : HGraphDelegateVisitor(graph) {} in PrepareForRegisterAllocation()
|
| D | pretty_printer.h | 27 explicit HPrettyPrinter(HGraph* graph) : HGraphVisitor(graph) { } in HPrettyPrinter()
106 explicit StringPrettyPrinter(HGraph* graph) in StringPrettyPrinter()
|
| D | bounds_check_elimination.h | 26 explicit BoundsCheckElimination(HGraph* graph) in BoundsCheckElimination()
|
| D | boolean_simplifier.h | 65 explicit HBooleanSimplifier(HGraph* graph) in HBooleanSimplifier()
|
| D | codegen_test.cc | 60 TestCodeGeneratorARM(HGraph* graph, in TestCodeGeneratorARM()
80 TestCodeGeneratorX86(HGraph* graph, in TestCodeGeneratorX86()
142 static void RunCodeBaseline(HGraph* graph, bool has_result, Expected expected) { in RunCodeBaseline()
191 HGraph* graph, in RunCodeOptimized()
212 static void RunCodeOptimized(HGraph* graph, in RunCodeOptimized()
248 HGraph* graph = CreateGraph(&arena); in TestCode() local
261 HGraph* graph = CreateGraph(&arena); in TestCodeLong() local
527 HGraph* graph = CreateGraph(&allocator); in TEST() local
646 HGraph* graph = CreateGraph(&allocator); in TEST() local
692 HGraph* graph = CreateGraph(&allocator); in TEST() local
|
| D | constant_folding.h | 36 : HOptimization(graph, true, name) {} in HOptimization() argument
|
| D | gvn.h | 29 GVNOptimization(HGraph* graph, const SideEffectsAnalysis& side_effects) in GVNOptimization()
|
| D | licm.h | 29 LICM(HGraph* graph, const SideEffectsAnalysis& side_effects) in LICM()
|
| D | primitive_type_propagation.h | 27 explicit PrimitiveTypePropagation(HGraph* graph) in PrimitiveTypePropagation()
|
| D | instruction_simplifier.h | 34 : HOptimization(graph, true, name, stats) {} in HOptimization() argument
|
| D | dead_code_elimination.h | 35 : HOptimization(graph, true, name, stats) {} in HOptimization() argument
|
| D | optimization.h | 34 : graph_(graph), in graph_() argument
|
| D | optimizing_unit_test.h | 62 void RemoveSuspendChecks(HGraph* graph) { in RemoveSuspendChecks()
85 HGraph* graph = CreateGraph(allocator); variable
|
| D | side_effects_analysis.h | 27 explicit SideEffectsAnalysis(HGraph* graph) in SideEffectsAnalysis()
|