1 /* { dg-require-effective-target vect_int } */
21 __attribute__ ((noinline)) int
28 for (i = 0; i < N; i++)
31 res[i].a = ptr->f + ptr->b;
32 res[i].d = ptr->f - ptr->b;
35 res[i].e = ptr->f - ptr->b;
37 res[i].g = ptr->f - ptr->b;
42 for (i = 0; i < N; i++)
44 if (res[i].a != check_res[i].a
45 || res[i].b != check_res[i].b
46 || res[i].c != check_res[i].c
47 || res[i].d != check_res[i].d
48 || res[i].e != check_res[i].e
49 || res[i].f != check_res[i].f
50 || res[i].g != check_res[i].g
51 || res[i].h != check_res[i].h)
64 for (i = 0; i < N; i++)
75 check_res[i].c = arr[i].b;
76 check_res[i].a = arr[i].f + arr[i].b;
77 check_res[i].d = arr[i].f - arr[i].b;
78 check_res[i].b = arr[i].f;
79 check_res[i].f = arr[i].b;
80 check_res[i].e = arr[i].f - arr[i].b;
81 check_res[i].h = arr[i].f;
82 check_res[i].g = arr[i].f - arr[i].b;
92 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_strided8 } } } */
93 /* { dg-final { cleanup-tree-dump "vect" } } */