Lines Matching refs:queue
33 * The basic principle of a queue-based spinlock can best be understood
34 * by studying a classic queue-based spinlock implementation called the
102 * Per-CPU queue node structures; we can never have more than 4 nested
168 * xchg_tail - Put in the new queue tail code word & retrieve previous one
170 * @tail : The new queue tail code word
171 * Return: The previous queue tail code word
212 * xchg_tail - Put in the new queue tail code word & retrieve previous one
214 * @tail : The new queue tail code word
215 * Return: The previous queue tail code word
297 * (queue tail, pending bit, lock value)
308 * queue : | ^--' | :
311 * queue : ^--' :
340 * If we observe any contention; queue.
343 goto queue;
355 * Undo and queue; our setting of PENDING might have made the
365 goto queue;
395 queue:
439 * We touched a (possibly) cold cacheline in the per-cpu queue node;
500 * atomic_cond_read_acquire() call. As the next PV queue head hasn't
520 * If the queue head is the only one in the queue (lock value == tail)
542 * which will then detect the remaining tail and queue behind us