Inlining and estimate_num_insns
Richard Guenther
richard.guenther@gmail.com
Tue Mar 1 13:41:00 GMT 2005
On Tue, 1 Mar 2005 13:46:22 +0100, Jan Hubicka <jh@suse.cz> wrote:
> Looks nice, you might also consider turing next_clone list into doubly
> linked list to speedup remove_node somewhat. Not sure how much that
> one counts.
I'd like to see profiles after the patch first - changing that one would only
help cgraph_remove_node and we still would have a same complexity
list walk to check if we still need the function body (solvable with
introduction
of another counter, though). The edge stuff really was sort of O(N^2), this one
is clearly linear.
> Can you post --disable-checking benchmarks on your testcase
> with leafify?
I'll try to do some more benchmarking, but for this I need to move over the
patch to my custom tree. Will do so and submit the patch for 4.0/4.1.
Richard.
More information about the Gcc
mailing list