Author: jeff
Date: Thu Feb 27 19:05:26 2020
New Revision: 358400
URL: https://svnweb.freebsd.org/changeset/base/358400

Log:
  Simplify lazy advance with a 64bit atomic cmpset.
  
  This provides the potential to force a lazy (tick based) SMR to advance
  when there are blocking waiters by decoupling the wr_seq value from the
  ticks value.
  
  Add some missing compiler barriers.
  
  Reviewed by:  rlibby
  Differential Revision:        https://reviews.freebsd.org/D23825

Modified:
  head/sys/kern/subr_smr.c
  head/sys/sys/smr.h

Modified: head/sys/kern/subr_smr.c
==============================================================================
--- head/sys/kern/subr_smr.c    Thu Feb 27 19:04:39 2020        (r358399)
+++ head/sys/kern/subr_smr.c    Thu Feb 27 19:05:26 2020        (r358400)
@@ -184,12 +184,9 @@ static uma_zone_t smr_zone;
  * that will flush the store buffer or prevent access to the section protected
  * data.  For example, an idle processor, or an system management interrupt,
  * or a vm exit.
- *
- * We must wait one additional tick if we are around the wrap condition
- * because the write seq will move forward by two with one interrupt.
  */
 #define        SMR_LAZY_GRACE          2
-#define        SMR_LAZY_GRACE_MAX      (SMR_LAZY_GRACE + 1)
+#define        SMR_LAZY_INCR           (SMR_LAZY_GRACE * SMR_SEQ_INCR)
 
 /*
  * The maximum sequence number ahead of wr_seq that may still be valid.  The
@@ -197,7 +194,7 @@ static uma_zone_t smr_zone;
  * case poll needs to attempt to forward the sequence number if the goal is
  * within wr_seq + SMR_SEQ_ADVANCE.
  */
-#define        SMR_SEQ_ADVANCE         MAX(SMR_SEQ_INCR, SMR_LAZY_GRACE_MAX)
+#define        SMR_SEQ_ADVANCE         SMR_LAZY_INCR
 
 static SYSCTL_NODE(_debug, OID_AUTO, smr, CTLFLAG_RW | CTLFLAG_MPSAFE, NULL,
     "SMR Stats");
