120   int const input_count = node->InputCount();  in Clone()
153     int input_count = InputCount();  in AppendInput()
187   DCHECK_LT(index, InputCount());  in InsertInput()
188   AppendInput(zone, InputAt(InputCount() - 1));  in InsertInput()
189   for (int i = InputCount() - 1; i > index; --i) {  in InsertInput()
200   DCHECK_LT(index, InputCount());  in InsertInputs()
202     AppendInput(zone, InputAt(Max(InputCount() - count, 0)));  in InsertInputs()
204   for (int i = InputCount() - count - 1; i >= Max(index, count); --i) {  in InsertInputs()
215   DCHECK_LT(index, InputCount());  in RemoveInput()
216   for (; index < InputCount() - 1; ++index) {  in RemoveInput()
219   TrimInputCount(InputCount() - 1);  in RemoveInput()
239 void Node::NullAllInputs() { ClearInputs(0, InputCount()); }  in NullAllInputs()
243   int current_count = InputCount();  in TrimInputCount()
309   if (n.InputCount() > 0) {  in operator <<()
311     for (int i = 0; i < n.InputCount(); ++i) {  in operator <<()
365   int count = this->InputCount();  in Verify()
373     DCHECK_EQ(count, this->InputCount());  in Verify()
382     DCHECK_EQ(this->InputCount(), index);  in Verify()
393     DCHECK_EQ(this->InputCount(), index);  in Verify()