1 /* { dg-do compile { target { { i?86-*-* x86_64-*-* } && ia32 } } } */
2 /* { dg-options "-O2 --param min-insn-to-prefetch-ratio=5 -fprefetch-loop-arrays -march=athlon -fdump-tree-aprefetch-details" } */
4 /* These are common idioms for writing variable-length arrays at the end
5 of structures. We should not deduce anything about the number of iterations
6 of the loops from them. */
14 int loop0 (int n, struct tail0 *x)
18 for (i = 0; i < n; i++)
29 int loop1 (int n, struct tail1 *x)
33 for (i = 0; i < n; i++)
39 /* It is unlikely that this should be a tail array. We may deduce that most
40 likely, the loop iterates about 5 times, and the array is not worth prefetching. */
47 int loop5 (int n, struct tail5 *x)
51 for (i = 0; i < n; i++)
57 /* { dg-final { scan-tree-dump-times "Issued prefetch" 2 "aprefetch" } } */
58 /* { dg-final { scan-tree-dump-times "Not prefetching" 1 "aprefetch" } } */
59 /* { dg-final { cleanup-tree-dump "aprefetch" } } */