https://gcc.gnu.org/bugzilla/show_bug.cgi?id=96920
--- Comment #5 from CVS Commits ---
The master branch has been updated by Richard Biener :
https://gcc.gnu.org/g:46a58c779af3055a4b10b285a1f4be28abe4351c
commit r11-3013-g46a58c779af3055a4b10b285a1f4be28abe4351c
Author: Richard Biener
Date:
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=96920
--- Comment #4 from Richard Biener ---
Another example:
int a[1024];
int b[2048];
void foo (int x, int y)
{
for (int i = 0; i < 1024; ++i)
{
int tem0 = b[2*i];
int tem1 = b[2*i+1];
for (int j = 0; j < 32; ++j)
{
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=96920
--- Comment #3 from Richard Biener ---
It's similar to PR96698 where we had a nested cycle where a cycle PHI was fed
by an induction. Here we're feeding the cycle PHI by another cycle PHI so the
fancy detection of computing a latch value doesn't
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=96920
Richard Biener changed:
What|Removed |Added
Keywords||ice-on-valid-code
--- Comment #2 from R
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=96920
Richard Biener changed:
What|Removed |Added
Target Milestone|--- |10.3
Summary|ICE segmentatio
