Lines Matching refs:use
58 // LoopExit node in the peeled iteration, use its control input instead.
63 Node* use = use_edge.from();
64 if (loop->count(use) == 1) {
68 DCHECK(use->opcode() == IrOpcode::kLoopExitEffect ||
69 use->opcode() == IrOpcode::kLoopExitValue);
71 use->opcode() == IrOpcode::kLoopExitEffect
73 : common->Phi(LoopExitValueRepresentationOf(use->op()), 2);
74 Node* phi = graph->NewNode(phi_operator, use,
75 copier.map(use)->InputAt(0), merge_node);
76 use->ReplaceUses(phi);
78 phi->ReplaceInput(0, use);
79 copier.map(use)->Kill();
80 } else if (use != merge_node) {
82 use->ReplaceInput(use_edge.index(), merge_node);
90 // should use the value coming from outside the loop.