Lines Matching full:replacement
36 Node* replacement = reduction.replacement();
37 if (replacement == NULL) {
39 } else if (replacement == node) {
40 // {replacement == node} represents an in-place reduction.
47 if (node == graph_->start()) graph_->SetStart(replacement);
48 if (node == graph_->end()) graph_->SetEnd(replacement);
50 // {replacement} was already reduced and finish.
51 if (replacement->id() < before) {
52 node->ReplaceUses(replacement);
57 // {node} with {replacement}. New nodes created by this reduction can
60 std::bind2nd(std::ptr_fun(&NodeIdIsLessThan), before), replacement);
65 // Rerun all the reductions on the {replacement}.
67 node = replacement;
