On Tue, 1 Mar 2005 13:41:27 +0100 (CET), Steven Bosscher
<[EMAIL PROTECTED]> wrote:
> On Mar 01, 2005 01:35 PM, Richard Guenther <[EMAIL PROTECTED]> wrote:
> > Try this,. bootstrapped on i686-pc-linux-gnu in progress.
>
> If this works, maybe we should consider this for 4.0 (as a compiler
> speedup), but for 4.1 we should really look into VECs instead of
> doubly linked lists.
> If your patch works, I'll try it for 8361 with -fobey-inline too ;-)
Bootstrapped ok.
tramp3d-v3 with -O2 and new size estimate:
integration : 16.95 (12%) usr 0.21 ( 4%) sys 17.90 (12%) wall
TOTAL : 138.06 5.37 144.96
above with the cgraph doubly-linked-list patch:
integration : 12.88 (10%) usr 0.17 ( 3%) sys 13.41 (10%) wall
TOTAL : 128.46 5.17 136.07
That's 7% faster.
we additionally to the patch can replace the commonly used
while (node->callees)
cgraph_remove_edge (node->callees);
with
cgraph_node_remove_callees (node);
I'll re-bootstrap with that and see if it even helps more.
