Home | History | Annotate | Download | only in compiler

Lines Matching defs:s3

115   Node* s3 = graph()->NewNode(s_op, p1, d3);
120 USE(s3);
288 // (B0 + S3) -> [p1, 2, B0, NULL]
289 BaseWithIndexAndDisplacement32Matcher match32(graph()->NewNode(a_op, b0, s3));
292 // (S3 + B0) -> [p1, 2, B0, NULL]
293 s3 = graph()->NewNode(s_op, p1, d3);
294 BaseWithIndexAndDisplacement32Matcher match33(graph()->NewNode(a_op, s3, b0));
297 // (D15 + S3) -> [p1, 2, NULL, D15]
298 s3 = graph()->NewNode(s_op, p1, d3);
300 graph()->NewNode(a_op, d15, s3));
303 // (S3 + D15) -> [p1, 2, NULL, D15]
304 s3 = graph()->NewNode(s_op, p1, d3);
306 graph()->NewNode(a_op, s3, d15));
321 // (D15 + S3) + B0 -> [p1, 2, b0, d15]
322 s3 = graph()->NewNode(s_op, p1, d3);
324 graph()->NewNode(a_op, graph()->NewNode(a_op, d15, s3), b0));
327 // (B0 + D15) + S3 -> [p1, 2, b0, d15]
328 s3 = graph()->NewNode(s_op, p1, d3);
330 graph()->NewNode(a_op, graph()->NewNode(a_op, b0, d15), s3));
333 // (S3 + B0) + D15 -> [p1, 2, b0, d15]
334 s3 = graph()->NewNode(s_op, p1, d3);
336 graph()->NewNode(a_op, graph()->NewNode(a_op, s3, b0), d15));
339 // D15 + (S3 + B0) -> [p1, 2, b0, d15]
340 s3 = graph()->NewNode(s_op, p1, d3);
342 graph()->NewNode(a_op, d15, graph()->NewNode(a_op, s3, b0)));
345 // B0 + (D15 + S3) -> [p1, 2, b0, d15]
346 s3 = graph()->NewNode(s_op, p1, d3);
348 graph()->NewNode(a_op, b0, graph()->NewNode(a_op, d15, s3)));
351 // S3 + (B0 + D15) -> [p1, 2, b0, d15]
352 s3 = graph()->NewNode(s_op, p1, d3);
354 graph()->NewNode(a_op, s3, graph()->NewNode(a_op, b0, d15)));
434 Node* s3 = graph()->NewNode(s_op, p1, d3);
439 USE(s3);
611 // (B0 + S3) -> [p1, 2, B0, NULL]
612 BaseWithIndexAndDisplacement64Matcher match64(graph()->NewNode(a_op, b0, s3));
615 // (S3 + B0) -> [p1, 2, B0, NULL]
616 s3 = graph()->NewNode(s_op, p1, d3);
617 BaseWithIndexAndDisplacement64Matcher match33(graph()->NewNode(a_op, s3, b0));
620 // (D15 + S3) -> [p1, 2, NULL, D15]
621 s3 = graph()->NewNode(s_op, p1, d3);
623 graph()->NewNode(a_op, d15, s3));
626 // (S3 + D15) -> [p1, 2, NULL, D15]
627 s3 = graph()->NewNode(s_op, p1, d3);
629 graph()->NewNode(a_op, s3, d15));
644 // (D15 + S3) + B0 -> [p1, 2, b0, d15]
645 s3 = graph()->NewNode(s_op, p1, d3);
647 graph()->NewNode(a_op, graph()->NewNode(a_op, d15, s3), b0));
650 // (B0 + D15) + S3 -> [p1, 2, b0, d15]
651 s3 = graph()->NewNode(s_op, p1, d3);
653 graph()->NewNode(a_op, graph()->NewNode(a_op, b0, d15), s3));
656 // (S3 + B0) + D15 -> [p1, 2, b0, d15]
657 s3 = graph()->NewNode(s_op, p1, d3);
659 graph()->NewNode(a_op, graph()->NewNode(a_op, s3, b0), d15));
662 // D15 + (S3 + B0) -> [p1, 2, b0, d15]
663 s3 = graph()->NewNode(s_op, p1, d3);
665 graph()->NewNode(a_op, d15, graph()->NewNode(a_op, s3, b0)));
668 // B0 + (D15 + S3) -> [p1, 2, b0, d15]
669 s3 = graph()->NewNode(s_op, p1, d3);
671 graph()->NewNode(a_op, b0, graph()->NewNode(a_op, d15, s3)));
674 // S3 + (B0 + D15) -> [p1, 2, b0, d15]
675 s3 = graph()->NewNode(s_op, p1, d3);
677 graph()->NewNode(a_op, s3, graph()->NewNode(a_op, b0, d15)));