Lines Matching refs:node
44 // node, except Terminate nodes which will be deleted anyway.
45 for (Node* node : copies) {
46 if (IrOpcode::IsGraphTerminator(node->opcode()) &&
47 node->opcode() != IrOpcode::kTerminate && node->UseCount() == 0) {
48 NodeProperties::MergeControlToEnd(graph, common, node);
52 #define COPY(node, n) copier.map(node, n)
55 for (Node* node : loop_node->uses()) {
56 switch (node->opcode()) {
60 Node* stack_check = node->InputAt(0);
65 COPY(node, i)->ReplaceInput(0,
102 if (node->InputAt(1) == loop_node) {
103 // Create a merge node from all iteration exits.
105 merge_inputs[0] = node;
107 merge_inputs[i] = COPY(node, i - 1);
111 // Replace all uses of the loop exit with the merge node.
112 for (Edge use_edge : node->use_edges()) {
117 // iterations. Its merge will be the merge node for LoopExits.
148 // We only need to keep the Terminate node for the loop header of the
150 FOREACH_COPY_INDEX(i) { COPY(node, i)->Kill(); }