This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug c++/13776] [tree-ssa] Many C++ compile-time regression in 3.5-tree-ssa 040120
- From: "rguenth at tat dot physik dot uni-tuebingen dot de" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 13 Mar 2004 11:46:10 -0000
- Subject: [Bug c++/13776] [tree-ssa] Many C++ compile-time regression in 3.5-tree-ssa 040120
- References: <20040120183908.13776.kgardas@objectsecurity.com>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Additional Comments From rguenth at tat dot physik dot uni-tuebingen dot de 2004-03-13 11:46 -------
Subject: Re: [tree-ssa] Many C++ compile-time regression in
3.5-tree-ssa 040120
dnovillo at redhat dot com wrote:
> ------- Additional Comments From dnovillo at redhat dot com 2004-03-13 02:08 -------
> Subject: Re: [tree-ssa] Many C++ compile-time regression in
> 3.5-tree-ssa 040120
>
> On Fri, 2004-03-12 at 21:02, dberlin at dberlin dot org wrote:
>
>
>>I can't fix the algorithmic properties of the SSAPRE algorithm we use,
>>which is what you are running into, i'm betting.
>>
>
> Could we add thresholds to back away from overly complicated functions?
Or just "split" them up using sort of windowing? It looks clearly wrong
to not limit a O(n^2) or O(n^3) algorithm.
Richard.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=13776