This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
[testsuite] Skip loop tests on Visium
- From: Eric Botcazou <ebotcazou at adacore dot com>
- To: gcc-patches at gcc dot gnu dot org
- Date: Tue, 16 Jan 2018 22:03:56 +0100
- Subject: [testsuite] Skip loop tests on Visium
- Authentication-results: sourceware.org; auth=none
They either use too much space in the data segment or on the stack.
Tested on visium-elf, applied on the mainline.
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.
--
Eric Botcazou
Index: gcc.dg/tree-ssa/ldist-27.c
===================================================================
--- gcc.dg/tree-ssa/ldist-27.c (revision 256562)
+++ gcc.dg/tree-ssa/ldist-27.c (working copy)
@@ -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: gcc.dg/tree-ssa/loop-interchange-1.c
===================================================================
--- gcc.dg/tree-ssa/loop-interchange-1.c (revision 256562)
+++ gcc.dg/tree-ssa/loop-interchange-1.c (working copy)
@@ -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: gcc.dg/tree-ssa/loop-interchange-10.c
===================================================================
--- gcc.dg/tree-ssa/loop-interchange-10.c (revision 256562)
+++ gcc.dg/tree-ssa/loop-interchange-10.c (working copy)
@@ -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: gcc.dg/tree-ssa/loop-interchange-11.c
===================================================================
--- gcc.dg/tree-ssa/loop-interchange-11.c (revision 256562)
+++ gcc.dg/tree-ssa/loop-interchange-11.c (working copy)
@@ -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: gcc.dg/tree-ssa/loop-interchange-14.c
===================================================================
--- gcc.dg/tree-ssa/loop-interchange-14.c (revision 256562)
+++ gcc.dg/tree-ssa/loop-interchange-14.c (working copy)
@@ -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: gcc.dg/tree-ssa/loop-interchange-15.c
===================================================================
--- gcc.dg/tree-ssa/loop-interchange-15.c (revision 256562)
+++ gcc.dg/tree-ssa/loop-interchange-15.c (working copy)
@@ -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: gcc.dg/tree-ssa/loop-interchange-1b.c
===================================================================
--- gcc.dg/tree-ssa/loop-interchange-1b.c (revision 256562)
+++ gcc.dg/tree-ssa/loop-interchange-1b.c (working copy)
@@ -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: gcc.dg/tree-ssa/loop-interchange-2.c
===================================================================
--- gcc.dg/tree-ssa/loop-interchange-2.c (revision 256562)
+++ gcc.dg/tree-ssa/loop-interchange-2.c (working copy)
@@ -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: gcc.dg/tree-ssa/loop-interchange-3.c
===================================================================
--- gcc.dg/tree-ssa/loop-interchange-3.c (revision 256562)
+++ gcc.dg/tree-ssa/loop-interchange-3.c (working copy)
@@ -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: gcc.dg/tree-ssa/loop-interchange-4.c
===================================================================
--- gcc.dg/tree-ssa/loop-interchange-4.c (revision 256562)
+++ gcc.dg/tree-ssa/loop-interchange-4.c (working copy)
@@ -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: gcc.dg/tree-ssa/loop-interchange-5.c
===================================================================
--- gcc.dg/tree-ssa/loop-interchange-5.c (revision 256562)
+++ gcc.dg/tree-ssa/loop-interchange-5.c (working copy)
@@ -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: gcc.dg/tree-ssa/loop-interchange-6.c
===================================================================
--- gcc.dg/tree-ssa/loop-interchange-6.c (revision 256562)
+++ gcc.dg/tree-ssa/loop-interchange-6.c (working copy)
@@ -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: gcc.dg/tree-ssa/loop-interchange-7.c
===================================================================
--- gcc.dg/tree-ssa/loop-interchange-7.c (revision 256562)
+++ gcc.dg/tree-ssa/loop-interchange-7.c (working copy)
@@ -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: gcc.dg/tree-ssa/loop-interchange-8.c
===================================================================
--- gcc.dg/tree-ssa/loop-interchange-8.c (revision 256562)
+++ gcc.dg/tree-ssa/loop-interchange-8.c (working copy)
@@ -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: gcc.dg/tree-ssa/loop-interchange-9.c
===================================================================
--- gcc.dg/tree-ssa/loop-interchange-9.c (revision 256562)
+++ gcc.dg/tree-ssa/loop-interchange-9.c (working copy)
@@ -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];