locking/qspinlock: Use smp_cond_acquire() in pending code
PATCH 1/3 locking/qspinlock: Use smp_cond_acquire() in pending code
The newly introduced smp_cond_acquire() was used to replace the slowpath lock acquisition loop. Similarly, the new function can also be applied to the pending bit locking loop. This patch uses the new function in that loop.
--- kernel/locking/qspinlock.c | 7 +++---- 1 files changed, 3 insertions(+), 4 deletions(-)
kernel/locking/qspinlock.c +3 -4
@@ -358,8 +358,7 @@ void queued_spin_lock_slowpath(struct qspinlock *lock, u32 val)* sequentiality; this is because not all clear_pending_set_locked() * implementations imply full barriers. */ -while ((val =smp_load_acquire (&lock->val.counter)) & _Q_LOCKED_MASK) -cpu_relax (); +smp_cond_acquire (!(atomic_read (&lock->val) & _Q_LOCKED_MASK));/* * take ownership and clear the pending bit.
@@ -435,7 +434,7 @@ queue:* * The PV pv_wait_head_or_lock function, if active, will acquire * the lock and return a non-zero value. So we have to skip the -* smp_load_acquire() call. As the next PV queue head hasn't been +* smp_cond_acquire() call. As the next PV queue head hasn't been * designated yet, there is no way for the locked value to become * _Q_SLOW_VAL. So both the set_locked() and the * atomic_cmpxchg_relaxed() calls will be safe.
@@ -466,7 +465,7 @@ locked:break ; }/* -* The smp_load_acquire() call above has provided the necessary +* The smp_cond_acquire() call above has provided the necessary * acquire semantics required for locking. At most two * iterations of this loop may be ran. */
Signature · 1 line
1.7.1
PATCH 2/3 locking/pvqspinlock: Enable slowpath locking count tracking
This patch enables the tracking of the number of slowpath locking operations performed. This can be used to compare against the number of lock stealing operations to see what percentage of locks are stolen versus acquired via the regular slowpath.
--- kernel/locking/qspinlock_paravirt.h | 5 +++++ kernel/locking/qspinlock_stat.h | 3 +++ 2 files changed, 8 insertions(+), 0 deletions(-)
kernel/locking/qspinlock_paravirt.h +5 -0
@@ -398,6 +398,11 @@ pv_wait_head_or_lock(struct qspinlock *lock, struct mcs_spinlock *node)if (READ_ONCE (pn->state) == vcpu_hashed) lp = (struct qspinlock **)1 ; +/* +* Tracking # of slowpath locking operations +*/ +qstat_inc (qstat_pv_lock_slowpath, true); +for (;; waitcnt++) {/* * Set correct vCPU state to be used by queue node wait-early
kernel/locking/qspinlock_stat.h +3 -0
@@ -22,6 +22,7 @@* pv_kick_wake - # of vCPU kicks used for computing pv_latency_wake * pv_latency_kick - average latency (ns) of vCPU kick operation * pv_latency_wake - average latency (ns) from vCPU kick to wakeup +* pv_lock_slowpath - # of locking operations via the slowpath * pv_lock_stealing - # of lock stealing operations * pv_spurious_wakeup - # of spurious wakeups * pv_wait_again - # of vCPU wait's that happened after a vCPU kick
@@ -45,6 +46,7 @@ enum qlock_stats { qstat_pv_kick_wake, qstat_pv_latency_kick, qstat_pv_latency_wake, + qstat_pv_lock_slowpath, qstat_pv_lock_stealing, qstat_pv_spurious_wakeup, qstat_pv_wait_again,
@@ -70,6 +72,7 @@ static const char * const qstat_names[qstat_num + 1] = { [qstat_pv_spurious_wakeup] = "pv_spurious_wakeup", [qstat_pv_latency_kick] = "pv_latency_kick", [qstat_pv_latency_wake] = "pv_latency_wake", + [qstat_pv_lock_slowpath] = "pv_lock_slowpath", [qstat_pv_lock_stealing] = "pv_lock_stealing", [qstat_pv_wait_again] = "pv_wait_again", [qstat_pv_wait_early] = "pv_wait_early",
Signature · 1 line
1.7.1
tip-bot for Waiman Long
merge bot[tip:locking/core] locking/pvqspinlock: Enable slowpath locking count tracking
locking/pvqspinlock: Enable slowpath locking count tracking
Commit-ID: 32d62510f949d3c8e83b9b3b844a84446611661b Gitweb: http://git.kernel.org/tip/32d62510f949d3c8e83b9b3b844a84446611661b Author: Waiman Long <[email protected]> AuthorDate: Thu, 10 Dec 2015 15:17:45 -0500 Committer: Ingo Molnar <[email protected]> CommitDate: Mon, 29 Feb 2016 10:02:42 +0100
locking/pvqspinlock: Enable slowpath locking count tracking
This patch enables the tracking of the number of slowpath locking operations performed. This can be used to compare against the number of lock stealing operations to see what percentage of locks are stolen versus acquired via the regular slowpath.
--- kernel/locking/qspinlock_paravirt.h | 5 +++++ kernel/locking/qspinlock_stat.h | 3 +++ 2 files changed, 8 insertions(+)
kernel/locking/qspinlock_paravirt.h +5 -0
@@ -400,6 +400,11 @@ pv_wait_head_or_lock(struct qspinlock *lock, struct mcs_spinlock *node)if (READ_ONCE (pn->state) == vcpu_hashed) lp = (struct qspinlock **)1 ; +/* +* Tracking # of slowpath locking operations +*/ +qstat_inc (qstat_pv_lock_slowpath, true); +for (;; waitcnt++) {/* * Set correct vCPU state to be used by queue node wait-early
kernel/locking/qspinlock_stat.h +3 -0
@@ -22,6 +22,7 @@* pv_kick_wake - # of vCPU kicks used for computing pv_latency_wake * pv_latency_kick - average latency (ns) of vCPU kick operation * pv_latency_wake - average latency (ns) from vCPU kick to wakeup +* pv_lock_slowpath - # of locking operations via the slowpath * pv_lock_stealing - # of lock stealing operations * pv_spurious_wakeup - # of spurious wakeups * pv_wait_again - # of vCPU wait's that happened after a vCPU kick
@@ -45,6 +46,7 @@ enum qlock_stats { qstat_pv_kick_wake, qstat_pv_latency_kick, qstat_pv_latency_wake, + qstat_pv_lock_slowpath, qstat_pv_lock_stealing, qstat_pv_spurious_wakeup, qstat_pv_wait_again,
@@ -70,6 +72,7 @@ static const char * const qstat_names[qstat_num + 1] = { [qstat_pv_spurious_wakeup] = "pv_spurious_wakeup", [qstat_pv_latency_kick] = "pv_latency_kick", [qstat_pv_latency_wake] = "pv_latency_wake", + [qstat_pv_lock_slowpath] = "pv_lock_slowpath", [qstat_pv_lock_stealing] = "pv_lock_stealing", [qstat_pv_wait_again] = "pv_wait_again", [qstat_pv_wait_early] = "pv_wait_early",
PATCH 3/3 locking/pvqspinlock: Direct lock stealing count tracking in pv_queued_spin_steal_lock
In reply to Waiman LongThis patch moves the lock stealing count tracking code into pv_queued_spin_steal_lock instead of via a jacket function simplifying the code.
--- kernel/locking/qspinlock_paravirt.h | 16 +++++++++------- kernel/locking/qspinlock_stat.h | 13 ------------- 2 files changed, 9 insertions(+), 20 deletions(-)
kernel/locking/qspinlock_paravirt.h +9 -7
@@ -55,6 +55,11 @@ struct pv_node { };/* +* Include queued spinlock statistics code +*/ +#include "qspinlock_stat.h" + +/* * By replacing the regular queued_spin_trylock() with the function below, * it will be called once when a lock waiter enter the PV slowpath before * being queued. By allowing one lock stealing attempt here when the pending
@@ -65,9 +70,11 @@ struct pv_node {static inline bool pv_queued_spin_steal_lock (struct qspinlock *lock) {struct __qspinlock *l = (void *)lock; +int ret = !(atomic_read (&lock->val) & _Q_LOCKED_PENDING_MASK) && + (cmpxchg (&l->locked,0 , _Q_LOCKED_VAL) ==0 ); -return !(atomic_read (&lock->val) & _Q_LOCKED_PENDING_MASK) && - (cmpxchg (&l->locked,0 , _Q_LOCKED_VAL) ==0 ); +qstat_inc (qstat_pv_lock_stealing, ret); +return ret; }/*
@@ -138,11 +145,6 @@ static __always_inline int trylock_clear_pending(struct qspinlock *lock)#endif /* _Q_PENDING_BITS == 8 */ /* -* Include queued spinlock statistics code -*/ -#include "qspinlock_stat.h" - -/* * Lock and MCS node addresses hash table for fast lookup * * Hashing is done on a per-cacheline basis to minimize the need to access
kernel/locking/qspinlock_stat.h +0 -13
@@ -282,19 +282,6 @@ static inline void __pv_wait(u8 *ptr, u8 val)#define pv_kick (c) __pv_kick(c)#define pv_wait (p, v) __pv_wait(p, v) -/* -* PV unfair trylock count tracking function -*/ -static inline int qstat_spin_steal_lock (struct qspinlock *lock) -{ -int ret =pv_queued_spin_steal_lock (lock); - -qstat_inc (qstat_pv_lock_stealing, ret); -return ret; -} -#undef queued_spin_trylock -#define queued_spin_trylock (l) qstat_spin_steal_lock(l) -#else /* CONFIG_QUEUED_LOCK_STAT */ static inline void qstat_inc (enum qlock_stats stat,bool cond) { }
Signature · 1 line
1.7.1
tip-bot for Waiman Long
merge bot[tip:locking/core] locking/pvqspinlock: Move lock stealing count tracking code into pv_queued_spin_steal_lock()
locking/pvqspinlock: Move lock stealing count tracking code into pv_queued_spin_steal_lock()
Commit-ID: eaff0e7003cca6c2748b67ead2d4b1a8ad858fc7 Gitweb: http://git.kernel.org/tip/eaff0e7003cca6c2748b67ead2d4b1a8ad858fc7 Author: Waiman Long <[email protected]> AuthorDate: Thu, 10 Dec 2015 15:17:46 -0500 Committer: Ingo Molnar <[email protected]> CommitDate: Mon, 29 Feb 2016 10:02:41 +0100
locking/pvqspinlock: Move lock stealing count tracking code into pv_queued_spin_steal_lock()
This patch moves the lock stealing count tracking code into pv_queued_spin_steal_lock() instead of via a jacket function simplifying the code.
--- kernel/locking/qspinlock_paravirt.h | 16 +++++++++------- kernel/locking/qspinlock_stat.h | 13 ------------- 2 files changed, 9 insertions(+), 20 deletions(-)
kernel/locking/qspinlock_paravirt.h +9 -7
@@ -55,6 +55,11 @@ struct pv_node { };/* +* Include queued spinlock statistics code +*/ +#include "qspinlock_stat.h" + +/* * By replacing the regular queued_spin_trylock() with the function below, * it will be called once when a lock waiter enter the PV slowpath before * being queued. By allowing one lock stealing attempt here when the pending
@@ -65,9 +70,11 @@ struct pv_node {static inline bool pv_queued_spin_steal_lock (struct qspinlock *lock) {struct __qspinlock *l = (void *)lock; +int ret = !(atomic_read (&lock->val) & _Q_LOCKED_PENDING_MASK) && + (cmpxchg (&l->locked,0 , _Q_LOCKED_VAL) ==0 ); -return !(atomic_read (&lock->val) & _Q_LOCKED_PENDING_MASK) && - (cmpxchg (&l->locked,0 , _Q_LOCKED_VAL) ==0 ); +qstat_inc (qstat_pv_lock_stealing, ret); +return ret; }/*
@@ -138,11 +145,6 @@ static __always_inline int trylock_clear_pending(struct qspinlock *lock)#endif /* _Q_PENDING_BITS == 8 */ /* -* Include queued spinlock statistics code -*/ -#include "qspinlock_stat.h" - -/* * Lock and MCS node addresses hash table for fast lookup * * Hashing is done on a per-cacheline basis to minimize the need to access
kernel/locking/qspinlock_stat.h +0 -13
@@ -279,19 +279,6 @@ static inline void __pv_wait(u8 *ptr, u8 val)#define pv_kick (c) __pv_kick(c)#define pv_wait (p, v) __pv_wait(p, v) -/* -* PV unfair trylock count tracking function -*/ -static inline int qstat_spin_steal_lock (struct qspinlock *lock) -{ -int ret =pv_queued_spin_steal_lock (lock); - -qstat_inc (qstat_pv_lock_stealing, ret); -return ret; -} -#undef queued_spin_trylock -#define queued_spin_trylock (l) qstat_spin_steal_lock(l) -#else /* CONFIG_QUEUED_LOCK_STAT */ static inline void qstat_inc (enum qlock_stats stat,bool cond) { }
tip-bot for Waiman Long
merge botlocking/qspinlock: Use smp_cond_acquire() in pending code
Commit-ID: cb037fdad6772df2d49fe61c97d7c0d8265bc918 Gitweb: http://git.kernel.org/tip/cb037fdad6772df2d49fe61c97d7c0d8265bc918 Author: Waiman Long <[email protected]> AuthorDate: Thu, 10 Dec 2015 15:17:44 -0500 Committer: Ingo Molnar <[email protected]> CommitDate: Mon, 29 Feb 2016 10:02:42 +0100
locking/qspinlock: Use smp_cond_acquire() in pending code
The newly introduced smp_cond_acquire() was used to replace the slowpath lock acquisition loop. Similarly, the new function can also be applied to the pending bit locking loop. This patch uses the new function in that loop.
--- kernel/locking/qspinlock.c | 7 +++---- 1 file changed, 3 insertions(+), 4 deletions(-)
kernel/locking/qspinlock.c +3 -4
@@ -358,8 +358,7 @@ void queued_spin_lock_slowpath(struct qspinlock *lock, u32 val)* sequentiality; this is because not all clear_pending_set_locked() * implementations imply full barriers. */ -while ((val =smp_load_acquire (&lock->val.counter)) & _Q_LOCKED_MASK) -cpu_relax (); +smp_cond_acquire (!(atomic_read (&lock->val) & _Q_LOCKED_MASK));/* * take ownership and clear the pending bit.
@@ -435,7 +434,7 @@ queue:* * The PV pv_wait_head_or_lock function, if active, will acquire * the lock and return a non-zero value. So we have to skip the -* smp_load_acquire() call. As the next PV queue head hasn't been +* smp_cond_acquire() call. As the next PV queue head hasn't been * designated yet, there is no way for the locked value to become * _Q_SLOW_VAL. So both the set_locked() and the * atomic_cmpxchg_relaxed() calls will be safe.
@@ -466,7 +465,7 @@ locked:break ; }/* -* The smp_load_acquire() call above has provided the necessary +* The smp_cond_acquire() call above has provided the necessary * acquire semantics required for locking. At most two * iterations of this loop may be ran. */