1  /* { dg-require-effective-target vect_int } */
       2  
       3  #include <stdlib.h>
       4  #include <stdarg.h>
       5  #include "tree-vect.h"
       6  
       7  #define N 9
       8  
       9  struct extraction
      10  {
      11    int a[N];
      12    int b[N];
      13  };
      14  
      15  static int a[N] = {1,2,3,4,5,6,7,8,9};
      16  static int b[N] = {2,3,4,5,6,7,8,9,9};
      17  
      18  __attribute__ ((noinline))
      19  int main1 (int x, int y) {
      20    int i;
      21    struct extraction *p;
      22    p = (struct extraction *) malloc (sizeof (struct extraction));
      23  
      24    for (i = 0; i < N; i++)
      25      {
      26        p->a[i] = a[i];
      27        asm volatile ("" ::: "memory");
      28      }
      29  
      30    /* Not vectorizable: distance 1.  */
      31  #pragma GCC unroll 0
      32    for (i = 0; i < N - 1; i++)
      33      {
      34         *((int *)p + x + i + 1) = *((int *)p + x + i);
      35      }
      36  
      37    /* check results: */
      38    for (i = 0; i < N; i++)
      39      {
      40         if (p->a[i] != 1) 
      41           abort();
      42      }
      43    return 0;
      44  }
      45  
      46  int main (void)
      47  { 
      48    check_vect ();
      49  
      50    return main1 (0, N);
      51  }
      52  
      53  /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 0 "vect" } } */
      54  /* { dg-final { scan-tree-dump-times "possible dependence between data-refs" 1 "vect" { target { ! vect_multiple_sizes } } } } */
      55  /* { dg-final { scan-tree-dump "possible dependence between data-refs" "vect" { target vect_multiple_sizes } } } */
      56