1 /* { dg-skip-if "" { vect_no_align } } */
2 /* { dg-require-effective-target vect_int } */
3 /* { dg-add-options bind_pic_locally } */
11 short sc
[N
] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
12 16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31};
13 short sb
[N
] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
14 16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31};
16 int ic
[N
] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,
17 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
18 int ib
[N
] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,
19 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
21 __attribute__ ((noinline
))
26 /* Multiple types with different sizes, used in idependent
27 copmutations. Vectorizable. */
28 for (i
= 0; i
< n
; i
++)
30 sa
[i
+2] = sb
[i
] + sc
[i
];
31 ia
[i
+1] = ib
[i
] + ic
[i
];
35 for (i
= 0; i
< n
; i
++)
37 if (sa
[i
+2] != sb
[i
] + sc
[i
] || ia
[i
+1] != ib
[i
] + ic
[i
])
48 /* Multiple types with different sizes, used in idependent
49 copmutations. Vectorizable. */
50 for (i
= 0; i
< n
; i
++)
52 ia
[i
+1] = ib
[i
] + ic
[i
];
53 sa
[i
] = sb
[i
] + sc
[i
];
57 for (i
= 0; i
< n
; i
++)
59 if (sa
[i
] != sb
[i
] + sc
[i
] || ia
[i
+1] != ib
[i
] + ic
[i
])
77 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 2 "vect" { target vect_element_align } } } */
78 /* { dg-final { scan-tree-dump-times "not vectorized: unsupported unaligned store" 2 "vect" { xfail vect_element_align } } } */
79 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 3 "vect" { target vect_element_align xfail { ! vect_unaligned_possible } } } } */