lkml.org 
[lkml]   [2014]   [Feb]   [26]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [PATCH 5/8] locking, mutex: Cancelable MCS lock for adaptive spinning
On Tue, Feb 25, 2014 at 11:56:19AM -0800, Jason Low wrote:
> On Mon, 2014-02-10 at 20:58 +0100, Peter Zijlstra wrote:
>
> > +unqueue:
> > + /*
> > + * Step - A -- stabilize @prev
> > + *
> > + * Undo our @prev->next assignment; this will make @prev's
> > + * unlock()/unqueue() wait for a next pointer since @lock points to us
> > + * (or later).
> > + */
> > +
> > + for (;;) {
> > + if (prev->next == node &&
> > + cmpxchg(&prev->next, node, NULL) == node)
> > + break;
> > +
> > + /*
> > + * We can only fail the cmpxchg() racing against an unlock(),
> > + * in which case we should observe @node->locked becomming
> > + * true.
> > + */
> > + if (smp_load_acquire(&node->locked))
> > + return true;

I've stuck on in right about here. So that we don't unduly delay the
cmpxchg() after the load of prev.

> > +
> > + /*
> > + * Or we race against a concurrent unqueue()'s step-B, in which
> > + * case its step-C will write us a new @node->prev pointer.
> > + */
> > + prev = ACCESS_ONCE(node->prev);
>
> Should we also add an arch_mutex_cpu_relax() to this loop?
>
>


\
 
 \ /
  Last update: 2014-02-26 13:01    [W:0.880 / U:1.820 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site