[patch] new dominance calculator

Richard Henderson rth@cygnus.com
Thu Aug 3 15:33:00 GMT 2000


On Sat, Jun 24, 2000 at 04:22:15AM +0200, Michael Matz wrote:
> -/* Compute dominator relationships using new flow graph structures.  */
> +/* Compute dominator relationships using new flow graph structures in
> +   nearly linear time.  */
>  void
>  compute_flow_dominators (dominators, post_dominators)
> +     sbitmap *dominators;
> +     sbitmap *post_dominators;
> +{
> +  if (dominators)
> +    {
> +      calculate_flow_dominators (dominators, 0);
> +    }

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.

Additionally, since the algorithm has the entire dominator tree, then
immediate dominators are available directly.  You should export an
interface to get at them, and then replace the existing
compute_immediate_dominators function.



r~


More information about the Gcc-patches mailing list