Lines Matching refs:predecessor
169 // for each predecessor, replacing the phi node with the corresponding phi
195 BasicBlock* predecessor = block->PredecessorAt(j);
196 predecessor->ClearSuccessors();
197 if (block->deferred()) predecessor->set_deferred(true);
210 DCHECK_EQ(predecessor->control(), BasicBlock::kGoto);
211 predecessor->set_control(BasicBlock::kNone);
212 schedule->AddBranch(predecessor, branch_clone, new_true_block,
265 BasicBlock* predecessor = block->PredecessorAt(0);
266 DCHECK_LT(predecessor->rpo_number(), block->rpo_number());
267 current_effect = block_final_effect[predecessor->id().ToSize()];
268 current_control = block_final_control[predecessor->id().ToSize()];
270 // Create control merge nodes and effect phis for all predecessor blocks.
275 BasicBlock* predecessor = block->PredecessorAt(i);
276 DCHECK_LT(predecessor->rpo_number(), block->rpo_number());
277 merge_inputs.push_back(block_final_control[predecessor->id().ToSize()]);
279 block_final_effect[predecessor->id().ToSize()]);
339 BasicBlock* predecessor = block->PredecessorAt(i);
340 if (block->LoopContains(predecessor)) {
341 loop_backedges.push_back(predecessor);
344 loop_entries.push_back(predecessor);
387 for (BasicBlock* predecessor : predecessors) {
388 inputs.push_back(sidetable[predecessor->id().ToSize()]);