[Bug tree-optimization/128070] -O3 cunrolli growth on many small loops, super-linear compile time and memory

[rguenth at gcc dot gnu.org via Gcc-bugs]

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=128070

Richard Biener <rguenth at gcc dot gnu.org> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
             Status|UNCONFIRMED                 |ASSIGNED
     Ever confirmed|0                           |1
   Last reconfirmed|                            |2026-10-23
           Assignee|unassigned at gcc dot gnu.org      |rguenth at gcc dot 
gnu.org

--- Comment #4 from Richard Biener <rguenth at gcc dot gnu.org> ---
I will have a look - the bisection is a bit odd, it possibly enables more CSE
and more unrolling.

In principle unrolling should be linear time complexity though there might
be utilities used that expose non-linearisms.  We also iterate it N (8) times.