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 *pin = &in[0];
      16    unsigned int *pout = &out[0];
      17    unsigned int a0, a1, a2, a3;
      18  
      19    /* Non isomorphic, even 64-bit subgroups.  */
      20    a0 = *pin++ + 23;
      21    a1 = *pin++ * 142;
      22    a2 = *pin++ + 2;
      23    a3 = *pin++ * 31;
      24  
      25    /* But we can still vectorize the multiplication or the store.  */
      26    *pout++ = a0 * x;
      27    *pout++ = a1 * y;
      28    *pout++ = a2 * x;
      29    *pout++ = a3 * y;
      30  
      31    /* Check results.  */
      32    if (out[0] != (in[0] + 23) * x
      33        || out[1] != (in[1] * 142) * y
      34        || out[2] != (in[2] + 2) * x
      35        || out[3] != (in[3] * 31) * y)
      36      abort();
      37  
      38    return 0;
      39  }
      40  
      41  int main (void)
      42  {
      43    check_vect ();
      44  
      45    main1 (2, 3);
      46  
      47    return 0;
      48  }
      49  
      50  /* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" } } */
      51