This is the mail archive of the
mailing list for the GCC project.
Re: Fast dominators code
- To: Brad Lucier <lucier at math dot purdue dot edu>
- Subject: Re: Fast dominators code
- From: Michael Matz <matzmich at cs dot tu-berlin dot de>
- Date: Thu, 28 Sep 2000 18:06:01 +0200 (MET DST)
- cc: gcc-patches at gcc dot gnu dot org
On Wed, 27 Sep 2000, Brad Lucier wrote:
> part of which includes ldc.c, a (near) linear time dominators computation,
> which is *much* faster than the current dominators calculation. At the
> time, this patch applied cleanly, and passed make bootstrap and make
> check with no regressions. Matz's copyright assignment has since been
> registered by the FSF. I would very much like this patch to be in GCC 3.0.
I think, I'm going to implement the simpler normal Lengauer/Tarjan
algorithm on this weekend, so Jeff's head doesn't hurt too much ;-)
It should be at the same or even higher speed (due to less overhead).
> Richard Henderson in
> > I'd prefer that we not create such trivial wrapper functions. Instead,
> > just modify all current users of compute_flow_dominators to use your
> > new function.
This I'm doing too.
> Jeff Law in
> [... general things about form ...]
I'm trying to fix that.