https://gcc.gnu.org/bugzilla/show_bug.cgi?id=114052
--- Comment #17 from GCC Commits <cvs-commit at gcc dot gnu.org> --- The releases/gcc-14 branch has been updated by Richard Biener <[email protected]>: https://gcc.gnu.org/g:c886bd9ab21429a11bea393b5a6e7438a1d924ef commit r14-11329-gc886bd9ab21429a11bea393b5a6e7438a1d924ef Author: Richard Biener <[email protected]> Date: Wed Jan 29 13:25:14 2025 +0100 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.
