aboutsummaryrefslogtreecommitdiffstats
path: root/include/linux/rwsem.h
diff options
context:
space:
mode:
authorThomas Gleixner <tglx@linutronix.de>2021-08-15 23:28:03 +0200
committerIngo Molnar <mingo@kernel.org>2021-08-17 17:12:22 +0200
commit943f0edb754fac195043c620b44f920e4fb76ec8 (patch)
tree6184f12bafde18af0fbf613b4b6e0e9f145a1850 /include/linux/rwsem.h
parentlocking/rtmutex: Provide rt_mutex_base_is_locked() (diff)
downloadlinux-dev-943f0edb754fac195043c620b44f920e4fb76ec8.tar.xz
linux-dev-943f0edb754fac195043c620b44f920e4fb76ec8.zip
locking/rt: Add base code for RT rw_semaphore and rwlock
On PREEMPT_RT, rw_semaphores and rwlocks are substituted with an rtmutex and a reader count. The implementation is writer unfair, as it is not feasible to do priority inheritance on multiple readers, but experience has shown that real-time workloads are not the typical workloads which are sensitive to writer starvation. The inner workings of rw_semaphores and rwlocks on RT are almost identical except for the task state and signal handling. rw_semaphores are not state preserving over a contention, they are expected to enter and leave with state == TASK_RUNNING. rwlocks have a mechanism to preserve the state of the task at entry and restore it after unblocking taking potential non-lock related wakeups into account. rw_semaphores can also be subject to signal handling interrupting a blocked state, while rwlocks ignore signals. To avoid code duplication, provide a shared implementation which takes the small difference vs. state and signals into account. The code is included into the relevant rw_semaphore/rwlock base code and compiled for each use case separately. Signed-off-by: Thomas Gleixner <tglx@linutronix.de> Signed-off-by: Peter Zijlstra (Intel) <peterz@infradead.org> Signed-off-by: Ingo Molnar <mingo@kernel.org> Link: https://lore.kernel.org/r/20210815211302.957920571@linutronix.de
Diffstat (limited to 'include/linux/rwsem.h')
0 files changed, 0 insertions, 0 deletions