716   Node* n11 = graph.NewNode(op, nil, nil, nil, nil, nil);  in TEST()  local
717   USE(n11);  in TEST()
721   n11->ReplaceInput(0, n2);  in TEST()
725   n11->ReplaceInput(1, n3);  in TEST()
729   n11->ReplaceInput(2, n7);  in TEST()
738   n11->ReplaceInput(3, n8);  in TEST()
748   n11->ReplaceInput(4, n10);  in TEST()
749   n13->ReplaceInput(0, n11);  in TEST()
759   n12->ReplaceInput(3, n11);  in TEST()
1032   Node* n11 = graph.NewNode(op, nil, nil, nil);  in TEST()  local
1033   USE(n11);  in TEST()
1037   n11->ReplaceInput(0, n4);  in TEST()
1038   n11->ReplaceInput(1, n25);  in TEST()
1039   n11->ReplaceInput(2, n7);  in TEST()
1040   n25->ReplaceInput(0, n11);  in TEST()
1243   Node* n11 = graph.NewNode(op, nil, nil, nil);  in TEST()  local
1244   USE(n11);  in TEST()
1248   n11->ReplaceInput(0, n3);  in TEST()
1252   n26->ReplaceInput(0, n11);  in TEST()
1455   n11->ReplaceInput(1, n26);  in TEST()
1456   n11->ReplaceInput(2, n8);  in TEST()
1457   n16->ReplaceInput(1, n11);  in TEST()
1599   Node* n11 = graph.NewNode(op, nil, nil, nil);  in TEST()  local
1600   USE(n11);  in TEST()
1604   n11->ReplaceInput(0, n4);  in TEST()
1605   n11->ReplaceInput(1, n11);  in TEST()
1606   n11->ReplaceInput(2, n7);  in TEST()