gcc/testsuite/gcc.dg/vect/vect-double-reduc-2.c

   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] = {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};
  12
  13 __attribute__ ((noinline)) void
  14 foo ()
  15 {
  16   int res = 0, i, j, k;
  17
  18   for (k = 0; k < K; k++)
  19     {
  20       res = 1000000;
  21       for (j = 0; j < K; j++)
  22         for (i = 0; i < K; i++)
  23           res -= in[i+k][j] * coeff[i][j];
  24
  25       out[k] = res;
  26     }
  27 }
  28
  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 #pragma GCC novector
  47   for (k = 0; k < K; k++)
  48     if (out[k] != check_result[k])
  49       abort ();
  50
  51   return 0;
  52 }
  53
  54 /* { dg-final { scan-tree-dump-times "OUTER LOOP VECTORIZED" 1 "vect" } } */
  55