1 /* { dg-require-effective-target vect_int } */
19 __attribute__ ((noinline)) int
27 unsigned char u, t, s, x, y, z, w;
29 for (i = 0; i < N; i++)
40 u = arr[i].b - arr[i].a;
41 t = arr[i].d - arr[i].c;
42 check_res[i].c = u + t;
43 x = arr[i].b + arr[i].d;
44 check_res[i].a = arr[i].a + x;
45 check_res[i].d = u + t;
46 s = arr[i].h - arr[i].a;
47 check_res[i].b = s + t;
48 check_res[i].f = arr[i].f + arr[i].h;
49 check_res[i].e = arr[i].b + arr[i].e;
50 check_res[i].h = arr[i].d;
51 check_res[i].g = u + t;
57 for (i = 0; i < N; i++)
63 res[i].a = ptr->a + x;
67 res[i].f = ptr->f + ptr->h;
68 res[i].e = ptr->b + ptr->e;
75 for (i = 0; i < N; i++)
77 if (res[i].a != check_res[i].a
78 || res[i].b != check_res[i].b
79 || res[i].c != check_res[i].c
80 || res[i].d != check_res[i].d
81 || res[i].e != check_res[i].e
82 || res[i].f != check_res[i].f
83 || res[i].g != check_res[i].g
84 || res[i].h != check_res[i].h)
99 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_strided8 } } } */
100 /* { dg-final { cleanup-tree-dump "vect" } } */