From ea5853a348038a1dc58fabc108b7bbc15f390fa0 Mon Sep 17 00:00:00 2001 From: Eric Botcazou Date: Tue, 16 Jan 2018 21:03:49 +0000 Subject: [PATCH] ldist-27.c: Skip on Visium. * gcc.dg/tree-ssa/ldist-27.c: Skip on Visium. * gcc.dg/tree-ssa/loop-interchange-1.c: Likewise. * gcc.dg/tree-ssa/loop-interchange-1b.c: Likewise. * gcc.dg/tree-ssa/loop-interchange-2.c: Likewise. * gcc.dg/tree-ssa/loop-interchange-3.c: Likewise. * gcc.dg/tree-ssa/loop-interchange-4.c: Likewise. * gcc.dg/tree-ssa/loop-interchange-5.c: Likewise. * gcc.dg/tree-ssa/loop-interchange-6.c: Likewise. * gcc.dg/tree-ssa/loop-interchange-7.c: Likewise. * gcc.dg/tree-ssa/loop-interchange-8.c: Likewise. * gcc.dg/tree-ssa/loop-interchange-9.c: Likewise. * gcc.dg/tree-ssa/loop-interchange-10.c: Likewise. * gcc.dg/tree-ssa/loop-interchange-11.c: Likewise. * gcc.dg/tree-ssa/loop-interchange-14.c: Likewise. * gcc.dg/tree-ssa/loop-interchange-15.c: Likewise. From-SVN: r256759 --- gcc/testsuite/ChangeLog | 18 ++++++++++++++++++ gcc/testsuite/gcc.dg/tree-ssa/ldist-27.c | 1 + .../gcc.dg/tree-ssa/loop-interchange-1.c | 1 + .../gcc.dg/tree-ssa/loop-interchange-10.c | 1 + .../gcc.dg/tree-ssa/loop-interchange-11.c | 1 + .../gcc.dg/tree-ssa/loop-interchange-14.c | 1 + .../gcc.dg/tree-ssa/loop-interchange-15.c | 1 + .../gcc.dg/tree-ssa/loop-interchange-1b.c | 1 + .../gcc.dg/tree-ssa/loop-interchange-2.c | 1 + .../gcc.dg/tree-ssa/loop-interchange-3.c | 1 + .../gcc.dg/tree-ssa/loop-interchange-4.c | 1 + .../gcc.dg/tree-ssa/loop-interchange-5.c | 1 + .../gcc.dg/tree-ssa/loop-interchange-6.c | 1 + .../gcc.dg/tree-ssa/loop-interchange-7.c | 1 + .../gcc.dg/tree-ssa/loop-interchange-8.c | 1 + .../gcc.dg/tree-ssa/loop-interchange-9.c | 1 + 16 files changed, 33 insertions(+) diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog index b192145c1c9..4ae3447683c 100644 --- a/gcc/testsuite/ChangeLog +++ b/gcc/testsuite/ChangeLog @@ -1,3 +1,21 @@ +2018-01-16 Eric Botcazou + + * gcc.dg/tree-ssa/ldist-27.c: Skip on Visium. + * gcc.dg/tree-ssa/loop-interchange-1.c: Likewise. + * gcc.dg/tree-ssa/loop-interchange-1b.c: Likewise. + * gcc.dg/tree-ssa/loop-interchange-2.c: Likewise. + * gcc.dg/tree-ssa/loop-interchange-3.c: Likewise. + * gcc.dg/tree-ssa/loop-interchange-4.c: Likewise. + * gcc.dg/tree-ssa/loop-interchange-5.c: Likewise. + * gcc.dg/tree-ssa/loop-interchange-6.c: Likewise. + * gcc.dg/tree-ssa/loop-interchange-7.c: Likewise. + * gcc.dg/tree-ssa/loop-interchange-8.c: Likewise. + * gcc.dg/tree-ssa/loop-interchange-9.c: Likewise. + * gcc.dg/tree-ssa/loop-interchange-10.c: Likewise. + * gcc.dg/tree-ssa/loop-interchange-11.c: Likewise. + * gcc.dg/tree-ssa/loop-interchange-14.c: Likewise. + * gcc.dg/tree-ssa/loop-interchange-15.c: Likewise. + 2018-01-16 Eric Botcazou PR testsuite/77734 diff --git a/gcc/testsuite/gcc.dg/tree-ssa/ldist-27.c b/gcc/testsuite/gcc.dg/tree-ssa/ldist-27.c index b1fd024a942..f59e9096d2c 100644 --- a/gcc/testsuite/gcc.dg/tree-ssa/ldist-27.c +++ b/gcc/testsuite/gcc.dg/tree-ssa/ldist-27.c @@ -1,5 +1,6 @@ /* { dg-do run } */ /* { dg-options "-O3 -ftree-loop-distribute-patterns -fdump-tree-ldist-details" } */ +/* { dg-skip-if "too big data segment" { visium-*-* } } */ #define M (300) #define N (200) diff --git a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-1.c b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-1.c index 8bd3ba78e73..e5d2895a17b 100644 --- a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-1.c +++ b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-1.c @@ -1,5 +1,6 @@ /* { dg-do run } */ /* { dg-options "-O2 -floop-interchange -fassociative-math -fno-signed-zeros -fno-trapping-math -fdump-tree-linterchange-details" } */ +/* { dg-skip-if "too big data segment" { visium-*-* } } */ /* Copied from graphite/interchange-4.c */ diff --git a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-10.c b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-10.c index b9c9fac0c01..76c8318d724 100644 --- a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-10.c +++ b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-10.c @@ -1,5 +1,6 @@ /* { dg-do run } */ /* { dg-options "-O2 -floop-interchange -fdump-tree-linterchange-details" } */ +/* { dg-skip-if "too big data segment" { visium-*-* } } */ #define M 256 int a[M][M], b[M][M]; diff --git a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-11.c b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-11.c index becec948c30..a4d656ae830 100644 --- a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-11.c +++ b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-11.c @@ -1,5 +1,6 @@ /* { dg-do compile } */ /* { dg-options "-O2 -floop-interchange -fdump-tree-linterchange-details" } */ +/* { dg-skip-if "too big data segment" { visium-*-* } } */ #define M 256 int a[M][M], b[M][M]; diff --git a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-14.c b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-14.c index 7c71ae4c4af..64c761ca55a 100644 --- a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-14.c +++ b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-14.c @@ -1,6 +1,7 @@ /* PR tree-optimization/83337 */ /* { dg-do run { target int32plus } } */ /* { dg-options "-O2 -floop-interchange -fdump-tree-linterchange-details" } */ +/* { dg-skip-if "too big data segment" { visium-*-* } } */ /* Copied from graphite/interchange-5.c */ diff --git a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-15.c b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-15.c index 63e5bb73134..fca70d69713 100644 --- a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-15.c +++ b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-15.c @@ -2,6 +2,7 @@ /* { dg-do run { target int32plus } } */ /* { dg-options "-O2 -floop-interchange" } */ /* { dg-require-effective-target alloca } */ +/* { dg-skip-if "too big stack" { visium-*-* } } */ /* Copied from graphite/interchange-5.c */ diff --git a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-1b.c b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-1b.c index f5f765bb902..27e0e2dc08e 100644 --- a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-1b.c +++ b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-1b.c @@ -1,5 +1,6 @@ /* { dg-do run } */ /* { dg-options "-O2 -floop-interchange -fdump-tree-linterchange-details" } */ +/* { dg-skip-if "too big data segment" { visium-*-* } } */ /* Copied from graphite/interchange-4.c */ diff --git a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-2.c b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-2.c index 25745275a4e..a1305e3e400 100644 --- a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-2.c +++ b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-2.c @@ -1,5 +1,6 @@ /* { dg-do run } */ /* { dg-options "-O2 -floop-interchange -fdump-tree-linterchange-details" } */ +/* { dg-skip-if "too big data segment" { visium-*-* } } */ /* Copied from graphite/interchange-5.c */ diff --git a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-3.c b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-3.c index 98d3d2f183b..e4515feb7e3 100644 --- a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-3.c +++ b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-3.c @@ -1,5 +1,6 @@ /* { dg-do run } */ /* { dg-options "-O2 -floop-interchange -fdump-tree-linterchange-details" } */ +/* { dg-skip-if "too big stack" { visium-*-* } } */ /* Copied from graphite/interchange-6.c */ diff --git a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-4.c b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-4.c index 4e64275fbbf..51dbbcd6a3f 100644 --- a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-4.c +++ b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-4.c @@ -1,6 +1,7 @@ /* { dg-do run } */ /* { dg-options "-O2 -floop-interchange -fdump-tree-linterchange-details" } */ /* { dg-require-stack-size "8*111*1111" } */ +/* { dg-skip-if "too big stack" { visium-*-* } } */ /* Copied from graphite/interchange-7.c */ diff --git a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-5.c b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-5.c index 9d0d13964a1..ea19edd820b 100644 --- a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-5.c +++ b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-5.c @@ -1,5 +1,6 @@ /* { dg-do run } */ /* { dg-options "-O2 -floop-interchange -fdump-tree-linterchange-details" } */ +/* { dg-skip-if "too big data segment" { visium-*-* } } */ #define M 256 int a[M][M], b[M][M], c[M][M], d[M][M]; diff --git a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-6.c b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-6.c index 2802836f31c..cedcc67a0e6 100644 --- a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-6.c +++ b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-6.c @@ -1,5 +1,6 @@ /* { dg-do run } */ /* { dg-options "-O2 -floop-interchange -fdump-tree-linterchange-details" } */ +/* { dg-skip-if "too big data segment" { visium-*-* } } */ #define M 256 int a[M][M], b[M][M], c[M][M], d[M][M]; diff --git a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-7.c b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-7.c index 2c589c13c15..c475b7cf631 100644 --- a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-7.c +++ b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-7.c @@ -1,5 +1,6 @@ /* { dg-do run } */ /* { dg-options "-O2 -floop-interchange -fdump-tree-linterchange-details" } */ +/* { dg-skip-if "too big data segment" { visium-*-* } } */ #define M 256 int a[M][M], b[M][M], c[M][M], d[M][M]; diff --git a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-8.c b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-8.c index 7546c7331e1..b983107356b 100644 --- a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-8.c +++ b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-8.c @@ -1,5 +1,6 @@ /* { dg-do run } */ /* { dg-options "-O2 -floop-interchange -fdump-tree-linterchange-details" } */ +/* { dg-skip-if "too big data segment" { visium-*-* } } */ #define M 256 int a[M][M], b[M][M], c[M][M], d[M][M]; diff --git a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-9.c b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-9.c index 2215739f98a..210da8dc791 100644 --- a/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-9.c +++ b/gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-9.c @@ -1,5 +1,6 @@ /* { dg-do run } */ /* { dg-options "-O2 -floop-interchange -fdump-tree-linterchange-details" } */ +/* { dg-skip-if "too big data segment" { visium-*-* } } */ #define M 256 int a[M][M], b[M][M], c[M], d[M]; -- 2.30.2