This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/20216] [4.0/4.1 Regression] Simple loop runs out of stack at -O1
- From: "dberlin at gcc dot gnu dot org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 26 Feb 2005 19:20:45 -0000
- Subject: [Bug tree-optimization/20216] [4.0/4.1 Regression] Simple loop runs out of stack at -O1
- References: <20050225212929.20216.fjahanian@apple.com>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Additional Comments From dberlin at gcc dot gnu dot org 2005-02-26 19:20 -------
The first part of the patch seems fine.
We should make tree_fold_binomial non-recursive.
Note, however, that once you do that, the other part of the patch isn't actually
doing anything (the change to chrec_apply).
Then all the memory usage comes from fold (all 600 meg of memory usage, i mean)
creating new trees.
It also doesn't recurse int hat case.
In any case, limiting the input to chrec_apply to <1024 is uh, wrong, as it's
not really fixing anything.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=20216