Lines Matching refs:n3
219 Node* n3 = graph.NewNode(&OPA1, n1); in TEST() local
220 Node* end = graph.NewNode(&OPA2, n2, n3); in TEST()
229 recorder.CheckContains(n3); in TEST()
262 Node* n3 = graph.NewNode(&OPA1, n1); in TEST() local
263 Node* end = graph.NewNode(&OPA2, n2, n3); in TEST()
278 CHECK_EQ(&OPB1, n3->op()); in TEST()
279 CHECK_EQ(n1, n3->InputAt(0)); in TEST()
282 CHECK_EQ(n3, end->InputAt(1)); in TEST()
292 Node* n3 = graph.NewNode(&OPA1, n1); in TEST() local
293 Node* end = graph.NewNode(&OPA2, n2, n3); in TEST()
402 Node* n3 = graph.NewNode(&OPA1, n1); in TEST() local
403 Node* end = graph.NewNode(&OPA2, n2, n3); in TEST()
420 CHECK_EQ(0, n3->UseCount()); in TEST()
457 Node* n3 = graph.NewNode(&OPA1, n1); in TEST() local
458 Node* end = graph.NewNode(&OPA2, n2, n3); in TEST()
475 CHECK(n3->IsDead()); in TEST()
479 CHECK_EQ(0, n3->UseCount()); in TEST()
492 Node* n3 = 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()
499 if (i == 4) end = graph.NewNode(&OPA2, n3, n1); in TEST()
500 if (i == 5) end = graph.NewNode(&OPA2, n1, n3); in TEST()
512 CHECK_EQ(&OPA1, n3->op()); in TEST()