HomeSort by relevance Sort by last modified time
    Searched refs:HasIrreducibleLoops (Results 1 - 14 of 14) sorted by null

  /art/compiler/optimizing/
linear_order.cc 130 DCHECK(graph->HasIrreducibleLoops() || IsLinearOrderWellFormed(graph, linear_order));
pc_relative_fixups_mips.cc 137 if (graph_->HasIrreducibleLoops()) {
pc_relative_fixups_x86.cc 169 bool has_irreducible_loops = GetGraph()->HasIrreducibleLoops();
register_allocation_resolver.cc 413 return instruction->GetBlock()->GetGraph()->HasIrreducibleLoops() &&
438 if (codegen_->GetGraph()->HasIrreducibleLoops() &&
462 if (codegen_->GetGraph()->HasIrreducibleLoops() &&
dead_code_elimination.cc 515 if (!graph_->HasIrreducibleLoops()) {
gvn.cc 308 if (!pure || instruction->GetBlock()->GetGraph()->HasIrreducibleLoops()) {
superblock_cloner.cc 576 if (graph_->HasIrreducibleLoops() || graph_->HasTryCatch()) {
load_store_elimination.cc 185 !GetGraph()->HasIrreducibleLoops())) {
    [all...]
ssa_liveness_analysis.h     [all...]
nodes.cc     [all...]
code_generator_mips.cc     [all...]
inliner.cc     [all...]
loop_optimization.cc 441 if (!graph_->HasLoops() || graph_->HasTryCatch() || graph_->HasIrreducibleLoops()) {
    [all...]
nodes.h 597 bool HasIrreducibleLoops() const { return has_irreducible_loops_; }
    [all...]

Completed in 189 milliseconds