From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 1666) id 935823857830; Thu, 17 Feb 2022 11:26:16 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 935823857830 MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Content-Type: text/plain; charset="utf-8" From: Richard Biener To: gcc-cvs@gcc.gnu.org Subject: [gcc r11-9587] tree-optimization/102893 - properly DCE empty loops inside infinite loops X-Act-Checkin: gcc X-Git-Author: Richard Biener X-Git-Refname: refs/heads/releases/gcc-11 X-Git-Oldrev: 634c2bc38ff66f13164967a8e3b965e8255dd4d9 X-Git-Newrev: 6d9c2ed02128ddf327465333f5563500b6cf8886 Message-Id: <20220217112616.935823857830@sourceware.org> Date: Thu, 17 Feb 2022 11:26:16 +0000 (GMT) X-BeenThere: gcc-cvs@gcc.gnu.org X-Mailman-Version: 2.1.29 Precedence: list List-Id: Gcc-cvs mailing list List-Unsubscribe: , List-Archive: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 17 Feb 2022 11:26:16 -0000 https://gcc.gnu.org/g:6d9c2ed02128ddf327465333f5563500b6cf8886 commit r11-9587-g6d9c2ed02128ddf327465333f5563500b6cf8886 Author: Richard Biener Date: Fri Oct 22 12:45:32 2021 +0200 tree-optimization/102893 - properly DCE empty loops inside infinite loops The following fixes the test for an exit edge I put in place for the fix for PR45178 where I somehow misunderstood how the cyclic list works. 2021-10-22 Richard Biener PR tree-optimization/102893 * tree-ssa-dce.c (find_obviously_necessary_stmts): Fix the test for an exit edge. * gcc.dg/tree-ssa/ssa-dce-9.c: New testcase. (cherry picked from commit c2a9a98a369528c8689ecb68db576f8e7dc2fa45) Diff: --- gcc/testsuite/gcc.dg/tree-ssa/ssa-dce-9.c | 10 ++++++++++ gcc/tree-ssa-dce.c | 2 +- 2 files changed, 11 insertions(+), 1 deletion(-) diff --git a/gcc/testsuite/gcc.dg/tree-ssa/ssa-dce-9.c b/gcc/testsuite/gcc.dg/tree-ssa/ssa-dce-9.c new file mode 100644 index 00000000000..e1ffa7f038d --- /dev/null +++ b/gcc/testsuite/gcc.dg/tree-ssa/ssa-dce-9.c @@ -0,0 +1,10 @@ +/* { dg-do compile } */ +/* { dg-options "-O2 -fdump-tree-cddce1" } */ + +int main() +{ + while(1) + for(int i=0; i<9000000; i++){} +} + +/* { dg-final { scan-tree-dump-not "if" "cddce1" } } */ diff --git a/gcc/tree-ssa-dce.c b/gcc/tree-ssa-dce.c index cf586e38e2b..3509fe4c5cc 100644 --- a/gcc/tree-ssa-dce.c +++ b/gcc/tree-ssa-dce.c @@ -450,7 +450,7 @@ find_obviously_necessary_stmts (bool aggressive) FOR_EACH_LOOP (loop, 0) /* For loops without an exit do not mark any condition. */ - if (loop->exits->next && !finite_loop_p (loop)) + if (loop->exits->next->e && !finite_loop_p (loop)) { if (dump_file) fprintf (dump_file, "cannot prove finiteness of loop %i\n",