/art/compiler/optimizing/ |
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 | 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 | prepare_for_register_allocation.h | 25 * A simplification pass over the graph before doing register allocation. 31 explicit PrepareForRegisterAllocation(HGraph* graph) : HGraphDelegateVisitor(graph) {} argument
|
H A D | select_generator.h | 50 HSelectGenerator(HGraph* graph, OptimizingCompilerStats* stats) argument 51 : HOptimization(graph, kSelectGeneratorPassName, 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 | gvn.h | 29 GVNOptimization(HGraph* graph, argument 32 : HOptimization(graph, pass_name), side_effects_(side_effects) {}
|
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 | licm.h | 29 LICM(HGraph* graph, const SideEffectsAnalysis& side_effects, OptimizingCompilerStats* stats) argument 30 : HOptimization(graph, kLoopInvariantCodeMotionPassName, stats),
|
H A D | linearize_test.cc | 42 HGraph* graph = CreateCFG(&allocator, data); local 45 x86::CodeGeneratorX86 codegen(graph, *features_x86.get(), CompilerOptions()); 46 SsaLivenessAnalysis liveness(graph, &codegen); 49 ASSERT_EQ(graph->GetLinearOrder().size(), number_of_blocks); 51 ASSERT_EQ(graph->GetLinearOrder()[i]->GetBlockId(), expected_order[i]); 56 // Structure of this graph (+ are back edges) 81 // Structure of this graph (+ are back edges) 106 // Structure of this graph (+ are back edges) 133 /* Structure of this graph (+ are back edges) 163 /* Structure of this graph ( [all...] |
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 | 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 | suspend_check_test.cc | 34 HGraph* graph = CreateCFG(&allocator, data); local 35 HBasicBlock* first_block = graph->GetEntryBlock()->GetSingleSuccessor();
|
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 | dex_cache_array_fixups_arm.cc | 30 explicit DexCacheArrayFixupsVisitor(HGraph* graph) argument 31 : HGraphVisitor(graph), 34 graph->GetArena()->Adapter(kArenaAllocCodeGenerator)) {}
|
H A D | dominator_test.cc | 32 HGraph* graph = CreateCFG(&allocator, data); local 33 ASSERT_EQ(graph->GetBlocks().size(), blocks_length); 36 if (graph->GetBlocks()[i] == nullptr) { 40 ASSERT_EQ(nullptr, graph->GetBlocks()[i]->GetDominator()); 41 ASSERT_TRUE(graph->GetBlocks()[i]->IsEntryBlock()); 44 ASSERT_NE(nullptr, graph->GetBlocks()[i]->GetDominator()); 45 ASSERT_EQ(blocks[i], graph->GetBlocks()[i]->GetDominator()->GetBlockId());
|
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 | instruction_simplifier_arm64.h | 28 InstructionSimplifierArm64Visitor(HGraph* graph, OptimizingCompilerStats* stats) argument 29 : HGraphVisitor(graph), stats_(stats) {} 88 InstructionSimplifierArm64(HGraph* graph, OptimizingCompilerStats* stats) argument 89 : HOptimization(graph, "instruction_simplifier_arm64", stats) {}
|
H A D | live_ranges_test.cc | 35 HGraph* graph = CreateCFG(allocator, data); local 38 RemoveSuspendChecks(graph); 40 PrepareForRegisterAllocation(graph).Run(); 41 return graph; 49 * Which becomes the following graph (numbered by lifetime position): 63 HGraph* graph = BuildGraph(data, &allocator); local 67 x86::CodeGeneratorX86 codegen(graph, *features_x86.get(), CompilerOptions()); 68 SsaLivenessAnalysis liveness(graph, &codegen); 76 HBasicBlock* block = graph->GetBlocks()[1]; 91 * Which becomes the following graph (numbere 112 HGraph* graph = BuildGraph(data, &allocator); local 163 HGraph* graph = BuildGraph(data, &allocator); local 241 HGraph* graph = BuildGraph(data, &allocator); local 321 HGraph* graph = BuildGraph(data, &allocator); local 399 HGraph* graph = BuildGraph(data, &allocator); local [all...] |
H A D | optimization.h | 31 HOptimization(HGraph* graph, argument 34 : graph_(graph),
|
H A D | pretty_printer.h | 27 explicit HPrettyPrinter(HGraph* graph) : HGraphVisitor(graph) { } argument 106 explicit StringPrettyPrinter(HGraph* graph) argument 107 : HPrettyPrinter(graph), str_(""), current_block_(nullptr) { }
|
H A D | pretty_printer_test.cc | 33 HGraph* graph = CreateCFG(&allocator, data); local 34 StringPrettyPrinter printer(graph);
|
H A D | sharpening.h | 35 HSharpening(HGraph* graph, argument 39 : HOptimization(graph, kSharpeningPassName),
|