| /art/compiler/optimizing/ |
| D | find_loops_test.cc | 40 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
53 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
69 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
86 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
101 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
107 static void TestBlock(HGraph* graph, in TestBlock()
147 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
175 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
200 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
226 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() 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 = CreateCFG(&allocator, data); in Check() local
59 HGraph* graph = CreateGraph(&allocator); in TEST_F() local
292 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
326 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
380 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
404 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
460 HGraph* graph = CreateGraph(allocator); in BuildIfElseWithPhi() local
536 HGraph* graph = BuildIfElseWithPhi(&allocator, &phi, &input1, &input2); in TEST_F() local
553 HGraph* graph = BuildIfElseWithPhi(&allocator, &phi, &input1, &input2); in TEST_F() local
572 HGraph* graph = BuildIfElseWithPhi(&allocator, &phi, &input1, &input2); in TEST_F() local
[all …]
|
| D | live_ranges_test.cc | 35 HGraph* graph = CreateCFG(allocator, data); in BuildGraph() local
63 HGraph* graph = BuildGraph(data, &allocator); in TEST_F() local
112 HGraph* graph = BuildGraph(data, &allocator); in TEST_F() local
163 HGraph* graph = BuildGraph(data, &allocator); in TEST_F() local
241 HGraph* graph = BuildGraph(data, &allocator); in TEST_F() local
321 HGraph* graph = BuildGraph(data, &allocator); in TEST_F() local
399 HGraph* graph = BuildGraph(data, &allocator); in TEST_F() local
|
| D | ssa_phi_elimination.h | 32 explicit SsaDeadPhiElimination(HGraph* graph) in SsaDeadPhiElimination()
61 explicit SsaRedundantPhiElimination(HGraph* graph) in SsaRedundantPhiElimination()
|
| D | instruction_simplifier_arm.h | 28 InstructionSimplifierArmVisitor(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArmVisitor()
48 InstructionSimplifierArm(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm()
|
| D | nodes_test.cc | 33 HGraph* graph = CreateGraph(&allocator); in TEST() local
76 HGraph* graph = CreateGraph(&allocator); in TEST() local
104 HGraph* graph = CreateGraph(&allocator); in TEST() local
125 HGraph* graph = CreateGraph(&allocator); in TEST() local
|
| D | graph_checker_test.cc | 31 HGraph* graph = CreateGraph(allocator); in CreateSimpleCFG() local
48 HGraph* graph = CreateCFG(&allocator, data); in TestCode() local
99 HGraph* graph = CreateSimpleCFG(&allocator); in TEST_F() local
117 HGraph* graph = CreateSimpleCFG(&allocator); in TEST_F() local
|
| D | constant_folding_test.cc | 133 auto check_after_cf = [](HGraph* graph) { in TEST_F()
194 auto check_after_cf = [](HGraph* graph) { in TEST_F()
255 auto check_after_cf = [](HGraph* graph) { in TEST_F()
334 auto check_after_cf = [](HGraph* graph) { in TEST_F()
405 auto check_after_cf = [](HGraph* graph) { in TEST_F()
468 auto check_after_cf = [](HGraph* graph) { in TEST_F()
532 auto check_after_cf = [](HGraph* graph) { in TEST_F()
632 auto check_after_cf = [](HGraph* graph) { in TEST_F()
717 auto check_after_cf = [](HGraph* graph) { in TEST_F()
849 auto check_after_cf = [](HGraph* graph) { in TEST_F()
|
| D | instruction_simplifier_arm64.h | 28 InstructionSimplifierArm64Visitor(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm64Visitor()
88 InstructionSimplifierArm64(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm64()
|
| D | gvn_test.cc | 33 HGraph* graph = CreateGraph(&allocator); in TEST_F() local
118 HGraph* graph = CreateGraph(&allocator); in TEST_F() local
201 HGraph* graph = CreateGraph(&allocator); in TEST_F() local
326 HGraph* graph = CreateGraph(&allocator); in TEST_F() local
|
| D | builder.h | 37 HGraphBuilder(HGraph* graph, in HGraphBuilder()
73 : graph_(graph), in graph_() argument
|
| D | prepare_for_register_allocation.h | 31 explicit PrepareForRegisterAllocation(HGraph* graph) : HGraphDelegateVisitor(graph) {} in PrepareForRegisterAllocation()
|
| D | dex_cache_array_fixups_arm.h | 28 DexCacheArrayFixups(HGraph* graph, OptimizingCompilerStats* stats) in DexCacheArrayFixups()
|
| D | pretty_printer.h | 27 explicit HPrettyPrinter(HGraph* graph) : HGraphVisitor(graph) { } in HPrettyPrinter()
106 explicit StringPrettyPrinter(HGraph* graph) in StringPrettyPrinter()
|
| D | constant_folding.h | 43 : HOptimization(graph, name) {} in HOptimization() argument
|
| D | select_generator.h | 50 HSelectGenerator(HGraph* graph, OptimizingCompilerStats* stats) in HSelectGenerator()
|
| D | instruction_simplifier.h | 41 : HOptimization(graph, name, stats) {} in HOptimization() argument
|
| D | gvn.h | 32 : HOptimization(graph, pass_name), side_effects_(side_effects) {} in HOptimization() argument
|
| D | pc_relative_fixups_x86.h | 31 PcRelativeFixups(HGraph* graph, CodeGenerator* codegen, OptimizingCompilerStats* stats) in PcRelativeFixups()
|
| D | load_store_elimination.h | 28 LoadStoreElimination(HGraph* graph, const SideEffectsAnalysis& side_effects) in LoadStoreElimination()
|
| D | optimization.h | 34 : graph_(graph), in graph_() argument
|
| D | dead_code_elimination.h | 35 : HOptimization(graph, name, stats) {} in HOptimization() argument
|
| D | licm.h | 29 LICM(HGraph* graph, const SideEffectsAnalysis& side_effects, OptimizingCompilerStats* stats) in LICM()
|
| D | optimizing_unit_test.h | 64 void RemoveSuspendChecks(HGraph* graph) { in RemoveSuspendChecks()
89 HGraph* graph = CreateGraph(allocator); variable
|