1 /* { dg-require-effective-target vect_int } */
19 __attribute__ ((noinline)) int
27 for (i = 0; i < N; i++)
29 res[i].c = ptr->b + ptr->c;
31 res[i].a = x + ptr->b;
32 res[i].d = ptr->b + ptr->c;
34 res[i].f = ptr->f + ptr->e;
35 res[i].e = ptr->b + ptr->e;
37 res[i].g = ptr->b + ptr->c;
42 for (i = 0; i < N; i++)
44 if (res[i].c != arr[i].b + arr[i].c
45 || res[i].a != arr[i].c + arr[i].f + arr[i].b
46 || res[i].d != arr[i].b + arr[i].c
47 || res[i].b != arr[i].c
48 || res[i].f != arr[i].f + arr[i].e
49 || res[i].e != arr[i].b + arr[i].e
50 || res[i].h != arr[i].c
51 || res[i].g != arr[i].b + arr[i].c)
56 /* Not vectorizable: gap in store. */
57 for (i = 0; i < N; i++)
65 for (i = 0; i < N; i++)
67 if (res[i].a != arr[i].b
68 || res[i].b != arr[i].c)
82 for (i = 0; i < N; i++)
101 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_interleave && vect_extract_even_odd } } } } */
102 /* { dg-final { cleanup-tree-dump "vect" } } */