diff options
author | Dan Albert <danalbert@google.com> | 2016-02-24 13:48:45 -0800 |
---|---|---|
committer | Dan Albert <danalbert@google.com> | 2016-02-24 13:51:18 -0800 |
commit | b9de1157289455b0ca26daff519d4a0ddcd1fa13 (patch) | |
tree | 4c56cc0a34b91f17033a40a455f26652304f7b8d /gcc-4.8.1/gcc/testsuite/gcc.dg/tree-ssa/prefetch-6.c | |
parent | 098157a754787181cfa10e71325832448ddcea98 (diff) | |
download | toolchain_gcc-b9de1157289455b0ca26daff519d4a0ddcd1fa13.tar.gz toolchain_gcc-b9de1157289455b0ca26daff519d4a0ddcd1fa13.tar.bz2 toolchain_gcc-b9de1157289455b0ca26daff519d4a0ddcd1fa13.zip |
Update 4.8.1 to 4.8.3.
My previous drop was the wrong version. The platform mingw is
currently using 4.8.3, not 4.8.1 (not sure how I got that wrong).
From ftp://ftp.gnu.org/gnu/gcc/gcc-4.8.3/gcc-4.8.3.tar.bz2.
Bug: http://b/26523949
Change-Id: Id85f1bdcbbaf78c7d0b5a69e74c798a08f341c35
Diffstat (limited to 'gcc-4.8.1/gcc/testsuite/gcc.dg/tree-ssa/prefetch-6.c')
-rw-r--r-- | gcc-4.8.1/gcc/testsuite/gcc.dg/tree-ssa/prefetch-6.c | 54 |
1 files changed, 0 insertions, 54 deletions
diff --git a/gcc-4.8.1/gcc/testsuite/gcc.dg/tree-ssa/prefetch-6.c b/gcc-4.8.1/gcc/testsuite/gcc.dg/tree-ssa/prefetch-6.c deleted file mode 100644 index 176830580..000000000 --- a/gcc-4.8.1/gcc/testsuite/gcc.dg/tree-ssa/prefetch-6.c +++ /dev/null @@ -1,54 +0,0 @@ -/* { dg-do compile { target { { i?86-*-* x86_64-*-* } && ia32 } } } */ -/* { dg-require-effective-target sse2 } */ -/* { dg-options "-O2 -fprefetch-loop-arrays -march=athlon -msse2 -mfpmath=sse --param simultaneous-prefetches=100 --param min-insn-to-prefetch-ratio=6 -fdump-tree-aprefetch-details" } */ - -#define N 1000 -#define K 900 - -double a[N][N]; - -double test(void) -{ - unsigned i, j; - double sum = 0; - - /* Here, we should use non-temporal prefetch instruction. */ - for (i = 0; i < K; i++) - for (j = 0; j < K; j++) - sum += a[i][j]; - - /* Here, we should not use non-temporal prefetch instruction, since the - value of a[i+10][j] is reused in L2 cache. */ - for (i = 0; i < K; i++) - for (j = 0; j < K; j++) - sum += a[i][j] * a[i + 10][j]; - - /* Here, we should use non-temporal prefetch instruction, since the - value of a[i+100][j] is too far to be reused in L2 cache. */ - for (i = 0; i < K; i++) - for (j = 0; j < K; j++) - sum += a[i][j] * a[i + 100][j]; - - /* Here, temporal prefetches should be used, since the volume of the - memory accesses is smaller than L2 cache. */ - for (i = 0; i < 100; i++) - for (j = 0; j < 100; j++) - sum += a[i][j] * a[i + 100][j]; - - /* Temporal prefetches should be used here (even though the accesses to - a[j][i] are independent, the same cache line is almost always hit - every N iterations). */ - for (i = 0; i < N; i++) - for (j = 0; j < N; j++) - sum += a[j][i]; - - return sum; -} - -/* { dg-final { scan-tree-dump-times "Issued prefetch" 5 "aprefetch" } } */ -/* { dg-final { scan-tree-dump-times "Issued nontemporal prefetch" 3 "aprefetch" } } */ - -/* { dg-final { scan-assembler-times "prefetcht" 5 } } */ -/* { dg-final { scan-assembler-times "prefetchnta" 3 } } */ - -/* { dg-final { cleanup-tree-dump "aprefetch" } } */ |