Home
last modified time | relevance | path

Searched refs:head (Results 451 - 475 of 5965) sorted by relevance

1...<<11121314151617181920>>...239

/kernel/linux/linux-6.6/sound/soc/sof/
H A Dipc3-loader.c114 const struct sof_ext_man_header *head; in ipc3_fw_ext_man_size() local
116 head = (struct sof_ext_man_header *)fw->data; in ipc3_fw_ext_man_size()
120 * it prevents from reading unallocated memory from `head` in following in ipc3_fw_ext_man_size()
123 if (fw->size < sizeof(*head)) in ipc3_fw_ext_man_size()
130 if (head->magic == SOF_EXT_MAN_MAGIC_NUMBER) in ipc3_fw_ext_man_size()
131 return head->full_size; in ipc3_fw_ext_man_size()
135 head->magic); in ipc3_fw_ext_man_size()
143 const struct sof_ext_man_header *head; in sof_ipc3_fw_parse_ext_man() local
149 head = (struct sof_ext_man_header *)fw->data; in sof_ipc3_fw_parse_ext_man()
150 remaining = head in sof_ipc3_fw_parse_ext_man()
[all...]
/third_party/skia/third_party/externals/dawn/src/common/
H A DSlabAllocator.cpp33 SlabAllocatorImpl::Slab::Slab(char allocation[], IndexLinkNode* head) in Slab() argument
34 : allocation(allocation), freeList(head), prev(nullptr), next(nullptr), blocksInUse(0) { in Slab()
117 IndexLinkNode* head = slab->freeList; in PushFront() local
118 if (head == nullptr) { in PushFront()
121 ASSERT(IsNodeInSlab(slab, head)); in PushFront()
122 node->nextIndex = head->index; in PushFront()
133 IndexLinkNode* head = slab->freeList; in PopFront() local
134 if (head->nextIndex == kInvalidIndex) { in PopFront()
137 ASSERT(IsNodeInSlab(slab, head)); in PopFront()
138 slab->freeList = OffsetFrom(head, hea in PopFront()
[all...]
/kernel/linux/linux-6.6/io_uring/
H A Dpoll.c172 poll->head = NULL; in io_init_poll_iocb()
182 struct wait_queue_head *head = smp_load_acquire(&poll->head); in io_poll_remove_entry() local
184 if (head) { in io_poll_remove_entry()
185 spin_lock_irq(&head->lock); in io_poll_remove_entry()
187 poll->head = NULL; in io_poll_remove_entry()
188 spin_unlock_irq(&head->lock); in io_poll_remove_entry()
415 * as req->head is NULL'ed out, the request can be in io_pollfree_wake()
419 smp_store_release(&poll->head, NULL); in io_pollfree_wake()
449 poll->head in io_poll_wake()
463 struct wait_queue_head *head; io_poll_double_prepare() local
486 __io_queue_proc(struct io_poll *poll, struct io_poll_table *pt, struct wait_queue_head *head, struct io_poll **poll_ptr) __io_queue_proc() argument
542 io_poll_queue_proc(struct file *file, struct wait_queue_head *head, struct poll_table_struct *p) io_poll_queue_proc() argument
653 io_async_queue_proc(struct file *file, struct wait_queue_head *head, struct poll_table_struct *p) io_async_queue_proc() argument
[all...]
/kernel/linux/linux-5.10/fs/
H A Dsplice.c187 unsigned int head = pipe->head; in splice_to_pipe() local
200 while (!pipe_full(head, tail, pipe->max_usage)) { in splice_to_pipe()
201 struct pipe_buffer *buf = &pipe->bufs[head & mask]; in splice_to_pipe()
210 head++; in splice_to_pipe()
211 pipe->head = head; in splice_to_pipe()
232 unsigned int head = pipe->head; in add_to_pipe() local
240 } else if (pipe_full(head, tai in add_to_pipe()
399 unsigned int head = pipe->head; splice_from_pipe_feed() local
640 unsigned int head, tail, mask; iter_file_splice_write() local
[all...]
/third_party/libwebsockets/win32port/zlib/
H A Dinflate.c117 state->head = Z_NULL;
639 if (state->head != Z_NULL)
640 state->head->done = -1;
684 if (state->head != Z_NULL)
685 state->head->text = (int)((hold >> 8) & 1);
691 if (state->head != Z_NULL)
692 state->head->time = hold;
698 if (state->head != Z_NULL) {
699 state->head->xflags = (int)(hold & 0xff);
700 state->head
[all...]
/third_party/skia/src/gpu/ops/
H A DOpsTask.cpp106 auto head = op; in removeOp() local
107 while (head->prevInChain()) { head = head->prevInChain(); } in removeOp()
108 SkASSERT(head == fHead.get()); in removeOp()
165 fBounds = fList.head()->bounds(); in fAppliedClip()
172 for (const auto& op : GrOp::ChainRange<>(fList.head())) { in visitProxies()
195 // We process ops in chain b from head to tail. We attempt to merge with nodes in a, starting in DoConcat()
196 // at chain a's tail and working toward the head. We produce one of the following outcomes: in DoConcat()
197 // 1) b's head i in DoConcat()
[all...]
/kernel/linux/linux-5.10/drivers/char/agp/
H A Disoch.c23 static void agp_3_5_dev_list_insert(struct list_head *head, struct list_head *new) in agp_3_5_dev_list_insert() argument
28 list_for_each(pos, head) { in agp_3_5_dev_list_insert()
40 struct list_head *pos, *tmp, *head = &list->list, *start = head->next; in agp_3_5_dev_list_sort() local
43 INIT_LIST_HEAD(head); in agp_3_5_dev_list_sort()
45 for (pos=start; pos!=head; ) { in agp_3_5_dev_list_sort()
54 agp_3_5_dev_list_insert(head, tmp); in agp_3_5_dev_list_sort()
81 struct list_head *head = &dev_list->list, *pos; in agp_3_5_isochronous_node_enable() local
136 list_for_each(pos, head) { in agp_3_5_isochronous_node_enable()
287 struct list_head *head in agp_3_5_nonisochronous_node_enable() local
322 struct list_head *head, *pos; agp_3_5_enable() local
[all...]
/kernel/linux/linux-5.10/net/sunrpc/
H A Dxprtmultipath.c205 struct rpc_xprt *xprt_switch_find_first_entry(struct list_head *head) in xprt_switch_find_first_entry() argument
209 list_for_each_entry_rcu(pos, head, xprt_switch) { in xprt_switch_find_first_entry()
227 struct rpc_xprt *xprt_switch_find_current_entry(struct list_head *head, in xprt_switch_find_current_entry() argument
233 list_for_each_entry_rcu(pos, head, xprt_switch) { in xprt_switch_find_current_entry()
246 struct list_head *head; in xprt_iter_current_entry() local
250 head = &xps->xps_xprt_list; in xprt_iter_current_entry()
252 return xprt_switch_find_first_entry(head); in xprt_iter_current_entry()
253 return xprt_switch_find_current_entry(head, xpi->xpi_cursor); in xprt_iter_current_entry()
260 struct list_head *head; in __rpc_xprt_switch_has_addr() local
266 head in __rpc_xprt_switch_has_addr()
290 xprt_switch_find_next_entry(struct list_head *head, const struct rpc_xprt *cur) xprt_switch_find_next_entry() argument
331 __xprt_switch_find_next_entry_roundrobin(struct list_head *head, const struct rpc_xprt *cur) __xprt_switch_find_next_entry_roundrobin() argument
346 struct list_head *head = &xps->xps_xprt_list; xprt_switch_find_next_entry_roundrobin() local
[all...]
/kernel/linux/linux-6.6/drivers/char/agp/
H A Disoch.c23 static void agp_3_5_dev_list_insert(struct list_head *head, struct list_head *new) in agp_3_5_dev_list_insert() argument
28 list_for_each(pos, head) { in agp_3_5_dev_list_insert()
40 struct list_head *pos, *tmp, *head = &list->list, *start = head->next; in agp_3_5_dev_list_sort() local
43 INIT_LIST_HEAD(head); in agp_3_5_dev_list_sort()
45 for (pos=start; pos!=head; ) { in agp_3_5_dev_list_sort()
54 agp_3_5_dev_list_insert(head, tmp); in agp_3_5_dev_list_sort()
81 struct list_head *head = &dev_list->list, *pos; in agp_3_5_isochronous_node_enable() local
136 list_for_each(pos, head) { in agp_3_5_isochronous_node_enable()
287 struct list_head *head in agp_3_5_nonisochronous_node_enable() local
322 struct list_head *head, *pos; agp_3_5_enable() local
[all...]
/kernel/linux/linux-6.6/kernel/
H A Dsoftirq.c707 struct tasklet_struct *head; member
718 struct tasklet_head *head; in __tasklet_schedule_common() local
722 head = this_cpu_ptr(headp); in __tasklet_schedule_common()
724 *head->tail = t; in __tasklet_schedule_common()
725 head->tail = &(t->next); in __tasklet_schedule_common()
765 list = tl_head->head; in tasklet_action_common()
766 tl_head->head = NULL; in tasklet_action_common()
767 tl_head->tail = &tl_head->head; in tasklet_action_common()
899 &per_cpu(tasklet_vec, cpu).head; in softirq_init()
901 &per_cpu(tasklet_hi_vec, cpu).head; in softirq_init()
[all...]
/third_party/nghttp2/lib/
H A Dnghttp2_buf.c145 bufs->head = chain; in nghttp2_bufs_init3()
146 bufs->cur = bufs->head; in nghttp2_bufs_init3()
173 bufs->head = chain; in nghttp2_bufs_realloc()
174 bufs->cur = bufs->head; in nghttp2_bufs_realloc()
191 for (chain = bufs->head; chain;) { in nghttp2_bufs_free()
199 bufs->head = NULL; in nghttp2_bufs_free()
218 bufs->head = chain; in nghttp2_bufs_wrap_init()
219 bufs->cur = bufs->head; in nghttp2_bufs_wrap_init()
257 bufs->head = head_chain; in nghttp2_bufs_wrap_init2()
258 bufs->cur = bufs->head; in nghttp2_bufs_wrap_init2()
[all...]
/third_party/node/deps/nghttp2/lib/
H A Dnghttp2_buf.c145 bufs->head = chain; in nghttp2_bufs_init3()
146 bufs->cur = bufs->head; in nghttp2_bufs_init3()
173 bufs->head = chain; in nghttp2_bufs_realloc()
174 bufs->cur = bufs->head; in nghttp2_bufs_realloc()
191 for (chain = bufs->head; chain;) { in nghttp2_bufs_free()
199 bufs->head = NULL; in nghttp2_bufs_free()
218 bufs->head = chain; in nghttp2_bufs_wrap_init()
219 bufs->cur = bufs->head; in nghttp2_bufs_wrap_init()
257 bufs->head = head_chain; in nghttp2_bufs_wrap_init2()
258 bufs->cur = bufs->head; in nghttp2_bufs_wrap_init2()
[all...]
/third_party/skia/third_party/externals/dawn/src/tests/unittests/
H A DLinkedListTests.cpp58 // Checks that when iterating |list| (either from head to tail, or from
59 // tail to head, as determined by |forward|), we get back |node_ids|,
66 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); node != list.end(); in ExpectListContentsForDirection()
78 SCOPED_TRACE("Iterating forward (from head to tail)"); in ExpectListContents()
82 SCOPED_TRACE("Iterating backward (from tail to head)"); in ExpectListContents()
89 EXPECT_EQ(list.end(), list.head()); in TEST()
101 EXPECT_EQ(&n1, list.head()); in TEST()
111 EXPECT_EQ(&n1, list.head()); in TEST()
121 EXPECT_EQ(&n1, list.head()); in TEST()
144 EXPECT_EQ(&n1, list.head()); in TEST()
[all...]
/kernel/linux/linux-6.6/include/linux/
H A Ddma-fence-array.h68 * @head: potential dma_fence_array object
75 #define dma_fence_array_for_each(fence, index, head) \
76 for (index = 0, fence = dma_fence_array_first(head); fence; \
77 ++(index), fence = dma_fence_array_next(head, index))
86 struct dma_fence *dma_fence_array_first(struct dma_fence *head);
87 struct dma_fence *dma_fence_array_next(struct dma_fence *head,
/kernel/linux/linux-6.6/tools/testing/selftests/arm64/signal/testcases/
H A Dsme_vl.c33 struct _aarch64_ctx *head = GET_SF_RESV_HEAD(sf); in sme_vl() local
41 head = get_header(head, ZA_MAGIC, resv_sz, &offset); in sme_vl()
42 if (!head) { in sme_vl()
46 za = (struct za_context *)head; in sme_vl()
H A Dsve_vl.c33 struct _aarch64_ctx *head = GET_SF_RESV_HEAD(sf); in sve_vl() local
41 head = get_header(head, SVE_MAGIC, resv_sz, &offset); in sve_vl()
42 if (!head) { in sve_vl()
46 sve = (struct sve_context *)head; in sve_vl()
/third_party/benchmark/src/
H A Dbenchmark_name.cc25 size_t size_impl(const Head& head, const Tail&... tail) { in size_impl() argument
26 return head.size() + size_impl(tail...); in size_impl()
34 void join_impl(std::string& s, const char delimiter, const Head& head, in join_impl() argument
36 if (!s.empty() && !head.empty()) { in join_impl()
40 s += head; in join_impl()
/kernel/linux/linux-5.10/drivers/net/ethernet/apm/xgene-v2/
H A Dmain.c246 u8 head; in xge_txc_poll() local
249 head = tx_ring->head; in xge_txc_poll()
256 raw_desc = &tx_ring->raw_desc[head]; in xge_txc_poll()
263 skb = tx_ring->pkt_info[head].skb; in xge_txc_poll()
264 dma_addr = tx_ring->pkt_info[head].dma_addr; in xge_txc_poll()
265 pkt_buf = tx_ring->pkt_info[head].pkt_buf; in xge_txc_poll()
276 head = (head + 1) & (XGENE_ENET_NUM_DESC - 1); in xge_txc_poll()
282 tx_ring->head in xge_txc_poll()
294 u8 head, rx_error; xge_rx_poll() local
[all...]
/kernel/linux/linux-6.6/drivers/net/ethernet/apm/xgene-v2/
H A Dmain.c246 u8 head; in xge_txc_poll() local
249 head = tx_ring->head; in xge_txc_poll()
256 raw_desc = &tx_ring->raw_desc[head]; in xge_txc_poll()
263 skb = tx_ring->pkt_info[head].skb; in xge_txc_poll()
264 dma_addr = tx_ring->pkt_info[head].dma_addr; in xge_txc_poll()
265 pkt_buf = tx_ring->pkt_info[head].pkt_buf; in xge_txc_poll()
276 head = (head + 1) & (XGENE_ENET_NUM_DESC - 1); in xge_txc_poll()
282 tx_ring->head in xge_txc_poll()
294 u8 head, rx_error; xge_rx_poll() local
[all...]
/kernel/linux/linux-5.10/drivers/net/ethernet/amazon/ena/
H A Dena_eth_com.h11 /* head update threshold in units of (queue size / ENA_COMP_HEAD_THRESH) */
170 u16 unreported_comp, head; in ena_com_update_dev_comp_head() local
174 head = io_cq->head; in ena_com_update_dev_comp_head()
175 unreported_comp = head - io_cq->last_head_update; in ena_com_update_dev_comp_head()
179 pr_debug("Write completion queue doorbell for queue %d: head: %d\n", in ena_com_update_dev_comp_head()
180 io_cq->qid, head); in ena_com_update_dev_comp_head()
181 writel(head, io_cq->cq_head_db_reg); in ena_com_update_dev_comp_head()
182 io_cq->last_head_update = head; in ena_com_update_dev_comp_head()
210 io_cq->head in ena_com_cq_inc_head()
[all...]
/kernel/linux/linux-6.6/drivers/net/ethernet/amazon/ena/
H A Dena_eth_com.h11 /* head update threshold in units of (queue size / ENA_COMP_HEAD_THRESH) */
177 u16 unreported_comp, head; in ena_com_update_dev_comp_head() local
181 head = io_cq->head; in ena_com_update_dev_comp_head()
182 unreported_comp = head - io_cq->last_head_update; in ena_com_update_dev_comp_head()
187 "Write completion queue doorbell for queue %d: head: %d\n", in ena_com_update_dev_comp_head()
188 io_cq->qid, head); in ena_com_update_dev_comp_head() local
189 writel(head, io_cq->cq_head_db_reg); in ena_com_update_dev_comp_head()
190 io_cq->last_head_update = head; in ena_com_update_dev_comp_head()
218 io_cq->head in ena_com_cq_inc_head()
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/nouveau/nvkm/engine/fifo/
H A Drunl.h31 struct list_head head; member
92 struct list_head head; member
114 #define nvkm_runl_find_engn(engn,runl,cond) nvkm_list_find(engn, &(runl)->engns, head, (cond))
116 #define nvkm_runl_first(fifo) list_first_entry(&(fifo)->runls, struct nvkm_runl, head)
117 #define nvkm_runl_foreach(runl,fifo) list_for_each_entry((runl), &(fifo)->runls, head)
118 #define nvkm_runl_foreach_cond(runl,fifo,cond) nvkm_list_foreach(runl, &(fifo)->runls, head, (cond))
119 #define nvkm_runl_foreach_engn(engn,runl) list_for_each_entry((engn), &(runl)->engns, head)
121 nvkm_list_foreach(engn, &(runl)->engns, head, (cond))
122 #define nvkm_runl_foreach_cgrp(cgrp,runl) list_for_each_entry((cgrp), &(runl)->cgrps, head)
124 list_for_each_entry_safe((cgrp), (gtmp), &(runl)->cgrps, head)
[all...]
/kernel/linux/linux-6.6/tools/perf/util/intel-pt-decoder/
H A Dintel-pt-log.c30 size_t head; member
105 size_t space = b->buf_sz - b->head; in log_buf__write()
108 memcpy(b->buf + b->head, buf, n); in log_buf__write()
111 b->head += n; in log_buf__write()
112 if (sz && b->head >= b->buf_sz) { in log_buf__write()
113 b->head = 0; in log_buf__write()
172 fflush(f); /* Could update b->head and b->wrapped */ in log_buf__dump()
176 write_lines(b->buf + b->head, b->buf_sz - b->head, b->backend, &remove_first); in log_buf__dump()
178 write_lines(b->buf, b->head, in log_buf__dump()
[all...]
/kernel/linux/linux-5.10/drivers/pci/hotplug/
H A Dcpqphp_ctrl.c296 * @head: list to sort
298 static int sort_by_size(struct pci_resource **head) in sort_by_size() argument
304 if (!(*head)) in sort_by_size()
307 if (!((*head)->next)) in sort_by_size()
313 /* Special case for swapping list head */ in sort_by_size()
314 if (((*head)->next) && in sort_by_size()
315 ((*head)->length > (*head)->next->length)) { in sort_by_size()
317 current_res = *head; in sort_by_size()
318 *head in sort_by_size()
346 sort_by_max_size(struct pci_resource **head) sort_by_max_size() argument
396 do_pre_bridge_resource_split(struct pci_resource **head, struct pci_resource **orig_head, u32 alignment) do_pre_bridge_resource_split() argument
473 do_bridge_resource_split(struct pci_resource **head, u32 alignment) do_bridge_resource_split() argument
526 get_io_resource(struct pci_resource **head, u32 size) get_io_resource() argument
623 get_max_resource(struct pci_resource **head, u32 size) get_max_resource() argument
720 get_resource(struct pci_resource **head, u32 size) get_resource() argument
813 cpqhp_resource_sort_and_combine(struct pci_resource **head) cpqhp_resource_sort_and_combine() argument
[all...]
/kernel/linux/linux-6.6/drivers/pci/hotplug/
H A Dcpqphp_ctrl.c296 * @head: list to sort
298 static int sort_by_size(struct pci_resource **head) in sort_by_size() argument
304 if (!(*head)) in sort_by_size()
307 if (!((*head)->next)) in sort_by_size()
313 /* Special case for swapping list head */ in sort_by_size()
314 if (((*head)->next) && in sort_by_size()
315 ((*head)->length > (*head)->next->length)) { in sort_by_size()
317 current_res = *head; in sort_by_size()
318 *head in sort_by_size()
346 sort_by_max_size(struct pci_resource **head) sort_by_max_size() argument
396 do_pre_bridge_resource_split(struct pci_resource **head, struct pci_resource **orig_head, u32 alignment) do_pre_bridge_resource_split() argument
473 do_bridge_resource_split(struct pci_resource **head, u32 alignment) do_bridge_resource_split() argument
526 get_io_resource(struct pci_resource **head, u32 size) get_io_resource() argument
623 get_max_resource(struct pci_resource **head, u32 size) get_max_resource() argument
720 get_resource(struct pci_resource **head, u32 size) get_resource() argument
813 cpqhp_resource_sort_and_combine(struct pci_resource **head) cpqhp_resource_sort_and_combine() argument
[all...]

Completed in 17 milliseconds

1...<<11121314151617181920>>...239