/art/compiler/optimizing/ |
D | dead_code_elimination.cc | 65 ArenaAllocator* allocator = graph_->GetArena(); in RemoveDeadBlocks() 66 ArenaBitVector live_blocks(allocator, graph_->GetBlocks().Size(), false); in RemoveDeadBlocks() 67 ArenaBitVector affected_loops(allocator, graph_->GetBlocks().Size(), false); in RemoveDeadBlocks() 69 MarkReachableBlocks(graph_->GetEntryBlock(), &live_blocks); in RemoveDeadBlocks() 75 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in RemoveDeadBlocks() 94 graph_->ClearDominanceInformation(); in RemoveDeadBlocks() 95 graph_->ComputeDominanceInformation(); in RemoveDeadBlocks() 99 for (HReversePostOrderIterator it(*graph_); !it.Done();) { in RemoveDeadBlocks() 119 for (HPostOrderIterator b(*graph_); !b.Done(); b.Advance()) { in RemoveDeadInstructions()
|
D | optimization.cc | 33 SSAChecker checker(graph_->GetArena(), graph_); in Check() 40 GraphChecker checker(graph_->GetArena(), graph_); in Check()
|
D | inliner.cc | 47 if (graph_->IsDebuggable()) { in Run() 52 const GrowableArray<HBasicBlock*>& blocks = graph_->GetReversePostOrder(); in Run() 171 HGraph* callee_graph = new (graph_->GetArena()) HGraph( in TryBuildAndInline() 172 graph_->GetArena(), in TryBuildAndInline() 176 graph_->IsDebuggable(), in TryBuildAndInline() 177 graph_->GetCurrentInstructionId()); in TryBuildAndInline() 281 callee_graph->InlineInto(graph_, invoke_instruction); in TryBuildAndInline() 284 graph_->SetHasBoundsChecks(true); in TryBuildAndInline()
|
D | side_effects_analysis.cc | 24 block_effects_.SetSize(graph_->GetBlocks().Size()); in Run() 25 loop_effects_.SetSize(graph_->GetBlocks().Size()); in Run() 28 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in Run() 40 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in Run()
|
D | ssa_liveness_analysis.cc | 72 GrowableArray<uint32_t> forward_predecessors(graph_->GetArena(), graph_->GetBlocks().Size()); in LinearizeGraph() 73 forward_predecessors.SetSize(graph_->GetBlocks().Size()); in LinearizeGraph() 74 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in LinearizeGraph() 87 GrowableArray<HBasicBlock*> worklist(graph_->GetArena(), 1); in LinearizeGraph() 88 worklist.Add(graph_->GetEntryBlock()); in LinearizeGraph() 91 graph_->linear_order_.Add(current); in LinearizeGraph() 116 for (HLinearOrderIterator it(*graph_); !it.Done(); it.Advance()) { in NumberInstructions() 128 LiveInterval::MakeInterval(graph_->GetArena(), current->GetType(), current)); in NumberInstructions() 146 LiveInterval::MakeInterval(graph_->GetArena(), current->GetType(), current)); in NumberInstructions() 159 for (HLinearOrderIterator it(*graph_); !it.Done(); it.Advance()) { in ComputeLiveness() [all …]
|
D | builder.cc | 45 explicit Temporaries(HGraph* graph) : graph_(graph), index_(0) {} in Temporaries() 48 HInstruction* temp = new (graph_->GetArena()) HTemporary(index_); in Add() 62 graph_->UpdateTemporariesVRegSlots(index_); in Add() 66 HGraph* const graph_; member in art::Temporaries 141 graph_->SetNumberOfVRegs(count); in InitializeLocals() 156 graph_->SetNumberOfInVRegs(number_of_parameters); in InitializeParameters() 218 T* comparison = new (arena_) T(value, graph_->GetIntConstant(0)); in If_21t() 263 DCHECK(graph_->GetBlocks().IsEmpty()); in BuildGraph() 270 entry_block_ = new (arena_) HBasicBlock(graph_, 0); in BuildGraph() 271 graph_->AddBlock(entry_block_); in BuildGraph() [all …]
|
D | primitive_type_propagation.h | 28 : graph_(graph), worklist_(graph->GetArena(), kDefaultWorklistSize) {} in PrimitiveTypePropagation() 39 HGraph* const graph_; variable
|
D | optimization.h | 34 : graph_(graph), in graph_() function 53 HGraph* const graph_; variable
|
D | side_effects_analysis.h | 29 graph_(graph), in SideEffectsAnalysis() 46 HGraph* graph_; variable
|
D | licm.cc | 83 ArenaBitVector visited(graph_->GetArena(), graph_->GetBlocks().Size(), false); in Run() 86 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in Run()
|
D | gvn.cc | 306 : graph_(graph), in GlobalValueNumberer() 318 HGraph* graph_; member in art::GlobalValueNumberer 332 sets_.Put(graph_->GetEntryBlock()->GetBlockId(), new (allocator_) ValueSet(allocator_)); in Run() 336 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in Run() 405 GlobalValueNumberer gvn(graph_->GetArena(), graph_, side_effects_); in Run()
|
D | ssa_phi_elimination.cc | 28 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in MarkDeadPhis() 63 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in EliminateDeadPhis() 102 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in Run()
|
D | graph_visualizer.h | 45 HGraph* const graph_; variable
|
D | builder.h | 49 graph_(graph), in HGraphBuilder() 67 graph_(graph), 249 HGraph* const graph_; variable
|
D | graph_visualizer.cc | 352 : output_(output), graph_(graph), codegen_(codegen) {} in HGraphVisualizer() 356 HGraphVisualizerPrinter printer(graph_, *output_, "", true, codegen_); in PrintHeader() 366 if (!graph_->GetBlocks().IsEmpty()) { in DumpGraph() 367 HGraphVisualizerPrinter printer(graph_, *output_, pass_name, is_after_pass, codegen_); in DumpGraph()
|
D | constant_folding.cc | 42 InstructionWithAbsorbingInputSimplifier simplifier(graph_); in Run() 47 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in Run()
|
D | reference_type_propagation.cc | 30 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in Run() 98 bound_type = new (graph_->GetArena()) HBoundType(obj, ReferenceTypeInfo::CreateTop(false)); in BoundTypeForIfNotNull() 157 bound_type = new (graph_->GetArena()) HBoundType(obj, class_rti); in BoundTypeForIfInstanceOf()
|
D | nodes.h | 491 : graph_(graph), in graph_() function 516 return graph_->GetEntryBlock() == this; in IsEntryBlock() 520 return graph_->GetExitBlock() == this; in IsExitBlock() 527 loop_information_ = new (graph_->GetArena()) HLoopInformation(this, graph_); in AddBackEdge() 533 HGraph* GetGraph() const { return graph_; } in GetGraph() 534 void SetGraph(HGraph* graph) { graph_ = graph; } in SetGraph() 759 HGraph* graph_; 3948 explicit HGraphVisitor(HGraph* graph) : graph_(graph) {} in HGraphVisitor() 3960 HGraph* GetGraph() const { return graph_; } in GetGraph() 3971 HGraph* const graph_; [all …]
|
D | code_generator.h | 139 HGraph* GetGraph() const { return graph_; } in GetGraph() 355 graph_(graph), in CodeGenerator() 442 HGraph* const graph_; variable
|
D | primitive_type_propagation.cc | 81 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in Run()
|
D | code_generator.cc | 536 for (size_t i = 0; i < graph_->GetBlocks().Size(); ++i) { in BuildMappingTable() 537 HBasicBlock* block = graph_->GetBlocks().Get(i); in BuildMappingTable() 575 for (size_t i = 0; i < graph_->GetBlocks().Size(); ++i) { in BuildMappingTable() 576 HBasicBlock* block = graph_->GetBlocks().Get(i); in BuildMappingTable() 603 for (size_t i = 0; i < graph_->GetBlocks().Size(); ++i) { in BuildMappingTable() 604 HBasicBlock* block = graph_->GetBlocks().Get(i); in BuildMappingTable()
|
D | ssa_builder.cc | 38 : graph_(graph), worklist_(graph->GetArena(), kDefaultWorklistSize) {} in DeadPhiHandling() 49 HGraph* const graph_; member in art::DeadPhiHandling 165 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in Run()
|
D | boolean_simplifier.cc | 155 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in Run()
|
D | nodes.cc | 793 const GrowableArray<HBasicBlock*>& blocks = graph_->GetBlocks(); in FOR_EACH_INSTRUCTION() 803 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in VisitReversePostOrder() 1045 predecessor->AddInstruction(new (graph_->GetArena()) HGoto()); in DisconnectAndDelete() 1089 graph_->DeleteDeadBlock(this); in DisconnectAndDelete() 1139 graph_->DeleteDeadBlock(other); in MergeWith() 1172 other->graph_ = nullptr; in MergeWithInlined() 1190 graph_ = nullptr; in ReplaceWith()
|
D | intrinsics.cc | 333 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in Run()
|