https://gcc.gnu.org/bugzilla/show_bug.cgi?id=78574
Markus Trippelsdorf changed:
What|Removed |Added
Status|NEW |RESOLVED
CC|
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=78574
--- Comment #6 from amker at gcc dot gnu.org ---
Author: amker
Date: Wed Nov 30 14:41:09 2016
New Revision: 243026
URL: https://gcc.gnu.org/viewcvs?rev=243026=gcc=rev
Log:
PR tree-optimization/78574
* tree-ssa-loop-ivopts.c
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=78574
--- Comment #5 from amker at gcc dot gnu.org ---
Well, it is iv (maybe biv) in this case:
_24 = j_11 + 1;
is in irreducible sub-loop, but _24 is a loop invariant wrto the sub-loop. But
we don't have such information in GCC. Thus mark_bivs
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=78574
--- Comment #4 from amker at gcc dot gnu.org ---
(In reply to Jakub Jelinek from comment #2)
> Seems there is infinite recursion in find_deriving_biv_for_expr.
> It endlessly alternates being called on lhs of
> j_11 = PHI
>
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=78574
Richard Biener changed:
What|Removed |Added
Component|c |tree-optimization
Target