This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: [new-regalloc] What is the status on current sources
- To: "Michael Matz" <matzmich at cs dot tu-berlin dot de>
- Subject: Re: [new-regalloc] What is the status on current sources
- From: "Geert Bosch" <bosch at gnat dot com>
- Date: Sat, 10 Feb 2001 12:47:29 -0500
- Cc: "Daniel Berlin" <dberlin at redhat dot com>,"gcc at gcc dot gnu dot org" <gcc at gcc dot gnu dot org>
- Reply-To: "Geert Bosch" <bosch at gnat dot com>
On Fri, 9 Feb 2001 05:12:07 +0100 (MET), Michael Matz wrote:
But at the first time don't expect any performance improvements. Not in
compile time, which might get horrible
I couldn't agree more that it is too early to worry about absolute
performance, but I do think we need to be clear that the various algorithms
can be implemented without regressing to algorithms that inherently
require O(n**2) time. An essential part of the implementation of the
dataflow algorithms is to use DFS post-order traversal.
Since it seems that flow.c is the place where we do our dataflow analysis,
I wonder why you decided to implement a new df.c unit. It seems to me
that it would be preferable to enhance the existing flow.c instead of
writing a different piece of code that mostly does the same.
-Geert