locking/lockdep: Revert qrwlock recusive stuff
Subsystems (2)
Peter Zijlstra
maintainerCommit f0bab73cb539 ("locking/lockdep: Restrict the use of recursive read_lock() with qrwlock") changed lockdep to try and conform to the qrwlock semantics which differ from the traditional rwlock semantics.
In particular qrwlock is fair outside of interrupt context, but in interrupt context readers will ignore all fairness.
The problem modeling this is that read and write side have different lock state (interrupts) semantics but we only have a single representation of these. Therefore lockdep will get confused, thinking the lock can cause interrupt lock inversions.
So revert for now; the old rwlock semantics were already imperfectly modeled and the qrwlock extra won't fit either.
If we want to properly fix this, I think we need to resurrect the work Gautham did a few years ago that split the read and write state of locks:
http://lwn.net/Articles/332801/
---
include/linux/lockdep.h +1 -9
@@ -478,24 +478,16 @@ static inline void print_irqtrace_events(struct task_struct *curr)* on the per lock-class debug mode: */ -/* -* Read states in the 2-bit held_lock:read field: -* 0: Exclusive lock -* 1: Shareable lock, cannot be recursively called -* 2: Shareable lock, can be recursively called -* 3: Shareable lock, cannot be recursively called except in interrupt context -*/ #define lock_acquire_exclusive (l, s, t, n, i) lock_acquire(l, s, t, 0, 1, n, i)#define lock_acquire_shared (l, s, t, n, i) lock_acquire(l, s, t, 1, 1, n, i)#define lock_acquire_shared_recursive (l, s, t, n, i) lock_acquire(l, s, t, 2, 1, n, i) -#define lock_acquire_shared_irecursive (l, s, t, n, i) lock_acquire(l, s, t, 3, 1, n, i)#define spin_acquire (l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i)#define spin_acquire_nest (l, s, t, n, i) lock_acquire_exclusive(l, s, t, n, i)#define spin_release (l, n, i) lock_release(l, n, i)#define rwlock_acquire (l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i) -#define rwlock_acquire_read (l, s, t, i) lock_acquire_shared_irecursive(l, s, t, NULL, i) +#define rwlock_acquire_read (l, s, t, i) lock_acquire_shared_recursive(l, s, t, NULL, i)#define rwlock_release (l, n, i) lock_release(l, n, i)#define seqcount_acquire (l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i)
kernel/locking/lockdep.c +0 -6
@@ -3597,12 +3597,6 @@ void lock_acquire(struct lockdep_map *lock, unsigned int subclass,raw_local_irq_save (flags);check_flags (flags); -/* -* An interrupt recursive read in interrupt context can be considered -* to be the same as a recursive read from checking perspective. -*/ -if ((read ==3 ) &&in_interrupt ()) - read =2 ; current->lockdep_recursion =1 ;trace_lock_acquire (lock, subclass, trylock, read, check, nest_lock, ip); __lock_acquire(lock, subclass, trylock, read, check,
Peter Zijlstra
maintainerNow with locking self test reverted too and extra changelog.
---
Subject: locking/lockdep: Revert qrwlock recusive stuff
From: Peter Zijlstra <[email protected]>
Date: Tue, 30 Sep 2014 14:48:07 +0200
Commit f0bab73cb539 ("locking/lockdep: Restrict the use of recursive read_lock() with qrwlock") changed lockdep to try and conform to the qrwlock semantics which differ from the traditional rwlock semantics.
In particular qrwlock is fair outside of interrupt context, but in interrupt context readers will ignore all fairness.
The problem modeling this is that read and write side have different lock state (interrupts) semantics but we only have a single representation of these. Therefore lockdep will get confused, thinking the lock can cause interrupt lock inversions.
So revert for now; the old rwlock semantics were already imperfectly modeled and the qrwlock extra won't fit either.
If we want to properly fix this, I think we need to resurrect the work by Gautham did a few years ago that split the read and write state of locks:
http://lwn.net/Articles/332801/
FWIW the locking selftest that would've failed (and was reported by Borislav earlier) is something like:
RL(X1); /* IRQ-ON */ LOCK(A); UNLOCK(A); RU(X1); IRQ_ENTER(); RL(X1); /* IN-IRQ */ RU(X1); IRQ_EXIT();
At which point it would report that because A is an IRQ-unsafe lock we can suffer the following inversion:
CPU0 CPU1 lock(A) lock(X1) lock(A) <IRQ> lock(X1)
And this is 'wrong' because X1 can recurse (assuming the above lock are in fact read-lock) but lockdep doesn't know about this.
---
--- include/linux/lockdep.h | 10 -------- kernel/locking/lockdep.c | 6 ----- lib/locking-selftest.c | 56 +++++------------------------------------------ 3 files changed, 8 insertions(+), 64 deletions(-)
include/linux/lockdep.h +1 -9
@@ -478,24 +478,16 @@ static inline void print_irqtrace_events* on the per lock-class debug mode: */ -/* -* Read states in the 2-bit held_lock:read field: -* 0: Exclusive lock -* 1: Shareable lock, cannot be recursively called -* 2: Shareable lock, can be recursively called -* 3: Shareable lock, cannot be recursively called except in interrupt context -*/ #define lock_acquire_exclusive (l, s, t, n, i) lock_acquire(l, s, t, 0, 1, n, i)#define lock_acquire_shared (l, s, t, n, i) lock_acquire(l, s, t, 1, 1, n, i)#define lock_acquire_shared_recursive (l, s, t, n, i) lock_acquire(l, s, t, 2, 1, n, i) -#define lock_acquire_shared_irecursive (l, s, t, n, i) lock_acquire(l, s, t, 3, 1, n, i)#define spin_acquire (l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i)#define spin_acquire_nest (l, s, t, n, i) lock_acquire_exclusive(l, s, t, n, i)#define spin_release (l, n, i) lock_release(l, n, i)#define rwlock_acquire (l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i) -#define rwlock_acquire_read (l, s, t, i) lock_acquire_shared_irecursive(l, s, t, NULL, i) +#define rwlock_acquire_read (l, s, t, i) lock_acquire_shared_recursive(l, s, t, NULL, i)#define rwlock_release (l, n, i) lock_release(l, n, i)#define seqcount_acquire (l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i)
kernel/locking/lockdep.c +0 -6
@@ -3597,12 +3597,6 @@ void lock_acquire(struct lockdep_map *loraw_local_irq_save (flags);check_flags (flags); -/* -* An interrupt recursive read in interrupt context can be considered -* to be the same as a recursive read from checking perspective. -*/ -if ((read ==3 ) &&in_interrupt ()) - read =2 ; current->lockdep_recursion =1 ;trace_lock_acquire (lock, subclass, trylock, read, check, nest_lock, ip); __lock_acquire(lock, subclass, trylock, read, check,
lib/locking-selftest.c +7 -49
95 lines not on this page · raw message
Borislav Petkov
Tested-byQuoted 54 lines · Peter Zijlstra
Now with locking self test reverted too and extra changelog.
---
Subject: locking/lockdep: Revert qrwlock recusive stuff
From: Peter Zijlstra <[email protected]>
Date: Tue, 30 Sep 2014 14:48:07 +0200Commit
f0bab73cb539("locking/lockdep: Restrict the use of recursiveread_lock()with qrwlock") changed lockdep to try and conform to the qrwlock semantics which differ from the traditional rwlock semantics.In particular qrwlock is fair outside of interrupt context, but in interrupt context readers will ignore all fairness.
The problem modeling this is that read and write side have different lock state (interrupts) semantics but we only have a single representation of these. Therefore lockdep will get confused, thinking the lock can cause interrupt lock inversions.
So revert for now; the old rwlock semantics were already imperfectly modeled and the qrwlock extra won't fit either.
If we want to properly fix this, I think we need to resurrect the work by Gautham did a few years ago that split the read and write state of locks:
http://lwn.net/Articles/332801/FWIW the locking selftest that would've failed (and was reported by Borislav earlier) is something like:
RL(X1); /* IRQ-ON */ LOCK(A); UNLOCK(A); RU(X1); IRQ_ENTER(); RL(X1); /* IN-IRQ */ RU(X1); IRQ_EXIT();At which point it would report that because A is an IRQ-unsafe lock we can suffer the following inversion:
CPU0 CPU1 lock(A) lock(X1) lock(A) <IRQ> lock(X1)
Quoted 5 lines
And this is 'wrong' because X1 can recurse (assuming the above lock are in fact read-lock) but lockdep doesn't know about this.
Thanks!
Signature · 5 lines
Regards/Gruss,
Boris.
Sent from a fat crate under my desk. Formatting is fine.
--tip-bot for Peter Zijlstra
merge botlocking/lockdep: Revert qrwlock recusive stuff
Commit-ID: 8acd91e8620836a56ff62028ed28ba629f2881a0 Gitweb: http://git.kernel.org/tip/8acd91e8620836a56ff62028ed28ba629f2881a0 Author: Peter Zijlstra <[email protected]> AuthorDate: Tue, 30 Sep 2014 15:26:00 +0200 Committer: Ingo Molnar <[email protected]> CommitDate: Fri, 3 Oct 2014 06:09:30 +0200
locking/lockdep: Revert qrwlock recusive stuff
Commit f0bab73cb539 ("locking/lockdep: Restrict the use of recursive read_lock() with qrwlock") changed lockdep to try and conform to the qrwlock semantics which differ from the traditional rwlock semantics.
In particular qrwlock is fair outside of interrupt context, but in interrupt context readers will ignore all fairness.
The problem modeling this is that read and write side have different lock state (interrupts) semantics but we only have a single representation of these. Therefore lockdep will get confused, thinking the lock can cause interrupt lock inversions.
So revert it for now; the old rwlock semantics were already imperfectly modeled and the qrwlock extra won't fit either.
If we want to properly fix this, I think we need to resurrect the work by Gautham did a few years ago that split the read and write state of locks:
http://lwn.net/Articles/332801/
FWIW the locking selftest that would've failed (and was reported by Borislav earlier) is something like:
RL(X1); /* IRQ-ON */ LOCK(A); UNLOCK(A); RU(X1); IRQ_ENTER(); RL(X1); /* IN-IRQ */ RU(X1); IRQ_EXIT();
At which point it would report that because A is an IRQ-unsafe lock we can suffer the following inversion:
CPU0 CPU1 lock(A) lock(X1) lock(A) <IRQ> lock(X1)
And this is 'wrong' because X1 can recurse (assuming the above lock are in fact read-lock) but lockdep doesn't know about this.
--- include/linux/lockdep.h | 10 +-------- kernel/locking/lockdep.c | 6 ------ lib/locking-selftest.c | 56 ++++++------------------------------------------ 3 files changed, 8 insertions(+), 64 deletions(-)
include/linux/lockdep.h +1 -9
@@ -478,24 +478,16 @@ static inline void print_irqtrace_events(struct task_struct *curr)* on the per lock-class debug mode: */ -/* -* Read states in the 2-bit held_lock:read field: -* 0: Exclusive lock -* 1: Shareable lock, cannot be recursively called -* 2: Shareable lock, can be recursively called -* 3: Shareable lock, cannot be recursively called except in interrupt context -*/ #define lock_acquire_exclusive (l, s, t, n, i) lock_acquire(l, s, t, 0, 1, n, i)#define lock_acquire_shared (l, s, t, n, i) lock_acquire(l, s, t, 1, 1, n, i)#define lock_acquire_shared_recursive (l, s, t, n, i) lock_acquire(l, s, t, 2, 1, n, i) -#define lock_acquire_shared_irecursive (l, s, t, n, i) lock_acquire(l, s, t, 3, 1, n, i)#define spin_acquire (l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i)#define spin_acquire_nest (l, s, t, n, i) lock_acquire_exclusive(l, s, t, n, i)#define spin_release (l, n, i) lock_release(l, n, i)#define rwlock_acquire (l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i) -#define rwlock_acquire_read (l, s, t, i) lock_acquire_shared_irecursive(l, s, t, NULL, i) +#define rwlock_acquire_read (l, s, t, i) lock_acquire_shared_recursive(l, s, t, NULL, i)#define rwlock_release (l, n, i) lock_release(l, n, i)#define seqcount_acquire (l, s, t, i) lock_acquire_exclusive(l, s, t, NULL, i)
kernel/locking/lockdep.c +0 -6
@@ -3597,12 +3597,6 @@ void lock_acquire(struct lockdep_map *lock, unsigned int subclass,raw_local_irq_save (flags);check_flags (flags); -/* -* An interrupt recursive read in interrupt context can be considered -* to be the same as a recursive read from checking perspective. -*/ -if ((read ==3 ) &&in_interrupt ()) - read =2 ; current->lockdep_recursion =1 ;trace_lock_acquire (lock, subclass, trylock, read, check, nest_lock, ip); __lock_acquire(lock, subclass, trylock, read, check,
lib/locking-selftest.c +7 -49
95 lines not on this page · raw message