This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: [new-regalloc] Dataflow too slow...
- To: Geert Bosch <bosch at gnat dot com>
- Subject: Re: [new-regalloc] Dataflow too slow...
- From: Daniel Berlin <dberlin at redhat dot com>
- Date: Sat, 3 Feb 2001 15:35:30 -0500 (EST)
- cc: Michael Hayes <mhayes at redhat dot com>, <gcc at gcc dot gnu dot org>
On Sat, 3 Feb 2001, Geert Bosch wrote:
> One of the things I'm stumbling on now is that df_rd_global_compute
> takes way too much time to allow me to bootstrap the Ada compiler.
>
> For example, one unit that usually just takes 0.8 seconds to compile on
> a 1.1GH Athlon, takes more then 10 minutes now. Memory usage is around
> 30 MB, not outrageous. One invocation of this function takes a few
> minutes to return...
Really?
How many basic blocks do you have in the function.
>
> I killed the compiler after it was munching for 40 minutes on a (bit)
> more complex file. Of course, it is too early to be concerned about a
> factor of ten in performance, but even for testing this is a bit too slow...
I need to see these files.
In order to reduce memory usage, i moved df.[ch] to use bitmaps, but this
will make them
> What complexity should these dataflow calculations be?
Right now, they are done using simple iterative methods on a worklist.
I already changed it to use bitmaps rather than sbitmaps tos ave memory.
i'm working on dfs search to speed it up as well.
>
> -Geert
>