|
111
|
1 /* { dg-require-effective-target vect_int } */
|
|
|
2
|
|
|
3 #include <stdarg.h>
|
|
|
4 #include "tree-vect.h"
|
|
|
5
|
|
|
6 #define N 128
|
|
|
7
|
|
|
8 /* unaligned store. */
|
|
|
9
|
|
|
10 int ib[N+7];
|
|
|
11
|
|
|
12 __attribute__ ((noinline))
|
|
|
13 int main1 ()
|
|
|
14 {
|
|
|
15 int i;
|
|
|
16 int ia[N+1];
|
|
|
17
|
|
|
18 /* The store is aligned and the loads are misaligned with the same
|
|
|
19 misalignment. Cost model is disabled. If misaligned stores are supported,
|
|
|
20 we peel according to the loads to align them. */
|
|
|
21 for (i = 0; i <= N; i++)
|
|
|
22 {
|
|
|
23 ia[i] = ib[i+2] + ib[i+6];
|
|
|
24 }
|
|
|
25
|
|
|
26 /* check results: */
|
|
|
27 for (i = 1; i <= N; i++)
|
|
|
28 {
|
|
|
29 if (ia[i] != ib[i+2] + ib[i+6])
|
|
|
30 abort ();
|
|
|
31 }
|
|
|
32
|
|
|
33 return 0;
|
|
|
34 }
|
|
|
35
|
|
|
36 int main (void)
|
|
|
37 {
|
|
|
38 int i;
|
|
|
39
|
|
|
40 check_vect ();
|
|
|
41
|
|
|
42 for (i = 0; i <= N+6; i++)
|
|
|
43 {
|
|
|
44 asm volatile ("" : "+r" (i));
|
|
|
45 ib[i] = i;
|
|
|
46 }
|
|
|
47
|
|
|
48 return main1 ();
|
|
|
49 }
|
|
|
50
|
|
|
51 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
|
|
52 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { target { { vect_element_align } && { vect_aligned_arrays } } } } } */
|
|
|
53 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { target { { vect_element_align } && { vect_aligned_arrays } } } } } */
|
