lkml.org 
[lkml]   [2009]   [Feb]   [12]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [ltt-dev] [RFC git tree] Userspace RCU (urcu) for Linux (repost)
Replying to a separate portion of the mail with less CC :


> On Thu, Feb 12, 2009 at 02:05:39AM -0500, Mathieu Desnoyers wrote:
> > * Paul E. McKenney (paulmck@linux.vnet.ibm.com) wrote:
> > > On Wed, Feb 11, 2009 at 11:08:24PM -0500, Mathieu Desnoyers wrote:
> > > > * Paul E. McKenney (paulmck@linux.vnet.ibm.com) wrote:
> > > > > On Wed, Feb 11, 2009 at 04:35:49PM -0800, Paul E. McKenney wrote:
> > > > > > On Wed, Feb 11, 2009 at 04:42:58PM -0500, Mathieu Desnoyers wrote:
> > > > > > > * Paul E. McKenney (paulmck@linux.vnet.ibm.com) wrote:
> > >
> > > [ . . . ]
> > >
> > > > > And I had bugs in my model that allowed the rcu_read_lock() model
> > > > > to nest indefinitely, which overflowed into the top bit, messing
> > > > > things up. :-/
> > > > >
> > > > > Attached is a fixed model. This model validates correctly (woo-hoo!).
> > > > > Even better, gives the expected error if you comment out line 180 and
> > > > > uncomment line 213, this latter corresponding to the error case I called
> > > > > out a few days ago.
> > > > >
> > > >
> > > > Great ! :) I added this version to the git repository, hopefully it's ok
> > > > with you ?
> > >
> > > Works for me!
> > >
> > > > > I will play with removing models of mb...
> > > >
> > > > OK, I see you already did..
> > >
> > > I continued this, and surprisingly few are actually required, though
> > > I don't fully trust the modeling of removed memory barriers.
> >
> > On my side I cleaned up the code a lot, and actually added some barriers
> > ;) Especially in the busy loops, where we expect the other thread's
> > value to change eventually between iterations. A smp_rmb() seems more
> > appropriate that barrier(). I also added a lot of comments about
> > barriers in the code, and made the reader side much easier to review.
> >
> > Please feel free to comment on my added code comments.
>
> The torture test now looks much more familiar. ;-)
>
> I fixed some compiler warnings (in my original, sad to say), added an
> ACCESS_ONCE() to rcu_read_lock() (also in my original),

Yes, I thought about this ACCESS_ONCE during my sleep.. just did not
have to to update the source yet. :)

Merged. Thanks !

[...]

> --- a/urcu.c
> +++ b/urcu.c
> @@ -99,7 +99,8 @@ static void force_mb_single_thread(pthread_t tid)
> * BUSY-LOOP.
> */
> while (sig_done < 1)
> - smp_rmb(); /* ensure we re-read sig-done */
> + barrier(); /* ensure compiler re-reads sig-done */
> + /* cache coherence guarantees CPU re-read. */

That could be a smp_rmc() ? (see other mail)

> smp_mb(); /* read sig_done before ending the barrier */
> }
>
> @@ -113,7 +114,8 @@ static void force_mb_all_threads(void)
> if (!reader_data)
> return;
> sig_done = 0;
> - smp_mb(); /* write sig_done before sending the signals */
> + /* smp_mb(); write sig_done before sending the signals */
> + /* redundant with barriers in pthread_kill(). */

Absolutely not. pthread_kill does not send a signal to self in every
case because the writer thread has not requirement to register itself.
It *could* be registered as a reader too, but does not have to.

> for (index = reader_data; index < reader_data + num_readers; index++)
> pthread_kill(index->tid, SIGURCU);
> /*
> @@ -121,7 +123,8 @@ static void force_mb_all_threads(void)
> * BUSY-LOOP.
> */
> while (sig_done < num_readers)
> - smp_rmb(); /* ensure we re-read sig-done */
> + barrier(); /* ensure compiler re-reads sig-done */
> + /* cache coherence guarantees CPU re-read. */

That could be a smp_rmc() ?

> smp_mb(); /* read sig_done before ending the barrier */
> }
> #endif
> @@ -181,7 +184,8 @@ void synchronize_rcu(void)
> * the writer waiting forever while new readers are always accessing
> * data (no progress).
> */
> - smp_mb();
> + /* smp_mb(); Don't need this one for CPU, only compiler. */
> + barrier();

smp_mc() ?

>
> switch_next_urcu_qparity(); /* 1 -> 0 */
>

Side-note :
on archs without cache coherency, all smp_[rw ]mb would turn into a
cache flush.

Mathieu


--
Mathieu Desnoyers
OpenPGP key fingerprint: 8CD5 52C3 8E3C 4140 715F BA06 3F25 A8FE 3BAE 9A68


\
 
 \ /
  Last update: 2009-02-12 20:41    [W:0.140 / U:0.096 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site