1 /* { dg-require-effective-target vect_int } */
9 int in[2*K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
10 int coeff[K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
11 int out_max[K], out_min[K];
12 int check_max[K] = {62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93};
13 int check_min[K] = {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};
15 __attribute__ ((noinline)) void
18 int max, min, i, j, k;
20 for (k = 0; k < K; k++)
24 for (j = 0; j < K; j++)
25 for (i = 0; i < K; i++)
27 max = max < in[i+k][j] ? in[i+k][j] : max;
28 min = min > in[i+k][j] ? in[i+k][j] : min;
41 for (j = 0; j < K; j++)
43 for (i = 0; i < 2*K; i++)
46 for (i = 0; i < K; i++)
52 for (k = 0; k < K; k++)
53 if (out_max[k] != check_max[k] || out_min[k] != 0)
58 for (k = 0; k < K; k++)
59 if (out_min[k] != check_min[k] || out_max[k] != 100)
65 /* { dg-final { scan-tree-dump-times "OUTER LOOP VECTORIZED" 1 "vect" { xfail vect_no_int_max } } } */
66 /* { dg-final { cleanup-tree-dump "vect" } } */