1  /* { dg-skip-if "Skip for mips -mpaired-single" { mips*-*-* } { "-mpaired-single" } } */
       2  /* PR tree-optimization/65963.  */
       3  #include "tree-vect.h"
       4  
       5  #define N 512
       6  
       7  int in[2*N], out[N];
       8  
       9  __attribute__ ((noinline)) void
      10  loop (void)
      11  {
      12    for (int i = 0; i < N; i++)
      13      out[i] = in[i << 1] + 7;
      14  }
      15  
      16  int
      17  main (int argc, char **argv)
      18  {
      19    check_vect ();
      20    for (int i = 0; i < 2*N; i++)
      21      {
      22        in[i] = i;
      23        __asm__ volatile ("" : : : "memory");
      24      }
      25    loop ();
      26    __asm__ volatile ("" : : : "memory");
      27    for (int i = 0; i < N; i++)
      28      {
      29        if (out[i] != i*2 + 7)
      30  	abort ();
      31      }
      32    return 0;
      33  }
      34  /* { dg-final { scan-tree-dump-times "vectorized 1 loops in function" 1 "vect" { target { vect_strided2 } } } } */