Searched refs:predecessor_count (Results 1 – 4 of 4) sorted by relevance
182 auto predecessor_count = CountBlockPredecessors(cfg_); in OptimizeCfg() local186 if (predecessor_count[block->id()] == 0) continue; in OptimizeCfg()194 DCHECK_GT(predecessor_count[destination->id()], 0); in OptimizeCfg()195 if (predecessor_count[destination->id()] != 1) break; in OptimizeCfg()203 --predecessor_count[destination->id()]; in OptimizeCfg()204 DCHECK_EQ(predecessor_count[destination->id()], 0); in OptimizeCfg()209 [&](Block* b) { return predecessor_count[b->id()] == 0; }); in OptimizeCfg()
274 int predecessor_count = static_cast<int>(block->PredecessorCount()); in MakeReschedulable() local275 for (int i = 0; i < predecessor_count; ++i) { in MakeReschedulable()282 current_control = graph()->NewNode(common()->Merge(predecessor_count), in MakeReschedulable()287 common()->EffectPhi(predecessor_count), in MakeReschedulable()
362 int predecessor_count = static_cast<int>(block->PredecessorCount()); in EliminateRedundantPhiNodes() local368 for (int i = 1; i < predecessor_count; ++i) { in EliminateRedundantPhiNodes()
1149 int predecessor_count = phi->InputCount() - 1; in UpdateStateForPhi() local1158 for (int i = 1; i < predecessor_count; i++) { in UpdateStateForPhi()