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