| /* { dg-require-effective-target vect_int_mult } */ |
| signed short in[2*K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))); |
| signed short coeff[K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))); |
| int check_result[K] = {642816,660736,678656,696576,714496,732416,750336,768256,786176,804096,822016,839936,857856,875776,893696,911616,929536,947456,965376,983296,1001216,1019136,1037056,1054976,1072896,1090816,1108736,1126656,1144576,1162496,1180416,1198336}; |
| __attribute__ ((noinline)) void |
| sum += in[i+k][j] * coeff[i][j]; |
| for (i = 0; i < 2*K; i++) |
| if (out[k] != check_result[k]) |
| /* Vectorization of loops with multiple types and double reduction is not |
| /* { dg-final { scan-tree-dump-times "OUTER LOOP VECTORIZED" 1 "vect" { xfail *-*-* } } } */ |