Cross Reference: /external/v8/test/cctest/compiler/test-node.cc

Lines Matching refs:n3
149   Node* n3 = graph.NewNode(&dummy_operator0);
156   n0->ReplaceUses(n3);
161   CHECK_USES(n3, n1, n2);
163   CHECK_INPUTS(n1, n3);
164   CHECK_INPUTS(n2, n3);
198   Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2);
201   CHECK_USES(n0, n3);
202   CHECK_USES(n1, n3);
203   CHECK_USES(n2, n3);
204   CHECK_USES(n3, NONE);
207   CHECK_INPUTS(n3, n0, n1, n2);
209   n3->ReplaceInput(1, n4);
212   CHECK_USES(n4, n3);
214   CHECK_INPUTS(n3, n0, n4, n2);
233     Node* n3 = graph.NewNode(&dummy_operator1, n0);
235     CHECK(!n0->OwnedBy(n3));
237     CHECK(!n3->OwnedBy(n0));
253     Node* n3 = graph.NewNode(&dummy_operator0);
254     n2->ReplaceInput(0, n3);
262     CHECK(n3->OwnedBy(n2));
263     CHECK(!n2->OwnedBy(n3));
283   Node* n3 = graph.NewNode(&dummy_operator1, n0);
285   CHECK_USES(n0, n1, n2, n3);
286   CHECK_USES(n3, NONE);
297   Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2);
299   CHECK_INPUTS(n3, n0, n1, n2);
302   n3->AppendInput(graph.zone(), n4);
304   CHECK_INPUTS(n3, n0, n1, n2, n4);
305   CHECK_USES(n4, n3);
307   n3->AppendInput(graph.zone(), n4);
309   CHECK_INPUTS(n3, n0, n1, n2, n4, n4);
310   CHECK_USES(n4, n3, n3);
314   CHECK_USES(n4, n3, n3, n5);
361   Node* n3 = graph.NewNode(&dummy_operator0);
363   n2->AppendInput(graph.zone(), n3);
365   CHECK_INPUTS(n2, n0, n1, n3);
366   CHECK_USES(n3, n2);
404   Node* n3 = graph.NewNode(&dummy_operator1, n0);
405   n3->AppendInput(graph.zone(), n1);
406   n3->AppendInput(graph.zone(), n2);
408   CHECK_INPUTS(n3, n0, n1, n2);
409   CHECK_USES(n0, n1, n2, n3);
410   CHECK_USES(n1, n3);
411   CHECK_USES(n2, n3);
413   n3->ReplaceInput(1, NULL);
416   CHECK_INPUTS(n3, n0, NULL, n2);
427   Node* n3 = graph.NewNode(&dummy_operator0);
440   n0->ReplaceUses(n3);
443   CHECK_INPUTS(n2, n3, n1, n3);
444   CHECK_USES(n3, n2, n1, n2);
459   Node* n3 = graph.NewNode(&dummy_operator1, n0);
460   n3->ReplaceInput(0, n1);