Lines Matching refs:copy
63 // Make a copy of the graph for each outer loop.
78 // The outer loops are dead in this copy.
88 // Copy all nodes.
91 Node* copy = mapping->at(orig->id());
92 if (copy != sentinel) {
99 // No need to copy leaf nodes or parameters.
104 // Copy the node.
109 copy = graph->NewNode(orig->op(), orig->InputCount(), &tmp_inputs[0]);
111 NodeProperties::SetType(copy, NodeProperties::GetType(orig));
113 mapping->at(orig->id()) = copy;
114 TRACE(" copy #%d:%s -> #%d\n", orig->id(), orig->op()->mnemonic(),
115 copy->id());
120 Node* copy = mapping->at(orig->id());
121 for (int j = 0; j < copy->InputCount(); j++) {
122 if (copy->InputAt(j) == sentinel) {
123 copy->ReplaceInput(j, mapping->at(orig->InputAt(j)->id()));
180 Node* copy = mapping->at(node->id());
182 copy->ReplaceInput(0, input);
183 TRACE(" header #%d:%s(0) => #%d:%s\n", copy->id(),
184 copy->op()->mnemonic(), input->id(), input->op()->mnemonic());
198 Node* copy = mapping->at(node->id());
204 copy->ReplaceInput(0, merge);
213 copy->ReplaceInput(0, phi);
218 TRACE(" header #%d:%s(0) => #%d:%s(", copy->id(),
219 copy->op()->mnemonic(), input->id(), input->op()->mnemonic());
247 for (NodeVector* const copy : copies) {
248 end->AppendInput(graph->zone(), copy->at(id));
