Lines Matching defs:node0
243 Node* node0 = graph()->NewNode(&kOpA0);
244 Node* node1 = graph()->NewNode(&kOpA1, node0);
245 EXPECT_CALL(e, Replace(node0, node0));
247 EXPECT_FALSE(r.Reduce(node0).Changed());
262 Node* node0 = graph()->NewNode(&kOpA0);
263 Node* node1 = graph()->NewNode(&kOpA1, node0);
264 EXPECT_CALL(e, Revisit(node0));
266 EXPECT_FALSE(r.Reduce(node0).Changed());
458 Node* node0 = graph()->NewNode(&kOpA0);
459 Node* node1 = graph()->NewNode(&kOpA1, node0);
460 Node* node2 = graph()->NewNode(&kOpA1, node0);
461 EXPECT_CALL(r, Reduce(node0)).WillOnce(Return(Reducer::NoChange()));
464 EXPECT_FALSE(node0->IsDead());
472 Node* node0 = graph()->NewNode(&kOpA0);
473 EXPECT_CALL(r1, Reduce(node0));
474 EXPECT_CALL(r2, Reduce(node0));
475 ReduceNode(node0, &r1, &r2);
482 Node* node0 = graph()->NewNode(&kOpA0);
483 EXPECT_CALL(r1, Reduce(node0));
484 EXPECT_CALL(r2, Reduce(node0));
485 EXPECT_CALL(r3, Reduce(node0)).InSequence(s1, s2, s3).WillOnce(
486 Return(Reducer::Changed(node0)));
487 EXPECT_CALL(r1, Reduce(node0)).InSequence(s1);
488 EXPECT_CALL(r2, Reduce(node0)).InSequence(s2);
489 ReduceNode(node0, &r1, &r2, &r3);