Lines Matching refs:use
276 for (Node* use : node->uses()) {
277 if (NodeProperties::IsPhi(use)) {
278 SetLoopMark(use, loop_num);
284 if (use->opcode() == IrOpcode::kLoopExit) {
285 SetLoopMark(use, loop_num);
286 for (Node* exit_use : use->uses()) {
332 Node* use = edge.from();
333 if (!IsBackedge(use, edge.index())) {
334 if (PropagateForwardMarks(node, use)) Queue(use);
350 bool IsBackedge(Node* use, int index) {
351 if (LoopNum(use) <= 0) return false;
352 if (NodeProperties::IsPhi(use)) {
353 return index != NodeProperties::FirstControlIndex(use) &&
355 } else if (use->opcode() == IrOpcode::kLoop) {
358 DCHECK(IsLoopExitNode(use));
580 ENQUEUE_USES(use, true);
586 ENQUEUE_USES(use, (use->opcode() == IrOpcode::kLoopExitEffect ||
587 use->opcode() == IrOpcode::kLoopExitValue))
603 ENQUEUE_USES(use, true)
607 ENQUEUE_USES(use, true);
638 ENQUEUE_USES(use, true)
642 ENQUEUE_USES(use, true)
681 for (Node* use : node->uses()) {
682 if (!loop_tree->Contains(loop, use)) {
693 unmarked_exit = (use->opcode() != IrOpcode::kTerminate);
699 "(%s) is inside loop, but its use %i (%s) is outside.\n",
700 loop_node->id(), node->id(), node->op()->mnemonic(), use->id(),
701 use->op()->mnemonic());