1 /* { dg-require-effective-target vect_int } */
19 __attribute__ ((noinline)) int
28 for (i = 0; i < N; i++)
39 check_res[i].c = arr[i].a;
40 check_res[i].a = arr[i].f + arr[i].a;
41 check_res[i].d = arr[i].f - arr[i].a;
42 check_res[i].b = arr[i].f;
43 check_res[i].f = arr[i].a;
44 check_res[i].e = arr[i].f - arr[i].a;
45 check_res[i].h = arr[i].f;
46 check_res[i].g = arr[i].f - arr[i].a;
52 for (i = 0; i < N; i++)
55 res[i].a = ptr->f + ptr->a;
56 res[i].d = ptr->f - ptr->a;
59 res[i].e = ptr->f - ptr->a;
61 res[i].g = ptr->f - ptr->a;
66 for (i = 0; i < N; i++)
68 if (res[i].a != check_res[i].a
69 || res[i].b != check_res[i].b
70 || res[i].c != check_res[i].c
71 || res[i].d != check_res[i].d
72 || res[i].e != check_res[i].e
73 || res[i].f != check_res[i].f
74 || res[i].g != check_res[i].g
75 || res[i].h != check_res[i].h)
90 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_strided8 } } } */
91 /* { dg-final { cleanup-tree-dump "vect" } } */