https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90001
Roman Zhuykov changed:
What|Removed |Added
Status|NEW |RESOLVED
Resolution|---
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90001
--- Comment #7 from Arseny Solokha ---
There are no backporting pending, I believe? If so, should this PR be closed
now?
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90001
--- Comment #6 from Roman Zhuykov ---
Author: zhroma
Date: Fri Dec 13 17:02:53 2019
New Revision: 279375
URL: https://gcc.gnu.org/viewcvs?rev=279375=gcc=rev
Log:
modulo-sched: speed up DDG analysis (PR90001)
PR rtl-optimization/90001
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90001
--- Comment #5 from Roman Zhuykov ---
Retested patch separately, everything works.
Have found 2 more slow Fortran examples on (obsolete) spu platform and with
additional options like -O1/O2 -fomit-frame-pointer -funroll-loops -fpeel-loops
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90001
--- Comment #4 from Roman Zhuykov ---
Thanks for testcase.
2-3 weeks ago I already caught and fixed this on my local branch, see some info
in the bottom.
Current algorithm which finds recurrence_length for all DDG strongly connected
components
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90001
Roman Zhuykov changed:
What|Removed |Added
CC||zhroma at ispras dot ru
--- Comment #3
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=90001
Richard Biener changed:
What|Removed |Added
Target|powerpc-*-linux-gnu |powerpc-*-linux-gnu
