This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: Out-of-sight compile times for calculate_loop_depth
- To: Michael Hayes <m dot hayes at elec dot canterbury dot ac dot nz>
- Subject: Re: Out-of-sight compile times for calculate_loop_depth
- From: Jeffrey A Law <law at cygnus dot com>
- Date: Mon, 07 Feb 2000 16:20:23 -0700
- cc: Brad Lucier <lucier at math dot purdue dot edu>, gcc at gcc dot gnu dot org
- Reply-To: law at cygnus dot com
In message <14495.20749.161443.966173@ongaonga.elec.canterbury.ac.nz>you writ
e:
> This testcase exposes problems with the dominator calculation
> algorithm and with flow_loop_node_add. The latter I never
> particularly liked since it can exhibit quadratic behaviour. As an
> interim solution, adding the loops to the loop tree in reverse order
> should reduce the insertion time.
There are certainly faster algorithms for computing dominators; I've
speculated that we'll eventually have to use one as we make more use of
dominance relationships.
The advantage of the existing dominator algorithm is that it's very
simple to understand and performs OK for reasonable code.
jeff