lkml.org 
[lkml]   [2010]   [Feb]   [1]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: Lock dependency based tree report in perf lock
On Mon, Feb 01, 2010 at 09:25:04AM +0100, Peter Zijlstra wrote:
> On Sat, 2010-01-30 at 19:57 +0100, Frederic Weisbecker wrote:
> > On Sat, Jan 30, 2010 at 09:46:28AM +0100, Peter Zijlstra wrote:
> > > On Sat, 2010-01-30 at 00:17 +0100, Frederic Weisbecker wrote:
> > > >
> > > >
> > > > Anyway, that's just an idea, not trivial I must admit.
> > >
> > > lockdep actually collects all this information, so writing it out isn't
> > > too hard.
> >
> >
> >
> > Lockdep collects the theorical dependencies but not the practical
> > scenarios.
> >
> > Say B and C depend on A, you'll get:
> >
> > A
> > / \
> > B C
> >
> > But nothing can tell you that if A is taken, B and C will always
> > be taken. You may have different scenarios based on this dependency,
> > which is not something that lockdep logs, right?
>
> Right. But we keep track of the full held lock stack, which is what was
> requested.



Ah, I see what you mean. Yeah we have that, but it is a runtime check
feature, and the representation is linear. We should not add further
tracepoint based on this to get the possible scenarios of locking,
we should rather deduce them from the current tracepoints we have.

Would be a bad idea to add even more overhead.



\
 
 \ /
  Last update: 2010-02-01 18:51    [W:0.139 / U:0.184 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site