Re: [PATCH 2/2] perf: Add a new sort order: SORT_INCLUSIVE
From: Frederic Weisbecker
Date: Thu Mar 08 2012 - 10:39:43 EST
On Wed, Mar 07, 2012 at 02:41:19PM -0800, Arun Sharma wrote:
> Each entry that used to get added once to the histogram, now is added
> chain->nr times, each time with one less entry in the
> callchain.
>
> This will result in a non-leaf function that appears in a lot of
> samples to get a histogram entry with lots of hits.
>
> The user can then drill down into the callchains of functions that
> have high inclusive times.
I don't yet understand the point of this.
Imagine those three hists:
a -> b -> c
a -> b -> d
a-> e -> f
The fractal inverted mode (-G) will report this:
a--
|
----- b
| |
| -----c
| |
| -----d
|
----- e
|
-----f
The branch sorting is recursive so outstanding callers appear
in the first branches already.
So if your goal is to find important callers, I don't see why
the existing functionalities aren't enough.
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/