| /art/compiler/optimizing/ |
| D | find_loops_test.cc | 40 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
41 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
53 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
54 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
69 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
70 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
86 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
87 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
101 HGraph* graph = CreateCFG(&allocator, data); in TEST_F() local
102 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
[all …]
|
| D | gvn_test.cc | 32 HGraph* graph = CreateGraph(&allocator); in TEST_F() local
33 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); in TEST_F()
34 graph->AddBlock(entry); in TEST_F()
35 graph->SetEntryBlock(entry); in TEST_F()
36 HInstruction* parameter = new (&allocator) HParameterValue(graph->GetDexFile(), in TEST_F()
42 HBasicBlock* block = new (&allocator) HBasicBlock(graph); in TEST_F()
43 graph->AddBlock(block); in TEST_F()
53 graph->GetDexFile(), in TEST_F()
62 graph->GetDexFile(), in TEST_F()
72 graph->GetDexFile(), in TEST_F()
[all …]
|
| D | graph_test.cc | 27 static HBasicBlock* createIfBlock(HGraph* graph, ArenaAllocator* allocator) { in createIfBlock() argument
28 HBasicBlock* if_block = new (allocator) HBasicBlock(graph); in createIfBlock()
29 graph->AddBlock(if_block); in createIfBlock()
30 HInstruction* instr = graph->GetIntConstant(4); in createIfBlock()
38 static HBasicBlock* createGotoBlock(HGraph* graph, ArenaAllocator* allocator) { in createGotoBlock() argument
39 HBasicBlock* block = new (allocator) HBasicBlock(graph); in createGotoBlock()
40 graph->AddBlock(block); in createGotoBlock()
46 static HBasicBlock* createEntryBlock(HGraph* graph, ArenaAllocator* allocator) { in createEntryBlock() argument
47 HBasicBlock* block = createGotoBlock(graph, allocator); in createEntryBlock()
48 graph->SetEntryBlock(block); in createEntryBlock()
[all …]
|
| D | nodes_test.cc | 33 HGraph* graph = CreateGraph(&allocator); in TEST() local
34 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); in TEST()
35 graph->AddBlock(entry); in TEST()
36 graph->SetEntryBlock(entry); in TEST()
38 graph->GetDexFile(), dex::TypeIndex(0), 0, Primitive::kPrimNot); in TEST()
42 HBasicBlock* first_block = new (&allocator) HBasicBlock(graph); in TEST()
43 graph->AddBlock(first_block); in TEST()
49 HBasicBlock* exit_block = new (&allocator) HBasicBlock(graph); in TEST()
50 graph->AddBlock(exit_block); in TEST()
55 &allocator, 1, graph->GetArtMethod(), 0, null_check); in TEST()
[all …]
|
| D | graph_checker_test.cc | 31 HGraph* graph = CreateGraph(allocator); in CreateSimpleCFG() local
32 HBasicBlock* entry_block = new (allocator) HBasicBlock(graph); in CreateSimpleCFG()
34 graph->AddBlock(entry_block); in CreateSimpleCFG()
35 graph->SetEntryBlock(entry_block); in CreateSimpleCFG()
36 HBasicBlock* exit_block = new (allocator) HBasicBlock(graph); in CreateSimpleCFG()
38 graph->AddBlock(exit_block); in CreateSimpleCFG()
39 graph->SetExitBlock(exit_block); in CreateSimpleCFG()
41 graph->BuildDominatorTree(); in CreateSimpleCFG()
42 return graph; in CreateSimpleCFG()
48 HGraph* graph = CreateCFG(&allocator, data); in TestCode() local
[all …]
|
| D | codegen_test.cc | 81 HGraph* graph = CreateCFG(&arena, data); in TestCode() local
83 RemoveSuspendChecks(graph); in TestCode()
84 RunCode(target_config, graph, [](HGraph*) {}, has_result, expected); in TestCode()
94 HGraph* graph = CreateCFG(&arena, data, Primitive::kPrimLong); in TestCodeLong() local
96 RemoveSuspendChecks(graph); in TestCodeLong()
97 RunCode(target_config, graph, [](HGraph*) {}, has_result, expected); in TestCodeLong()
418 HGraph* graph = CreateGraph(&allocator); in TEST_F() local
420 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); in TEST_F()
421 graph->AddBlock(entry); in TEST_F()
422 graph->SetEntryBlock(entry); in TEST_F()
[all …]
|
| D | codegen_test_utils.h | 71 CodeGenerator* CreateCodeGenerator(HGraph* graph, const CompilerOptions& compiler_options) { in CreateCodeGenerator() argument
72 return create_codegen_(graph, compiler_options); in CreateCodeGenerator()
88 TestCodeGeneratorARMVIXL(HGraph* graph, in TestCodeGeneratorARMVIXL() argument
91 : arm::CodeGeneratorARMVIXL(graph, isa_features, compiler_options) { in TestCodeGeneratorARMVIXL()
108 TestCodeGeneratorX86(HGraph* graph, in TestCodeGeneratorX86() argument
111 : x86::CodeGeneratorX86(graph, isa_features, compiler_options) { in TestCodeGeneratorX86()
221 static void ValidateGraph(HGraph* graph) { in ValidateGraph() argument
222 GraphChecker graph_checker(graph); in ValidateGraph()
234 HGraph* graph, in RunCodeNoCheck() argument
238 SsaLivenessAnalysis liveness(graph, codegen); in RunCodeNoCheck()
[all …]
|
| D | register_allocator_test.cc | 60 HGraph* graph = CreateCFG(&allocator, data); in Check() local
63 x86::CodeGeneratorX86 codegen(graph, *features_x86.get(), CompilerOptions()); in Check()
64 SsaLivenessAnalysis liveness(graph, &codegen); in Check()
79 HGraph* graph = CreateGraph(&allocator); in TEST_F() local
82 x86::CodeGeneratorX86 codegen(graph, *features_x86.get(), CompilerOptions()); in TEST_F()
318 HGraph* graph = CreateCFG(&allocator, data); in Loop3() local
321 x86::CodeGeneratorX86 codegen(graph, *features_x86.get(), CompilerOptions()); in Loop3()
322 SsaLivenessAnalysis liveness(graph, &codegen); in Loop3()
329 HBasicBlock* loop_header = graph->GetBlocks()[2]; in Loop3()
338 HBasicBlock* return_block = graph->GetBlocks()[3]; in Loop3()
[all …]
|
| D | side_effects_analysis.h | 28 SideEffectsAnalysis(HGraph* graph, const char* pass_name = kSideEffectsAnalysisPassName)
29 : HOptimization(graph, pass_name), in HOptimization() argument
30 graph_(graph), in HOptimization()
31 block_effects_(graph->GetBlocks().size(), in HOptimization()
32 graph->GetArena()->Adapter(kArenaAllocSideEffectsAnalysis)), in HOptimization()
33 loop_effects_(graph->GetBlocks().size(), in HOptimization()
34 graph->GetArena()->Adapter(kArenaAllocSideEffectsAnalysis)) {} in HOptimization()
|
| D | optimizing_compiler.cc | 142 PassObserver(HGraph* graph, in PassObserver() argument
147 : graph_(graph), in PassObserver()
151 disasm_info_(graph->GetArena()), in PassObserver()
155 visualizer_(&visualizer_oss_, graph, *codegen), in PassObserver()
347 void RunOptimizations(HGraph* graph,
387 void MaybeRunInliner(HGraph* graph,
395 HGraph* graph,
462 HGraph* graph, in BuildOptimization() argument
474 return new (arena) BoundsCheckElimination(graph, in BuildOptimization()
479 return new (arena) GVNOptimization(graph, *most_recent_side_effects, pass_name.c_str()); in BuildOptimization()
[all …]
|
| D | builder.h | 39 HGraphBuilder(HGraph* graph, in HGraphBuilder() argument
50 : graph_(graph), in HGraphBuilder()
56 block_builder_(graph, dex_file, code_item), in HGraphBuilder()
57 ssa_builder_(graph, in HGraphBuilder()
61 instruction_builder_(graph, in HGraphBuilder()
77 HGraphBuilder(HGraph* graph,
81 : graph_(graph), in graph_() argument
87 block_builder_(graph, nullptr, code_item), in graph_()
88 ssa_builder_(graph, in graph_()
92 instruction_builder_(graph, in graph_()
|
| D | live_ranges_test.cc | 35 HGraph* graph = CreateCFG(allocator, data); in BuildGraph() local
38 RemoveSuspendChecks(graph); in BuildGraph()
40 PrepareForRegisterAllocation(graph).Run(); in BuildGraph()
41 return graph; in BuildGraph()
63 HGraph* graph = BuildGraph(data, &allocator); in TEST_F() local
67 x86::CodeGeneratorX86 codegen(graph, *features_x86.get(), CompilerOptions()); in TEST_F()
68 SsaLivenessAnalysis liveness(graph, &codegen); in TEST_F()
76 HBasicBlock* block = graph->GetBlocks()[1]; in TEST_F()
112 HGraph* graph = BuildGraph(data, &allocator); in TEST_F() local
115 x86::CodeGeneratorX86 codegen(graph, *features_x86.get(), CompilerOptions()); in TEST_F()
[all …]
|
| D | ssa_phi_elimination.h | 32 explicit SsaDeadPhiElimination(HGraph* graph) in SsaDeadPhiElimination() argument
33 : HOptimization(graph, kSsaDeadPhiEliminationPassName), in SsaDeadPhiElimination()
34 worklist_(graph->GetArena()->Adapter(kArenaAllocSsaPhiElimination)) { in SsaDeadPhiElimination()
61 explicit SsaRedundantPhiElimination(HGraph* graph) in SsaRedundantPhiElimination() argument
62 : HOptimization(graph, kSsaRedundantPhiEliminationPassName), in SsaRedundantPhiElimination()
63 worklist_(graph->GetArena()->Adapter(kArenaAllocSsaPhiElimination)) { in SsaRedundantPhiElimination()
|
| D | linear_order.cc | 54 static bool IsLinearOrderWellFormed(const HGraph* graph, ArenaVector<HBasicBlock*>* linear_order) { in IsLinearOrderWellFormed() argument
55 for (HBasicBlock* header : graph->GetBlocks()) { in IsLinearOrderWellFormed()
82 void LinearizeGraph(const HGraph* graph, in LinearizeGraph() argument
95 ArenaVector<uint32_t> forward_predecessors(graph->GetBlocks().size(), in LinearizeGraph()
97 for (HBasicBlock* block : graph->GetReversePostOrder()) { in LinearizeGraph()
108 linear_order->reserve(graph->GetReversePostOrder().size()); in LinearizeGraph()
110 worklist.push_back(graph->GetEntryBlock()); in LinearizeGraph()
125 DCHECK(graph->HasIrreducibleLoops() || IsLinearOrderWellFormed(graph, linear_order)); in LinearizeGraph()
|
| D | induction_var_range.cc | 264 HGraph* graph, in GenerateRange() argument
274 graph, in GenerateRange()
287 HGraph* graph, in GenerateTakenTest() argument
296 graph, in GenerateTakenTest()
329 HGraph* graph, in GenerateLastValue() argument
338 graph, in GenerateLastValue()
376 HGraph* graph, in IsUnitStride() argument
388 *offset = graph->GetConstant(info->op_b->type, off_value); in IsUnitStride()
402 HGraph* graph, in GenerateTripCount() argument
410 if (!GenerateCode(trip->op_b, nullptr, graph, block, &taken_test, false, false)) { in GenerateTripCount()
[all …]
|
| D | dead_code_elimination_test.cc | 36 HGraph* graph = CreateCFG(&allocator, data); in TestCode() local
37 ASSERT_NE(graph, nullptr); in TestCode()
39 StringPrettyPrinter printer_before(graph); in TestCode()
46 x86::CodeGeneratorX86 codegenX86(graph, *features_x86.get(), CompilerOptions()); in TestCode()
47 HDeadCodeElimination(graph, nullptr /* stats */, "dead_code_elimination").Run(); in TestCode()
48 GraphChecker graph_checker(graph); in TestCode()
52 StringPrettyPrinter printer_after(graph); in TestCode()
|
| D | bounds_check_elimination_test.cc | 358 static HInstruction* BuildSSAGraph1(HGraph* graph, in BuildSSAGraph1() argument
363 HBasicBlock* entry = new (allocator) HBasicBlock(graph); in BuildSSAGraph1()
364 graph->AddBlock(entry); in BuildSSAGraph1()
365 graph->SetEntryBlock(entry); in BuildSSAGraph1()
367 graph->GetDexFile(), dex::TypeIndex(0), 0, Primitive::kPrimNot); in BuildSSAGraph1()
370 HInstruction* constant_initial = graph->GetIntConstant(initial); in BuildSSAGraph1()
371 HInstruction* constant_increment = graph->GetIntConstant(increment); in BuildSSAGraph1()
372 HInstruction* constant_10 = graph->GetIntConstant(10); in BuildSSAGraph1()
374 HBasicBlock* block = new (allocator) HBasicBlock(graph); in BuildSSAGraph1()
375 graph->AddBlock(block); in BuildSSAGraph1()
[all …]
|
| D | graph_checker.h | 29 explicit GraphChecker(HGraph* graph, const char* dump_prefix = "art::GraphChecker: ")
30 : HGraphDelegateVisitor(graph), in HGraphDelegateVisitor() argument
31 errors_(graph->GetArena()->Adapter(kArenaAllocGraphChecker)), in HGraphDelegateVisitor()
33 seen_ids_(graph->GetArena(), in HGraphDelegateVisitor()
34 graph->GetCurrentInstructionId(), in HGraphDelegateVisitor()
37 blocks_storage_(graph->GetArena()->Adapter(kArenaAllocGraphChecker)), in HGraphDelegateVisitor()
38 visited_storage_(graph->GetArena(), 0u, true, kArenaAllocGraphChecker) {} in HGraphDelegateVisitor()
|
| D | x86_memory_gen.cc | 29 MemoryOperandVisitor(HGraph* graph, bool do_implicit_null_checks) in MemoryOperandVisitor() argument
30 : HGraphVisitor(graph), in MemoryOperandVisitor()
72 X86MemoryOperandGeneration::X86MemoryOperandGeneration(HGraph* graph, in X86MemoryOperandGeneration() argument
75 : HOptimization(graph, kX86MemoryOperandGenerationPassName, stats), in X86MemoryOperandGeneration()
|
| 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);
166 HGraph* graph,
174 HInstruction* GenerateTripCount(HLoopInformation* loop, HGraph* graph, HBasicBlock* block);
268 HGraph* graph,
279 HGraph* graph,
285 HGraph* graph,
291 HGraph* graph,
297 HGraph* graph,
[all …]
|
| D | constant_folding_test.cc | 133 auto check_after_cf = [](HGraph* graph) { in TEST_F() argument
134 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
194 auto check_after_cf = [](HGraph* graph) { in TEST_F() argument
195 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
255 auto check_after_cf = [](HGraph* graph) { in TEST_F() argument
256 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
334 auto check_after_cf = [](HGraph* graph) { in TEST_F() argument
335 HInstruction* inst1 = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
405 auto check_after_cf = [](HGraph* graph) { in TEST_F() argument
406 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
[all …]
|
| D | ssa_builder.h | 50 SsaBuilder(HGraph* graph, in SsaBuilder() argument
54 : graph_(graph), in SsaBuilder()
59 ambiguous_agets_(graph->GetArena()->Adapter(kArenaAllocGraphBuilder)), in SsaBuilder()
60 ambiguous_asets_(graph->GetArena()->Adapter(kArenaAllocGraphBuilder)), in SsaBuilder()
61 uninitialized_strings_(graph->GetArena()->Adapter(kArenaAllocGraphBuilder)) { in SsaBuilder()
|
| D | ssa_test.cc | 36 explicit SsaPrettyPrinter(HGraph* graph) : HPrettyPrinter(graph), str_("") {} in SsaPrettyPrinter() argument
68 static void ReNumberInstructions(HGraph* graph) { in ReNumberInstructions() argument
70 for (HBasicBlock* block : graph->GetBlocks()) { in ReNumberInstructions()
83 HGraph* graph = CreateCFG(&allocator, data); in TestCode() local
86 RemoveSuspendChecks(graph); in TestCode()
87 ReNumberInstructions(graph); in TestCode()
90 for (HBasicBlock* block : graph->GetBlocks()) { in TestCode()
96 SsaPrettyPrinter printer(graph); in TestCode()
|
| D | dominator_test.cc | 32 HGraph* graph = CreateCFG(&allocator, data); in TestCode() local
33 ASSERT_EQ(graph->GetBlocks().size(), blocks_length); in TestCode()
36 if (graph->GetBlocks()[i] == nullptr) { in TestCode()
40 ASSERT_EQ(nullptr, graph->GetBlocks()[i]->GetDominator()); in TestCode()
41 ASSERT_TRUE(graph->GetBlocks()[i]->IsEntryBlock()); in TestCode()
44 ASSERT_NE(nullptr, graph->GetBlocks()[i]->GetDominator()); in TestCode()
45 ASSERT_EQ(blocks[i], graph->GetBlocks()[i]->GetDominator()->GetBlockId()); in TestCode()
|
| D | instruction_simplifier_arm.h | 28 InstructionSimplifierArmVisitor(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArmVisitor() argument
29 : HGraphVisitor(graph), stats_(stats) {} in InstructionSimplifierArmVisitor()
80 InstructionSimplifierArm(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm() argument
81 : HOptimization(graph, kInstructionSimplifierArmPassName, stats) {} in InstructionSimplifierArm()
|