Searched refs:HasIrreducibleLoops (Results 1 – 14 of 14) sorted by relevance
130 DCHECK(graph->HasIrreducibleLoops() || IsLinearOrderWellFormed(graph, linear_order)); in LinearizeGraphInternal()
413 return instruction->GetBlock()->GetGraph()->HasIrreducibleLoops() && in IsMaterializableEntryBlockInstructionOfGraphWithIrreducibleLoop()438 if (codegen_->GetGraph()->HasIrreducibleLoops() && in ConnectSplitSiblings()462 if (codegen_->GetGraph()->HasIrreducibleLoops() && in ConnectSplitSiblings()
163 bool has_irreducible_loops = GetGraph()->HasIrreducibleLoops(); in GetPCRelativeBasePointer()
132 if (GetGraph()->HasIrreducibleLoops() && !GetGraph()->HasLoops()) { in CheckGraphFlags()134 StrBool(GetGraph()->HasIrreducibleLoops()), in CheckGraphFlags()138 if (GetGraph()->HasIrreducibleLoops() != flag_info_.seen_irreducible_loop) { in CheckGraphFlags()142 StrBool(GetGraph()->HasIrreducibleLoops()), in CheckGraphFlags()
320 if (!pure || instruction->GetBlock()->GetGraph()->HasIrreducibleLoops()) { in HashCode()
441 DCHECK(graph_->HasIrreducibleLoops()); in ReplaceUninitializedStringPhis()
980 if (!graph_->HasIrreducibleLoops()) { in Run()
2002 if (!last_instruction->IsThrow() && graph_->HasIrreducibleLoops()) { in CanInlineBody()2022 } else if (graph_->HasIrreducibleLoops()) { in CanInlineBody()
857 if (graph_->HasIrreducibleLoops()) { in IsSubgraphClonable()
1048 if (block_at_use.GetGraph()->HasIrreducibleLoops()) { in AddBackEdgeUses()
259 DCHECK(!HasIrreducibleLoops()) << "Recomputing loop information in graphs with irreducible loops " in RecomputeDominatorTree()2684 if (HasIrreducibleLoops()) { in InlineInto()
602 !GetGraph()->HasIrreducibleLoops())) { in FindOrAddTypeConversionIfNecessary()
545 if (!graph_->HasLoops() || graph_->HasIrreducibleLoops()) { in Run()
720 bool HasIrreducibleLoops() const { return has_irreducible_loops_; } in HasIrreducibleLoops() function