Lines Matching refs:node
40 // node, except Terminate nodes which will be deleted anyway.
41 for (Node* node : copied_nodes) {
42 if (IrOpcode::IsGraphTerminator(node->opcode()) &&
43 node->opcode() != IrOpcode::kTerminate && node->UseCount() == 0) {
44 NodeProperties::MergeControlToEnd(graph, common, node);
49 for (Node* node : loop_node->uses()) {
50 // We do not need the Terminate node for the peeled iteration.
51 if (node->opcode() == IrOpcode::kTerminate) {
52 copier.map(node)->Kill();
55 if (node->opcode() != IrOpcode::kLoopExit) continue;
56 DCHECK_EQ(node->InputAt(1), loop_node);
57 // Create a merge node for the peeled iteration and main loop. Skip the
58 // LoopExit node in the peeled iteration, use its control input instead.
60 graph->NewNode(common->Merge(2), node, copier.map(node)->InputAt(0));
61 // Replace all uses of the loop exit with the merge node.
62 for (Edge use_edge : node->use_edges()) {
85 copier.map(node)->Kill();
99 // We are now left with an unconnected subgraph of the peeled Loop node and
104 // We are reusing the Loop node of the peeled iteration and its phis as the