| /art/compiler/optimizing/ |
| D | codegen_test_utils.h | 58 typedef CodeGenerator* (*CreateCodegenFn)(HGraph*, const CompilerOptions&);
66 CodeGenerator* CreateCodeGenerator(HGraph* graph, const CompilerOptions& compiler_options) { in CreateCodeGenerator()
98 TestCodeGeneratorARMVIXL(HGraph* graph, const CompilerOptions& compiler_options) in TestCodeGeneratorARMVIXL()
140 TestCodeGeneratorARM64(HGraph* graph, const CompilerOptions& compiler_options) in TestCodeGeneratorARM64()
158 TestCodeGeneratorX86(HGraph* graph, const CompilerOptions& compiler_options) in TestCodeGeneratorX86()
271 static void ValidateGraph(HGraph* graph) { in ValidateGraph()
284 HGraph* graph, in RunCodeNoCheck()
285 const std::function<void(HGraph*)>& hook_before_codegen, in RunCodeNoCheck()
305 HGraph* graph, in RunCode()
306 std::function<void(HGraph*)> hook_before_codegen, in RunCode()
[all …]
|
| D | graph_test.cc | 29 HBasicBlock* CreateIfBlock(HGraph* graph);
30 HBasicBlock* CreateGotoBlock(HGraph* graph);
31 HBasicBlock* CreateEntryBlock(HGraph* graph);
32 HBasicBlock* CreateReturnBlock(HGraph* graph);
33 HBasicBlock* CreateExitBlock(HGraph* graph);
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()
[all …]
|
| D | find_loops_test.cc | 38 HGraph* graph = CreateCFG(data); in TEST_F()
49 HGraph* graph = CreateCFG(data); in TEST_F()
63 HGraph* graph = CreateCFG(data); in TEST_F()
78 HGraph* graph = CreateCFG(data); in TEST_F()
91 HGraph* graph = CreateCFG(data); in TEST_F()
97 static void TestBlock(HGraph* graph, in TestBlock()
135 HGraph* graph = CreateCFG(data); in TEST_F()
161 HGraph* graph = CreateCFG(data); in TEST_F()
184 HGraph* graph = CreateCFG(data); in TEST_F()
208 HGraph* graph = CreateCFG(data); in TEST_F()
[all …]
|
| D | graph_checker_test.cc | 24 HGraph* CreateSimpleCFG();
36 HGraph* GraphCheckerTest::CreateSimpleCFG() { in CreateSimpleCFG()
37 HGraph* graph = CreateGraph(); in CreateSimpleCFG()
52 HGraph* graph = CreateCFG(data); in TestCode()
98 HGraph* graph = CreateSimpleCFG(); in TEST_F()
113 HGraph* graph = CreateSimpleCFG(); in TEST_F()
|
| D | induction_var_range.h | 102 HGraph* graph,
113 HInstruction* GenerateTakenTest(HInstruction* context, HGraph* graph, HBasicBlock* block);
127 HInstruction* GenerateLastValue(HInstruction* instruction, HGraph* graph, HBasicBlock* block);
182 HGraph* graph,
190 HInstruction* GenerateTripCount(HLoopInformation* loop, HGraph* graph, HBasicBlock* block);
292 HGraph* graph,
303 HGraph* graph,
309 HGraph* graph,
315 HGraph* graph,
321 HGraph* graph,
[all …]
|
| D | builder.h | 36 HGraphBuilder(HGraph* graph,
46 HGraphBuilder(HGraph* graph,
60 HGraph* const graph_;
|
| D | linear_order.h | 26 void LinearizeGraphInternal(const HGraph* graph, ArrayRef<HBasicBlock*> linear_order);
40 void LinearizeGraph(const HGraph* graph, Vector* linear_order) { in LinearizeGraph()
|
| D | register_allocator_test.cc | 61 HGraph* BuildIfElseWithPhi(HPhi** phi, HInstruction** input1, HInstruction** input2);
63 HGraph* BuildFieldReturn(HInstruction** field, HInstruction** ret);
64 HGraph* BuildTwoSubs(HInstruction** first_sub, HInstruction** second_sub);
65 HGraph* BuildDiv(HInstruction** div);
89 HGraph* graph = CreateCFG(data); in Check()
104 HGraph* graph = CreateGraph(); in TEST_F()
328 HGraph* graph = CreateCFG(data); in Loop3()
361 HGraph* graph = CreateCFG(data); in TEST_F()
411 HGraph* graph = CreateCFG(data); in DeadPhi()
435 HGraph* graph = CreateCFG(data); in TEST_F()
[all …]
|
| D | ssa_phi_elimination.h | 31 explicit SsaDeadPhiElimination(HGraph* graph) in SsaDeadPhiElimination()
53 explicit SsaRedundantPhiElimination(HGraph* graph) in SsaRedundantPhiElimination()
|
| D | live_ranges_test.cc | 32 HGraph* BuildGraph(const std::vector<uint16_t>& data);
35 HGraph* LiveRangesTest::BuildGraph(const std::vector<uint16_t>& data) { in BuildGraph()
36 HGraph* graph = CreateCFG(data); in BuildGraph()
62 HGraph* graph = BuildGraph(data); in TEST_F()
107 HGraph* graph = BuildGraph(data); in TEST_F()
154 HGraph* graph = BuildGraph(data); in TEST_F()
228 HGraph* graph = BuildGraph(data); in TEST_F()
304 HGraph* graph = BuildGraph(data); in TEST_F()
378 HGraph* graph = BuildGraph(data); in TEST_F()
|
| D | constant_folding_test.cc | 41 const std::function<void(HGraph*)>& check_after_cf, in TestCode()
53 const std::function<void(HGraph*)>& check_after_cf) { in TestCodeOnReadyGraph()
84 HGraph* graph_;
124 auto check_after_cf = [](HGraph* graph) { in TEST_F()
185 auto check_after_cf = [](HGraph* graph) { in TEST_F()
246 auto check_after_cf = [](HGraph* graph) { in TEST_F()
325 auto check_after_cf = [](HGraph* graph) { in TEST_F()
396 auto check_after_cf = [](HGraph* graph) { in TEST_F()
459 auto check_after_cf = [](HGraph* graph) { in TEST_F()
523 auto check_after_cf = [](HGraph* graph) { in TEST_F()
[all …]
|
| D | graph_visualizer.h | 30 class HGraph; variable
103 HGraph* graph,
112 HGraph* const graph_;
|
| D | optimization.h | 34 HOptimization(HGraph* graph,
54 HGraph* const graph_;
146 HGraph* graph,
|
| D | side_effects_analysis.h | 28 explicit SideEffectsAnalysis(HGraph* graph, const char* pass_name = kSideEffectsAnalysisPassName)
49 HGraph* graph_;
|
| D | x86_memory_gen.cc | 29 MemoryOperandVisitor(HGraph* graph, bool do_implicit_null_checks) in MemoryOperandVisitor()
72 X86MemoryOperandGeneration::X86MemoryOperandGeneration(HGraph* graph, in X86MemoryOperandGeneration()
|
| D | block_builder.h | 30 HBasicBlockBuilder(HGraph* graph,
70 HGraph* const graph_;
|
| D | inliner.h | 29 class HGraph; variable
35 HInliner(HGraph* outer_graph,
36 HGraph* outermost_graph,
100 void RunOptimizations(HGraph* callee_graph,
276 HGraph* const outermost_graph_;
|
| D | codegen_test.cc | 89 HGraph* graph = CreateCFG(data); in TestCode()
93 RunCode(target_config, *compiler_options_, graph, [](HGraph*) {}, has_result, expected); in TestCode() argument
101 HGraph* graph = CreateCFG(data, DataType::Type::kInt64); in TestCodeLong()
105 RunCode(target_config, *compiler_options_, graph, [](HGraph*) {}, has_result, expected); in TestCodeLong() argument
421 HGraph* graph = CreateGraph(); in TEST_F()
459 auto hook_before_codegen = [](HGraph* graph_in) { in TEST_F()
482 HGraph* graph = CreateGraph(); in TEST_F()
506 auto hook_before_codegen = [](HGraph* graph_in) { in TEST_F()
530 HGraph* graph = CreateGraph(); in TEST_F()
574 auto hook_before_codegen = [](HGraph* graph_in) { in TEST_F()
[all …]
|
| D | optimizing_unit_test.h | 76 void RemoveSuspendChecks(HGraph* graph) { in RemoveSuspendChecks()
123 HGraph* CreateGraph() { in CreateGraph()
140 return new (allocator) HGraph( in CreateGraph()
149 HGraph* CreateCFG(const std::vector<uint16_t>& data,
151 HGraph* graph = CreateGraph();
253 HGraph* graph_;
|
| D | register_allocator.h | 29 class HGraph; variable
63 static bool CanAllocateRegistersFor(const HGraph& graph,
|
| D | nodes_test.cc | 33 HGraph* graph = CreateGraph(); in TEST_F()
73 HGraph* graph = CreateGraph(); in TEST_F()
98 HGraph* graph = CreateGraph(); in TEST_F()
116 HGraph* graph = CreateGraph(); in TEST_F()
|
| D | constant_folding.h | 42 HConstantFolding(HGraph* graph, const char* name) : HOptimization(graph, name) {} in HConstantFolding()
|
| D | instruction_simplifier_arm.h | 28 InstructionSimplifierArm(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm()
|
| D | instruction_simplifier_arm64.h | 28 InstructionSimplifierArm64(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm64()
|
| D | cha_guard_optimization.h | 29 explicit CHAGuardOptimization(HGraph* graph,
|