From patchwork Tue Jan 16 21:03:56 2018 Content-Type: text/plain; charset="utf-8" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit X-Patchwork-Submitter: Eric Botcazou X-Patchwork-Id: 861890 Return-Path: X-Original-To: incoming@patchwork.ozlabs.org Delivered-To: patchwork-incoming@bilbo.ozlabs.org Authentication-Results: ozlabs.org; spf=pass (mailfrom) smtp.mailfrom=gcc.gnu.org (client-ip=209.132.180.131; helo=sourceware.org; envelope-from=gcc-patches-return-471422-incoming=patchwork.ozlabs.org@gcc.gnu.org; receiver=) Authentication-Results: ozlabs.org; dkim=pass (1024-bit key; unprotected) header.d=gcc.gnu.org header.i=@gcc.gnu.org header.b="XHnZNX1t"; dkim-atps=neutral Received: from sourceware.org (server1.sourceware.org [209.132.180.131]) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (No client certificate requested) by ozlabs.org (Postfix) with ESMTPS id 3zLjQ34qpWz9sP9 for ; Wed, 17 Jan 2018 08:04:09 +1100 (AEDT) DomainKey-Signature: a=rsa-sha1; c=nofws; d=gcc.gnu.org; h=list-id :list-unsubscribe:list-archive:list-post:list-help:sender:from :to:subject:date:message-id:mime-version:content-type :content-transfer-encoding; q=dns; s=default; b=jgmt5cO6feckR1Iy L+cOS4tutd6lKn+BD0pBPsyLyKP07RdKkqeqEgWmA72HdPCF5Wm2bE2LuyznZPYS Z6Cxx6HCilGApb5/JM/3Vs4kdTc4Jbej9JE2qJysmNo3dm2vC9tLxHe5Oq+dCBTW T7gkrQwQQ+n4eBrXlwisf3Vk7MQ= DKIM-Signature: v=1; a=rsa-sha1; c=relaxed; d=gcc.gnu.org; h=list-id :list-unsubscribe:list-archive:list-post:list-help:sender:from :to:subject:date:message-id:mime-version:content-type :content-transfer-encoding; s=default; bh=98UdF8sk6KfyzQ3+oUuwKx TH2iA=; b=XHnZNX1tAZYq0yrRZL/3Bs8A5LezL4E/jaehT2u/sGdW4CDcbUDGn0 szey8KJLty9k64Qby6gjx7eIgvTn2KYM9RXs8xZYEALM+0qHgo5wXIOQypa89mGj yFErRjInQMUbyjTUFiU6kplvDEtDpzkiSKzwayZvLZU1YHIqFWLrY= Received: (qmail 43732 invoked by alias); 16 Jan 2018 21:04:02 -0000 Mailing-List: contact gcc-patches-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Id: List-Unsubscribe: List-Archive: List-Post: List-Help: Sender: gcc-patches-owner@gcc.gnu.org Delivered-To: mailing list gcc-patches@gcc.gnu.org Received: (qmail 43715 invoked by uid 89); 16 Jan 2018 21:04:01 -0000 Authentication-Results: sourceware.org; auth=none X-Virus-Found: No X-Spam-SWARE-Status: No, score=-10.3 required=5.0 tests=AWL, BAYES_00, GIT_PATCH_2, GIT_PATCH_3, KAM_ASCII_DIVIDERS, RCVD_IN_DNSWL_NONE, SPF_PASS autolearn=ham version=3.3.2 spammy=UD:loop-interchange-8.c, sk:loop-in, ldist-27.c, UD:loop-interchange-1b.c X-HELO: smtp.eu.adacore.com Received: from mel.act-europe.fr (HELO smtp.eu.adacore.com) (194.98.77.210) by sourceware.org (qpsmtpd/0.93/v0.84-503-g423c35a) with ESMTP; Tue, 16 Jan 2018 21:04:00 +0000 Received: from localhost (localhost [127.0.0.1]) by filtered-smtp.eu.adacore.com (Postfix) with ESMTP id 937BE8139C for ; Tue, 16 Jan 2018 22:03:57 +0100 (CET) Received: from smtp.eu.adacore.com ([127.0.0.1]) by localhost (smtp.eu.adacore.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 3Ue2bOqENPQY for ; Tue, 16 Jan 2018 22:03:57 +0100 (CET) Received: from polaris.localnet (bon31-6-88-161-99-133.fbx.proxad.net [88.161.99.133]) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (No client certificate requested) by smtp.eu.adacore.com (Postfix) with ESMTPSA id 62BAC8138F for ; Tue, 16 Jan 2018 22:03:57 +0100 (CET) From: Eric Botcazou To: gcc-patches@gcc.gnu.org Subject: [testsuite] Skip loop tests on Visium Date: Tue, 16 Jan 2018 22:03:56 +0100 Message-ID: <60648477.c0X91DhU5z@polaris> MIME-Version: 1.0 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 * 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. 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];