| /kernel/linux/linux-5.10/drivers/staging/media/atomisp/pci/hive_isp_css_common/host/ |
| H A D | debug_private.h | 30 return (debug_data_ptr->head == debug_data_ptr->tail); in is_debug_buffer_empty()
56 if (remote_tail > debug_data_ptr->tail) { in debug_synch_queue()
57 size_t delta = remote_tail - debug_data_ptr->tail; in debug_synch_queue()
60 debug_data_ptr->tail * sizeof(uint32_t), in debug_synch_queue()
61 (void *)&debug_data_ptr->buf[debug_data_ptr->tail], delta * sizeof(uint32_t)); in debug_synch_queue()
62 } else if (remote_tail < debug_data_ptr->tail) { in debug_synch_queue()
63 size_t delta = DEBUG_BUF_SIZE - debug_data_ptr->tail; in debug_synch_queue()
66 debug_data_ptr->tail * sizeof(uint32_t), in debug_synch_queue()
67 (void *)&debug_data_ptr->buf[debug_data_ptr->tail], delta * sizeof(uint32_t)); in debug_synch_queue()
72 debug_data_ptr->tail in debug_synch_queue()
[all...] |
| /kernel/linux/linux-6.6/drivers/staging/media/atomisp/pci/hive_isp_css_common/host/ |
| H A D | debug_private.h | 30 return (debug_data_ptr->head == debug_data_ptr->tail); in is_debug_buffer_empty()
56 if (remote_tail > debug_data_ptr->tail) { in debug_synch_queue()
57 size_t delta = remote_tail - debug_data_ptr->tail; in debug_synch_queue()
60 debug_data_ptr->tail * sizeof(uint32_t), in debug_synch_queue()
61 (void *)&debug_data_ptr->buf[debug_data_ptr->tail], delta * sizeof(uint32_t)); in debug_synch_queue()
62 } else if (remote_tail < debug_data_ptr->tail) { in debug_synch_queue()
63 size_t delta = DEBUG_BUF_SIZE - debug_data_ptr->tail; in debug_synch_queue()
66 debug_data_ptr->tail * sizeof(uint32_t), in debug_synch_queue()
67 (void *)&debug_data_ptr->buf[debug_data_ptr->tail], delta * sizeof(uint32_t)); in debug_synch_queue()
72 debug_data_ptr->tail in debug_synch_queue()
[all...] |
| /kernel/linux/linux-5.10/lib/ |
| H A D | list_sort.c | 19 struct list_head *head, **tail = &head; in merge() local
24 *tail = a; in merge()
25 tail = &a->next; in merge()
28 *tail = b; in merge()
32 *tail = b; in merge()
33 tail = &b->next; in merge()
36 *tail = a; in merge()
55 struct list_head *tail = head; in merge_final() local
61 tail->next = a; in merge_final()
62 a->prev = tail; in merge_final()
216 struct list_head **tail = &pending; list_sort() local
[all...] |
| /kernel/linux/linux-6.6/lib/ |
| H A D | list_sort.c | 19 struct list_head *head, **tail = &head; in merge() local
24 *tail = a; in merge()
25 tail = &a->next; in merge()
28 *tail = b; in merge()
32 *tail = b; in merge()
33 tail = &b->next; in merge()
36 *tail = a; in merge()
55 struct list_head *tail = head; in merge_final() local
61 tail->next = a; in merge_final()
62 a->prev = tail; in merge_final()
216 struct list_head **tail = &pending; list_sort() local
[all...] |
| /kernel/linux/linux-6.6/tools/lib/ |
| H A D | list_sort.c | 18 struct list_head *head, **tail = &head; in merge() local
23 *tail = a; in merge()
24 tail = &a->next; in merge()
27 *tail = b; in merge()
31 *tail = b; in merge()
32 tail = &b->next; in merge()
35 *tail = a; in merge()
54 struct list_head *tail = head; in merge_final() local
60 tail->next = a; in merge_final()
61 a->prev = tail; in merge_final()
215 struct list_head **tail = &pending; list_sort() local
[all...] |
| /kernel/linux/linux-5.10/arch/arm64/kernel/ |
| H A D | perf_callchain.c | 20 * next frame tail.
23 user_backtrace(struct frame_tail __user *tail, in user_backtrace() argument
31 if (!access_ok(tail, sizeof(buftail))) in user_backtrace()
35 err = __copy_from_user_inatomic(&buftail, tail, sizeof(buftail)); in user_backtrace()
49 if (tail >= buftail.fp) in user_backtrace()
71 compat_user_backtrace(struct compat_frame_tail __user *tail, in compat_user_backtrace() argument
78 if (!access_ok(tail, sizeof(buftail))) in compat_user_backtrace()
82 err = __copy_from_user_inatomic(&buftail, tail, sizeof(buftail)); in compat_user_backtrace()
94 if (tail + 1 >= (struct compat_frame_tail __user *) in compat_user_backtrace()
116 struct frame_tail __user *tail; in perf_callchain_user() local
126 struct compat_frame_tail __user *tail; perf_callchain_user() local
[all...] |
| /kernel/linux/linux-6.6/arch/arm64/kernel/ |
| H A D | perf_callchain.c | 20 * next frame tail.
23 user_backtrace(struct frame_tail __user *tail, in user_backtrace() argument
31 if (!access_ok(tail, sizeof(buftail))) in user_backtrace()
35 err = __copy_from_user_inatomic(&buftail, tail, sizeof(buftail)); in user_backtrace()
49 if (tail >= buftail.fp) in user_backtrace()
71 compat_user_backtrace(struct compat_frame_tail __user *tail, in compat_user_backtrace() argument
78 if (!access_ok(tail, sizeof(buftail))) in compat_user_backtrace()
82 err = __copy_from_user_inatomic(&buftail, tail, sizeof(buftail)); in compat_user_backtrace()
94 if (tail + 1 >= (struct compat_frame_tail __user *) in compat_user_backtrace()
114 struct frame_tail __user *tail; in perf_callchain_user() local
124 struct compat_frame_tail __user *tail; perf_callchain_user() local
[all...] |
| /kernel/linux/linux-5.10/drivers/rpmsg/ |
| H A D | qcom_glink_rpm.c | 50 void __iomem *tail; member
60 unsigned int tail; in glink_rpm_rx_avail() local
63 tail = readl(pipe->tail); in glink_rpm_rx_avail()
65 if (head < tail) in glink_rpm_rx_avail()
66 return pipe->native.length - tail + head; in glink_rpm_rx_avail()
68 return head - tail; in glink_rpm_rx_avail()
75 unsigned int tail; in glink_rpm_rx_peak() local
78 tail = readl(pipe->tail); in glink_rpm_rx_peak()
99 unsigned int tail; glink_rpm_rx_advance() local
114 unsigned int tail; glink_rpm_tx_avail() local
[all...] |
| H A D | qcom_glink_smem.c | 39 __le32 *tail; member
55 u32 tail; in glink_smem_rx_avail() local
71 tail = le32_to_cpu(*pipe->tail); in glink_smem_rx_avail()
73 if (head < tail) in glink_smem_rx_avail()
74 return pipe->native.length - tail + head; in glink_smem_rx_avail()
76 return head - tail; in glink_smem_rx_avail()
84 u32 tail; in glink_smem_rx_peak() local
86 tail = le32_to_cpu(*pipe->tail); in glink_smem_rx_peak()
103 u32 tail; glink_smem_rx_advance() local
118 u32 tail; glink_smem_tx_avail() local
[all...] |
| /kernel/linux/linux-5.10/drivers/infiniband/sw/rdmavt/ |
| H A D | cq.c | 76 u32 tail; in rvt_cq_enter() local
84 tail = RDMA_READ_UAPI_ATOMIC(u_wc->tail); in rvt_cq_enter()
89 tail = k_wc->tail; in rvt_cq_enter()
103 if (unlikely(next == tail || cq->cq_full)) { in rvt_cq_enter()
225 * Allocate the completion queue entries and head/tail pointers. in rvt_create_cq()
361 RDMA_READ_UAPI_ATOMIC(cq->queue->tail)) in rvt_req_notify_cq()
364 if (cq->kqueue->head != cq->kqueue->tail) in rvt_req_notify_cq()
383 u32 head, tail, in rvt_resize_cq() local
524 u32 tail; rvt_poll_cq() local
[all...] |
| /kernel/linux/linux-6.6/drivers/infiniband/sw/rdmavt/ |
| H A D | cq.c | 34 u32 tail; in rvt_cq_enter() local
42 tail = RDMA_READ_UAPI_ATOMIC(u_wc->tail); in rvt_cq_enter()
47 tail = k_wc->tail; in rvt_cq_enter()
61 if (unlikely(next == tail || cq->cq_full)) { in rvt_cq_enter()
183 * Allocate the completion queue entries and head/tail pointers. in rvt_create_cq()
319 RDMA_READ_UAPI_ATOMIC(cq->queue->tail)) in rvt_req_notify_cq()
322 if (cq->kqueue->head != cq->kqueue->tail) in rvt_req_notify_cq()
341 u32 head, tail, in rvt_resize_cq() local
482 u32 tail; rvt_poll_cq() local
[all...] |
| /kernel/linux/linux-5.10/include/linux/ |
| H A D | circ_buf.h | 12 int tail; member
16 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
19 as a completely full buffer has head == tail, which is the same as
21 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
24 accessing head and tail more than once, so they can change
26 #define CIRC_CNT_TO_END(head,tail,size) \
27 ({int end = (size) - (tail); \
32 #define CIRC_SPACE_TO_END(head,tail,siz
[all...] |
| /kernel/linux/linux-6.6/include/linux/ |
| H A D | circ_buf.h | 12 int tail; member
16 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
19 as a completely full buffer has head == tail, which is the same as
21 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
24 accessing head and tail more than once, so they can change
26 #define CIRC_CNT_TO_END(head,tail,size) \
27 ({int end = (size) - (tail); \
32 #define CIRC_SPACE_TO_END(head,tail,siz
[all...] |
| /foundation/communication/bluetooth_service/services/bluetooth/stack/platform/src/ |
| H A D | packet.c | 35 Payload *tail; member
75 packet->tail = PayloadNew(tailSize); in PacketMalloc()
78 if ((packet->head != NULL) && (packet->tail != NULL) && (packet->payload != NULL)) { in PacketMalloc()
82 packet->payload->next = packet->tail; in PacketMalloc()
83 packet->tail->prev = packet->payload; in PacketMalloc()
95 refPacket->tail = PayloadNewRef(pkt->tail->buf); in PacketRefMalloc()
97 if ((refPacket->head != NULL) && (refPacket->tail != NULL)) { in PacketRefMalloc()
101 while (srcPayload != pkt->tail) { in PacketRefMalloc()
111 refPayload->next = refPacket->tail; in PacketRefMalloc()
[all...] |
| /kernel/linux/linux-5.10/drivers/net/wireguard/ |
| H A D | queueing.c | 56 queue->head = queue->tail = STUB(queue); in wg_prev_queue_init()
82 struct sk_buff *tail = queue->tail, *next = smp_load_acquire(&NEXT(tail)); in wg_prev_queue_dequeue() local
84 if (tail == STUB(queue)) { in wg_prev_queue_dequeue()
87 queue->tail = next; in wg_prev_queue_dequeue()
88 tail = next; in wg_prev_queue_dequeue()
92 queue->tail = next; in wg_prev_queue_dequeue()
94 return tail; in wg_prev_queue_dequeue()
96 if (tail ! in wg_prev_queue_dequeue()
[all...] |
| /kernel/linux/linux-6.6/drivers/net/wireguard/ |
| H A D | queueing.c | 56 queue->head = queue->tail = STUB(queue); in wg_prev_queue_init()
82 struct sk_buff *tail = queue->tail, *next = smp_load_acquire(&NEXT(tail)); in wg_prev_queue_dequeue() local
84 if (tail == STUB(queue)) { in wg_prev_queue_dequeue()
87 queue->tail = next; in wg_prev_queue_dequeue()
88 tail = next; in wg_prev_queue_dequeue()
92 queue->tail = next; in wg_prev_queue_dequeue()
94 return tail; in wg_prev_queue_dequeue()
96 if (tail ! in wg_prev_queue_dequeue()
[all...] |
| /kernel/linux/linux-6.6/drivers/rpmsg/ |
| H A D | qcom_glink_rpm.c | 51 void __iomem *tail; member
73 unsigned int tail; in glink_rpm_rx_avail() local
76 tail = readl(pipe->tail); in glink_rpm_rx_avail()
78 if (head < tail) in glink_rpm_rx_avail()
79 return pipe->native.length - tail + head; in glink_rpm_rx_avail()
81 return head - tail; in glink_rpm_rx_avail()
88 unsigned int tail; in glink_rpm_rx_peek() local
91 tail = readl(pipe->tail); in glink_rpm_rx_peek()
112 unsigned int tail; glink_rpm_rx_advance() local
127 unsigned int tail; glink_rpm_tx_avail() local
[all...] |
| H A D | qcom_glink_smem.c | 53 __le32 *tail; member
70 u32 tail; in glink_smem_rx_avail() local
86 tail = le32_to_cpu(*pipe->tail); in glink_smem_rx_avail()
88 if (head < tail) in glink_smem_rx_avail()
89 return pipe->native.length - tail + head; in glink_smem_rx_avail()
91 return head - tail; in glink_smem_rx_avail()
99 u32 tail; in glink_smem_rx_peek() local
101 tail = le32_to_cpu(*pipe->tail); in glink_smem_rx_peek()
118 u32 tail; glink_smem_rx_advance() local
133 u32 tail; glink_smem_tx_avail() local
[all...] |
| /kernel/linux/linux-5.10/arch/arm/kernel/ |
| H A D | perf_callchain.c | 31 * next frame tail.
34 user_backtrace(struct frame_tail __user *tail, in user_backtrace() argument
40 if (!access_ok(tail, sizeof(buftail))) in user_backtrace()
44 err = __copy_from_user_inatomic(&buftail, tail, sizeof(buftail)); in user_backtrace()
56 if (tail + 1 >= buftail.fp) in user_backtrace()
66 struct frame_tail __user *tail; in perf_callchain_user() local
78 tail = (struct frame_tail __user *)regs->ARM_fp - 1; in perf_callchain_user()
81 tail && !((unsigned long)tail & 0x3)) in perf_callchain_user()
82 tail in perf_callchain_user()
[all...] |
| /kernel/linux/linux-6.6/arch/arm/kernel/ |
| H A D | perf_callchain.c | 31 * next frame tail.
34 user_backtrace(struct frame_tail __user *tail, in user_backtrace() argument
40 if (!access_ok(tail, sizeof(buftail))) in user_backtrace()
44 err = __copy_from_user_inatomic(&buftail, tail, sizeof(buftail)); in user_backtrace()
56 if (tail + 1 >= buftail.fp) in user_backtrace()
65 struct frame_tail __user *tail; in perf_callchain_user() local
72 tail = (struct frame_tail __user *)regs->ARM_fp - 1; in perf_callchain_user()
75 tail && !((unsigned long)tail & 0x3)) in perf_callchain_user()
76 tail in perf_callchain_user()
[all...] |
| /foundation/arkui/ace_engine/frameworks/core/pipeline/base/ |
| H A D | component.cpp | 59 auto tail = std::find_if(components.rbegin(), components.rend(), IsRenderComponent<Component>); in MergeRSNode() local
60 if (head == components.end() || tail == components.rend()) { in MergeRSNode()
64 (*tail)->isTailComponent_ = true; in MergeRSNode()
74 auto tail = std::find_if(components.rbegin(), components.rend(), IsRenderComponent<SingleChild>); in MergeRSNode() local
75 if (head == components.end() || tail == components.rend()) { in MergeRSNode()
79 AceType::DynamicCast<Component>(*tail)->isTailComponent_ = true; in MergeRSNode()
85 auto tail = std::find_if(components.rbegin(), components.rend(), IsRenderComponent<SingleChild>); in MergeRSNode() local
86 if (components.empty() || head == components.end() || tail == components.rend()) { in MergeRSNode()
94 AceType::DynamicCast<Component>(*tail)->isTailComponent_ = true; in MergeRSNode()
98 void Component::MergeRSNode(const RefPtr<Component>& head, const RefPtr<Component>& tail) in MergeRSNode() argument
[all...] |
| /kernel/linux/linux-5.10/drivers/gpu/drm/i915/gt/ |
| H A D | intel_ring.h | 27 void intel_ring_reset(struct intel_ring *ring, u32 tail);
90 assert_ring_tail_valid(const struct intel_ring *ring, unsigned int tail) in assert_ring_tail_valid() argument
94 GEM_BUG_ON(!intel_ring_offset_valid(ring, tail)); in assert_ring_tail_valid()
111 GEM_BUG_ON(cacheline(tail) == cacheline(head) && tail < head); in assert_ring_tail_valid()
116 intel_ring_set_tail(struct intel_ring *ring, unsigned int tail)
118 /* Whilst writes to the tail are strictly order, there is no
119 * serialisation between readers and the writers. The tail may be
124 assert_ring_tail_valid(ring, tail);
125 ring->tail
130 __intel_ring_space(unsigned int head, unsigned int tail, unsigned int size) __intel_ring_space() argument
[all...] |
| /kernel/linux/linux-6.6/drivers/gpu/drm/i915/gt/ |
| H A D | intel_ring.h | 26 void intel_ring_reset(struct intel_ring *ring, u32 tail);
91 assert_ring_tail_valid(const struct intel_ring *ring, unsigned int tail) in assert_ring_tail_valid() argument
95 GEM_BUG_ON(!intel_ring_offset_valid(ring, tail)); in assert_ring_tail_valid()
112 GEM_BUG_ON(cacheline(tail) == cacheline(head) && tail < head); in assert_ring_tail_valid()
117 intel_ring_set_tail(struct intel_ring *ring, unsigned int tail)
119 /* Whilst writes to the tail are strictly order, there is no
120 * serialisation between readers and the writers. The tail may be
125 assert_ring_tail_valid(ring, tail);
126 ring->tail
131 __intel_ring_space(unsigned int head, unsigned int tail, unsigned int size) __intel_ring_space() argument
[all...] |
| /kernel/linux/linux-5.10/kernel/locking/ |
| H A D | qspinlock.c | 44 * In particular; where the traditional MCS lock consists of a tail pointer
46 * unlock the next pending (next->locked), we compress both these: {tail,
52 * we can encode the tail by combining the 2-bit nesting level with the cpu
53 * number. With one byte for the lock value and 3 bytes for the tail, only a
111 * We must be able to distinguish between no-tail and the tail at 0:0,
117 u32 tail; in encode_tail() local
119 tail = (cpu + 1) << _Q_TAIL_CPU_OFFSET; in encode_tail()
120 tail |= idx << _Q_TAIL_IDX_OFFSET; /* assume < 4 */ in encode_tail()
122 return tail; in encode_tail()
125 decode_tail(u32 tail) decode_tail() argument
176 xchg_tail(struct qspinlock *lock, u32 tail) xchg_tail() argument
220 xchg_tail(struct qspinlock *lock, u32 tail) xchg_tail() argument
318 u32 old, tail; queued_spin_lock_slowpath() local
[all...] |
| /kernel/linux/linux-6.6/kernel/locking/ |
| H A D | qspinlock.c | 45 * In particular; where the traditional MCS lock consists of a tail pointer
47 * unlock the next pending (next->locked), we compress both these: {tail,
53 * we can encode the tail by combining the 2-bit nesting level with the cpu
54 * number. With one byte for the lock value and 3 bytes for the tail, only a
112 * We must be able to distinguish between no-tail and the tail at 0:0,
118 u32 tail; in encode_tail() local
120 tail = (cpu + 1) << _Q_TAIL_CPU_OFFSET; in encode_tail()
121 tail |= idx << _Q_TAIL_IDX_OFFSET; /* assume < 4 */ in encode_tail()
123 return tail; in encode_tail()
126 decode_tail(u32 tail) decode_tail() argument
177 xchg_tail(struct qspinlock *lock, u32 tail) xchg_tail() argument
221 xchg_tail(struct qspinlock *lock, u32 tail) xchg_tail() argument
319 u32 old, tail; queued_spin_lock_slowpath() local
[all...] |