1 /* { dg-require-effective-target vect_int_mult } */
2
3 #include <stdarg.h>
4 #include "tree-vect.h"
5
6 #define K 32
7
8 int in[2*K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
9 int coeff[K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
10 int out[K];
11 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};
12
13 __attribute__ ((noinline)) void
foo()14 foo ()
15 {
16 int sum = 0, i, j, k;
17
18 for (k = 0; k < K; k++)
19 {
20 sum = 0;
21 for (j = 0; j < K; j++)
22 for (i = 0; i < K; i++)
23 sum += in[i+k][j] * coeff[i][j];
24
25 out[k] = sum;
26 }
27 }
28
main()29 int main ()
30 {
31 int i, j, k;
32
33 check_vect ();
34
35 for (j = 0; j < K; j++)
36 {
37 for (i = 0; i < 2*K; i++)
38 in[i][j] = i+j;
39
40 for (i = 0; i < K; i++)
41 coeff[i][j] = i+2;
42 }
43
44 foo();
45
46 for (k = 0; k < K; k++)
47 if (out[k] != check_result[k])
48 abort ();
49
50 return 0;
51 }
52
53 /* { dg-final { scan-tree-dump-times "OUTER LOOP VECTORIZED" 1 "vect" } } */
54
55