Lines Matching full:tail

46  * In particular; where the traditional MCS lock consists of a tail pointer
48  * unlock the next pending (next->locked), we compress both these: {tail,
54  * we can encode the tail by combining the 2-bit nesting level with the cpu
55  * number. With one byte for the lock value and 3 bytes for the tail, only a
114  * (queue tail, pending bit, lock value)
133 	u32 old, tail;
217 	tail = encode_tail(smp_processor_id(), idx);
265 	 * publish the updated tail via xchg_tail() and potentially link
271 	 * Publish the updated tail.
277 	old = xchg_tail(lock, tail);
337 	 * If the queue head is the only one in the queue (lock value == tail)
338 	 * and nobody is pending, clear the tail code and grab the lock.
352 	if ((val & _Q_TAIL_MASK) == tail) {
359 	 * which will then detect the remaining tail and queue behind us