1 /* { dg-require-effective-target vect_int } */
21 __attribute__ ((noinline)) int
27 unsigned char u, t, s, x, y, z, w;
29 for (i = 0; i < N; i++)
35 res[i].a = ptr->a + x;
39 res[i].f = ptr->f + ptr->h;
40 res[i].e = ptr->b + ptr->e;
47 for (i = 0; i < N; i++)
49 if (res[i].a != check_res[i].a
50 || res[i].b != check_res[i].b
51 || res[i].c != check_res[i].c
52 || res[i].d != check_res[i].d
53 || res[i].e != check_res[i].e
54 || res[i].f != check_res[i].f
55 || res[i].g != check_res[i].g
56 || res[i].h != check_res[i].h)
66 unsigned char u, t, s, x, y, z, w;
70 for (i = 0; i < N; i++)
81 u = arr[i].b - arr[i].a;
82 t = arr[i].d - arr[i].c;
83 check_res[i].c = u + t;
84 x = arr[i].b + arr[i].d;
85 check_res[i].a = arr[i].a + x;
86 check_res[i].d = u + t;
87 s = arr[i].h - arr[i].a;
88 check_res[i].b = s + t;
89 check_res[i].f = arr[i].f + arr[i].h;
90 check_res[i].e = arr[i].b + arr[i].e;
91 check_res[i].h = arr[i].d;
92 check_res[i].g = u + t;
103 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_strided8 } } } */
104 /* { dg-final { cleanup-tree-dump "vect" } } */