Home
last modified time | relevance | path

Searched refs:tail_id (Results 1 - 10 of 10) sorted by relevance

/kernel/linux/linux-5.10/arch/s390/lib/
H A Dspinlock.c120 int lockval, ix, node_id, tail_id, old, new, owner, count; in arch_spin_lock_queued() local
154 tail_id = old & _Q_TAIL_MASK; in arch_spin_lock_queued()
155 if (tail_id != 0) { in arch_spin_lock_queued()
156 node->prev = arch_spin_decode_tail(tail_id); in arch_spin_lock_queued()
166 if (tail_id != 0) { in arch_spin_lock_queued()
185 tail_id = old & _Q_TAIL_MASK; in arch_spin_lock_queued()
186 new = ((tail_id != node_id) ? tail_id : 0) | lockval; in arch_spin_lock_queued()
200 if (node_id && tail_id != node_id) { in arch_spin_lock_queued()
/kernel/linux/linux-6.6/arch/s390/lib/
H A Dspinlock.c120 int lockval, ix, node_id, tail_id, old, new, owner, count; in arch_spin_lock_queued() local
154 tail_id = old & _Q_TAIL_MASK; in arch_spin_lock_queued()
155 if (tail_id != 0) { in arch_spin_lock_queued()
156 node->prev = arch_spin_decode_tail(tail_id); in arch_spin_lock_queued()
166 if (tail_id != 0) { in arch_spin_lock_queued()
185 tail_id = old & _Q_TAIL_MASK; in arch_spin_lock_queued()
186 new = ((tail_id != node_id) ? tail_id : 0) | lockval; in arch_spin_lock_queued()
200 if (node_id && tail_id != node_id) { in arch_spin_lock_queued()
/kernel/linux/linux-5.10/kernel/printk/
H A Dprintk_ringbuffer.c69 * The descriptor ring has a @tail_id that contains the ID of the oldest
76 * @tail_id is advanced, followed by advancing @head_id. And finally the
80 * The @tail_id can only be advanced if the new @tail_id would be in the
766 unsigned long tail_id) in desc_push_tail()
772 d_state = desc_read(desc_ring, tail_id, &desc, NULL, NULL); in desc_push_tail()
782 DESC_ID_PREV_WRAP(desc_ring, tail_id)) { in desc_push_tail()
797 desc_make_reusable(desc_ring, tail_id); in desc_push_tail()
814 * Check the next descriptor after @tail_id before pushing the tail in desc_push_tail()
822 d_state = desc_read(desc_ring, DESC_ID(tail_id in desc_push_tail()
765 desc_push_tail(struct printk_ringbuffer *rb, unsigned long tail_id) desc_push_tail() argument
[all...]
H A Dprintk_ringbuffer.h77 atomic_long_t tail_id; member
216 * The initial @head_id and @tail_id for the desc ring. It is at the last
260 .tail_id = ATOMIC_INIT(DESC0_ID(descbits)), \
H A Dprintk.c976 VMCOREINFO_OFFSET(prb_desc_ring, tail_id); in log_buf_vmcoreinfo_setup()
/kernel/linux/linux-6.6/kernel/printk/
H A Dprintk_ringbuffer.c69 * The descriptor ring has a @tail_id that contains the ID of the oldest
76 * @tail_id is advanced, followed by advancing @head_id. And finally the
80 * The @tail_id can only be advanced if the new @tail_id would be in the
768 unsigned long tail_id) in desc_push_tail()
774 d_state = desc_read(desc_ring, tail_id, &desc, NULL, NULL); in desc_push_tail()
784 DESC_ID_PREV_WRAP(desc_ring, tail_id)) { in desc_push_tail()
799 desc_make_reusable(desc_ring, tail_id); in desc_push_tail()
816 * Check the next descriptor after @tail_id before pushing the tail in desc_push_tail()
824 d_state = desc_read(desc_ring, DESC_ID(tail_id in desc_push_tail()
767 desc_push_tail(struct printk_ringbuffer *rb, unsigned long tail_id) desc_push_tail() argument
[all...]
H A Dprintk_ringbuffer.h77 atomic_long_t tail_id; member
217 * The initial @head_id and @tail_id for the desc ring. It is at the last
261 .tail_id = ATOMIC_INIT(DESC0_ID(descbits)), \
H A Dprintk.c989 VMCOREINFO_OFFSET(prb_desc_ring, tail_id); in log_buf_vmcoreinfo_setup()
/kernel/linux/linux-6.6/scripts/gdb/linux/
H A Ddmesg.py88 off = prb_desc_ring_type.get_type()['tail_id'].bitpos // 8
89 tail_id = utils.read_atomic_long(desc_ring, off)
93 did = tail_id
/kernel/linux/linux-5.10/scripts/gdb/linux/
H A Ddmesg.py94 off = prb_desc_ring_type.get_type()['tail_id'].bitpos // 8
95 tail_id = utils.read_u64(desc_ring, off + counter_off)
99 did = tail_id

Completed in 15 milliseconds