IVOPT performance tuning patch. The main problem is a variant of maximal weight
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / vect-double-reduc-5.c
blobf624d86502f853c8ae1def899e5521303a14281a
1 /* { dg-require-effective-target vect_int_mult } */
3 #include <stdarg.h>
4 #include <stdio.h>
5 #include "tree-vect.h"
7 #define K 32
9 signed short in[2*K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
10 signed short coeff[K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
11 int out[K];
12 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};
14 __attribute__ ((noinline)) void
15 foo ()
17 int sum = 0, i, j, k;
19 for (k = 0; k < K; k++)
21 sum = 0;
22 for (j = 0; j < K; j++)
23 for (i = 0; i < K; i++)
24 sum += in[i+k][j] * coeff[i][j];
26 out[k] = sum;
30 int main ()
32 int i, j, k;
34 check_vect ();
36 for (j = 0; j < K; j++)
38 for (i = 0; i < 2*K; i++)
39 in[i][j] = i+j;
41 for (i = 0; i < K; i++)
42 coeff[i][j] = i+2;
45 foo();
47 for (k = 0; k < K; k++)
48 if (out[k] != check_result[k])
49 abort ();
51 return 0;
54 /* Vectorization of loops with multiple types and double reduction is not
55 supported yet. */
56 /* { dg-final { scan-tree-dump-times "OUTER LOOP VECTORIZED" 1 "vect" { xfail *-*-* } } } */
57 /* { dg-final { cleanup-tree-dump "vect" } } */