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] = {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};
      12  
      13  __attribute__ ((noinline)) void 
      14  foo ()
      15  {
      16    int sum = 0, i, j, k;
      17  
      18    for (k = 0; k < K; k++)
      19      {
      20        sum = 10000;
      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  
      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