1 /* { dg-require-effective-target vect_condition } */
11 int c[N] = {3,2,1,10,1,42,3,4,50,9,32,8,11,10,1,2};
12 int a[N+1] = {0,16,32,48,64,128,256,512,0,16,32,48,64,128,256,512,1024};
13 int check_result[M] = {1024,1024,1024,256,256,256,256,256,256,256,256,128,48,48,48,48,48,48,48,48,48,48,48,48,48,48,48,48,48,48,48,48};
15 __attribute__ ((noinline)) void
21 for (j = 0; j < M; j++)
26 for (i = 0; i < N; i++)
29 curr_a = x > c[i] ? curr_a : next_a;
42 for (j = 0; j < M; j++)
47 for (j = 0; j < M; j++)
48 if (x_out[j] != check_result[j])
54 /* { dg-final { scan-tree-dump-times "OUTER LOOP VECTORIZED" 1 "vect" { xfail vect_no_align } } } */
55 /* { dg-final { cleanup-tree-dump "vect" } } */