1  /* Disabling epilogues until we find a better way to deal with scans.  */
       2  /* { dg-additional-options "--param vect-epilogues-nomask=0" } */
       3  /* { dg-require-effective-target vect_int } */
       4  /* { dg-add-options bind_pic_locally } */
       5  
       6  #include <stdarg.h>
       7  #include "tree-vect.h"
       8  
       9  #define N 8
      10  #define OFF 8
      11  
      12  /* Check handling of accesses for which the "initial condition" -
      13     the expression that represents the first location accessed - is
      14     more involved than just an ssa_name.  */
      15  
      16  int ia[N];
      17  int ib[N+OFF] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10, 14, 22, 26, 34};
      18  int off = 8;
      19  
      20  __attribute__ ((noinline))
      21  int main1 (int *ib)
      22  {
      23    int i;
      24  
      25    for (i = 0; i < N; i++)
      26      {
      27        ia[i] = ib[i+off];
      28      }
      29  
      30  
      31    /* check results:  */
      32    for (i = 0; i < N; i++)
      33      {
      34       if (ia[i] != ib[i+off])
      35          abort ();
      36      }
      37  
      38    return 0;
      39  }
      40  
      41  int main (void)
      42  {
      43    check_vect ();
      44  
      45    main1 (ib);
      46    return 0;
      47  }
      48  
      49  /* For targets that don't support misaligned loads we version for the load.
      50     (The store is aligned).  */
      51  
      52  /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
      53  /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { xfail { ! vect_unaligned_possible } } } } */
      54  /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" } } */
      55  /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 1 "vect" { target { vect_no_align && { ! vect_hw_misalign } } } } } */