]> git.ipfire.org Git - thirdparty/gcc.git/commit
tree-optimization/114052 - consider infinite sub-loops when lowering iter bound
authorRichard Biener <rguenther@suse.de>
Wed, 29 Jan 2025 12:25:14 +0000 (13:25 +0100)
committerRichard Biener <rguenth@gcc.gnu.org>
Thu, 30 Jan 2025 09:00:14 +0000 (10:00 +0100)
commitd1c7837d2d6e5a2997228681166ed8c814891881
tree01a0132bf2d71966400486ea5a10af051dd0e447
parentf559ac896942ffe0e2315d0a4d8b8b517a16d607
tree-optimization/114052 - consider infinite sub-loops when lowering iter bound

When we walk stmts to find always executed stmts with UB in the last
iteration to be able to reduce the iteration count by one we fail
to consider infinite subloops in the last iteration that would make
such stmt not execute.  The following adds this.

PR tree-optimization/114052
* tree-ssa-loop-niter.cc (maybe_lower_iteration_bound): Check
for infinite subloops we might not exit.

* gcc.dg/pr114052-1.c: New testcase.
gcc/testsuite/gcc.dg/pr114052-1.c [new file with mode: 0644]
gcc/tree-ssa-loop-niter.cc