1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
|
/* { dg-do compile { target { i?86-*-* x86_64-*-* } } } */
/* { dg-options "-O2 -fprefetch-loop-arrays -march=amdfam10 --param simultaneous-prefetches=100 -fdump-tree-aprefetch-details -fdump-tree-optimized" } */
#define K 1000000
int a[K];
void test(int *p)
{
unsigned i;
/* Nontemporal store should not be used here (only write and read temporal
prefetches). */
for (i = 0; i < K - 10000; i++)
a[i + 10000] = a[i];
/* Nontemporal store should not be used here (only write and read nontemporal
prefetches). */
for (i = 0; i < K - 100000; i++)
a[i + 100000] = a[i];
/* Nontemporal store should be used neither for a nor for p, as we do not know
whether they alias or not. */
for (i = 0; i < K; i++)
{
a[i] = 0;
*p++ = 1;
}
/* Nontemporal store should not be used for a, as we do not know whether its
value will be reused or not. */
for (i = 0; i < 1000; i++)
a[i] = 0;
}
/* { dg-final { scan-tree-dump-times "Issued prefetch" 5 "aprefetch" } } */
/* { dg-final { scan-tree-dump-times "Issued nontemporal prefetch" 2 "aprefetch" } } */
/* { dg-final { scan-tree-dump-times "a nontemporal store" 0 "aprefetch" } } */
/* { dg-final { scan-tree-dump-times "builtin_prefetch" 7 "optimized" } } */
|
