diff options
author | rguenth <rguenth@138bc75d-0d04-0410-961f-82ee72b054a4> | 2012-07-02 11:43:46 +0000 |
---|---|---|
committer | rguenth <rguenth@138bc75d-0d04-0410-961f-82ee72b054a4> | 2012-07-02 11:43:46 +0000 |
commit | 87e200413ff278de07c47cb21bbbbaac238864ec (patch) | |
tree | 7571e73ba6cb3202642afdc4b34430a313e9a3a3 /libgomp | |
parent | 32819af552a46e7ee5814325586cabb5b86c9890 (diff) | |
download | gcc-87e200413ff278de07c47cb21bbbbaac238864ec.tar.gz |
2012-07-02 Richard Guenther <rguenther@suse.de>
Michael Matz <matz@suse.de>
Tobias Grosser <tobias@grosser.es>
Sebastian Pop <sebpop@gmail.com>
config/
* cloog.m4: Set up to work against ISL only.
* isl.m4: New file.
* Makefile.def: Add ISL host module, remove PPL host module.
Adjust ClooG host module to use the proper ISL.
* Makefile.tpl: Pass ISL include flags instead of PPL ones.
* configure.ac: Include config/isl.m4. Add ISL host library,
remove PPL. Remove PPL configury, add ISL configury, adjust
ClooG configury.
* Makefile.in: Regenerated.
* configure: Likewise.
gcc/
* Makefile.in: Remove PPL flags in favor of ISL ones.
(BACKENDLIBS): Remove PPL libs.
(INCLUDES): Remove PPL includes in favor of ISL ones.
(graphite-clast-to-gimple.o): Remove graphite-dependences.h and
graphite-cloog-compat.h dependencies.
(graphite-dependences.o): Likewise.
(graphite-poly.o): Likewise.
* configure.ac: Declare ISL vars instead of PPL ones.
* configure: Regenerated.
* doc/install.texi: Replace PPL requirement documentation
with ISL one.
* graphite-blocking.c: Remove PPL code, add ISL equivalent.
* graphite-clast-to-gimple.c: Likewise.
* graphite-dependences.c: Likewise.
* graphite-interchange.c: Likewise.
* graphite-poly.h: Likewise.
* graphite-poly.c: Likewise.
* graphite-sese-to-poly.c: Likewise.
* graphite.c: Likewise.
* graphite-scop-detection.c: Re-arrange includes.
* graphite-cloog-util.c: Remove.
* graphite-cloog-util.h: Likewise.
* graphite-ppl.h: Likewise.
* graphite-ppl.c: Likewise.
* graphite-dependences.h: Likewise.
libgomp/
* testsuite/libgomp.graphite/force-parallel-4.c: Adjust.
* testsuite/libgomp.graphite/force-parallel-5.c: Likewise.
* testsuite/libgomp.graphite/force-parallel-7.c: Likewise.
* testsuite/libgomp.graphite/force-parallel-8.c: Likewise.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@189156 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'libgomp')
-rw-r--r-- | libgomp/ChangeLog | 10 | ||||
-rw-r--r-- | libgomp/testsuite/libgomp.graphite/force-parallel-4.c | 1 | ||||
-rw-r--r-- | libgomp/testsuite/libgomp.graphite/force-parallel-5.c | 2 | ||||
-rw-r--r-- | libgomp/testsuite/libgomp.graphite/force-parallel-7.c | 21 | ||||
-rw-r--r-- | libgomp/testsuite/libgomp.graphite/force-parallel-8.c | 16 |
5 files changed, 37 insertions, 13 deletions
diff --git a/libgomp/ChangeLog b/libgomp/ChangeLog index 1cfd599d460..ace010430e7 100644 --- a/libgomp/ChangeLog +++ b/libgomp/ChangeLog @@ -1,3 +1,13 @@ +2012-07-02 Richard Guenther <rguenther@suse.de> + Michael Matz <matz@suse.de> + Tobias Grosser <tobias@grosser.es> + Sebastian Pop <sebpop@gmail.com> + + * testsuite/libgomp.graphite/force-parallel-4.c: Adjust. + * testsuite/libgomp.graphite/force-parallel-5.c: Likewise. + * testsuite/libgomp.graphite/force-parallel-7.c: Likewise. + * testsuite/libgomp.graphite/force-parallel-8.c: Likewise. + 2012-06-28 Andreas Schwab <schwab@linux-m68k.org> * libgomp.texi: Include gpl_v3.texi instead of gpl.texi. diff --git a/libgomp/testsuite/libgomp.graphite/force-parallel-4.c b/libgomp/testsuite/libgomp.graphite/force-parallel-4.c index c0c6b1c6e55..825bda5c439 100644 --- a/libgomp/testsuite/libgomp.graphite/force-parallel-4.c +++ b/libgomp/testsuite/libgomp.graphite/force-parallel-4.c @@ -47,6 +47,7 @@ int main(void) } /* Check that parallel code generation part make the right answer. */ +/* { dg-final { scan-tree-dump-times "1 loops carried no dependency" 1 "graphite" } } */ /* { dg-final { scan-tree-dump-times "2 loops carried no dependency" 1 "graphite" } } */ /* { dg-final { cleanup-tree-dump "graphite" } } */ /* { dg-final { scan-tree-dump-times "loopfn.0" 5 "optimized" } } */ diff --git a/libgomp/testsuite/libgomp.graphite/force-parallel-5.c b/libgomp/testsuite/libgomp.graphite/force-parallel-5.c index b72b0215f3f..5c944dcee61 100644 --- a/libgomp/testsuite/libgomp.graphite/force-parallel-5.c +++ b/libgomp/testsuite/libgomp.graphite/force-parallel-5.c @@ -31,7 +31,7 @@ int main(void) } /* Check that parallel code generation part make the right answer. */ -/* { dg-final { scan-tree-dump-times "2 loops carried no dependency" 1 "graphite" } } */ +/* { dg-final { scan-tree-dump-times "1 loops carried no dependency" 1 "graphite" } } */ /* { dg-final { cleanup-tree-dump "graphite" } } */ /* { dg-final { scan-tree-dump-times "loopfn.0" 5 "optimized" } } */ /* { dg-final { scan-tree-dump-times "loopfn.1" 5 "optimized" } } */ diff --git a/libgomp/testsuite/libgomp.graphite/force-parallel-7.c b/libgomp/testsuite/libgomp.graphite/force-parallel-7.c index 0191af085ea..2fbe10a4e5c 100644 --- a/libgomp/testsuite/libgomp.graphite/force-parallel-7.c +++ b/libgomp/testsuite/libgomp.graphite/force-parallel-7.c @@ -2,29 +2,30 @@ int A[N+5][N+5][N+5]; -int foo(void) +void abort (void); + +int foo (void) { int i, j, k; + for (i = 0; i < N + 5; i++) + for (j = 0; j < N + 5; j++) + for (k = 0; k < N + 5; k++) + A[i][j][k] = i + j + k; + /* Loop i: carried no dependency. */ for (i = 0; i < N; i++) for (j = 0; j < N; j++) for (k = 0; k < N; k++) A[k+1][j+2][i+1] = A[k][j][i+1]; - for (i = 0; i < N; i++) - /* Loop j: carried no dependency. */ - for (j = 0; j < N; j++) - /* Loop k: carreid no dependency. */ - for (k = 0; k < N; k++) - A[i+1][j][k] = A[i][j][k+1]; - return A[1][5][2]; } -int main(void) +int main (void) { - foo(); + if (5 != foo ()) + abort (); return 0; } diff --git a/libgomp/testsuite/libgomp.graphite/force-parallel-8.c b/libgomp/testsuite/libgomp.graphite/force-parallel-8.c index dc553f53f1d..f9ce9686fef 100644 --- a/libgomp/testsuite/libgomp.graphite/force-parallel-8.c +++ b/libgomp/testsuite/libgomp.graphite/force-parallel-8.c @@ -2,11 +2,20 @@ int x[N][N], y[N]; +void abort (void); + int foo(void) { int i, j; for (i = 0; i < N; i++) + y[i] = i; + + for (i = 0; i < N; i++) + for (j = 0; j < N; j++) + x[i][j] = i + j; + + for (i = 0; i < N; i++) { y[i] = i; @@ -27,13 +36,16 @@ int foo(void) int main(void) { - foo(); + if (168 != foo()) + abort (); return 0; } /* Check that parallel code generation part make the right answer. */ -/* { dg-final { scan-tree-dump-times "2 loops carried no dependency" 1 "graphite" } } */ +/* { dg-final { scan-tree-dump-times "1 loops carried no dependency" 1 "graphite" } } */ +/* { dg-final { scan-tree-dump-times "3 loops carried no dependency" 1 "graphite" } } */ +/* { dg-final { scan-tree-dump-times "5 loops carried no dependency" 1 "graphite" } } */ /* { dg-final { cleanup-tree-dump "graphite" } } */ /* { dg-final { scan-tree-dump-times "loopfn.0" 5 "optimized" } } */ /* { dg-final { scan-tree-dump-times "loopfn.1" 5 "optimized" } } */ |