1 /* { dg-require-effective-target vect_int } */
9 short sb[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
10 16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31};
12 int ib[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,
13 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
15 /* Current peeling-for-alignment scheme will consider the 'sa[i+7]'
16 access for peeling, and therefore will examine the option of
17 using a peeling factor = VF-7%VF. This will result in a peeling factor 1,
18 which will also align the access to 'ia[i+3]', and the loop could be
19 vectorized on all targets that support unaligned loads.
26 /* Multiple types with different sizes, used in idependent
27 copmutations. Vectorizable. */
28 for (i = 0; i < n; i++)
35 for (i = 0; i < n; i++)
37 if (sa[i+7] != sb[i] || ia[i+3] != ib[i])
44 /* Current peeling-for-alignment scheme will consider the 'ia[i+3]'
45 access for peeling, and therefore will examine the option of
46 using a peeling factor = VF-3%VF. This will result in a peeling factor
47 5 if VF=8, or 1 if VF=4,2. In either case, this will also align the access
48 to 'sa[i+3]', and the loop could be vectorized on targets that support
55 /* Multiple types with different sizes, used in independent
56 copmutations. Vectorizable. */
57 for (i = 0; i < n; i++)
64 for (i = 0; i < n; i++)
66 if (sa[i+3] != sb[i] || ia[i+3] != ib[i])
83 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 2 "vect" { xfail vect_no_align } } } */
84 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 2 "vect" { xfail vect_no_align } } } */
85 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 4 "vect" { xfail vect_no_align } } } */
86 /* { dg-final { cleanup-tree-dump "vect" } } */