| /art/compiler/optimizing/ |
| D | find_loops_test.cc | 38 HGraph* graph = CreateCFG(data); in TEST_F() local
49 HGraph* graph = CreateCFG(data); in TEST_F() local
63 HGraph* graph = CreateCFG(data); in TEST_F() local
78 HGraph* graph = CreateCFG(data); in TEST_F() local
91 HGraph* graph = CreateCFG(data); in TEST_F() local
97 static void TestBlock(HGraph* graph, in TestBlock()
135 HGraph* graph = CreateCFG(data); in TEST_F() local
161 HGraph* graph = CreateCFG(data); in TEST_F() local
184 HGraph* graph = CreateCFG(data); in TEST_F() local
208 HGraph* graph = CreateCFG(data); in TEST_F() local
[all …]
|
| D | codegen_test_utils.h | 72 CodeGenerator* CreateCodeGenerator(HGraph* graph, const CompilerOptions& compiler_options) { in CreateCodeGenerator()
104 TestCodeGeneratorARMVIXL(HGraph* graph, in TestCodeGeneratorARMVIXL()
148 TestCodeGeneratorARM64(HGraph* graph, in TestCodeGeneratorARM64()
168 TestCodeGeneratorX86(HGraph* graph, in TestCodeGeneratorX86()
281 static void ValidateGraph(HGraph* graph) { in ValidateGraph()
294 HGraph* graph, in RunCodeNoCheck()
315 HGraph* graph, in RunCode()
325 HGraph* graph, in RunCode()
336 CodeGenerator* create_codegen_arm_vixl32(HGraph* graph, const CompilerOptions& compiler_options) { in create_codegen_arm_vixl32()
345 CodeGenerator* create_codegen_arm64(HGraph* graph, const CompilerOptions& compiler_options) { in create_codegen_arm64()
[all …]
|
| D | graph_test.cc | 36 HBasicBlock* GraphTest::CreateIfBlock(HGraph* graph) { in CreateIfBlock()
47 HBasicBlock* GraphTest::CreateGotoBlock(HGraph* graph) { in CreateGotoBlock()
55 HBasicBlock* GraphTest::CreateEntryBlock(HGraph* graph) { in CreateEntryBlock()
61 HBasicBlock* GraphTest::CreateReturnBlock(HGraph* graph) { in CreateReturnBlock()
69 HBasicBlock* GraphTest::CreateExitBlock(HGraph* graph) { in CreateExitBlock()
81 HGraph* graph = CreateGraph(); in TEST_F() local
113 HGraph* graph = CreateGraph(); in TEST_F() local
145 HGraph* graph = CreateGraph(); in TEST_F() local
177 HGraph* graph = CreateGraph(); in TEST_F() local
209 HGraph* graph = CreateGraph(); in TEST_F() local
[all …]
|
| D | register_allocator_test.cc | 83 HGraph* graph = CreateCFG(data); in Check() local
100 HGraph* graph = CreateGraph(); in TEST_F() local
326 HGraph* graph = CreateCFG(data); in Loop3() local
361 HGraph* graph = CreateCFG(data); in TEST_F() local
413 HGraph* graph = CreateCFG(data); in DeadPhi() local
439 HGraph* graph = CreateCFG(data); in TEST_F() local
495 HGraph* graph = CreateGraph(); in BuildIfElseWithPhi() local
568 HGraph* graph = BuildIfElseWithPhi(&phi, &input1, &input2); in PhiHint() local
586 HGraph* graph = BuildIfElseWithPhi(&phi, &input1, &input2); in PhiHint() local
606 HGraph* graph = BuildIfElseWithPhi(&phi, &input1, &input2); in PhiHint() local
[all …]
|
| D | live_ranges_test.cc | 38 HGraph* graph = CreateCFG(data); in BuildGraph() local
64 HGraph* graph = BuildGraph(data); in TEST_F() local
111 HGraph* graph = BuildGraph(data); in TEST_F() local
160 HGraph* graph = BuildGraph(data); in TEST_F() local
236 HGraph* graph = BuildGraph(data); in TEST_F() local
314 HGraph* graph = BuildGraph(data); in TEST_F() local
390 HGraph* graph = BuildGraph(data); in TEST_F() local
|
| D | ssa_phi_elimination.h | 31 explicit SsaDeadPhiElimination(HGraph* graph) in SsaDeadPhiElimination()
53 explicit SsaRedundantPhiElimination(HGraph* graph) in SsaRedundantPhiElimination()
|
| D | nodes_test.cc | 33 HGraph* graph = CreateGraph(); in TEST_F() local
73 HGraph* graph = CreateGraph(); in TEST_F() local
98 HGraph* graph = CreateGraph(); in TEST_F() local
116 HGraph* graph = CreateGraph(); in TEST_F() local
|
| D | graph_checker_test.cc | 37 HGraph* graph = CreateGraph(); in CreateSimpleCFG() local
52 HGraph* graph = CreateCFG(data); in TestCode() local
98 HGraph* graph = CreateSimpleCFG(); in TEST_F() local
113 HGraph* graph = CreateSimpleCFG(); in TEST_F() local
|
| D | constant_folding_test.cc | 129 auto check_after_cf = [](HGraph* graph) { in TEST_F()
190 auto check_after_cf = [](HGraph* graph) { in TEST_F()
251 auto check_after_cf = [](HGraph* graph) { in TEST_F()
330 auto check_after_cf = [](HGraph* graph) { in TEST_F()
401 auto check_after_cf = [](HGraph* graph) { in TEST_F()
464 auto check_after_cf = [](HGraph* graph) { in TEST_F()
528 auto check_after_cf = [](HGraph* graph) { in TEST_F()
628 auto check_after_cf = [](HGraph* graph) { in TEST_F()
713 auto check_after_cf = [](HGraph* graph) { in TEST_F()
845 auto check_after_cf = [](HGraph* graph) { in TEST_F()
|
| D | gvn_test.cc | 30 HGraph* graph = CreateGraph(); in TEST_F() local
111 HGraph* graph = CreateGraph(); in TEST_F() local
190 HGraph* graph = CreateGraph(); in TEST_F() local
311 HGraph* graph = CreateGraph(); in TEST_F() local
|
| D | x86_memory_gen.cc | 29 MemoryOperandVisitor(HGraph* graph, bool do_implicit_null_checks) in MemoryOperandVisitor()
72 X86MemoryOperandGeneration::X86MemoryOperandGeneration(HGraph* graph, in X86MemoryOperandGeneration()
|
| D | pc_relative_fixups_mips.cc | 29 PCRelativeHandlerVisitor(HGraph* graph, CodeGenerator* codegen) in PCRelativeHandlerVisitor()
113 HGraph* graph = GetGraph(); in VisitPackedSwitch() local
|
| D | linear_order.h | 40 void LinearizeGraph(const HGraph* graph, Vector* linear_order) { in LinearizeGraph()
|
| D | constant_folding.h | 42 HConstantFolding(HGraph* graph, const char* name) : HOptimization(graph, name) {} in HConstantFolding()
|
| D | instruction_simplifier_arm64.h | 28 InstructionSimplifierArm64(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm64()
|
| D | cha_guard_optimization.h | 31 : HOptimization(graph, name) {} in HOptimization() argument
|
| D | instruction_simplifier_arm.h | 28 InstructionSimplifierArm(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm()
|
| D | pretty_printer.h | 28 explicit HPrettyPrinter(HGraph* graph) : HGraphVisitor(graph) { } in HPrettyPrinter()
108 explicit StringPrettyPrinter(HGraph* graph) in StringPrettyPrinter()
|
| D | linear_order.cc | 58 static bool IsLinearOrderWellFormed(const HGraph* graph, ArrayRef<HBasicBlock*> linear_order) { in IsLinearOrderWellFormed()
86 void LinearizeGraphInternal(const HGraph* graph, ArrayRef<HBasicBlock*> linear_order) { in LinearizeGraphInternal()
|
| D | code_sinking.h | 34 : HOptimization(graph, name, stats) {} in HOptimization() argument
|
| D | constructor_fence_redundancy_elimination.h | 53 : HOptimization(graph, name, stats) {} in HOptimization() argument
|
| D | dead_code_elimination.h | 32 HDeadCodeElimination(HGraph* graph, OptimizingCompilerStats* stats, const char* name) in HDeadCodeElimination()
|
| D | gvn.h | 32 : HOptimization(graph, pass_name), side_effects_(side_effects) {} in HOptimization() argument
|
| D | prepare_for_register_allocation.h | 35 : HGraphDelegateVisitor(graph, stats) {} in HGraphDelegateVisitor() argument
|
| D | codegen_test.cc | 89 HGraph* graph = CreateCFG(data); in TestCode() local
100 HGraph* graph = CreateCFG(data, DataType::Type::kInt64); in TestCodeLong() local
419 HGraph* graph = CreateGraph(); in TEST_F() local
479 HGraph* graph = CreateGraph(); in TEST_F() local
526 HGraph* graph = CreateGraph(); in TEST_F() local
606 HGraph* graph = CreateGraph(); in TestComparison() local
718 HGraph* graph = CreateGraph(); in TEST_F() local
742 HGraph* graph = CreateGraph(); in TEST_F() local
792 HGraph* graph = CreateGraph(); in TEST_F() local
835 HGraph* graph = CreateGraph(); in TEST_F() local
|