| /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...] |
| /third_party/libwebsockets/lib/misc/ |
| H A D | lws-ring.c | 100 lws_ring_get_count_waiting_elements(struct lws_ring *ring, uint32_t *tail) in lws_ring_get_count_waiting_elements() argument
103 if (!tail) in lws_ring_get_count_waiting_elements()
104 tail = &ring->oldest_tail; in lws_ring_get_count_waiting_elements()
114 if (ring->head == *tail) in lws_ring_get_count_waiting_elements()
117 if (ring->head > *tail) in lws_ring_get_count_waiting_elements()
118 f = (int)(ring->head - *tail); in lws_ring_get_count_waiting_elements()
120 f = (int)((ring->buflen - *tail) + ring->head); in lws_ring_get_count_waiting_elements()
199 lws_ring_consume(struct lws_ring *ring, uint32_t *tail, void *dest, in lws_ring_consume() argument
203 void *orig_tail = tail; in lws_ring_consume()
207 if (!tail) { in lws_ring_consume()
255 lws_ring_get_element(struct lws_ring *ring, uint32_t *tail) lws_ring_get_element() argument
267 lws_ring_update_oldest_tail(struct lws_ring *ring, uint32_t tail) lws_ring_update_oldest_tail() argument
288 lws_ring_dump(struct lws_ring *ring, uint32_t *tail) lws_ring_dump() argument
[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...] |
| /third_party/musl/src/exit/linux/ |
| H A D | atexit.c | 30 static struct node *tail; // point to the last node, or NULL variable
55 // link new nodes after tail in grow()
56 if (tail) { in grow()
57 tail->next = nodes; in grow()
66 if (tail == NULL) { in append_node()
69 new_tail = tail->next; in append_node()
77 new_tail->prev = tail; in append_node()
78 tail = new_tail; in append_node()
85 if (tail == node) { in remove_node()
87 tail in remove_node()
[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...] |
| /third_party/musl/porting/linux/user/src/exit/ |
| H A D | atexit.c | 30 static struct node *tail; // point to the last node, or NULL variable
55 // link new nodes after tail in grow()
56 if (tail) { in grow()
57 tail->next = nodes; in grow()
67 if (tail == NULL) { in append_node()
70 new_tail = tail->next; in append_node()
78 new_tail->prev = tail; in append_node()
79 tail = new_tail; in append_node()
87 if (tail == node) { in RemoveNode()
89 tail in RemoveNode()
[all...] |
| /third_party/node/deps/npm/node_modules/yallist/ |
| H A D | yallist.js | 13 self.tail = null
49 if (node === this.tail) {
50 this.tail = prev
78 if (!this.tail) {
79 this.tail = node
85 if (node === this.tail) {
93 var tail = this.tail
95 node.prev = tail
96 if (tail) {
[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...] |
| /third_party/node/lib/internal/streams/ |
| H A D | compose.js | 99 const tail = pipeline(streams, onfinished);
107 isReadable(tail) ||
108 isReadableStream(tail) ||
109 isTransformStream(tail)
118 readableObjectMode: !!tail?.readableObjectMode,
170 const toRead = isTransformStream(tail) ? tail.readable : tail;
182 if (isNodeStream(tail)) {
183 tail
[all...] |
| /third_party/skia/experimental/sktext/src/ |
| H A D | Line.h | 32 void merge(TextMetrics tail) { in merge() argument
33 this->fAscent = std::min(this->fAscent, tail.fAscent); in merge()
34 this->fDescent = std::max(this->fDescent, tail.fDescent); in merge()
35 this->fLeading = std::max(this->fLeading, tail.fLeading); in merge()
121 void moveTo(Stretch& tail) { in moveTo() argument
123 if (tail.isEmpty()) { in moveTo()
128 if (!tail.isEmpty()) { in moveTo()
129 this->fGlyphStart = tail.fGlyphStart; in moveTo()
130 this->fGlyphEnd = tail.fGlyphEnd; in moveTo()
131 this->fWidth = tail in moveTo()
[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...] |
| /third_party/rust/crates/regex/regex-syntax/src/hir/ |
| H A D | visitor.rs | 86 tail: &'a [Hir],
94 tail: &'a [Hir],
155 Some(Frame::Concat { head: &x[0], tail: &x[1..] }) in induct()
159 Some(Frame::Alternation { head: &x[0], tail: &x[1..] }) in induct()
171 Frame::Concat { tail, .. } => { in pop()
172 if tail.is_empty() { in pop()
175 Some(Frame::Concat { head: &tail[0], tail: &tail[1..] }) in pop()
178 Frame::Alternation { tail, in pop()
[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/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...] |
| /third_party/ltp/testcases/kernel/syscalls/io_uring/ |
| H A D | io_uring01.c | 37 unsigned int *tail; member
46 unsigned int *tail; member
96 sring->tail = sptr + p.sq_off.tail; in setup_io_uring_test()
119 cring->tail = cptr + p.cq_off.tail; in setup_io_uring_test()
148 for (head = *cring->head; head != *cring->tail; head++) { in drain_uring_cq()
180 unsigned int index = 0, tail = 0, next_tail = 0; in submit_to_uring_sq() local
198 /* Submission queue entry addition to SQE ring buffer tail */ in submit_to_uring_sq()
199 tail in submit_to_uring_sq()
[all...] |