1  /* { dg-require-effective-target vect_float } */
       2  
       3  #include <stdarg.h>
       4  #include "tree-vect.h"
       5  
       6  #define N 16
       7  
       8  __attribute__ ((noinline)) int
       9  main1 (void)
      10  {
      11    int i;
      12    float a[N];
      13    float b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
      14  
      15    /* 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    return main1 ();
      35  }
      36  
      37  /* Requires reverse for SVE, which is implemented by a later patch.
      38     Until then we fall back to Advanced SIMD and successfully vectorize
      39     the loop.  */
      40  /* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { target { ! vect_perm } xfail { aarch64_sve && vect_variable_length } } } } */
      41  /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_perm } } } */
      42