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  int b[N];
      10  
      11  __attribute__ ((noinline)) int
      12  foo (int n){
      13    int i,j;
      14    int sum,x,y;
      15  
      16    if (n<=0)
      17      return 0;
      18  
      19    for (i = 0; i < N/2; i++) {
      20      sum = 0;
      21      x = b[2*i];
      22      y = b[2*i+1];
      23      for (j = 0; j < n; j++) {
      24        sum += j;
      25      }
      26      a[2*i] = sum + x;
      27      a[2*i+1] = sum + y;
      28    }
      29  }
      30  
      31  int main (void)
      32  {
      33    int i,j;
      34    int sum;
      35  
      36    check_vect ();
      37  
      38    for (i=0; i<N; i++)
      39      b[i] = i;
      40   
      41    foo (N-1);
      42  
      43      /* check results:  */
      44    for (i=0; i<N/2; i++)
      45      {
      46        sum = 0;
      47        for (j = 0; j < N-1; j++)
      48          sum += j;
      49        if (a[2*i] != sum + b[2*i] || a[2*i+1] != sum + b[2*i+1])
      50          abort();
      51      }
      52  
      53    return 0;
      54  }
      55  
      56  /* { dg-final { scan-tree-dump-times "OUTER LOOP VECTORIZED." 1 "vect" { target vect_strided2 } } } */