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

Lines Matching defs:n3
150   Node* n3 = graph.NewNode(&dummy_operator0);
157   n0->ReplaceUses(n3);
162   CHECK_USES(n3, n1, n2);
164   CHECK_INPUTS(n1, n3);
165   CHECK_INPUTS(n2, n3);
201   Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2);
204   CHECK_USES(n0, n3);
205   CHECK_USES(n1, n3);
206   CHECK_USES(n2, n3);
207   CHECK_USES(n3, NONE);
210   CHECK_INPUTS(n3, n0, n1, n2);
212   n3->ReplaceInput(1, n4);
215   CHECK_USES(n4, n3);
217   CHECK_INPUTS(n3, n0, n4, n2);
237     Node* n3 = graph.NewNode(&dummy_operator1, n0);
239     CHECK(!n0->OwnedBy(n3));
241     CHECK(!n3->OwnedBy(n0));
257     Node* n3 = graph.NewNode(&dummy_operator0);
258     n2->ReplaceInput(0, n3);
266     CHECK(n3->OwnedBy(n2));
267     CHECK(!n2->OwnedBy(n3));
288   Node* n3 = graph.NewNode(&dummy_operator1, n0);
290   CHECK_USES(n0, n1, n2, n3);
291   CHECK_USES(n3, NONE);
303   Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2);
305   CHECK_INPUTS(n3, n0, n1, n2);
308   n3->AppendInput(graph.zone(), n4);
310   CHECK_INPUTS(n3, n0, n1, n2, n4);
311   CHECK_USES(n4, n3);
313   n3->AppendInput(graph.zone(), n4);
315   CHECK_INPUTS(n3, n0, n1, n2, n4, n4);
316   CHECK_USES(n4, n3, n3);
320   CHECK_USES(n4, n3, n3, n5);
369   Node* n3 = graph.NewNode(&dummy_operator0);
371   n2->AppendInput(graph.zone(), n3);
373   CHECK_INPUTS(n2, n0, n1, n3);
374   CHECK_USES(n3, n2);
414   Node* n3 = graph.NewNode(&dummy_operator1, n0);
415   n3->AppendInput(graph.zone(), n1);
416   n3->AppendInput(graph.zone(), n2);
418   CHECK_INPUTS(n3, n0, n1, n2);
419   CHECK_USES(n0, n1, n2, n3);
420   CHECK_USES(n1, n3);
421   CHECK_USES(n2, n3);
423   n3->ReplaceInput(1, NULL);
426   CHECK_INPUTS(n3, n0, NULL, n2);
438   Node* n3 = graph.NewNode(&dummy_operator0);
451   n0->ReplaceUses(n3);
454   CHECK_INPUTS(n2, n3, n1, n3);
455   CHECK_USES(n3, n2, n1, n2);
471   Node* n3 = graph.NewNode(&dummy_operator1, n0);
472   n3->ReplaceInput(0, n1);