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
;
43 for (i
= 0; i
< N
; i
++)
45 if (res
[i
].c
!= arr
[i
].b
+ arr
[i
].c
46 || res
[i
].a
!= arr
[i
].c
+ arr
[i
].f
+ arr
[i
].b
47 || res
[i
].d
!= arr
[i
].b
+ arr
[i
].c
48 || res
[i
].b
!= arr
[i
].c
49 || res
[i
].f
!= arr
[i
].f
+ arr
[i
].e
50 || res
[i
].e
!= arr
[i
].b
+ arr
[i
].e
51 || res
[i
].h
!= arr
[i
].c
52 || res
[i
].g
!= arr
[i
].b
+ arr
[i
].c
)
57 /* Vectorized as a strided SLP pair. */
58 for (i
= 0; i
< N
; i
++)
67 for (i
= 0; i
< N
; i
++)
69 if (res
[i
].a
!= arr
[i
].b
70 || res
[i
].b
!= arr
[i
].c
)
84 for (i
= 0; i
< N
; i
++)
94 asm volatile ("" ::: "memory");
102 /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" { target vect_strided8 } } } */