lkml.org 
[lkml]   [2012]   [Mar]   [8]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [PATCH 2/2] perf: Add a new sort order: SORT_INCLUSIVE
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.


\
 
 \ /
  Last update: 2012-03-08 16:41    [from the cache]
©2003-2011 Jasper Spaans