This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: [new-regalloc] Dataflow too slow...
- To: "Michael Hayes" <m dot hayes at elec dot canterbury dot ac dot nz>
- Subject: Re: [new-regalloc] Dataflow too slow...
- From: "Geert Bosch" <bosch at gnat dot com>
- Date: Sat, 03 Feb 2001 18:14:16 -0500
- Cc: "gcc at gcc dot gnu dot org" <gcc at gcc dot gnu dot org>
- Reply-To: "Geert Bosch" <bosch at gnat dot com>
On Sun, 04 Feb 2001 12:03:34 +1300 (NZDT), Michael Hayes wrote:
I used a simple worklist algorithm for this to get the ball rolling.
The usual solution to impove the performance is to order the blocks
with a depth first search. This was on my todo list.
Yes, I see. It seems that indeed in this case there could be O(N)
passes, even though using reverse post-order this would probably
be at most 5 passes. This is the big gain...
As for the esoteric algorithms, we first need to see what speed we
have with the dfs approach.
-Geert