diff options
| author | Thomas Schwinge <thomas@codesourcery.com> | 2016-04-12 12:40:22 +0200 |
|---|---|---|
| committer | Thomas Schwinge <tschwinge@gcc.gnu.org> | 2016-04-12 12:40:22 +0200 |
| commit | 27f9add31b0f005b0b90bf5d357dd0f7b664b664 (patch) | |
| tree | a3a6b2cefaacac0253ae68314ff489b848294db7 | |
| parent | b7a120d7a85727a990796ee64f0cc64a0eda59f0 (diff) | |
| download | gcc-27f9add31b0f005b0b90bf5d357dd0f7b664b664.zip gcc-27f9add31b0f005b0b90bf5d357dd0f7b664b664.tar.gz gcc-27f9add31b0f005b0b90bf5d357dd0f7b664b664.tar.bz2 | |
Improve libgomp.oacc-c-c++-common/par-loop-comb-reduction-2.c
libgomp/
* testsuite/libgomp.oacc-c-c++-common/par-loop-comb-reduction-2.c:
Make failure observable.
From-SVN: r234897
| -rw-r--r-- | libgomp/ChangeLog | 5 | ||||
| -rw-r--r-- | libgomp/testsuite/libgomp.oacc-c-c++-common/par-loop-comb-reduction-2.c | 4 |
2 files changed, 7 insertions, 2 deletions
diff --git a/libgomp/ChangeLog b/libgomp/ChangeLog index b53dc6b..6071b23 100644 --- a/libgomp/ChangeLog +++ b/libgomp/ChangeLog @@ -1,3 +1,8 @@ +2016-04-12 Thomas Schwinge <thomas@codesourcery.com> + + * testsuite/libgomp.oacc-c-c++-common/par-loop-comb-reduction-2.c: + Make failure observable. + 2016-04-12 Jakub Jelinek <jakub@redhat.com> * libgomp.h (struct gomp_target_task): Remove firstprivate_copies diff --git a/libgomp/testsuite/libgomp.oacc-c-c++-common/par-loop-comb-reduction-2.c b/libgomp/testsuite/libgomp.oacc-c-c++-common/par-loop-comb-reduction-2.c index a7a75a9..a339f32 100644 --- a/libgomp/testsuite/libgomp.oacc-c-c++-common/par-loop-comb-reduction-2.c +++ b/libgomp/testsuite/libgomp.oacc-c-c++-common/par-loop-comb-reduction-2.c @@ -19,7 +19,7 @@ main (int argc, char *argv[]) { #pragma acc loop worker vector reduction(^:res) for (i = 0; i < 1024; i++) - res ^= arr[j * 1024 + i]; + res ^= 3 * arr[j * 1024 + i]; #pragma acc loop worker vector reduction(^:res) for (i = 0; i < 1024; i++) @@ -30,7 +30,7 @@ main (int argc, char *argv[]) for (j = 0; j < 32; j++) for (i = 0; i < 1024; i++) { - hres ^= arr[j * 1024 + i]; + hres ^= 3 * arr[j * 1024 + i]; hres ^= arr[j * 1024 + (1023 - i)]; } |