This is the mail archive of the gcc-patches@gcc.gnu.org mailing list for the GCC project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

Re: Timings for reassociation pass


On 5/15/05, Daniel Berlin <dberlin@dberlin.org> wrote:
> For the curious, some timings for the simple reassociation pass at:
> http://gcc.gnu.org/ml/gcc-patches/2005-05/msg00751.html
> 
> 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?

Richard.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]