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