This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: crossjumping speedups
- To: Jan Hubicka <hubicka at atrey dot karlin dot mff dot cuni dot cz>
- Subject: Re: crossjumping speedups
- From: Richard Henderson <rth at redhat dot com>
- Date: Fri, 20 Jul 2001 14:41:16 -0700
- Cc: gcc-patches at gcc dot gnu dot org, patches at x86-64 dot org
- References: <20010720205652.E4277@atrey.karlin.mff.cuni.cz>
On Fri, Jul 20, 2001 at 08:56:52PM +0200, Jan Hubicka wrote:
> ! Avoid duplicated work by ensuring that at least one of edges
> ! is the first outgoing edge. This way we try each combination
> ! maximally twice, instead of N ougoing edges ^ 2. */
> if (e != fallthru && fallthru
> + && (e->src->succ == e || fallthru->src->succ == fallthru)
[...]
> ! && (e->src->succ == e || e2->src->succ == e2)
Everything but this is ok. You cannot assume order on edges.
r~