/art/compiler/optimizing/ |
H A D | find_loops_test.cc | 40 HGraph* graph = CreateCFG(&allocator, data); local 41 for (HBasicBlock* block : graph->GetBlocks()) { 53 HGraph* graph = CreateCFG(&allocator, data); local 54 for (HBasicBlock* block : graph->GetBlocks()) { 69 HGraph* graph = CreateCFG(&allocator, data); local 70 for (HBasicBlock* block : graph->GetBlocks()) { 86 HGraph* graph = CreateCFG(&allocator, data); local 87 for (HBasicBlock* block : graph->GetBlocks()) { 101 HGraph* graph = CreateCFG(&allocator, data); local 102 for (HBasicBlock* block : graph 107 TestBlock(HGraph* graph, uint32_t block_id, bool is_loop_header, uint32_t parent_loop_header_id, const int* blocks_in_loop = nullptr, size_t number_of_blocks = 0) argument 147 HGraph* graph = CreateCFG(&allocator, data); local 175 HGraph* graph = CreateCFG(&allocator, data); local 200 HGraph* graph = CreateCFG(&allocator, data); local 226 HGraph* graph = CreateCFG(&allocator, data); local 252 HGraph* graph = CreateCFG(&allocator, data); local 277 HGraph* graph = CreateCFG(&allocator, data); local 308 HGraph* graph = CreateCFG(&allocator, data); local 338 HGraph* graph = CreateCFG(&allocator, data); local 354 HGraph* graph = CreateCFG(&allocator, data); local [all...] |
H A D | gvn_test.cc | 33 HGraph* graph = CreateGraph(&allocator); local 34 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); 35 graph->AddBlock(entry); 36 graph->SetEntryBlock(entry); 37 HInstruction* parameter = new (&allocator) HParameterValue(graph->GetDexFile(), 43 HBasicBlock* block = new (&allocator) HBasicBlock(graph); 44 graph->AddBlock(block); 53 graph->GetDexFile(), 62 graph->GetDexFile(), 72 graph 118 HGraph* graph = CreateGraph(&allocator); local 201 HGraph* graph = CreateGraph(&allocator); local 326 HGraph* graph = CreateGraph(&allocator); local [all...] |
H A D | side_effects_analysis.h | 28 explicit SideEffectsAnalysis(HGraph* graph) argument 29 : HOptimization(graph, kSideEffectsAnalysisPassName), 30 graph_(graph), 31 block_effects_(graph->GetBlocks().size(), 32 graph->GetArena()->Adapter(kArenaAllocSideEffectsAnalysis)), 33 loop_effects_(graph->GetBlocks().size(), 34 graph->GetArena()->Adapter(kArenaAllocSideEffectsAnalysis)) {}
|
H A D | graph_checker_test.cc | 23 * Create a simple control-flow graph composed of two blocks: 31 HGraph* graph = CreateGraph(allocator); local 32 HBasicBlock* entry_block = new (allocator) HBasicBlock(graph); 34 graph->AddBlock(entry_block); 35 graph->SetEntryBlock(entry_block); 36 HBasicBlock* exit_block = new (allocator) HBasicBlock(graph); 38 graph->AddBlock(exit_block); 39 graph->SetExitBlock(exit_block); 41 graph->BuildDominatorTree(); 42 return graph; 48 HGraph* graph = CreateCFG(&allocator, data); local 99 HGraph* graph = CreateSimpleCFG(&allocator); local 117 HGraph* graph = CreateSimpleCFG(&allocator); local [all...] |
H A D | ssa_phi_elimination.h | 27 * Optimization phase that removes dead phis from the graph. Dead phis are unused 32 explicit SsaDeadPhiElimination(HGraph* graph) argument 33 : HOptimization(graph, kSsaDeadPhiEliminationPassName), 34 worklist_(graph->GetArena()->Adapter(kArenaAllocSsaPhiElimination)) { 61 explicit SsaRedundantPhiElimination(HGraph* graph) argument 62 : HOptimization(graph, kSsaRedundantPhiEliminationPassName), 63 worklist_(graph->GetArena()->Adapter(kArenaAllocSsaPhiElimination)) {
|
H A D | nodes_test.cc | 26 * Test that removing instruction from the graph removes itself from user lists 33 HGraph* graph = CreateGraph(&allocator); local 34 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); 35 graph->AddBlock(entry); 36 graph->SetEntryBlock(entry); 38 graph->GetDexFile(), 0, 0, Primitive::kPrimNot); 42 HBasicBlock* first_block = new (&allocator) HBasicBlock(graph); 43 graph->AddBlock(first_block); 49 HBasicBlock* exit_block = new (&allocator) HBasicBlock(graph); 50 graph 76 HGraph* graph = CreateGraph(&allocator); local 104 HGraph* graph = CreateGraph(&allocator); local 125 HGraph* graph = CreateGraph(&allocator); local [all...] |
H A D | graph_test.cc | 28 static HBasicBlock* createIfBlock(HGraph* graph, ArenaAllocator* allocator) { argument 29 HBasicBlock* if_block = new (allocator) HBasicBlock(graph); 30 graph->AddBlock(if_block); 31 HInstruction* instr = graph->GetIntConstant(4); 39 static HBasicBlock* createGotoBlock(HGraph* graph, ArenaAllocator* allocator) { argument 40 HBasicBlock* block = new (allocator) HBasicBlock(graph); 41 graph->AddBlock(block); 47 static HBasicBlock* createEntryBlock(HGraph* graph, ArenaAllocator* allocator) { argument 48 HBasicBlock* block = createGotoBlock(graph, allocator); 49 graph 53 createReturnBlock(HGraph* graph, ArenaAllocator* allocator) argument 61 createExitBlock(HGraph* graph, ArenaAllocator* allocator) argument 76 HGraph* graph = CreateGraph(&allocator); local 111 HGraph* graph = CreateGraph(&allocator); local 146 HGraph* graph = CreateGraph(&allocator); local 181 HGraph* graph = CreateGraph(&allocator); local 216 HGraph* graph = CreateGraph(&allocator); local 255 HGraph* graph = CreateGraph(&allocator); local 291 HGraph* graph = CreateGraph(&allocator); local [all...] |
H A D | constant_folding.h | 29 * Note that graph simplifications producing a constant should be 30 * implemented in art::HConstantFolding, while graph simplifications 42 HConstantFolding(HGraph* graph, const char* name = kConstantFoldingPassName) argument 43 : HOptimization(graph, name) {}
|
H A D | dex_cache_array_fixups_arm.h | 28 DexCacheArrayFixups(HGraph* graph, OptimizingCompilerStats* stats) argument 29 : HOptimization(graph, "dex_cache_array_fixups_arm", stats) {}
|
H A D | gvn.h | 29 GVNOptimization(HGraph* graph, argument 32 : HOptimization(graph, pass_name), side_effects_(side_effects) {}
|
H A D | instruction_simplifier.h | 29 * Note that graph simplifications producing a constant should be 30 * implemented in art::HConstantFolding, while graph simplifications 38 InstructionSimplifier(HGraph* graph, argument 41 : HOptimization(graph, name, stats) {}
|
H A D | load_store_elimination.h | 28 LoadStoreElimination(HGraph* graph, const SideEffectsAnalysis& side_effects) argument 29 : HOptimization(graph, kLoadStoreEliminationPassName),
|
H A D | pc_relative_fixups_x86.h | 31 PcRelativeFixups(HGraph* graph, CodeGenerator* codegen, OptimizingCompilerStats* stats) argument 32 : HOptimization(graph, "pc_relative_fixups_x86", stats),
|
H A D | select_generator.h | 50 HSelectGenerator(HGraph* graph, OptimizingCompilerStats* stats) argument 51 : HOptimization(graph, kSelectGeneratorPassName, stats) {}
|
H A D | builder.h | 37 HGraphBuilder(HGraph* graph, argument 47 : graph_(graph), 53 block_builder_(graph, dex_file, code_item), 54 ssa_builder_(graph, dex_compilation_unit->GetDexCache(), handles), 55 instruction_builder_(graph, 69 HGraphBuilder(HGraph* graph, argument 73 : graph_(graph), 80 block_builder_(graph, nullptr, code_item), 81 ssa_builder_(graph, null_dex_cache_, handles), 82 instruction_builder_(graph, [all...] |
H A D | register_allocator_test.cc | 41 HGraph* graph = CreateCFG(&allocator, data); local 44 x86::CodeGeneratorX86 codegen(graph, *features_x86.get(), CompilerOptions()); 45 SsaLivenessAnalysis liveness(graph, &codegen); 59 HGraph* graph = CreateGraph(&allocator); local 62 x86::CodeGeneratorX86 codegen(graph, *features_x86.get(), CompilerOptions()); 150 * Which becomes the following graph: 174 * Which becomes the following graph: 213 * Which becomes the following graph: 263 * Which becomes the following graph: 292 HGraph* graph local 326 HGraph* graph = CreateCFG(&allocator, data); local 380 HGraph* graph = CreateCFG(&allocator, data); local 404 HGraph* graph = CreateCFG(&allocator, data); local 460 HGraph* graph = CreateGraph(allocator); local 536 HGraph* graph = BuildIfElseWithPhi(&allocator, &phi, &input1, &input2); local 553 HGraph* graph = BuildIfElseWithPhi(&allocator, &phi, &input1, &input2); local 572 HGraph* graph = BuildIfElseWithPhi(&allocator, &phi, &input1, &input2); local 591 HGraph* graph = BuildIfElseWithPhi(&allocator, &phi, &input1, &input2); local 613 HGraph* graph = CreateGraph(allocator); local 654 HGraph* graph = BuildFieldReturn(&allocator, &field, &ret); local 669 HGraph* graph = BuildFieldReturn(&allocator, &field, &ret); local 690 HGraph* graph = CreateGraph(allocator); local 722 HGraph* graph = BuildTwoSubs(&allocator, &first_sub, &second_sub); local 738 HGraph* graph = BuildTwoSubs(&allocator, &first_sub, &second_sub); local 761 HGraph* graph = CreateGraph(allocator); local 791 HGraph* graph = BuildDiv(&allocator, &div); local 815 HGraph* graph = CreateGraph(&allocator); local [all...] |
H A D | instruction_simplifier_arm.h | 28 InstructionSimplifierArmVisitor(HGraph* graph, OptimizingCompilerStats* stats) argument 29 : HGraphVisitor(graph), stats_(stats) {} 48 InstructionSimplifierArm(HGraph* graph, OptimizingCompilerStats* stats) argument 49 : HOptimization(graph, "instruction_simplifier_arm", stats) {}
|
H A D | bounds_check_elimination.h | 29 BoundsCheckElimination(HGraph* graph, argument 32 : HOptimization(graph, kBoundsCheckEliminationPassName),
|
H A D | dead_code_elimination.h | 32 HDeadCodeElimination(HGraph* graph, argument 35 : HOptimization(graph, name, stats) {}
|
H A D | licm.h | 29 LICM(HGraph* graph, const SideEffectsAnalysis& side_effects, OptimizingCompilerStats* stats) argument 30 : HOptimization(graph, kLoopInvariantCodeMotionPassName, stats),
|
H A D | codegen_test.cc | 66 TestCodeGeneratorARM(HGraph* graph, argument 69 : arm::CodeGeneratorARM(graph, isa_features, compiler_options) { 86 TestCodeGeneratorX86(HGraph* graph, argument 89 : x86::CodeGeneratorX86(graph, isa_features, compiler_options) { 205 HGraph* graph, 209 GraphChecker graph_checker(graph); 218 SsaLivenessAnalysis liveness(graph, codegen); 220 PrepareForRegisterAllocation(graph).Run(); 222 RegisterAllocator(graph->GetArena(), codegen, liveness).AllocateRegisters(); 223 hook_before_codegen(graph); 204 RunCode(CodeGenerator* codegen, HGraph* graph, std::function<void(HGraph*)> hook_before_codegen, bool has_result, Expected expected) argument 231 RunCode(InstructionSet target_isa, HGraph* graph, std::function<void(HGraph*)> hook_before_codegen, bool has_result, Expected expected) argument 298 HGraph* graph = CreateCFG(&arena, data); local 311 HGraph* graph = CreateCFG(&arena, data, Primitive::kPrimLong); local 635 HGraph* graph = CreateGraph(&allocator); local 697 HGraph* graph = CreateGraph(&allocator); local 745 HGraph* graph = CreateGraph(&allocator); local 826 HGraph* graph = CreateGraph(&allocator); local [all...] |
H A D | dead_code_elimination_test.cc | 36 HGraph* graph = CreateCFG(&allocator, data); local 37 ASSERT_NE(graph, nullptr); 39 StringPrettyPrinter printer_before(graph); 46 x86::CodeGeneratorX86 codegenX86(graph, *features_x86.get(), CompilerOptions()); 47 HDeadCodeElimination(graph).Run(); 48 GraphChecker graph_checker(graph); 52 StringPrettyPrinter printer_after(graph);
|
H A D | optimization.h | 31 HOptimization(HGraph* graph, argument 34 : graph_(graph),
|
H A D | sharpening.h | 35 HSharpening(HGraph* graph, argument 39 : HOptimization(graph, kSharpeningPassName),
|
H A D | graph_checker.h | 26 // A control-flow graph visitor performing various checks. 29 explicit GraphChecker(HGraph* graph, const char* dump_prefix = "art::GraphChecker: ") argument 30 : HGraphDelegateVisitor(graph), 31 errors_(graph->GetArena()->Adapter(kArenaAllocGraphChecker)), 33 seen_ids_(graph->GetArena(), 34 graph->GetCurrentInstructionId(), 37 blocks_storage_(graph->GetArena()->Adapter(kArenaAllocGraphChecker)), 38 visited_storage_(graph->GetArena(), 0u, true, kArenaAllocGraphChecker) {} 40 // Check the whole graph (in reverse post-order). 76 // Was the last visit of the graph vali [all...] |