1  /* { dg-require-effective-target vect_int } */
       2  /* { dg-additional-options "-fno-tree-loop-distribute-patterns" } */
       3  
       4  #include <stdarg.h>
       5  #include "../../tree-vect.h"
       6  
       7  #define N 32 
       8  #define OFF 4
       9  
      10  /* Check handling of accesses for which the "initial condition" -
      11     the expression that represents the first location accessed - is
      12     more involved than just an ssa_name.  */
      13  
      14  int ib[N+OFF] __attribute__ ((__aligned__(16))) = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10};
      15  int ic[N+OFF] = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10};
      16  
      17  int main1 (int *pib)
      18  {
      19    int i;
      20    int ia[N+OFF];
      21  
      22    for (i = OFF; i < N; i++)
      23      {
      24        ia[i] = ic[i - OFF];
      25      }
      26  
      27  
      28    /* check results:  */
      29    for (i = OFF; i < N; i++)
      30      {
      31       if (ia[i] != ic[i - OFF])
      32          abort ();  
      33      }
      34  
      35    return 0;  
      36  }
      37  
      38  int main (void)
      39  {
      40    check_vect ();
      41  
      42    main1 (&ib[OFF]);
      43    return 0;
      44  }
      45  
      46  
      47  /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */