1  /* { dg-require-effective-target vect_int } */
       2  
       3  #include <stdarg.h>
       4  #include "tree-vect.h"
       5  
       6  #define N 128 
       7  
       8  typedef struct {
       9     unsigned short a;
      10     unsigned short b;
      11  } s;
      12  
      13  __attribute__ ((noinline)) int
      14  main1 ()
      15  {
      16    s arr[N];
      17    s *ptr = arr;
      18    s res[N];
      19    int i;
      20  
      21    for (i = 0; i < N; i++)
      22      {
      23        arr[i].a = i;
      24        arr[i].b = i * 2;
      25        asm volatile ("" ::: "memory");
      26      }
      27  
      28    for (i = 0; i < N; i++)
      29      {
      30        res[i].a = ptr->b - ptr->a;
      31        res[i].b = ptr->b + ptr->a;
      32        ptr++;
      33      }
      34    
      35    /* check results:  */
      36    for (i = 0; i < N; i++)
      37      {
      38        if (res[i].a != arr[i].b - arr[i].a
      39            || res[i].b != arr[i].a + arr[i].b)
      40  	abort ();
      41      }
      42  
      43    return 0;
      44  }
      45  
      46  int main (void)
      47  {
      48    int i;
      49    
      50    check_vect ();
      51  
      52    main1 ();
      53  
      54    return 0;
      55  }
      56  
      57  /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect"  { target vect_strided2 } } } */
      58