Home
last modified time | relevance | path

Searched refs:input_edges (Results 1 – 8 of 8) sorted by relevance

/external/v8/src/compiler/
Dcontrol-equivalence.cc102 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()
Descape-analysis.cc634 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()
Dscheduler.cc142 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()
Dnode.cc353 for (Edge edge : this->input_edges()) { in Verify()
Dnode.h126 InputEdges input_edges() { return InputEdges(this); } in input_edges() function
Dinstruction-selector.cc400 for (Edge edge : input->input_edges()) { in AddOperandToStateValueDescriptor()
/external/v8/test/unittests/compiler/
Descape-analysis-unittest.cc127 for (Edge edge : graph()->end()->input_edges()) { in EndGraph()
/external/v8/test/cctest/compiler/
Dtest-loop-analysis.cc107 for (Edge edge : node->input_edges()) { in SetSelfReferences()