https://gcc.gnu.org/bugzilla/show_bug.cgi?id=89922
Andrew Pinski <pinskia at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
Component|middle-end |tree-optimization
Severity|normal |enhancement
--- Comment #6 from Andrew Pinski <pinskia at gcc dot gnu.org> ---
Estimating sizes for loop 1
BB: 3, after_exit: 0
size: 1 _1 = <retval>.data[j_16];
size: 1 _2 = _1 + j_16;
size: 1 <retval>.data[j_16] = _2;
size: 1 j_13 = j_16 + 1;
Induction variable computation will be folded away.
size: 1 ivtmp_4 = ivtmp_18 - 1;
Induction variable computation will be folded away.
size: 2 if (ivtmp_4 != 0)
Exit condition will be eliminated in peeled copies.
Exit condition will be eliminated in last copy.
Constant conditional.
BB: 5, after_exit: 1
size: 7-4, last_iteration: 7-4
Loop size: 7
Estimated size after unrolling: 10
Not unrolling loop 1: size would grow.
