1 /* { dg-require-effective-target vect_int_mult } */
8 int in[2*K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
9 int coeff[K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
11 int check_result[K] = {357184,339264,321344,303424,285504,267584,249664,231744,213824,195904,177984,160064,142144,124224,106304,88384,70464,52544,34624,16704,-1216,-19136,-37056,-54976,-72896,-90816,-108736,-126656,-144576,-162496,-180416,-198336};
13 __attribute__ ((noinline)) void
18 for (k = 0; k < K; k++)
21 for (j = 0; j < K; j++)
22 for (i = 0; i < K; i++)
23 res -= in[i+k][j] * coeff[i][j];
35 for (j = 0; j < K; j++)
37 for (i = 0; i < 2*K; i++)
40 for (i = 0; i < K; i++)
46 for (k = 0; k < K; k++)
47 if (out[k] != check_result[k])
53 /* { dg-final { scan-tree-dump-times "OUTER LOOP VECTORIZED" 1 "vect" } } */
54 /* { dg-final { cleanup-tree-dump "vect" } } */