ldist-27.c: Skip on Visium.
authorEric Botcazou <ebotcazou@adacore.com>
Tue, 16 Jan 2018 21:03:49 +0000 (21:03 +0000)
committerEric Botcazou <ebotcazou@gcc.gnu.org>
Tue, 16 Jan 2018 21:03:49 +0000 (21:03 +0000)
* 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

16 files changed:
gcc/testsuite/ChangeLog
gcc/testsuite/gcc.dg/tree-ssa/ldist-27.c
gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-1.c
gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-10.c
gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-11.c
gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-14.c
gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-15.c
gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-1b.c
gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-2.c
gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-3.c
gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-4.c
gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-5.c
gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-6.c
gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-7.c
gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-8.c
gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-9.c

index b192145..4ae3447 100644 (file)
@@ -1,5 +1,23 @@
 2018-01-16  Eric Botcazou  <ebotcazou@adacore.com>
 
+       * 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  <ebotcazou@adacore.com>
+
        PR testsuite/77734
        * gcc.dg/plugin/must-tail-call-1.c: Pass -fdelayed-branch on SPARC.
 
index b1fd024..f59e909 100644 (file)
@@ -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)
index 8bd3ba7..e5d2895 100644 (file)
@@ -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 */
 
index b9c9fac..76c8318 100644 (file)
@@ -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];
index becec94..a4d656a 100644 (file)
@@ -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];
index 7c71ae4..64c761c 100644 (file)
@@ -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 */
 
index 63e5bb7..fca70d6 100644 (file)
@@ -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 */
 
index f5f765b..27e0e2d 100644 (file)
@@ -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 */
 
index 2574527..a1305e3 100644 (file)
@@ -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 */
 
index 98d3d2f..e4515fe 100644 (file)
@@ -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 */
 
index 4e64275..51dbbcd 100644 (file)
@@ -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 */
 
index 9d0d139..ea19edd 100644 (file)
@@ -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];
index 2802836..cedcc67 100644 (file)
@@ -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];
index 2c589c1..c475b7c 100644 (file)
@@ -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];
index 7546c73..b983107 100644 (file)
@@ -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];
index 2215739..210da8d 100644 (file)
@@ -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];