http://gcc.gnu.org/bugzilla/show_bug.cgi?id=59409
--- Comment #8 from H.J. Lu <hjl.tools at gmail dot com> --- (In reply to rguent...@suse.de from comment #7) > "hjl.tools at gmail dot com" <gcc-bugzi...@gcc.gnu.org> wrote: > >http://gcc.gnu.org/bugzilla/show_bug.cgi?id=59409 > > > >--- Comment #3 from H.J. Lu <hjl.tools at gmail dot com> --- > >slpeel_tree_peel_loop_to_edge has comments: > > > > The first guard is: > > if (FIRST_NITERS == 0) then skip the first loop, > > and go directly to the second loop. > > > >This is removed by r205730. > > It's implemented in terms of scalar loop iterations (latch execution count). Is that ever possible to have latch execution count < 0 and FIRST_NITERS == 0? It happens in x32 253.perlbmk.
