1 /* { dg-require-effective-target vect_int } */
9 short sc[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};
11 short sb[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};
14 int ic[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,
15 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
16 int ib[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};
23 /* Multiple types with different sizes, used in idependent
24 copmutations. Vectorizable. */
25 for (i = 0; i < n; i++)
27 sa[i+2] = sb[i] + sc[i];
28 ia[i+1] = ib[i] + ic[i];
32 for (i = 0; i < n; i++)
34 if (sa[i+2] != sb[i] + sc[i] || ia[i+1] != ib[i] + ic[i])
45 /* Multiple types with different sizes, used in idependent
46 copmutations. Vectorizable. */
47 for (i = 0; i < n; i++)
49 ia[i+1] = ib[i] + ic[i];
50 sa[i] = sb[i] + sc[i];
54 for (i = 0; i < n; i++)
56 if (sa[i] != sb[i] + sc[i] || ia[i+1] != ib[i] + ic[i])
74 /* { dg-final { scan-tree-dump-times "vectorized 0 loops" 2 "vect" } } */
75 /* { dg-final { scan-tree-dump-times "not vectorized: unsupported unaligned store" 2 "vect" } } */
76 /* { dg-final { cleanup-tree-dump "vect" } } */