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

Lines Matching refs:n1
201   Node* n1 = graph.NewNode(&OPA0);
202   Node* end = graph.NewNode(&OPA1, n1);
209   recorder.CheckContains(n1);
217   Node* n1 = graph.NewNode(&OPA0);
218   Node* n2 = graph.NewNode(&OPA1, n1);
219   Node* n3 = graph.NewNode(&OPA1, n1);
227   recorder.CheckContains(n1);
237   Node* n1 = graph.NewNode(&OPA0);
238   Node* end = graph.NewNode(&OPA1, n1);
250     CHECK_EQ(&OPB0, n1->op());
252     CHECK_EQ(n1, end->InputAt(0));
260   Node* n1 = graph.NewNode(&OPA0);
261   Node* n2 = graph.NewNode(&OPA1, n1);
262   Node* n3 = graph.NewNode(&OPA1, n1);
275     CHECK_EQ(&OPB0, n1->op());
277     CHECK_EQ(n1, n2->InputAt(0));
279     CHECK_EQ(n1, n3->InputAt(0));
290   Node* n1 = graph.NewNode(&OPA0);
291   Node* n2 = graph.NewNode(&OPA1, n1);
292   Node* n3 = graph.NewNode(&OPA1, n1);
367   Node* n1 = nend->InputAt(0);
368   CHECK_NE(end, n1);
369   CHECK_EQ(&OPC1, n1->op());
370   CHECK_EQ(1, n1->InputCount());
371   CHECK_EQ(end, n1->InputAt(0));
378   Node* n1 = graph.NewNode(&OPA0);
379   Node* end = graph.NewNode(&OPA1, n1);
391     CHECK_EQ(&OPA0, n1->op());
392     CHECK_EQ(n1, graph.end());
400   Node* n1 = graph.NewNode(&OPA0);
401   Node* n2 = graph.NewNode(&OPA1, n1);
402   Node* n3 = graph.NewNode(&OPA1, n1);
415     CHECK_EQ(&OPA0, n1->op());
416     CHECK_EQ(n1, end->InputAt(0));
417     CHECK_EQ(n1, end->InputAt(1));
430     Node* n1 = graph.NewNode(&OPA0);
431     Node* end = n1;
445       CHECK_EQ(&OPA0, n1->op());
446       CHECK_EQ(n1, graph.end());
455   Node* n1 = graph.NewNode(&OPA0);
456   Node* n2 = graph.NewNode(&OPA1, n1);
457   Node* n3 = graph.NewNode(&OPA1, n1);
472     CHECK_EQ(&OPB0, n1->op());
474     CHECK_EQ(n1, end->InputAt(0));
476     CHECK_EQ(n1, end->InputAt(0));
490     Node* n1 = graph.NewNode(&OPA0);
491     Node* n2 = graph.NewNode(&OPA1, n1);
492     Node* n3 = graph.NewNode(&OPA1, n1);
497     if (i == 2) end = graph.NewNode(&OPA2, n2, n1);
498     if (i == 3) end = graph.NewNode(&OPA2, n1, n2);
499     if (i == 4) end = graph.NewNode(&OPA2, n3, n1);
500     if (i == 5) end = graph.NewNode(&OPA2, n1, n3);
510     CHECK_EQ(&OPA0, n1->op());
575         Node* n1 = end->InputAt(0);
577         CHECK_NE(n1, n2);
578         CHECK(n1->id() < n2->id());
579         CHECK_EQ(&OPB2, n1->op());
581         Node* n4 = n1->InputAt(0);
583         CHECK_EQ(n4, n1->InputAt(1));
598     Node* n1 = graph.NewNode(&OPA0);
599     Node* end = graph.NewNode(&OPA1, n1);
618       CHECK_EQ(&OPC0, n1->op());
620       CHECK_EQ(n1, end->InputAt(0));
645   Node* n1 = graph.NewNode(&OPA0);
646   Node* end = graph.NewNode(&OPA1, n1);
658   CHECK_EQ(&OPB0, n1->op());
660   CHECK_EQ(n1, end->InputAt(0));