Lines Matching +full:acquisition +full:- +full:time

10 -----------------
18 of advantages, including simpler interfaces, and at that time smaller
24 --------------
28 (->owner) to keep track of the lock state during its lifetime.  Field owner
32 if waiter list is non-empty).  In its most basic form it also includes a
33 wait-queue and a spinlock that serializes access to it. Furthermore,
34 CONFIG_MUTEX_SPIN_ON_OWNER=y systems use a spinner MCS lock (->osq), described
45 (ii) midpath: aka optimistic spinning, tries to spin for acquisition
52      The MCS lock (proposed by Mellor-Crummey and Scott) is a simple spinlock
55      cacheline bouncing that common test-and-set spinlock implementations
56      incur. An MCS-like lock is specially tailored for optimistic spinning
66       the task is added to the wait-queue and sleeps until woken up by the
71 task and busy-waiting for a few cycles instead of immediately sleeping,
73 number of workloads. Note that this technique is also used for rw-semaphores.
76 ---------
80     - Only one task can hold the mutex at a time.
81     - Only the owner can unlock the mutex.
82     - Multiple unlocks are not permitted.
83     - Recursive locking/unlocking is not permitted.
84     - A mutex must only be initialized via the API (see below).
85     - A task may not exit with a mutex held.
86     - Memory areas where held locks reside must not be freed.
87     - Held mutexes must not be reinitialized.
88     - Mutexes may not be used in hardware or software interrupt
95     - Uses symbolic names of mutexes, whenever they are printed
97     - Point-of-acquire tracking, symbolic lookup of function names,
99     - Owner tracking.
100     - Detects self-recursing locks and prints out all relevant info.
101     - Detects multi-task circular deadlocks and prints out all affected
106 ----------
140 -------------
143 locks in the kernel. E.g: on x86-64 it is 32 bytes, where 'struct semaphore'
148 -------------------