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 (s *arr)
      15  {
      16    s *ptr = arr;
      17    s res[N];
      18    int i;
      19  
      20    for (i = 0; i < N; i++)
      21      {
      22        res[i].a = ptr->b - ptr->a;
      23        res[i].b = ptr->b + ptr->a;
      24        ptr++;
      25      }
      26    
      27    /* check results:  */
      28    for (i = 0; i < N; i++)
      29      {
      30        if (res[i].a != arr[i].b - arr[i].a
      31            || res[i].b != arr[i].a + arr[i].b)
      32  	abort ();
      33      }
      34  
      35    return 0;
      36  }
      37  
      38  int main (void)
      39  {
      40    int i;
      41    s arr[N];
      42    
      43    check_vect ();
      44  
      45    for (i = 0; i < N; i++)
      46      { 
      47        arr[i].a = i;
      48        arr[i].b = i * 2;
      49        asm volatile ("" ::: "memory");
      50      } 
      51  
      52    main1 (arr);
      53  
      54    return 0;
      55  }
      56  
      57  /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect"  { target vect_strided2 } } } */
      58