[Bug c++/13776] [tree-ssa] Many C++ compile-time regression in 3.5-tree-ssa 040120

rguenth at tat dot physik dot uni-tuebingen dot de gcc-bugzilla@gcc.gnu.org
Sat Mar 13 11:46:00 GMT 2004


------- 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



More information about the Gcc-bugs mailing list