Searched refs:input_edges (Results 1 – 8 of 8) sorted by relevance
102 if (entry.input != node->input_edges().end()) { in RunUndirectedDFS()153 if (entry.input != node->input_edges().end()) { in RunUndirectedDFS()162 DCHECK(entry.input == node->input_edges().end()); in RunUndirectedDFS()197 Node::InputEdges::iterator input = node->input_edges().begin(); in DFSPush()
634 for (Edge edge : node->input_edges()) { in RevisitInputs()694 for (Edge edge : node->input_edges()) { in IsAllocationPhi()921 for (Edge edge : node->input_edges()) { in AssignAliases()1078 for (Edge edge : node->input_edges()) { in ProcessAllocationUsers()
142 for (Edge const edge : node->input_edges()) { in UpdatePlacement()1202 stack.push(node->input_edges().begin()); in PrepareUses()1208 if (++stack.top() == edge.from()->input_edges().end()) stack.pop(); in PrepareUses()1212 if (node->InputCount() > 0) stack.push(node->input_edges().begin()); in PrepareUses()
353 for (Edge edge : this->input_edges()) { in Verify()
126 InputEdges input_edges() { return InputEdges(this); } in input_edges() function
400 for (Edge edge : input->input_edges()) { in AddOperandToStateValueDescriptor()
127 for (Edge edge : graph()->end()->input_edges()) { in EndGraph()
107 for (Edge edge : node->input_edges()) { in SetSelfReferences()