lists.openwall.net   lists  /  announce  owl-users  owl-dev  john-users  john-dev  passwdqc-users  yescrypt  popa3d-users  /  oss-security  kernel-hardening  musl  sabotage  tlsify  passwords  /  crypt-dev  xvendor  /  Bugtraq  Full-Disclosure  linux-kernel  linux-netdev  linux-ext4  linux-hardening  linux-cve-announce  PHC 
Open Source and information security mailing list archives
 
Hash Suite: Windows password security audit tool. GUI, reports in PDF.
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date:	Thu, 15 Mar 2012 15:50:36 +0100
From:	Frederic Weisbecker <fweisbec@...il.com>
To:	Namhyung Kim <namhyung.kim@....com>
Cc:	Arun Sharma <asharma@...com>, linux-kernel@...r.kernel.org,
	Ingo Molnar <mingo@...e.hu>,
	Arnaldo Carvalho de Melo <acme@...hat.com>,
	Mike Galbraith <efault@....de>,
	Paul Mackerras <paulus@...ba.org>,
	Peter Zijlstra <peterz@...radead.org>,
	Stephane Eranian <eranian@...gle.com>,
	Tom Zanussi <tzanussi@...il.com>,
	linux-perf-users@...r.kernel.org
Subject: Re: [PATCH 0/2] perf: add sort by inclusive time functionality (v2)

On Tue, Mar 13, 2012 at 10:36:31AM +0900, Namhyung Kim wrote:
> Hi,
> 
> 2012-03-13 4:58 AM, Arun Sharma wrote:
> >On 3/12/12 11:21 AM, Arun Sharma wrote:
> >>>BTW, I don't like the name 'inclusive' as a sort key. If it cares about
> >>>time, IMHO, the name should contain 'time' - something like 'itime' or
> >>>'inctime'?
> >>
> >>The existing sort orders: pid, comm, dso, symbol, parent -- all care
> >>about time, but none of them have time in their name?
> >
> >I'll take that back. What they sort on depends on the event.
> >
> >perf record -ge cache-misses
> >perf report -s inclusive
> >
> >will sort by the number of cache-misses and not time.
> >
> >-Arun
> 
> AFAIK, "sort" here means how perf identifies a sample event from
> others: "comm" will collect samples have same pid/comm, then "dso"
> will group samples belong to same library, and "symbol" will group
> again samples have same symbol name. This is what default sort order
> (comm,dso,symbol) does.

Right this is about how we group the events into histograms.
If you sort by dso, you'll have one histogram per dso and events
will be added to the histogram matching their dso.

Multiple sorting does the same with an "AND" between sort entries.
If you sort by dso,pid, you'll have one histogram per possible couple
of (dso,pid).

Say you have dso1, dso2 and pid1 and pid2, then you get 4 possible histograms:
(dso1,pid1), (dso1,pid2), (dso2,pid1), (dso2,pid2)
...assuming that over your events you have all these combinations.

So this is how we group samples into histograms.
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/

Powered by blists - more mailing lists

Powered by Openwall GNU/*/Linux Powered by OpenVZ