Re: A quick summary of gcc compilation speed from a political point of view

[Marc Espie <espie at nerim dot net>]

I've built a 3.3.2 profiling compiler, and built a kernel with it.
I'll try doing the same with 2.95.3, probably tomorrow, and also -current,
time-willing.

ftp://quatramaran.ens.fr/pub/espie/gcc/profile-kernel-gcc-3.3.2-1.gz

you'll notice a few calls to propolice, which don't interfere with
the timings.

For what it's worth, I notice side_effects_p as being rather high there.
Did someone try to provide an inlined version of the simple, non recursive
part of it ? does that make any sense.

I'm also wondering about the `type' cases. I'll admit the letters might
be nice for debug (e.g., #if DEBUG), but it would probably be more
efficient to have simple, small codes. Judging from the number of switch()
in gcc, those must take a larger amount of time, won't they ?

I also see make_node first filling a tmp node to get its size.
Maybe retrieving a size from a code might be better ?

And the memset() in make_node is quite obvious.