Searched refs:head (Results 76 - 100 of 2525) sorted by relevance

1234567891011>>

/linux-master/drivers/staging/media/atomisp/pci/hive_isp_css_common/host/
H A Ddebug.c40 debug_data.head = 0;
48 u32 head = 0; local
55 &head, sizeof(uint32_t));
62 debug_data.head = 0;
/linux-master/include/linux/
H A Dlist_sort.h13 void list_sort(void *priv, struct list_head *head, list_cmp_func_t cmp);
H A Drculist.h35 * list_tail_rcu - returns the prev pointer of the head of the list
36 * @head: the head of the list
42 #define list_tail_rcu(head) (*((struct list_head __rcu **)(&(head)->prev)))
91 * @head: list head to add it after
93 * Insert a new entry after the specified head.
104 static inline void list_add_rcu(struct list_head *new, struct list_head *head) argument
106 __list_add_rcu(new, head, hea
125 list_add_tail_rcu(struct list_head *new, struct list_head *head) argument
274 list_splice_init_rcu(struct list_head *list, struct list_head *head, void (*sync)(void)) argument
289 list_splice_tail_init_rcu(struct list_head *list, struct list_head *head, void (*sync)(void)) argument
[all...]
/linux-master/tools/include/linux/
H A Dlist_sort.h13 void list_sort(void *priv, struct list_head *head, list_cmp_func_t cmp);
H A Dring_buffer.h61 u64 head = READ_ONCE(base->data_head);
64 return head;
/linux-master/scripts/kconfig/
H A Dmnconf-common.h8 struct list_head *head; member in struct:search_data
/linux-master/tools/testing/selftests/bpf/
H A Dbpf_arena_htab.h9 struct arena_list_head head; member in struct:htab_bucket
29 return &__select_bucket(htab, hash)->head;
40 static hashtab_elem_t *lookup_elem_raw(arena_list_head_t *head, __u32 hash, int key) argument
44 list_for_each_entry(l, head, hash_node)
59 arena_list_head_t *head; local
62 head = select_bucket(htab, key);
63 l_old = lookup_elem_raw(head, htab_hash(key), key);
72 arena_list_head_t *head; local
75 head = select_bucket(htab, key);
76 l_old = lookup_elem_raw(head, htab_has
[all...]
/linux-master/drivers/tty/
H A Dtty_buffer.c73 bool restart = buf->head->commit != buf->head->read;
128 while ((p = buf->head) != NULL) {
129 buf->head = p->next;
139 buf->head = &buf->sentinel;
233 while ((next = smp_load_acquire(&buf->head->next)) != NULL) {
234 tty_buffer_free(port, buf->head);
235 buf->head = next;
237 buf->head->read = buf->head
397 lookahead_bufs(struct tty_port *port, struct tty_buffer *head) argument
436 receive_buf(struct tty_port *port, struct tty_buffer *head, size_t count) argument
470 struct tty_buffer *head = buf->head; local
[all...]
/linux-master/arch/powerpc/include/asm/
H A Dhvcserver.h38 extern int hvcs_free_partner_info(struct list_head *head);
40 struct list_head *head, unsigned long *pi_buff);
/linux-master/tools/testing/selftests/arm64/signal/testcases/
H A Dza_no_regs.c56 struct _aarch64_ctx *head = GET_BUF_RESV_HEAD(context); local
73 head = get_header(head, ZA_MAGIC, GET_BUF_RESV_SIZE(context), &offset);
74 if (!head) {
79 za = (struct za_context *)head;
85 if (head->size != ZA_SIG_REGS_OFFSET) {
87 head->size, ZA_SIG_REGS_OFFSET);
93 head->size, za->vl);
H A Dza_regs.c68 struct _aarch64_ctx *head = GET_BUF_RESV_HEAD(context); local
86 head = get_header(head, ZA_MAGIC, GET_BUF_RESV_SIZE(context), &offset);
87 if (!head) {
92 za = (struct za_context *)head;
98 if (head->size != ZA_SIG_CONTEXT_SIZE(sve_vq_from_vl(vl))) {
100 head->size, ZA_SIG_CONTEXT_SIZE(sve_vq_from_vl(vl)));
105 head->size, za->vl);
H A Dfake_sigreturn_sve_change_vl.c55 struct _aarch64_ctx *head = GET_SF_RESV_HEAD(sf); local
63 head = get_header(head, SVE_MAGIC, resv_sz, &offset);
64 if (!head) {
69 if (head->size != sizeof(struct sve_context)) {
74 sve = (struct sve_context *)head;
H A Dfake_sigreturn_sme_change_vl.c53 struct _aarch64_ctx *head = GET_SF_RESV_HEAD(sf); local
61 head = get_header(head, SVE_MAGIC, resv_sz, &offset);
62 if (!head) {
67 if (head->size != sizeof(struct sve_context)) {
72 sve = (struct sve_context *)head;
H A Dzt_regs.c30 struct _aarch64_ctx *head = GET_BUF_RESV_HEAD(context); local
42 head = get_header(head, ZT_MAGIC, GET_BUF_RESV_SIZE(context), &offset);
43 if (!head) {
48 zt = (struct zt_context *)head;
55 head->size, zt->nregs);
/linux-master/drivers/gpu/drm/nouveau/nvkm/engine/fifo/
H A Drunq.c28 list_del(&runq->head);
43 list_add_tail(&runq->head, &fifo->runqs);
/linux-master/net/ipv4/
H A Dinet_fragment.c35 * - the head of a "run" has the sum of all fragment lengths in frag_run_len.
256 static void inet_frag_destroy_rcu(struct rcu_head *head) argument
258 struct inet_frag_queue *q = container_of(head, struct inet_frag_queue,
453 struct sk_buff *fp, *head = skb_rb_first(&q->rb_fragments); local
470 if (head != skb) {
473 head = skb;
490 skb_morph(skb, head);
491 FRAG_CB(skb)->next_frag = FRAG_CB(head)->next_frag;
492 rb_replace_node(&head->rbnode, &skb->rbnode,
494 consume_skb(head);
555 inet_frag_reasm_finish(struct inet_frag_queue *q, struct sk_buff *head, void *reasm_data, bool try_coalesce) argument
631 struct sk_buff *head, *skb; local
[all...]
/linux-master/drivers/usb/core/
H A Dphy.c143 struct list_head *head; local
149 head = &phy_roothub->list;
151 list_for_each_entry(roothub_entry, head, list) {
160 list_for_each_entry_continue_reverse(roothub_entry, head, list)
170 struct list_head *head; local
176 head = &phy_roothub->list;
178 list_for_each_entry(roothub_entry, head, list) {
192 struct list_head *head; local
198 head = &phy_roothub->list;
200 list_for_each_entry(roothub_entry, head, lis
219 struct list_head *head; local
248 struct list_head *head; local
277 struct list_head *head; local
298 struct list_head *head; local
[all...]
/linux-master/tools/testing/selftests/ftrace/test.d/event/
H A Dsubsystem-enable.tc21 count=`head -n 100 trace | grep -v ^# | awk '{ print $5 }' | sort -u | wc -l`
32 count=`head -n 100 trace | grep -v ^# | awk '{ print $5 }' | sort -u | wc -l`
43 count=`head -n 100 trace | grep -v ^# | awk '{ print $5 }' | sort -u | wc -l`
/linux-master/kernel/gcov/
H A Dclang.c58 struct list_head head; member in struct:gcov_info
68 struct list_head head; member in struct:gcov_fn_info
89 INIT_LIST_HEAD(&info->head);
94 list_add_tail(&info->head, &clang_gcov_list);
120 INIT_LIST_HEAD(&info->head);
124 list_add_tail(&info->head, &current_info->functions);
131 struct gcov_fn_info, head);
177 struct gcov_info, head);
178 if (list_is_last(&info->head, &clang_gcov_list))
180 return list_next_entry(info, head);
[all...]
/linux-master/drivers/infiniband/sw/rdmavt/
H A Dcq.c32 u32 head; local
41 head = RDMA_READ_UAPI_ATOMIC(u_wc->head);
46 head = k_wc->head;
51 * Note that the head pointer might be writable by
54 if (head >= (unsigned)cq->ibcq.cqe) {
55 head = cq->ibcq.cqe;
58 next = head + 1;
78 trace_rvt_cq_enter(cq, entry, head);
341 u32 head, tail, n; local
[all...]
/linux-master/lib/
H A Dbtree.c93 static unsigned long *btree_node_alloc(struct btree_head *head, gfp_t gfp) argument
97 node = mempool_alloc(head->mempool, gfp);
176 static inline void __btree_init(struct btree_head *head) argument
178 head->node = NULL;
179 head->height = 0;
182 void btree_init_mempool(struct btree_head *head, mempool_t *mempool) argument
184 __btree_init(head);
185 head->mempool = mempool;
189 int btree_init(struct btree_head *head) argument
191 __btree_init(head);
199 btree_destroy(struct btree_head *head) argument
207 btree_last(struct btree_head *head, struct btree_geo *geo, unsigned long *key) argument
241 btree_lookup_node(struct btree_head *head, struct btree_geo *geo, unsigned long *key) argument
263 btree_lookup(struct btree_head *head, struct btree_geo *geo, unsigned long *key) argument
280 btree_update(struct btree_head *head, struct btree_geo *geo, unsigned long *key, void *val) argument
307 btree_get_prev(struct btree_head *head, struct btree_geo *geo, unsigned long *__key) argument
384 find_level(struct btree_head *head, struct btree_geo *geo, unsigned long *key, int level) argument
409 btree_grow(struct btree_head *head, struct btree_geo *geo, gfp_t gfp) argument
428 btree_shrink(struct btree_head *head, struct btree_geo *geo) argument
444 btree_insert_level(struct btree_head *head, struct btree_geo *geo, unsigned long *key, void *val, int level, gfp_t gfp) argument
506 btree_insert(struct btree_head *head, struct btree_geo *geo, unsigned long *key, void *val, gfp_t gfp) argument
516 merge(struct btree_head *head, struct btree_geo *geo, int level, unsigned long *left, int lfill, unsigned long *right, int rfill, unsigned long *parent, int lpos) argument
536 rebalance(struct btree_head *head, struct btree_geo *geo, unsigned long *key, int level, unsigned long *child, int fill) argument
587 btree_remove_level(struct btree_head *head, struct btree_geo *geo, unsigned long *key, int level) argument
625 btree_remove(struct btree_head *head, struct btree_geo *geo, unsigned long *key) argument
672 __btree_for_each(struct btree_head *head, struct btree_geo *geo, unsigned long *node, unsigned long opaque, void (*func)(void *elem, unsigned long opaque, unsigned long *key, size_t index, void *func2), void *func2, int reap, int height, size_t count) argument
742 btree_visitor(struct btree_head *head, struct btree_geo *geo, unsigned long opaque, void (*func)(void *elem, unsigned long opaque, unsigned long *key, size_t index, void *func2), void *func2) argument
760 btree_grim_visitor(struct btree_head *head, struct btree_geo *geo, unsigned long opaque, void (*func)(void *elem, unsigned long opaque, unsigned long *key, size_t index, void *func2), void *func2) argument
[all...]
H A Dplist.c56 static void plist_check_head(struct plist_head *head) argument
58 if (!plist_head_empty(head))
59 plist_check_list(&plist_first(head)->prio_list);
60 plist_check_list(&head->node_list);
68 * plist_add - add @node to @head
71 * @head: &struct plist_head pointer
73 void plist_add(struct plist_node *node, struct plist_head *head) argument
76 struct list_head *node_next = &head->node_list;
78 plist_check_head(head);
82 if (plist_head_empty(head))
112 plist_del(struct plist_node *node, struct plist_head *head) argument
145 plist_requeue(struct plist_node *node, struct plist_head *head) argument
[all...]
/linux-master/arch/powerpc/platforms/pseries/
H A Dhvcserver.c56 * @head: list_head pointer for an allocated list of partner info structs to
62 int hvcs_free_partner_info(struct list_head *head) argument
67 if (!head)
70 while (!list_empty(head)) {
71 element = head->next;
98 * @head: An initialized list_head pointer to an empty list to use to return the
116 * hvcs_free_partner_info() using a pointer to the SAME list head instance
119 int hvcs_get_partner_info(uint32_t unit_address, struct list_head *head, argument
133 if (!head || !pi_buff)
138 INIT_LIST_HEAD(head);
[all...]
/linux-master/drivers/dma/
H A Dvirt-dma.h44 void vchan_dma_desc_free_list(struct virt_dma_chan *vc, struct list_head *head);
170 * @head: list of descriptors found
178 struct list_head *head)
180 list_splice_tail_init(&vc->desc_allocated, head);
181 list_splice_tail_init(&vc->desc_submitted, head);
182 list_splice_tail_init(&vc->desc_issued, head);
183 list_splice_tail_init(&vc->desc_completed, head);
184 list_splice_tail_init(&vc->desc_terminated, head);
191 LIST_HEAD(head);
194 vchan_get_all_descriptors(vc, &head);
177 vchan_get_all_descriptors(struct virt_dma_chan *vc, struct list_head *head) argument
[all...]
/linux-master/security/tomoyo/
H A Dmemory.c112 list_for_each_entry(group, list, head.list) {
114 atomic_read(&group->head.users) == TOMOYO_GC_IN_PROGRESS)
116 atomic_inc(&group->head.users);
125 atomic_set(&entry->head.users, 1);
126 list_add_tail_rcu(&entry->head.list, list);
157 struct list_head *head; local
163 head = &tomoyo_name_list[hash_long(hash, TOMOYO_HASH_BITS)];
166 list_for_each_entry(ptr, head, head.list) {
168 atomic_read(&ptr->head
[all...]

Completed in 224 milliseconds

1234567891011>>