PR tree-optimization/84740
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / bb-slp-8a.c
blobcf355efe69aa04db113a923607a8551f62b92016
1 /* { dg-require-effective-target vect_int } */
3 #include <stdarg.h>
4 #include "tree-vect.h"
6 #define N 16
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};
11 __attribute__ ((noinline)) int
12 main1 (unsigned int x, unsigned int y, unsigned int *pin, unsigned int *pout)
14 int i;
15 unsigned int a0, a1, a2, a3;
17 /* pin and pout may alias, and loads and stores are mixed. The basic block
18 cannot be vectorized. */
19 a0 = *pin++ + 23;
20 *pout++ = a0 * x;
21 a1 = *pin++ + 142;
22 *pout++ = a1 * y;
23 a2 = *pin++ + 2;
24 *pout++ = a2 * x;
25 a3 = *pin++ + 31;
26 *pout++ = a3 * y;
28 if (i)
29 __asm__ volatile ("" : : : "memory");
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 ();
38 return 0;
41 int main (void)
43 check_vect ();
45 main1 (2, 3, &in[0], &out[0]);
47 return 0;
50 /* { dg-final { scan-tree-dump-times "basic block vectorized" 0 "slp2" } } */