Searched refs:rtmutex (Results 1 – 6 of 6) sorted by relevance
| /linux/include/linux/ |
| H A D | rwbase_rt.h | 13 struct rt_mutex_base rtmutex; member
19 .rtmutex = __RT_MUTEX_BASE_INITIALIZER(name.rtmutex), \
24 rt_mutex_base_init(&(rwbase)->rtmutex); \
|
| /linux/lib/ |
| H A D | test_lockup.c | 493 offsetof(rwlock_t, rwbase.rtmutex.wait_lock.magic), in test_lockup_init()
496 offsetof(struct mutex, rtmutex.wait_lock.magic), in test_lockup_init()
499 offsetof(struct rw_semaphore, rwbase.rtmutex.wait_lock.magic), in test_lockup_init()
|
| /linux/Documentation/locking/ |
| H A D | rt-mutex.rst | 32 The enqueueing of the waiters into the rtmutex waiter tree is done in
34 rtmutex, only the top priority waiter is enqueued into the owner's
|
| H A D | rt-mutex-design.rst | 10 This document tries to describe the design of the rtmutex.c implementation.
11 It doesn't describe the reasons why rtmutex.c exists. For that please see
307 not true, the rtmutex.c code will be broken!), this allows for the least
349 The implementation of the PI code in rtmutex.c has several places that a
414 rtmutex.c. See the 'Chain walk basics and protection scope' comment for further
|
| /linux/kernel/rcu/ |
| H A D | tree_plugin.h | 551 drop_boost_mutex = rt_mutex_owner(&rnp->boost_mtx.rtmutex) == t; in rcu_preempt_deferred_qs_irqrestore()
585 rt_mutex_futex_unlock(&rnp->boost_mtx.rtmutex); in rcu_preempt_deferred_qs_irqrestore()
1229 rt_mutex_init_proxy_locked(&rnp->boost_mtx.rtmutex, t); in rcu_boost()
1376 ret = (rt_mutex_owner(&rnp->boost_mtx.rtmutex) == t); in rcu_is_task_rcu_boosted()
|
| /linux/tools/perf/Documentation/ |
| H A D | perf-lock.txt | 191 rtmutex, rwlock-rt, rwlock-rt:R, rwlock-rt:W, percpu-rwmem, pcpu-sem,
|