1 /* { dg-require-effective-target vect_int } */
9 unsigned int ic[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
10 unsigned int ib[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
12 unsigned short sc[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
13 unsigned short sb[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
15 unsigned char cc[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
16 unsigned char cb[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
18 __attribute__ ((noinline))
23 /* Multiple types with different sizes, used in independent
24 computations. Vectorizable. All accesses aligned. */
25 for (i = 0; i < N; i++)
27 ia[i] = ib[i] + ic[i];
28 sa[i] = sb[i] + sc[i];
29 ca[i] = cb[i] + cc[i];
33 for (i = 0; i < N; i++)
35 if (ia[i] != ib[i] + ic[i]
36 || sa[i] != sb[i] + sc[i]
37 || ca[i] != cb[i] + cc[i])
51 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
52 /* { dg-final { cleanup-tree-dump "vect" } } */