Kernel call graphing

[Dave Hansen]

On Fri, 2003-10-31 at 15:22, Adam Litke wrote:
> I have written a tool to generate deterministic function call graphs.

And it's based on the old code from kernprof, right?

> ==================================================
>       2675523 .do_anonymous_page
>        103048 .do_wp_page
>         68635 .do_no_page
>         20233 .generic_file_aio_write_nolock
>         12209 .do_page_cache_readahead
>         10328 .__get_free_pages
>          6892 .copy_strings
>          2194 .find_or_create_page
>           849 .copy_strings32
>           194 .do_generic_mapping_read
> .__alloc_pages
>       2900105 .buffered_rmqueue
> ==================================================

One thing that kernprof did was sort the callers descending and the
called functions ascending.  That way, the most important data were near
the function name that you were looking at.

                ...
>         20233 .generic_file_aio_write_nolock
>         68635 .do_no_page
>        103048 .do_wp_page
>       2675523 .do_anonymous_page
> .__alloc_pages
>       2900105 .buffered_rmqueue
> ==================================================

--
Dave Hansen
haveblue at us.ibm.com


** Sent via the linuxppc64-dev mail list. See http://lists.linuxppc.org/