45   Node* na = graph()->NewNode(&kOp0);  in TEST_F()
46   Node* nb = graph()->NewNode(&kOp0);  in TEST_F()
47   Node* n1 = graph()->NewNode(&kOp1, na);  in TEST_F()
48   Node* n2 = graph()->NewNode(&kOp1, nb);  in TEST_F()
55   Node* n0 = graph()->NewNode(&kOp0);  in TEST_F()
56   Node* n1 = graph()->NewNode(&kOp1, n0);  in TEST_F()
59   EXPECT_FALSE(Reduce(graph()->NewNode(&kOp1, n0)).Changed());  in TEST_F()
65   Node* n0 = graph()->NewNode(&op);  in TEST_F()
66   Node* n1 = graph()->NewNode(&op);  in TEST_F()
77     inputs[i] = graph()->NewNode(  in TEST_F()
83     Node* n1 = graph()->NewNode(&op1, static_cast<int>(input_count), inputs);  in TEST_F()
89     Node* n2 = graph()->NewNode(&op2, static_cast<int>(input_count), inputs);  in TEST_F()
102     inputs[i] = graph()->NewNode(  in TEST_F()
107     Node* n = graph()->NewNode(&op1, static_cast<int>(input_count), inputs);  in TEST_F()
111     r = Reduce(graph()->NewNode(&op1, static_cast<int>(input_count), inputs));  in TEST_F()
115     r = Reduce(graph()->NewNode(&op1, static_cast<int>(input_count), inputs));  in TEST_F()
123   Node* n = graph()->NewNode(&kOp0);  in TEST_F()