Lines Matching defs:c0
187 Node* const c0 =
190 Node* const e0 = graph()->NewNode(&kOp0, v0, graph()->start(), c0);
192 Node* const merge = graph()->NewNode(common()->Merge(2), c0, c1);
201 EXPECT_EQ(c0, r.replacement());
210 Node* const c0 =
214 Node* const c3 = graph()->NewNode(&kOp0, v3, graph()->start(), c0);
216 Node* const e1 = graph()->NewNode(&kOp0, v1, e0, c0);
217 Node* const e2 = graph()->NewNode(&kOp0, v2, e1, c0);
219 Node* const merge = graph()->NewNode(common()->Merge(4), c0, c1, c2, c3);
229 EXPECT_THAT(r.replacement(), IsMerge(c0, c3));
272 Node* const c0 =
275 Node* const e0 = graph()->NewNode(&kOp0, v0, graph()->start(), c0);
277 Node* const loop = graph()->NewNode(common()->Loop(2), c0, c1);
288 EXPECT_EQ(c0, r.replacement());
297 Node* const c0 =
301 Node* const c3 = graph()->NewNode(&kOp0, v3, graph()->start(), c0);
303 Node* const e1 = graph()->NewNode(&kOp0, v1, e0, c0);
304 Node* const e2 = graph()->NewNode(&kOp0, v2, e1, c0);
306 Node* const loop = graph()->NewNode(common()->Loop(4), c0, c1, c2, c3);
316 EXPECT_THAT(r.replacement(), IsLoop(c0, c3));
