lkml.org 
[lkml]   [2009]   [Jan]   [7]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [PATCH -v5][RFC]: mutex: implement adaptive spinning


On Wed, 7 Jan 2009, Steven Rostedt wrote:

>
> On Wed, 7 Jan 2009, Steven Rostedt wrote:
> >
> > True. I need to keep looking at the code that is posted. In -rt, we force
> > the fast path into the slowpath as soon as another task fails to get the
> > lock. Without that, as you pointed out, the code can be racy.
>
> I mean we force the fast unlock path into the slow path as soon as another
> task fails to get the lock.

I think the mainline mutex code does that all right too - we keep the
counter negative all the time when it has contention.

So the original model where the spinning was done only after we'd gotten
the spinlock probably was correct. However, it _is_ a lot more expensive
than the "optimistic spin" model.

Linus


\
 
 \ /
  Last update: 2009-01-08 00:55    [from the cache]
©2003-2011 Jasper Spaans