This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/26854] Inordinate compile times on large routines
- From: "rguenth at gcc dot gnu.org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Tue, 23 Feb 2016 08:36:47 +0000
- Subject: [Bug tree-optimization/26854] Inordinate compile times on large routines
- Auto-submitted: auto-generated
- References: <bug-26854-4 at http dot gcc dot gnu dot org/bugzilla/>
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=26854
--- Comment #133 from Richard Biener <rguenth at gcc dot gnu.org> ---
Thanks for the update - this PR (one of the testcases) is also tracked in
http://gcc.opensuse.org/c++bench-czerny/random/ (two testcases, pr26854.c is
"all.c" and pr26854-2.c is "_num.c").
note that our focus is primarily -O1 for this kind of testcases - -O2 contains
too many known quadraticnesses though _num.c seems to survive fine (well, ~2gb
of ram).