Lines Matching +full:foo +full:- +full:queue
1 // SPDX-License-Identifier: GPL-2.0-only
3 * RT-Mutexes: simple blocking mutual exclusion locks with PI support
7 * Copyright (C) 2004-2006 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
8 * Copyright (C) 2005-2006 Timesys Corp., Thomas Gleixner <tglx@timesys.com>
17 * See Documentation/locking/rt-mutex-design.rst for details.
69 * lock->owner state tracking:
71 * lock->owner holds the task_struct pointer of the owner. Bit 0
82 * possible when bit 0 of lock->owner is 0.
85 * with ->wait_lock is held. To prevent any fast path cmpxchg to the lock,
110 * lock->wait_lock is held but explicit acquire semantics are needed in rt_mutex_set_owner()
113 xchg_acquire(&lock->owner, rt_mutex_owner_encode(lock, owner)); in rt_mutex_set_owner()
118 /* lock->wait_lock is held so the unlock provides release semantics. */ in rt_mutex_clear_owner()
119 WRITE_ONCE(lock->owner, rt_mutex_owner_encode(lock, NULL)); in rt_mutex_clear_owner()
124 lock->owner = (struct task_struct *) in clear_rt_mutex_waiters()
125 ((unsigned long)lock->owner & ~RT_MUTEX_HAS_WAITERS); in clear_rt_mutex_waiters()
131 unsigned long owner, *p = (unsigned long *) &lock->owner; in fixup_rt_mutex_waiters()
138 * lock->owner still has the waiters bit set, otherwise the in fixup_rt_mutex_waiters()
142 * l->owner=T1 in fixup_rt_mutex_waiters()
144 * lock(l->lock) in fixup_rt_mutex_waiters()
145 * l->owner = T1 | HAS_WAITERS; in fixup_rt_mutex_waiters()
148 * unlock(l->lock) in fixup_rt_mutex_waiters()
152 * lock(l->lock) in fixup_rt_mutex_waiters()
153 * l->owner = T1 | HAS_WAITERS; in fixup_rt_mutex_waiters()
156 * unlock(l->lock) in fixup_rt_mutex_waiters()
158 * signal(->T2) signal(->T3) in fixup_rt_mutex_waiters()
159 * lock(l->lock) in fixup_rt_mutex_waiters()
162 * unlock(l->lock) in fixup_rt_mutex_waiters()
163 * lock(l->lock) in fixup_rt_mutex_waiters()
167 * unlock(l->lock) in fixup_rt_mutex_waiters()
168 * lock(l->lock) in fixup_rt_mutex_waiters()
171 * l->owner = owner in fixup_rt_mutex_waiters()
172 * owner = l->owner & ~HAS_WAITERS; in fixup_rt_mutex_waiters()
173 * ==> l->owner = T1 in fixup_rt_mutex_waiters()
175 * lock(l->lock) in fixup_rt_mutex_waiters()
178 * owner = l->owner & ~HAS_WAITERS; in fixup_rt_mutex_waiters()
179 * cmpxchg(l->owner, T1, NULL) in fixup_rt_mutex_waiters()
180 * ===> Success (l->owner = NULL) in fixup_rt_mutex_waiters()
182 * l->owner = owner in fixup_rt_mutex_waiters()
183 * ==> l->owner = T1 in fixup_rt_mutex_waiters()
188 * serialized by l->lock, so nothing else can modify the waiters in fixup_rt_mutex_waiters()
189 * bit. If the bit is set then nothing can change l->owner either in fixup_rt_mutex_waiters()
221 return try_cmpxchg_acquire(&lock->owner, &old, new); in rt_mutex_cmpxchg_acquire()
233 return try_cmpxchg_release(&lock->owner, &old, new); in rt_mutex_cmpxchg_release()
237 * Callers must hold the ->wait_lock -- which is the whole purpose as we force
243 unsigned long *p = (unsigned long *) &lock->owner; in mark_rt_mutex_waiters()
252 * The cmpxchg loop above is relaxed to avoid back-to-back ACQUIRE in mark_rt_mutex_waiters()
262 * 2) Drop lock->wait_lock
267 __releases(lock->wait_lock) in unlock_rt_mutex_safe()
272 raw_spin_unlock_irqrestore(&lock->wait_lock, flags); in unlock_rt_mutex_safe()
318 * acquire a non-contended rtmutex. in rt_mutex_try_acquire()
332 lock->owner = (struct task_struct *) in mark_rt_mutex_waiters()
333 ((unsigned long)lock->owner | RT_MUTEX_HAS_WAITERS); in mark_rt_mutex_waiters()
337 * Simple slow path only version: lock->owner is protected by lock->wait_lock.
341 __releases(lock->wait_lock) in unlock_rt_mutex_safe()
343 lock->owner = NULL; in unlock_rt_mutex_safe()
344 raw_spin_unlock_irqrestore(&lock->wait_lock, flags); in unlock_rt_mutex_safe()
351 int prio = task->prio; in __waiter_prio()
360 * Update the waiter->tree copy of the sort keys.
365 lockdep_assert_held(&waiter->lock->wait_lock); in waiter_update_prio()
366 lockdep_assert(RB_EMPTY_NODE(&waiter->tree.entry)); in waiter_update_prio()
368 waiter->tree.prio = __waiter_prio(task); in waiter_update_prio()
369 waiter->tree.deadline = task->dl.deadline; in waiter_update_prio()
373 * Update the waiter->pi_tree copy of the sort keys (from the tree copy).
378 lockdep_assert_held(&waiter->lock->wait_lock); in waiter_clone_prio()
379 lockdep_assert_held(&task->pi_lock); in waiter_clone_prio()
380 lockdep_assert(RB_EMPTY_NODE(&waiter->pi_tree.entry)); in waiter_clone_prio()
382 waiter->pi_tree.prio = waiter->tree.prio; in waiter_clone_prio()
383 waiter->pi_tree.deadline = waiter->tree.deadline; in waiter_clone_prio()
390 &(struct rt_waiter_node){ .prio = __waiter_prio(p), .deadline = (p)->dl.deadline }
397 if (left->prio < right->prio) in rt_waiter_node_less()
406 if (dl_prio(left->prio)) in rt_waiter_node_less()
407 return dl_time_before(left->deadline, right->deadline); in rt_waiter_node_less()
415 if (left->prio != right->prio) in rt_waiter_node_equal()
424 if (dl_prio(left->prio)) in rt_waiter_node_equal()
425 return left->deadline == right->deadline; in rt_waiter_node_equal()
433 if (rt_waiter_node_less(&waiter->tree, &top_waiter->tree)) in rt_mutex_steal()
441 if (rt_or_dl_prio(waiter->tree.prio)) in rt_mutex_steal()
444 return rt_waiter_node_equal(&waiter->tree, &top_waiter->tree); in rt_mutex_steal()
458 if (rt_waiter_node_less(&aw->tree, &bw->tree)) in __waiter_less()
464 if (rt_waiter_node_less(&bw->tree, &aw->tree)) in __waiter_less()
467 /* NOTE: relies on waiter->ww_ctx being set before insertion */ in __waiter_less()
468 if (aw->ww_ctx) { in __waiter_less()
469 if (!bw->ww_ctx) in __waiter_less()
472 return (signed long)(aw->ww_ctx->stamp - in __waiter_less()
473 bw->ww_ctx->stamp) < 0; in __waiter_less()
482 lockdep_assert_held(&lock->wait_lock); in rt_mutex_enqueue()
484 rb_add_cached(&waiter->tree.entry, &lock->waiters, __waiter_less); in rt_mutex_enqueue()
490 lockdep_assert_held(&lock->wait_lock); in rt_mutex_dequeue()
492 if (RB_EMPTY_NODE(&waiter->tree.entry)) in rt_mutex_dequeue()
495 rb_erase_cached(&waiter->tree.entry, &lock->waiters); in rt_mutex_dequeue()
496 RB_CLEAR_NODE(&waiter->tree.entry); in rt_mutex_dequeue()
510 lockdep_assert_held(&task->pi_lock); in rt_mutex_enqueue_pi()
512 rb_add_cached(&waiter->pi_tree.entry, &task->pi_waiters, __pi_waiter_less); in rt_mutex_enqueue_pi()
518 lockdep_assert_held(&task->pi_lock); in rt_mutex_dequeue_pi()
520 if (RB_EMPTY_NODE(&waiter->pi_tree.entry)) in rt_mutex_dequeue_pi()
523 rb_erase_cached(&waiter->pi_tree.entry, &task->pi_waiters); in rt_mutex_dequeue_pi()
524 RB_CLEAR_NODE(&waiter->pi_tree.entry); in rt_mutex_dequeue_pi()
532 lockdep_assert_held(&lock->wait_lock); in rt_mutex_adjust_prio()
534 lockdep_assert_held(&p->pi_lock); in rt_mutex_adjust_prio()
537 pi_task = task_top_pi_waiter(p)->task; in rt_mutex_adjust_prio()
549 WARN_ON_ONCE(wqh->rtlock_task); in rt_mutex_wake_q_add_task()
551 wqh->rtlock_task = task; in rt_mutex_wake_q_add_task()
553 wake_q_add(&wqh->head, task); in rt_mutex_wake_q_add_task()
560 rt_mutex_wake_q_add_task(wqh, w->task, w->wake_state); in rt_mutex_wake_q_add()
565 if (IS_ENABLED(CONFIG_PREEMPT_RT) && wqh->rtlock_task) { in rt_mutex_wake_up_q()
566 wake_up_state(wqh->rtlock_task, TASK_RTLOCK_WAIT); in rt_mutex_wake_up_q()
567 put_task_struct(wqh->rtlock_task); in rt_mutex_wake_up_q()
568 wqh->rtlock_task = NULL; in rt_mutex_wake_up_q()
571 if (!wake_q_empty(&wqh->head)) in rt_mutex_wake_up_q()
572 wake_up_q(&wqh->head); in rt_mutex_wake_up_q()
602 return p->pi_blocked_on ? p->pi_blocked_on->lock : NULL; in task_blocked_on_lock()
607 * Decreases task's usage by one - may thus free the task.
624 * Returns 0 or -EDEADLK.
629 * [Pn] task->pi_lock held
630 * [L] rtmutex->wait_lock held
634 * rtmutex->wait_lock
635 * task->pi_lock
651 * [1] lock(task->pi_lock); [R] acquire [P1]
652 * [2] waiter = task->pi_blocked_on; [P1]
654 * [4] lock = waiter->lock; [P1]
655 * [5] if (!try_lock(lock->wait_lock)) { [P1] try to acquire [L]
656 * unlock(task->pi_lock); release [P1]
661 * [8] unlock(task->pi_lock); release [P1]
666 * lock(task->pi_lock); [L] acquire [P2]
669 * [13] unlock(task->pi_lock); release [P2]
670 * unlock(lock->wait_lock); release [L]
715 top_task->comm, task_pid_nr(top_task)); in rt_mutex_adjust_prio_chain()
719 return -EDEADLK; in rt_mutex_adjust_prio_chain()
732 raw_spin_lock_irq(&task->pi_lock); in rt_mutex_adjust_prio_chain()
737 waiter = task->pi_blocked_on; in rt_mutex_adjust_prio_chain()
740 * [3] check_exit_conditions_1() protected by task->pi_lock. in rt_mutex_adjust_prio_chain()
767 if (next_lock != waiter->lock) in rt_mutex_adjust_prio_chain()
778 * P3 should not return -EDEADLK because it gets trapped in the cycle in rt_mutex_adjust_prio_chain()
779 * created by P1 and P2 (which will resolve -- and runs into in rt_mutex_adjust_prio_chain()
792 if (IS_ENABLED(CONFIG_PREEMPT_RT) && waiter->ww_ctx && detect_deadlock) in rt_mutex_adjust_prio_chain()
824 if (rt_waiter_node_equal(&waiter->tree, task_to_waiter_node(task))) { in rt_mutex_adjust_prio_chain()
832 * [4] Get the next lock; per holding task->pi_lock we can't unblock in rt_mutex_adjust_prio_chain()
835 lock = waiter->lock; in rt_mutex_adjust_prio_chain()
837 * [5] We need to trylock here as we are holding task->pi_lock, in rt_mutex_adjust_prio_chain()
841 * Per the above, holding task->pi_lock guarantees lock exists, so in rt_mutex_adjust_prio_chain()
842 * inverting this lock order is infeasible from a life-time in rt_mutex_adjust_prio_chain()
845 if (!raw_spin_trylock(&lock->wait_lock)) { in rt_mutex_adjust_prio_chain()
846 raw_spin_unlock_irq(&task->pi_lock); in rt_mutex_adjust_prio_chain()
852 * [6] check_exit_conditions_2() protected by task->pi_lock and in rt_mutex_adjust_prio_chain()
853 * lock->wait_lock. in rt_mutex_adjust_prio_chain()
861 ret = -EDEADLK; in rt_mutex_adjust_prio_chain()
866 * logic pick which of the contending threads gets -EDEADLK. in rt_mutex_adjust_prio_chain()
872 if (IS_ENABLED(CONFIG_PREEMPT_RT) && orig_waiter && orig_waiter->ww_ctx) in rt_mutex_adjust_prio_chain()
875 raw_spin_unlock(&lock->wait_lock); in rt_mutex_adjust_prio_chain()
889 raw_spin_unlock(&task->pi_lock); in rt_mutex_adjust_prio_chain()
893 * [9] check_exit_conditions_3 protected by lock->wait_lock. in rt_mutex_adjust_prio_chain()
897 raw_spin_unlock_irq(&lock->wait_lock); in rt_mutex_adjust_prio_chain()
903 raw_spin_lock(&task->pi_lock); in rt_mutex_adjust_prio_chain()
918 raw_spin_unlock(&task->pi_lock); in rt_mutex_adjust_prio_chain()
919 raw_spin_unlock_irq(&lock->wait_lock); in rt_mutex_adjust_prio_chain()
956 * Since we hold lock->waiter_lock, task cannot unblock, even if we in rt_mutex_adjust_prio_chain()
957 * release task->pi_lock. in rt_mutex_adjust_prio_chain()
959 raw_spin_unlock(&task->pi_lock); in rt_mutex_adjust_prio_chain()
963 * [9] check_exit_conditions_3 protected by lock->wait_lock. in rt_mutex_adjust_prio_chain()
977 wake_up_state(top_waiter->task, top_waiter->wake_state); in rt_mutex_adjust_prio_chain()
978 raw_spin_unlock_irq(&lock->wait_lock); in rt_mutex_adjust_prio_chain()
985 * Per holding lock->wait_lock and checking for !owner above, there in rt_mutex_adjust_prio_chain()
989 raw_spin_lock(&task->pi_lock); in rt_mutex_adjust_prio_chain()
1028 * [12] check_exit_conditions_4() protected by task->pi_lock in rt_mutex_adjust_prio_chain()
1029 * and lock->wait_lock. The actual decisions are made after we in rt_mutex_adjust_prio_chain()
1035 * task->pi_lock next_lock cannot be dereferenced anymore. in rt_mutex_adjust_prio_chain()
1045 raw_spin_unlock(&task->pi_lock); in rt_mutex_adjust_prio_chain()
1046 raw_spin_unlock_irq(&lock->wait_lock); in rt_mutex_adjust_prio_chain()
1069 raw_spin_unlock_irq(&task->pi_lock); in rt_mutex_adjust_prio_chain()
1077 * Try to take an rt-mutex
1079 * Must be called with lock->wait_lock held and interrupts disabled
1090 lockdep_assert_held(&lock->wait_lock); in try_to_take_rt_mutex()
1094 * RT_MUTEX_HAS_WAITERS bit in @lock->owner. This forces all in try_to_take_rt_mutex()
1096 * and they serialize on @lock->wait_lock. in try_to_take_rt_mutex()
1101 * - There is a lock owner. The caller must fixup the in try_to_take_rt_mutex()
1105 * - @task acquires the lock and there are no other in try_to_take_rt_mutex()
1144 * the lock. @task->pi_blocked_on is NULL, so it does in try_to_take_rt_mutex()
1161 * pi_lock dance.@task->pi_blocked_on is NULL in try_to_take_rt_mutex()
1170 * Clear @task->pi_blocked_on. Requires protection by in try_to_take_rt_mutex()
1171 * @task->pi_lock. Redundant operation for the @waiter == NULL in try_to_take_rt_mutex()
1175 raw_spin_lock(&task->pi_lock); in try_to_take_rt_mutex()
1176 task->pi_blocked_on = NULL; in try_to_take_rt_mutex()
1180 * waiter into @task->pi_waiters tree. in try_to_take_rt_mutex()
1184 raw_spin_unlock(&task->pi_lock); in try_to_take_rt_mutex()
1201 * This must be called with lock->wait_lock held and interrupts disabled
1215 lockdep_assert_held(&lock->wait_lock); in task_blocks_on_rt_mutex()
1222 * the other will detect the deadlock and return -EDEADLOCK, in task_blocks_on_rt_mutex()
1230 return -EDEADLK; in task_blocks_on_rt_mutex()
1232 raw_spin_lock(&task->pi_lock); in task_blocks_on_rt_mutex()
1233 waiter->task = task; in task_blocks_on_rt_mutex()
1234 waiter->lock = lock; in task_blocks_on_rt_mutex()
1243 task->pi_blocked_on = waiter; in task_blocks_on_rt_mutex()
1245 raw_spin_unlock(&task->pi_lock); in task_blocks_on_rt_mutex()
1254 raw_spin_lock(&task->pi_lock); in task_blocks_on_rt_mutex()
1256 task->pi_blocked_on = NULL; in task_blocks_on_rt_mutex()
1257 raw_spin_unlock(&task->pi_lock); in task_blocks_on_rt_mutex()
1265 raw_spin_lock(&owner->pi_lock); in task_blocks_on_rt_mutex()
1271 if (owner->pi_blocked_on) in task_blocks_on_rt_mutex()
1280 raw_spin_unlock(&owner->pi_lock); in task_blocks_on_rt_mutex()
1296 raw_spin_unlock_irq_wake(&lock->wait_lock, wake_q); in task_blocks_on_rt_mutex()
1301 raw_spin_lock_irq(&lock->wait_lock); in task_blocks_on_rt_mutex()
1308 * queue it up.
1310 * Called with lock->wait_lock held and interrupts disabled.
1317 lockdep_assert_held(&lock->wait_lock); in mark_wakeup_next_waiter()
1319 raw_spin_lock(¤t->pi_lock); in mark_wakeup_next_waiter()
1324 * Remove it from current->pi_waiters and deboost. in mark_wakeup_next_waiter()
1327 * rt_mutex_setprio() to update p->pi_top_task before the in mark_wakeup_next_waiter()
1341 lock->owner = (void *) RT_MUTEX_HAS_WAITERS; in mark_wakeup_next_waiter()
1346 * p->pi_top_task pointer points to a blocked task). This however can in mark_wakeup_next_waiter()
1355 raw_spin_unlock(¤t->pi_lock); in mark_wakeup_next_waiter()
1372 * Slow path try-lock function:
1381 * This can be done without taking the @lock->wait_lock as in rt_mutex_slowtrylock()
1391 raw_spin_lock_irqsave(&lock->wait_lock, flags); in rt_mutex_slowtrylock()
1395 raw_spin_unlock_irqrestore(&lock->wait_lock, flags); in rt_mutex_slowtrylock()
1409 * Slow path to release a rt-mutex.
1417 raw_spin_lock_irqsave(&lock->wait_lock, flags); in rt_mutex_slowunlock()
1426 * foo->lock->owner = NULL; in rt_mutex_slowunlock()
1427 * rtmutex_lock(foo->lock); <- fast path in rt_mutex_slowunlock()
1428 * free = atomic_dec_and_test(foo->refcnt); in rt_mutex_slowunlock()
1429 * rtmutex_unlock(foo->lock); <- fast path in rt_mutex_slowunlock()
1431 * kfree(foo); in rt_mutex_slowunlock()
1432 * raw_spin_unlock(foo->lock->wait_lock); in rt_mutex_slowunlock()
1437 * lock->wait_lock. So we do the following sequence: in rt_mutex_slowunlock()
1441 * raw_spin_unlock(&lock->wait_lock); in rt_mutex_slowunlock()
1442 * if (cmpxchg(&lock->owner, owner, 0) == owner) in rt_mutex_slowunlock()
1447 * lock->owner is serialized by lock->wait_lock: in rt_mutex_slowunlock()
1449 * lock->owner = NULL; in rt_mutex_slowunlock()
1450 * raw_spin_unlock(&lock->wait_lock); in rt_mutex_slowunlock()
1453 /* Drops lock->wait_lock ! */ in rt_mutex_slowunlock()
1457 raw_spin_lock_irqsave(&lock->wait_lock, flags); in rt_mutex_slowunlock()
1464 * Queue the next waiter for wakeup once we release the wait_lock. in rt_mutex_slowunlock()
1467 raw_spin_unlock_irqrestore(&lock->wait_lock, flags); in rt_mutex_slowunlock()
1501 * - the lock owner has been scheduled out in rtmutex_spin_on_owner()
1502 * - current is not longer the top waiter in rtmutex_spin_on_owner()
1503 * - current is requested to reschedule (redundant in rtmutex_spin_on_owner()
1505 * - the VCPU on which owner runs is preempted in rtmutex_spin_on_owner()
1529 * - rtmutex, futex on all kernels
1530 * - mutex and rwsem substitutions on RT kernels
1536 * Must be called with lock->wait_lock held and interrupts disabled. It must
1546 lockdep_assert_held(&lock->wait_lock); in remove_waiter()
1548 raw_spin_lock(¤t->pi_lock); in remove_waiter()
1550 current->pi_blocked_on = NULL; in remove_waiter()
1551 raw_spin_unlock(¤t->pi_lock); in remove_waiter()
1560 raw_spin_lock(&owner->pi_lock); in remove_waiter()
1572 raw_spin_unlock(&owner->pi_lock); in remove_waiter()
1584 raw_spin_unlock_irq(&lock->wait_lock); in remove_waiter()
1589 raw_spin_lock_irq(&lock->wait_lock); in remove_waiter()
1593 * rt_mutex_slowlock_block() - Perform the wait-wake-try-to-take loop
1598 * @timeout: the pre-initialized and started timer, or NULL for none
1599 * @waiter: the pre-initialized rt_mutex_waiter
1600 * @wake_q: wake_q of tasks to wake when we drop the lock->wait_lock
1602 * Must be called with lock->wait_lock held and interrupts disabled
1610 __releases(&lock->wait_lock) __acquires(&lock->wait_lock) in rt_mutex_slowlock_block()
1624 if (timeout && !timeout->task) { in rt_mutex_slowlock_block()
1625 ret = -ETIMEDOUT; in rt_mutex_slowlock_block()
1629 ret = -EINTR; in rt_mutex_slowlock_block()
1643 raw_spin_unlock_irq_wake(&lock->wait_lock, wake_q); in rt_mutex_slowlock_block()
1650 raw_spin_lock_irq(&lock->wait_lock); in rt_mutex_slowlock_block()
1663 * If the result is not -EDEADLOCK or the caller requested in rt_mutex_handle_deadlock()
1666 if (res != -EDEADLOCK || detect_deadlock) in rt_mutex_handle_deadlock()
1669 if (build_ww_mutex() && w->ww_ctx) in rt_mutex_handle_deadlock()
1672 raw_spin_unlock_irq(&lock->wait_lock); in rt_mutex_handle_deadlock()
1683 * __rt_mutex_slowlock - Locking slowpath invoked with lock::wait_lock held
1702 lockdep_assert_held(&lock->wait_lock); in __rt_mutex_slowlock()
1726 if (!ww_ctx->is_wait_die) in __rt_mutex_slowlock()
1769 * rt_mutex_slowlock - Locking slowpath invoked when fast path fails
1783 * Do all pre-schedule work here, before we queue a waiter and invoke in rt_mutex_slowlock()
1784 * PI -- any such work that trips on rtlock (PREEMPT_RT spinlock) would in rt_mutex_slowlock()
1795 * rtmutex with lock->wait_lock held. But we cannot unconditionally in rt_mutex_slowlock()
1799 raw_spin_lock_irqsave(&lock->wait_lock, flags); in rt_mutex_slowlock()
1801 raw_spin_unlock_irqrestore_wake(&lock->wait_lock, flags, &wake_q); in rt_mutex_slowlock()
1810 lockdep_assert(!current->pi_blocked_on); in __rt_mutex_lock()
1825 * rtlock_slowlock_locked - Slow path lock acquisition for RT locks
1831 __releases(&lock->wait_lock) __acquires(&lock->wait_lock) in rtlock_slowlock_locked()
1836 lockdep_assert_held(&lock->wait_lock); in rtlock_slowlock_locked()
1864 raw_spin_unlock_irq_wake(&lock->wait_lock, wake_q); in rtlock_slowlock_locked()
1871 raw_spin_lock_irq(&lock->wait_lock); in rtlock_slowlock_locked()
1894 raw_spin_lock_irqsave(&lock->wait_lock, flags); in rtlock_slowlock()
1896 raw_spin_unlock_irqrestore_wake(&lock->wait_lock, flags, &wake_q); in rtlock_slowlock()