1 /* { dg-require-effective-target vect_int } */
2
3 #include <stdarg.h>
4 #include "tree-vect.h"
5
6 #define N 8
7
8 int
main1()9 main1 ()
10 {
11 int i;
12 unsigned int out[N*8], a0, a1, a2, a3, a4, a5, a6, a7, b1, b0, b2, b3, b4, b5, b6, b7;
13 unsigned int in[N*8] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63};
14
15 /* Different operations - not SLPable. */
16 for (i = 0; i < N; i++)
17 {
18 a0 = in[i*8] + 5;
19 a1 = in[i*8 + 1] * 6;
20 a2 = in[i*8 + 2] + 7;
21 a3 = in[i*8 + 3] + 8;
22 a4 = in[i*8 + 4] + 9;
23 a5 = in[i*8 + 5] + 10;
24 a6 = in[i*8 + 6] + 11;
25 a7 = in[i*8 + 7] + 12;
26
27 b0 = a0 * 3;
28 b1 = a1 * 2;
29 b2 = a2 * 12;
30 b3 = a3 * 5;
31 b4 = a4 * 8;
32 b5 = a5 * 4;
33 b6 = a6 * 3;
34 b7 = a7 * 2;
35
36 out[i*8] = b0 - 2;
37 out[i*8 + 1] = b1 - 3;
38 out[i*8 + 2] = b2 - 2;
39 out[i*8 + 3] = b3 - 1;
40 out[i*8 + 4] = b4 - 8;
41 out[i*8 + 5] = b5 - 7;
42 out[i*8 + 6] = b6 - 3;
43 out[i*8 + 7] = b7 - 7;
44 }
45
46 /* check results: */
47 for (i = 0; i < N; i++)
48 {
49 if (out[i*8] != (in[i*8] + 5) * 3 - 2
50 || out[i*8 + 1] != (in[i*8 + 1] * 6) * 2 - 3
51 || out[i*8 + 2] != (in[i*8 + 2] + 7) * 12 - 2
52 || out[i*8 + 3] != (in[i*8 + 3] + 8) * 5 - 1
53 || out[i*8 + 4] != (in[i*8 + 4] + 9) * 8 - 8
54 || out[i*8 + 5] != (in[i*8 + 5] + 10) * 4 - 7
55 || out[i*8 + 6] != (in[i*8 + 6] + 11) * 3 - 3
56 || out[i*8 + 7] != (in[i*8 + 7] + 12) * 2 - 7)
57 abort ();
58 }
59
60 return 0;
61 }
62
main(void)63 int main (void)
64 {
65 check_vect ();
66
67 main1 ();
68
69 return 0;
70 }
71
72 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_strided8 && vect_int_mult } } } } */
73 /* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { target { ! { vect_strided8 && vect_int_mult } } } } } */
74 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" } } */
75