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 b192145c1c9b19c671a0d9cd760beb31a8f15ee3..4ae3447683c187a6f9eb97226a297025249b767e 100644 (file)
@@ -1,3 +1,21 @@
+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
index b1fd024a942a18901ae1f34252d7db9d68a14708..f59e9096d2cac349122bb2e4e7d7b78fb7fa77ab 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 8bd3ba78e73f61c3fbb4802c144fdc62e37f9bd9..e5d2895a17bc1c0010fa4aa15b99b56824c7b756 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 b9c9fac0c01eaab39fa36482e2d27195867924a8..76c8318d724a60859e4a67a4f245521471e08cf2 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 becec948c301e7398b15b5b82da8b56b0a9a5c58..a4d656ae830c82dc07fc852b6c63b149b957d21e 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 7c71ae4c4af607e4c56134872bfee67445dcebe8..64c761ca55a3bdb6ccf9227e0208afdcd19ef2b3 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 63e5bb73134f5e78d3eededf3d144ada8eee25f8..fca70d697130c4b7de36920c57b7dd34bf30edba 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 f5f765bb902231f17ba1a3edbe5b651c98885ef9..27e0e2dc08e949484eded629205d7a073b015893 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 25745275a4ef6629b4fe704a3192ea349304dc74..a1305e3e400e546ea4a2ab6b046eaabcf98e1ecf 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 98d3d2f183bbe3c862ccee3d4eb305969aafa678..e4515feb7e30620fb1f9b967f0def90241e4a287 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 4e64275fbbf6c29c3672cb9aaa0fdfc64a4cf8f7..51dbbcd6a3fa34d290ab489034bac653fcf91402 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 9d0d13964a1088bd7138bc460ab6b446061e7953..ea19edd820bbbf1ddcb8dfcf82359b55f51b38f8 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 2802836f31c3d3f623e5c85108dbb6545ce35b75..cedcc67a0e601b69092baba4cbe8eb211c552ed4 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 2c589c13c158331e4d3c997487cada53b27e5093..c475b7cf63145dc13ead1bf0695d9bb4bc37b2f4 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 7546c7331e13a20595dedf45586c7528914d7bcc..b983107356b51df14a31c8374ed5b90a247d56e7 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 2215739f98a76551f30cd5a4b87a931cdd812d6f..210da8dc791efaa34aeddd3c666b5804c75fb246 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];