Home
last modified time | relevance | path

Searched refs:HasIrreducibleLoops (Results 1 – 13 of 13) sorted by relevance

/art/compiler/optimizing/
Dlinear_order.cc130 DCHECK(graph->HasIrreducibleLoops() || IsLinearOrderWellFormed(graph, linear_order)); in LinearizeGraphInternal()
Dpc_relative_fixups_x86.cc163 bool has_irreducible_loops = GetGraph()->HasIrreducibleLoops(); in GetPCRelativeBasePointer()
Dregister_allocation_resolver.cc413 return instruction->GetBlock()->GetGraph()->HasIrreducibleLoops() && in IsMaterializableEntryBlockInstructionOfGraphWithIrreducibleLoop()
438 if (codegen_->GetGraph()->HasIrreducibleLoops() && in ConnectSplitSiblings()
462 if (codegen_->GetGraph()->HasIrreducibleLoops() && in ConnectSplitSiblings()
Ddead_code_elimination.cc515 if (!graph_->HasIrreducibleLoops()) { in Run()
Dgvn.cc320 if (!pure || instruction->GetBlock()->GetGraph()->HasIrreducibleLoops()) { in HashCode()
Dssa_builder.cc441 DCHECK(graph_->HasIrreducibleLoops()); in ReplaceUninitializedStringPhis()
Dload_store_elimination.cc142 !GetGraph()->HasIrreducibleLoops())) { in FindOrAddTypeConversionIfNecessary()
Dssa_liveness_analysis.h1050 if (block_at_use.GetGraph()->HasIrreducibleLoops()) { in AddBackEdgeUses()
Dsuperblock_cloner.cc859 if (graph_->HasIrreducibleLoops() || graph_->HasTryCatch()) { in IsSubgraphClonable()
Dnodes.cc2450 if (HasIrreducibleLoops()) { in InlineInto()
2592 DCHECK(!outer_graph->HasIrreducibleLoops()) in InlineInto()
Dinliner.cc1890 } else if (graph_->HasIrreducibleLoops()) { in CanInlineBody()
Dloop_optimization.cc498 if (!graph_->HasLoops() || graph_->HasTryCatch() || graph_->HasIrreducibleLoops()) { in Run()
Dnodes.h677 bool HasIrreducibleLoops() const { return has_irreducible_loops_; } in HasIrreducibleLoops() function