1 /* Disabling epilogues until we find a better way to deal with scans. */
2 /* { dg-additional-options "--param vect-epilogues-nomask=0" } */
3 /* { dg-require-effective-target vect_int } */
4 /* { dg-skip-if "AArch64 tiny code model does not support programs larger than 1MiB" {aarch64_tiny} } */
5 /* { dg-add-options bind_pic_locally } */
18 struct s a
; /* array a.n is unaligned */
21 struct s e
; /* array e.n is aligned */
26 __attribute__ ((noinline
))
32 for (i
= 0; i
< N
; i
++)
34 tmp1
.a
.n
[1][2][i
] = 5;
39 for (i
= 0; i
<N
; i
++)
41 if (tmp1
.a
.n
[1][2][i
] != 5)
46 for (i
= 3; i
< N
-1; i
++)
48 tmp1
.a
.n
[1][2][i
] = 6;
53 for (i
= 3; i
< N
-1; i
++)
55 if (tmp1
.a
.n
[1][2][i
] != 6)
60 for (i
= 0; i
< N
; i
++)
62 tmp1
.e
.n
[1][2][i
] = 7;
67 for (i
= 0; i
< N
; i
++)
69 if (tmp1
.e
.n
[1][2][i
] != 7)
74 for (i
= 3; i
< N
-3; i
++)
76 tmp1
.e
.n
[1][2][i
] = 8;
81 for (i
= 3; i
<N
-3; i
++)
83 if (tmp1
.e
.n
[1][2][i
] != 8)
97 /* { dg-final { scan-tree-dump-times "vectorized 4 loops" 1 "vect" } } */
98 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
99 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 4 "vect" { target { {! vect_aligned_arrays} && {vect_sizes_32B_16B} } } } } */
100 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 2 "vect" { target { {vect_aligned_arrays} && {! vect_sizes_32B_16B} } } } } */