1  /* { dg-require-effective-target vect_int } */
       2  
       3  #include <stdarg.h>
       4  #include "tree-vect.h"
       5  
       6  #define N 16
       7  
       8  __attribute__ ((noinline))
       9  int main1 ()
      10  {
      11    int i;
      12    int a[N];
      13    int b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
      14  
      15    /* Not vectorizable yet (reverse access and forward access).  */
      16    for (i = N; i > 0; i--)
      17      {
      18        a[N-i] = b[i-1];
      19      }
      20  
      21    /* check results:  */
      22    for (i = 0; i <N; i++)
      23      {
      24        if (a[i] != b[N-1-i])
      25          abort ();
      26      }
      27  
      28    return 0;
      29  }
      30  
      31  int main (void)
      32  { 
      33    check_vect();
      34    
      35    return main1 ();
      36  }
      37  
      38  /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_perm && vect_hw_misalign } } } } */