Lines Matching defs:input
98 if (entry.input != node->input_edges().end()) {
99 Edge edge = *entry.input;
100 Node* input = edge.to();
101 ++(entry.input);
103 // Visit next control input.
104 if (!Participates(input)) continue;
105 if (GetData(input)->visited) continue;
106 if (GetData(input)->on_stack) {
107 // Found backedge if input is on stack.
108 if (input != entry.parent_node) {
109 VisitBackedge(node, input, kInputDirection);
112 // Push input onto stack.
113 DFSPush(stack, input, node, kInputDirection);
114 VisitPre(input);
149 if (entry.input != node->input_edges().end()) {
158 DCHECK(entry.input == node->input_edges().end());
193 Node::InputEdges::iterator input = node->input_edges().begin();
195 stack.push({dir, input, use, from, node});