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