85         for (Node* const use : node->uses()) {  in ReduceLoopOrMerge()
86           if (NodeProperties::IsPhi(use)) {  in ReduceLoopOrMerge()
87             DCHECK_EQ(inputs.count() + 1, use->InputCount());  in ReduceLoopOrMerge()
88             use->ReplaceInput(live_input_count, use->InputAt(i));  in ReduceLoopOrMerge()
99     for (Node* const use : node->uses()) {  in ReduceLoopOrMerge()
100       if (NodeProperties::IsPhi(use)) {  in ReduceLoopOrMerge()
101         Replace(use, use->InputAt(0));  in ReduceLoopOrMerge()
102       } else if (use->opcode() == IrOpcode::kLoopExit &&  in ReduceLoopOrMerge()
103                  use->InputAt(1) == node) {  in ReduceLoopOrMerge()
104         RemoveLoopExit(use);  in ReduceLoopOrMerge()
105       } else if (use->opcode() == IrOpcode::kTerminate) {  in ReduceLoopOrMerge()
107         Replace(use, dead());  in ReduceLoopOrMerge()
117     for (Node* const use : node->uses()) {  in ReduceLoopOrMerge()
118       if (NodeProperties::IsPhi(use)) {  in ReduceLoopOrMerge()
119         use->ReplaceInput(live_input_count, node);  in ReduceLoopOrMerge()
120         TrimMergeOrPhi(use, live_input_count);  in ReduceLoopOrMerge()
121         Revisit(use);  in ReduceLoopOrMerge()
132   for (Node* const use : node->uses()) {  in RemoveLoopExit()
133     if (use->opcode() == IrOpcode::kLoopExitValue ||  in RemoveLoopExit()
134         use->opcode() == IrOpcode::kLoopExitEffect) {  in RemoveLoopExit()
135       Replace(use, use->InputAt(0));  in RemoveLoopExit()