111
|
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, unsigned int *pin, unsigned int *pout)
|
|
13 {
|
|
14 int i;
|
|
15 unsigned int a0, a1, a2, a3;
|
|
16
|
|
17 /* pin and pout may alias. But since all the loads are before the first
|
|
18 store the basic block is vectorizable. */
|
|
19 a0 = *pin++ + 23;
|
|
20 a1 = *pin++ + 142;
|
|
21 a2 = *pin++ + 2;
|
|
22 a3 = *pin++ + 31;
|
|
23
|
|
24 *pout++ = a0 * x;
|
|
25 *pout++ = a1 * y;
|
|
26 *pout++ = a2 * x;
|
|
27 *pout++ = a3 * y;
|
|
28
|
|
29 if (i)
|
|
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[2] + 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, &in[0], &out[0]);
|
|
47
|
|
48 return 0;
|
|
49 }
|
|
50
|
|
51 /* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" { target vect_hw_misalign } } } */
|
|
52
|