91   int live_input_count = 0;  in ReduceEnd()  local
97     if (i != live_input_count) node->ReplaceInput(live_input_count, input);  in ReduceEnd()
98     ++live_input_count;  in ReduceEnd()
100   if (live_input_count == 0) {  in ReduceEnd()
102   } else if (live_input_count < inputs.count()) {  in ReduceEnd()
103     node->TrimInputCount(live_input_count);  in ReduceEnd()
104     NodeProperties::ChangeOp(node, common()->End(live_input_count));  in ReduceEnd()
107   DCHECK_EQ(inputs.count(), live_input_count);  in ReduceEnd()
120   int live_input_count = 0;  in ReduceLoopOrMerge()  local
128       if (live_input_count != i) {  in ReduceLoopOrMerge()
129         node->ReplaceInput(live_input_count, input);  in ReduceLoopOrMerge()
133             use->ReplaceInput(live_input_count, use->InputAt(i));  in ReduceLoopOrMerge()
137       ++live_input_count;  in ReduceLoopOrMerge()
140   if (live_input_count == 0) {  in ReduceLoopOrMerge()
142   } else if (live_input_count == 1) {  in ReduceLoopOrMerge()
165   DCHECK_LE(2, live_input_count);  in ReduceLoopOrMerge()
166   DCHECK_LE(live_input_count, inputs.count());  in ReduceLoopOrMerge()
168   if (live_input_count < inputs.count()) {  in ReduceLoopOrMerge()
172         use->ReplaceInput(live_input_count, node);  in ReduceLoopOrMerge()
173         TrimMergeOrPhi(use, live_input_count);  in ReduceLoopOrMerge()
177     TrimMergeOrPhi(node, live_input_count);  in ReduceLoopOrMerge()