--- Additional Comments From dberlin at gcc dot gnu dot org 2004-11-30
14:52 ---
Fixed
--
What|Removed |Added
Status|ASSIGNED|RESOLVED
--- Additional Comments From cvs-commit at gcc dot gnu dot org 2004-11-30
14:49 ---
Subject: Bug 18673
CVSROOT:/cvs/gcc
Module name:gcc
Changes by: [EMAIL PROTECTED] 2004-11-30 14:49:39
Modified files:
gcc: ChangeLog tree-ssa-pre.c
Log messag
--- Additional Comments From steven at gcc dot gnu dot org 2004-11-27
01:09 ---
Of course it's not very useful to claim that some algorithm
is O(N^x) when you don't say what N is...
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=18673
--- Additional Comments From dberlin at gcc dot gnu dot org 2004-11-27
00:28 ---
I have a patch that brings the time on 150 loops to 1.40 seconds, but i haven't
decided whether to apply it or not. I have to do more testing on real code.
I could make it nothing if i scoped the other bitm
--- Additional Comments From dberlin at gcc dot gnu dot org 2004-11-26
23:00 ---
Actually, Tree-PRE is provably O(n^2). We just have a larger constant than we'd
like.
On all the branches i have checked out (tcb, mainline) 150 loops takes 30
seconds, not 160.
THis includes the constifica
--- Additional Comments From pinskia at gcc dot gnu dot org 2004-11-25
14:32 ---
Confirmed.
60% of the time is in bitmap_value_replace_in_set
26% is in bitmap_bit_p
--
What|Removed |Added
---
