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  unsigned int *pin = &in[0];
17  unsigned int *pout = &out[0];
18
19  /* pin and pout are different, so despite the fact that loads and stores
20     are mixed the basic block is vectorizable.  */
21  a0 = *pin++ + 23;
22  *pout++ = a0 * x;
23  a1 = *pin++ + 142;
24  *pout++ = a1 * y;
25  a2 = *pin++ + 2;
26  *pout++ = a2 * x;
27  a3 = *pin++ + 31;
28  *pout++ = a3 * y;
29
30  if (i)
31    __asm__ volatile ("" : : : "memory");
32
33  /* Check results.  */
34  if (out[0] != (in[0] + 23) * x
35      || out[1] != (in[1] + 142) * y
36      || out[2] != (in[2] + 2) * x
37      || out[3] != (in[3] + 31) * y)
38    abort ();
39
40  return 0;
41}
42
43int main (void)
44{
45  check_vect ();
46
47  main1 (2, 3);
48
49  return 0;
50}
51
52/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2"  { target vect_hw_misalign } } } */
53/* { dg-final { cleanup-tree-dump "slp2" } } */
54
55