1 /* { dg-require-effective-target vect_int } */
9 myint data_ch1[N + 1] =
10 { 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30 };
11 myint data_ch2[N + 1] =
12 { 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30 };
15 __attribute__ ((noinline)) int
16 foo (myint * s1, myint * s2, int stride)
20 for (x = 0; x < N; x++)
21 score += ((s1[x] - s1[x + stride] + s2[x + stride]) >= 0 ?
22 s1[x] + s2[x + stride] :
35 return foo (data_ch1, data_ch2, 1);
38 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
39 /* { dg-final { cleanup-tree-dump "vect" } } */