This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/53852] [4.8 Regression] -ftree-loop-linear: large compile time / memory usage
- From: "Joost.VandeVondele at mat dot ethz.ch" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Thu, 07 Feb 2013 09:04:36 +0000
- Subject: [Bug tree-optimization/53852] [4.8 Regression] -ftree-loop-linear: large compile time / memory usage
- Auto-submitted: auto-generated
- References: <bug-53852-4@http.gcc.gnu.org/bugzilla/>
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=53852
Joost VandeVondele <Joost.VandeVondele at mat dot ethz.ch> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |grosser at gcc dot gnu.org
--- Comment #7 from Joost VandeVondele <Joost.VandeVondele at mat dot ethz.ch> 2013-02-07 09:04:36 UTC ---
I assume this PR is also a result of the PPL to ISL change ?
Is there anything in place that could be used to avoid this exponential
complexity ? The pattern in comment #5 seems not too exotic.