Lines Matching refs:n2
218 Node* n2 = graph.NewNode(&OPA1, n1); in TEST() local
220 Node* end = graph.NewNode(&OPA2, n2, n3); in TEST()
228 recorder.CheckContains(n2); in TEST()
261 Node* n2 = graph.NewNode(&OPA1, n1); in TEST() local
263 Node* end = graph.NewNode(&OPA2, n2, n3); in TEST()
276 CHECK_EQ(&OPB1, n2->op()); in TEST()
277 CHECK_EQ(n1, n2->InputAt(0)); in TEST()
281 CHECK_EQ(n2, end->InputAt(0)); in TEST()
291 Node* n2 = graph.NewNode(&OPA1, n1); in TEST() local
293 Node* end = graph.NewNode(&OPA2, n2, n3); in TEST()
401 Node* n2 = graph.NewNode(&OPA1, n1); in TEST() local
403 Node* end = graph.NewNode(&OPA2, n2, n3); in TEST()
419 CHECK_EQ(0, n2->UseCount()); in TEST()
456 Node* n2 = graph.NewNode(&OPA1, n1); in TEST() local
458 Node* end = graph.NewNode(&OPA2, n2, n3); in TEST()
473 CHECK(n2->IsDead()); in TEST()
478 CHECK_EQ(0, n2->UseCount()); in TEST()
491 Node* n2 = graph.NewNode(&OPA1, n1); in TEST() local
495 if (i == 0) end = graph.NewNode(&OPA2, n2, n3); in TEST()
496 if (i == 1) end = graph.NewNode(&OPA2, n3, n2); in TEST()
497 if (i == 2) end = graph.NewNode(&OPA2, n2, n1); in TEST()
498 if (i == 3) end = graph.NewNode(&OPA2, n1, n2); in TEST()
511 CHECK_EQ(&OPA1, n2->op()); in TEST()
576 Node* n2 = end->InputAt(1); in TEST() local
577 CHECK_NE(n1, n2); in TEST()
578 CHECK(n1->id() < n2->id()); in TEST()
580 CHECK_EQ(&OPB2, n2->op()); in TEST()
584 CHECK_EQ(n4, n2->InputAt(0)); in TEST()
585 CHECK_EQ(n4, n2->InputAt(1)); in TEST()