On Tue, Mar 22, 2016 at 01:46:43PM -0400, Waiman Long wrote:
Ding Tianhong reported a live-lock situation where a constant streamI would very much like a few words on how fairness is preserved.
of incoming optimistic spinners blocked a task in the wait list from
getting the mutex.
This patch attempts to fix this live-lock condition by enabling the
woken task in the wait queue to enter into an optimistic spinning
loop itself in parallel with the regular spinners in the OSQ. This
should prevent the live-lock condition from happening.
Because while the waiter remains on the wait_list while it spins, and
therefore unlock()s will only wake it, and we'll only contend with the
one waiter, the fact that we have two spinners is not fair or starvation
proof at all.
By adding the waiter to the OSQ we get only a single spinner and force
'fairness' by queuing.
I say 'fairness' because the OSQ (need_resched) cancellation can still
take the waiter out again and let even more new spinners in.
diff --git a/kernel/locking/mutex.c b/kernel/locking/mutex.cSuperfluous space there.
index 5dd6171..5c0acee 100644
@@ -538,6 +538,7 @@ __mutex_lock_common(struct mutex *lock, long state, unsigned int subclass,
struct task_struct *task = current;
struct mutex_waiter waiter;
unsigned long flags;
+ bool acquired = false; /* True if the lock is acquired */