This is the mail archive of the
mailing list for the GCC project.
Re: Timings for reassociation pass
- From: Richard Guenther <richard dot guenther at gmail dot com>
- To: Daniel Berlin <dberlin at dberlin dot org>
- Cc: Diego Novillo <dnovillo at redhat dot com>, GCC Patches <gcc-patches at gcc dot gnu dot org>
- Date: Sun, 15 May 2005 13:25:04 +0200
- Subject: Re: Timings for reassociation pass
- References: <email@example.com>
- Reply-to: Richard Guenther <richard dot guenther at gmail dot com>
On 5/15/05, Daniel Berlin <firstname.lastname@example.org> wrote:
> For the curious, some timings for the simple reassociation pass at:
> For tramp3d, out of 386 seconds, reassociation takes .24 seconds (0%).
> Almost all the time is in hash lookups.
> By comparison, splitting critical edges takes longer :)
> tree split crit edges : 0.25 ( 0%) usr
> tree reassociation : 0.24 ( 0%) usr
> It takes roughly the same relative % for cc1-i-files, and MICO as well.
I'm curious - does it buy us anything on these benchmarks? I mean
f.i. in runtime for tramp3d?