lkml.org 
[lkml]   [2011]   [Mar]   [16]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [RFC PATCH 0/4] perf: Custom contexts
On Wed, Mar 16, 2011 at 02:56:15PM +0100, Peter Zijlstra wrote:
> On Wed, 2011-03-16 at 14:53 +0100, Frederic Weisbecker wrote:
> > On Tue, Mar 15, 2011 at 11:32:54PM +0100, Peter Zijlstra wrote:
> > > Right, so I don't much like the interface, two new ioctl()s and a flag
> > > of dubious use.
> >
> > Do you think we need a new syscall for this new feature.
>
> No.
>
> > > How important is this recursive nature of the thing to you:
> > >
> > > > It's supposed to support infinite combinations with starter having starters
> > > > themselves, plus filters, etc...
> > >
> > > We've so far avoided recursion like that, we only have single level
> > > groups etc.
> >
> > There is actually no recursivity of any sort that the kernel has to handle.
> > The starter/stopper links are never handled recursively. ie: there is no
> > loop walking through the entire chain of starter to starter to starter, etc...
> >
> > It's always only handled between direct related event: starter and target, but
> > never further.
> >
> > Only the final effect has recursion properties in the resulting count
> > or trace.
>
> That's not an answer to my question.


Well, since there is no recursivity involved, there should be ne more worries
about allowing or not starters on starters. And I think it's an important
feature, that's in fact one of its key properties that let's one able to
define whatever kind of precise stacked context.

The possible usecase is so wide that I have a hard time to find a good
example. Counting instructions in exceptions on some specific syscalls,
counting instructions when some lock is taken on some irq handler, or
whatever...


\
 
 \ /
  Last update: 2011-03-16 15:05    [W:0.082 / U:3.648 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site