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