| /* { dg-require-effective-target vect_int_mult } */ |
| int in[2*K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))); |
| int coeff[K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))); |
| int check_result[K] = {652816,670736,688656,706576,724496,742416,760336,778256,796176,814096,832016,849936,867856,885776,903696,921616,939536,957456,975376,993296,1011216,1029136,1047056,1064976,1082896,1100816,1118736,1136656,1154576,1172496,1190416,1208336}; |
| __attribute__ ((noinline)) void |
| sum += in[i+k][j] * coeff[i][j]; |
| for (i = 0; i < 2*K; i++) |
| if (out[k] != check_result[k]) |
| /* { dg-final { scan-tree-dump-times "OUTER LOOP VECTORIZED" 1 "vect" } } */ |