1 /* PR tree-optimization/87859 */
3 /* { dg-options "-O2 -fno-tree-vectorize -fdump-tree-store-merging-details" } */
4 /* { dg-final { scan-tree-dump "New sequence of \[23] stores to replace old one of 19 stores" "store-merging" { target i?86-*-* x86_64-*-* } } } */
5 /* { dg-final { scan-tree-dump "New sequence of 1 stores to replace old one of 6 stores" "store-merging" { target i?86-*-* x86_64-*-* } } } */
10 #define A(n) unsigned n:1;
11 #define B(n) A(n##0) A(n##1) A(n##2) A(n##3) A(n##4) \
12 A(n##5) A(n##6) A(n##7) A(n##8) A(n##9)
13 B(f
) B(f1
) B(f2
) B(f3
) B(f4
) B(f5
)
14 A(f60
) A(f61
) A(f62
) A(f63
) A(f64
) A(f65
) A(f66
)
21 .f
.q
.f0
= 1, .f
.q
.f1
= 1, .f
.q
.f2
= 1, .f
.q
.f5
= 1, .f
.q
.f6
= 1,
22 .f
.q
.f7
= 1, .f
.q
.f8
= 1, .f
.q
.f9
= 1, .f
.q
.f13
= 1, .f
.q
.f14
= 1,
23 .f
.q
.f15
= 1, .f
.q
.f16
= 1, .f
.q
.f17
= 1, .f
.q
.f19
= 1, .f
.q
.f21
= 1,
27 __attribute__((noipa
)) void
30 if (x
[0] != s
.f
.i
[0] || x
[1] != s
.f
.i
[1] || x
[2] != s
.f
.i
[2])
34 __attribute__((noipa
)) void
35 foo (unsigned char *state
)