1 /* { dg-require-effective-target vect_int } */
9 int results[N] = {0,1,2,3,0,0,0,0,0,0,0,0,12,13,14,15};
14 int b[N] = {0,1,2,3,-4,-5,-6,-7,-8,-9,-10,-11,12,13,14,15};
17 for (i = 0; i < N; i++)
19 a[i] = (b[i] >= 0 ? b[i] : 0);
23 for (i = 0; i < N; i++)
25 if (a[i] != results[i])
39 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail vect_no_int_max } } } */
40 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
41 /* { dg-final { cleanup-tree-dump "vect" } } */