| /art/compiler/optimizing/ |
| D | codegen_test_utils.h | 72 CodeGenerator* CreateCodeGenerator(HGraph* graph, const CompilerOptions& compiler_options) { in CreateCodeGenerator()
89 TestCodeGeneratorARM(HGraph* graph, in TestCodeGeneratorARM()
109 TestCodeGeneratorARMVIXL(HGraph* graph, in TestCodeGeneratorARMVIXL()
129 TestCodeGeneratorX86(HGraph* graph, in TestCodeGeneratorX86()
242 static void ValidateGraph(HGraph* graph) { in ValidateGraph()
255 HGraph* graph, in RunCodeNoCheck()
271 HGraph* graph, in RunCode()
281 HGraph* graph, in RunCode()
291 CodeGenerator* create_codegen_arm(HGraph* graph, const CompilerOptions& compiler_options) { in create_codegen_arm()
299 CodeGenerator* create_codegen_arm_vixl32(HGraph* graph, const CompilerOptions& compiler_options) { in create_codegen_arm_vixl32()
[all …]
|
| 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 | 27 static HBasicBlock* createIfBlock(HGraph* graph, ArenaAllocator* allocator) { in createIfBlock()
38 static HBasicBlock* createGotoBlock(HGraph* graph, ArenaAllocator* allocator) { in createGotoBlock()
46 static HBasicBlock* createEntryBlock(HGraph* graph, ArenaAllocator* allocator) { in createEntryBlock()
52 static HBasicBlock* createReturnBlock(HGraph* graph, ArenaAllocator* allocator) { in createReturnBlock()
60 static HBasicBlock* createExitBlock(HGraph* graph, ArenaAllocator* allocator) { in createExitBlock()
75 HGraph* graph = CreateGraph(&allocator); in TEST() local
110 HGraph* graph = CreateGraph(&allocator); in TEST() local
145 HGraph* graph = CreateGraph(&allocator); in TEST() local
180 HGraph* graph = CreateGraph(&allocator); in TEST() local
215 HGraph* graph = CreateGraph(&allocator); in TEST() local
[all …]
|
| D | register_allocator_test.cc | 60 HGraph* graph = CreateCFG(&allocator, data); in Check() local
79 HGraph* graph = CreateGraph(&allocator); in TEST_F() local
318 HGraph* graph = CreateCFG(&allocator, data); in Loop3() local
355 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
409 HGraph* graph = CreateCFG(&allocator, data); in DeadPhi() local
437 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
493 HGraph* graph = CreateGraph(allocator); in BuildIfElseWithPhi() local
568 HGraph* graph = BuildIfElseWithPhi(&allocator, &phi, &input1, &input2); in PhiHint() local
586 HGraph* graph = BuildIfElseWithPhi(&allocator, &phi, &input1, &input2); in PhiHint() local
606 HGraph* graph = BuildIfElseWithPhi(&allocator, &phi, &input1, &input2); in PhiHint() 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 | 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 | x86_memory_gen.cc | 29 MemoryOperandVisitor(HGraph* graph, bool do_implicit_null_checks) in MemoryOperandVisitor()
72 X86MemoryOperandGeneration::X86MemoryOperandGeneration(HGraph* graph, in X86MemoryOperandGeneration()
|
| D | gvn_test.cc | 32 HGraph* graph = CreateGraph(&allocator); in TEST_F() local
116 HGraph* graph = CreateGraph(&allocator); in TEST_F() local
198 HGraph* graph = CreateGraph(&allocator); in TEST_F() local
322 HGraph* graph = CreateGraph(&allocator); in TEST_F() local
|
| D | instruction_simplifier_arm.h | 28 InstructionSimplifierArmVisitor(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArmVisitor()
80 InstructionSimplifierArm(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm()
|
| D | instruction_simplifier_arm64.h | 28 InstructionSimplifierArm64Visitor(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm64Visitor()
85 InstructionSimplifierArm64(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm64()
|
| D | pc_relative_fixups_mips.cc | 29 PCRelativeHandlerVisitor(HGraph* graph, CodeGenerator* codegen) in PCRelativeHandlerVisitor()
101 HGraph* graph = GetGraph(); in VisitPackedSwitch() local
|
| D | builder.h | 39 HGraphBuilder(HGraph* graph, in HGraphBuilder()
81 : graph_(graph), in graph_() argument
|
| D | cha_guard_optimization.h | 29 explicit CHAGuardOptimization(HGraph* graph) in CHAGuardOptimization()
|
| D | prepare_for_register_allocation.h | 31 explicit PrepareForRegisterAllocation(HGraph* graph) : HGraphDelegateVisitor(graph) {} in PrepareForRegisterAllocation()
|
| D | linear_order.cc | 54 static bool IsLinearOrderWellFormed(const HGraph* graph, ArenaVector<HBasicBlock*>* linear_order) { in IsLinearOrderWellFormed()
82 void LinearizeGraph(const HGraph* graph, in LinearizeGraph()
|
| D | pretty_printer.h | 28 explicit HPrettyPrinter(HGraph* graph) : HGraphVisitor(graph) { } in HPrettyPrinter()
108 explicit StringPrettyPrinter(HGraph* graph) in StringPrettyPrinter()
|
| D | code_sinking.h | 31 CodeSinking(HGraph* graph, OptimizingCompilerStats* stats) in CodeSinking()
|
| D | constant_folding.h | 42 HConstantFolding(HGraph* graph, const char* name) : HOptimization(graph, name) {} in HConstantFolding()
|
| D | select_generator.h | 50 HSelectGenerator(HGraph* graph, OptimizingCompilerStats* stats) in HSelectGenerator()
|
| D | dead_code_elimination.h | 32 HDeadCodeElimination(HGraph* graph, OptimizingCompilerStats* stats, const char* name) in HDeadCodeElimination()
|
| D | load_store_elimination.h | 28 LoadStoreElimination(HGraph* graph, const SideEffectsAnalysis& side_effects) in LoadStoreElimination()
|
| D | gvn.h | 32 : HOptimization(graph, pass_name), side_effects_(side_effects) {} in HOptimization() argument
|