1  /* { dg-require-effective-target vect_int } */
       2  
       3  #include <stdarg.h>
       4  #include "tree-vect.h"
       5  
       6  #define N 16 
       7  
       8  unsigned int out[N];
       9  unsigned int in[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
      10  
      11  __attribute__ ((noinline)) int
      12  main1 (unsigned int x, unsigned int y)
      13  {
      14    int i;
      15    unsigned int a0, a1, a2, a3;
      16  
      17    /* Not consecutive load with permutation - supported with building up
      18       the vector from scalars.  */
      19    a0 = in[0] + 23;
      20    a1 = in[1] + 142;
      21    a2 = in[1] + 2;
      22    a3 = in[3] + 31;
      23    
      24    out[0] = a0 * x;
      25    out[1] = a1 * y;
      26    out[2] = a2 * x;
      27    out[3] = a3 * y;
      28  
      29    if (x)
      30      __asm__ volatile ("" : : : "memory");
      31  
      32    /* Check results.  */
      33    if (out[0] != (in[0] + 23) * x
      34        || out[1] != (in[1] + 142) * y
      35        || out[2] != (in[1] + 2) * x
      36        || out[3] != (in[3] + 31) * y)
      37      abort();
      38  
      39    return 0;
      40  }
      41  
      42  int main (void)
      43  {
      44    check_vect ();
      45  
      46    main1 (2, 3);
      47  
      48    return 0;
      49  }
      50  
      51  /* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" { target vect_int_mult } } } */
      52