@@ -214,66 +211,45 @@ SYSCTL_COUNTER_U64(_debug_smr, OID_AUTO, poll_fail, CT
 
 /*
  * Advance a lazy write sequence number.  These move forward at the rate of
- * ticks.  Grace is two ticks in the future.  lazy write sequence numbers can
- * be even but not SMR_SEQ_INVALID so we pause time for a tick when we wrap.
+ * ticks.  Grace is SMR_LAZY_INCR (2 ticks) in the future.
  *
- * This returns the _current_ write sequence number.  The lazy goal sequence
- * number is SMR_LAZY_GRACE ticks ahead.
+ * This returns the goal write sequence number.
  */
 static smr_seq_t
 smr_lazy_advance(smr_t smr, smr_shared_t s)
 {
-       smr_seq_t s_rd_seq, s_wr_seq, goal;
-       int t;
+       union s_wr s_wr, old;
+       int t, d;
 
        CRITICAL_ASSERT(curthread);
 
        /*
-        * Load s_wr_seq prior to ticks to ensure that the thread that
-        * observes the largest value wins.
+        * Load the stored ticks value before the current one.  This way the
+        * current value can only be the same or larger.
         */
-       s_wr_seq = atomic_load_acq_int(&s->s_wr_seq);
-
-       /*
-        * We must not allow a zero tick value.  We go back in time one tick
-        * and advance the grace period forward one tick around zero.
-        */
+       old._pair = s_wr._pair = atomic_load_acq_64(&s->s_wr._pair);
        t = ticks;
-       if (t == SMR_SEQ_INVALID)
-               t--;
 
        /*
         * The most probable condition that the update already took place.
         */
-       if (__predict_true(t == s_wr_seq))
+       d = t - s_wr.ticks;
+       if (__predict_true(d == 0))
                goto out;
+       /* Cap the rate of advancement and handle long idle periods. */
+       if (d > SMR_LAZY_GRACE || d < 0)
+               d = SMR_LAZY_GRACE;
+       s_wr.ticks = t;
+       s_wr.seq += d * SMR_SEQ_INCR;
 
        /*
-        * After long idle periods the read sequence may fall too far
-        * behind write.  Prevent poll from ever seeing this condition
-        * by updating the stale rd_seq.  This assumes that there can
-        * be no valid section 2bn ticks old.  The rd_seq update must
-        * be visible before wr_seq to avoid races with other advance
-        * callers.
+        * This can only fail if another thread races to call advance().
+        * Strong cmpset semantics mean we are guaranteed that the update
+        * happened.
         */
-       s_rd_seq = atomic_load_int(&s->s_rd_seq);
-       if (SMR_SEQ_GT(s_rd_seq, t))
-               atomic_cmpset_rel_int(&s->s_rd_seq, s_rd_seq, t);
-
-       /*
-        * Release to synchronize with the wr_seq load above.  Ignore
-        * cmpset failures from simultaneous updates.
-        */
-       atomic_cmpset_rel_int(&s->s_wr_seq, s_wr_seq, t);
-       counter_u64_add(advance, 1);
-       /* If we lost either update race another thread did it. */
-       s_wr_seq = t;
+       atomic_cmpset_64(&s->s_wr._pair, old._pair, s_wr._pair);
 out:
-       goal = s_wr_seq + SMR_LAZY_GRACE;
-       /* Skip over the SMR_SEQ_INVALID tick. */
-       if (goal < SMR_LAZY_GRACE)
-               goal++;
-       return (goal);
+       return (s_wr.seq + SMR_LAZY_INCR);
 }
 
 /*
@@ -285,7 +261,7 @@ static smr_seq_t
 smr_shared_advance(smr_shared_t s)
 {
 
-       return (atomic_fetchadd_int(&s->s_wr_seq, SMR_SEQ_INCR) + SMR_SEQ_INCR);
+       return (atomic_fetchadd_int(&s->s_wr.seq, SMR_SEQ_INCR) + SMR_SEQ_INCR);
 }
 
 /*
@@ -346,8 +322,8 @@ smr_deferred_advance(smr_t smr, smr_shared_t s, smr_t 
  * This function may busy loop if the readers are roughly 1 billion
  * sequence numbers behind the writers.
  *
- * Lazy SMRs will not busy loop and the wrap happens every 49.6 days
- * at 1khz and 119 hours at 10khz.  Readers can block for no longer
+ * Lazy SMRs will not busy loop and the wrap happens every 25 days
+ * at 1khz and 60 hours at 10khz.  Readers can block for no longer
  * than half of this for SMR_SEQ_ macros to continue working.
  */
 smr_seq_t
@@ -478,7 +454,7 @@ smr_poll_scan(smr_t smr, smr_shared_t s, smr_seq_t s_r
         * Advance the rd_seq as long as we observed a more recent value.
         */
        s_rd_seq = atomic_load_int(&s->s_rd_seq);
-       if (SMR_SEQ_GEQ(rd_seq, s_rd_seq)) {
+       if (SMR_SEQ_GT(rd_seq, s_rd_seq)) {
                atomic_cmpset_int(&s->s_rd_seq, s_rd_seq, rd_seq);
                s_rd_seq = rd_seq;
        }
@@ -530,7 +506,7 @@ smr_poll(smr_t smr, smr_seq_t goal, bool wait)
 
        /*
         * Conditionally advance the lazy write clock on any writer
-        * activity.  This may reset s_rd_seq.
+        * activity.
         */
        if ((flags & SMR_LAZY) != 0)
                smr_lazy_advance(smr, s);
@@ -552,7 +528,7 @@ smr_poll(smr_t smr, smr_seq_t goal, bool wait)
         * wr_seq must be loaded prior to any c_seq value so that a
         * stale c_seq can only reference time after this wr_seq.
         */
-       s_wr_seq = atomic_load_acq_int(&s->s_wr_seq);
+       s_wr_seq = atomic_load_acq_int(&s->s_wr.seq);
 
        /*
         * This is the distance from s_wr_seq to goal.  Positive values
@@ -567,7 +543,7 @@ smr_poll(smr_t smr, smr_seq_t goal, bool wait)
         * smr.  If we are not blocking we can not succeed but the
         * sequence number is valid.
         */
-       if (delta > 0 && delta <= SMR_SEQ_MAX_ADVANCE &&
+       if (delta > 0 && delta <= SMR_SEQ_ADVANCE &&
            (flags & (SMR_LAZY | SMR_DEFERRED)) != 0) {
                if (!wait) {
                        success = false;
@@ -617,10 +593,8 @@ smr_create(const char *name, int limit, int flags)
        smr = uma_zalloc_pcpu(smr_zone, M_WAITOK);
 
        s->s_name = name;
-       if ((flags & SMR_LAZY) == 0)
-               s->s_rd_seq = s->s_wr_seq = SMR_SEQ_INIT;
-       else
-               s->s_rd_seq = s->s_wr_seq = ticks;
+       s->s_rd_seq = s->s_wr.seq = SMR_SEQ_INIT;
+       s->s_wr.ticks = ticks;
 
        /* Initialize all CPUS, not just those running. */
        for (i = 0; i <= mp_maxid; i++) {

Modified: head/sys/sys/smr.h
==============================================================================
--- head/sys/sys/smr.h  Thu Feb 27 19:04:39 2020        (r358399)
+++ head/sys/sys/smr.h  Thu Feb 27 19:05:26 2020        (r358400)
@@ -56,9 +56,16 @@
 #define        SMR_SEQ_INVALID         0
 
 /* Shared SMR state. */
+union s_wr {
+       struct {
+               smr_seq_t       seq;    /* Current write sequence #. */
+               int             ticks;  /* tick of last update (LAZY) */
+       };
+       uint64_t        _pair;
+};
 struct smr_shared {
        const char      *s_name;        /* Name for debugging/reporting. */
-       smr_seq_t       s_wr_seq;       /* Current write sequence #. */
+       union s_wr      s_wr;           /* Write sequence */
        smr_seq_t       s_rd_seq;       /* Minimum observed read sequence. */
 };
 typedef struct smr_shared *smr_shared_t;
@@ -189,7 +196,7 @@ static inline smr_seq_t
 smr_shared_current(smr_shared_t s)
 {
 
-       return (atomic_load_int(&s->s_wr_seq));
+       return (atomic_load_int(&s->s_wr.seq));
 }
 
 static inline smr_seq_t
@@ -281,7 +288,7 @@ smr_lazy_enter(smr_t smr)
         * If we assign a stale wr_seq value due to interrupt we use the
         * same algorithm that renders smr_enter() safe.
         */
-       smr->c_seq = smr_shared_current(smr->c_shared);
+       atomic_store_int(&smr->c_seq, smr_shared_current(smr->c_shared));
 }
 
 /*
@@ -306,7 +313,7 @@ smr_lazy_exit(smr_t smr)
         * time and wait 1 tick longer.
         */
        atomic_thread_fence_rel();
-       smr->c_seq = SMR_SEQ_INVALID;
+       atomic_store_int(&smr->c_seq, SMR_SEQ_INVALID);
        critical_exit();
 }
 
_______________________________________________
svn-src-head@freebsd.org mailing list
https://lists.freebsd.org/mailman/listinfo/svn-src-head
To unsubscribe, send any mail to "svn-src-head-unsubscr...@freebsd.org"

Reply via email to