Home
last modified time | relevance | path

Searched refs:head (Results 376 - 400 of 6118) sorted by relevance

1...<<11121314151617181920>>...245

/kernel/linux/linux-6.6/drivers/net/ethernet/netronome/nfp/flower/
H A Daction.c39 push_mpls->head.jump_id = NFP_FL_ACTION_OPCODE_PUSH_MPLS; in nfp_fl_push_mpls()
40 push_mpls->head.len_lw = act_size >> NFP_FL_LW_SIZ; in nfp_fl_push_mpls()
69 pop_mpls->head.jump_id = NFP_FL_ACTION_OPCODE_POP_MPLS; in nfp_fl_pop_mpls()
70 pop_mpls->head.len_lw = act_size >> NFP_FL_LW_SIZ; in nfp_fl_pop_mpls()
81 set_mpls->head.jump_id = NFP_FL_ACTION_OPCODE_SET_MPLS; in nfp_fl_set_mpls()
82 set_mpls->head.len_lw = act_size >> NFP_FL_LW_SIZ; in nfp_fl_set_mpls()
109 pop_vlan->head.jump_id = NFP_FL_ACTION_OPCODE_POP_VLAN; in nfp_fl_pop_vlan()
110 pop_vlan->head.len_lw = act_size >> NFP_FL_LW_SIZ; in nfp_fl_pop_vlan()
121 push_vlan->head.jump_id = NFP_FL_ACTION_OPCODE_PUSH_VLAN; in nfp_fl_push_vlan()
122 push_vlan->head in nfp_fl_push_vlan()
[all...]
/kernel/linux/linux-6.6/fs/
H A Dpipe.c63 * We use head and tail indices that aren't masked off, except at the point of
223 unsigned int head = READ_ONCE(pipe->head); in pipe_readable() local
227 return !pipe_empty(head, tail) || !writers; in pipe_readable()
254 was_full = pipe_full(pipe->head, pipe->tail, pipe->max_usage); in pipe_read()
256 /* Read ->head with a barrier vs post_one_notification() */ in pipe_read()
257 unsigned int head = smp_load_acquire(&pipe->head); in pipe_read() local
285 if (!pipe_empty(head, tail)) { in pipe_read()
337 if (!pipe_empty(head, tai in pipe_read()
408 unsigned int head = READ_ONCE(pipe->head); pipe_writable() local
421 unsigned int head; pipe_write() local
609 unsigned int count, head, tail, mask; pipe_ioctl() local
652 unsigned int head, tail; pipe_poll() local
1258 unsigned int head, tail, mask, n; pipe_resize_ring() local
[all...]
/kernel/linux/linux-5.10/fs/erofs/
H A Dnamei.c51 int head, back; in find_target_dirent() local
56 head = 1; in find_target_dirent()
60 while (head <= back) { in find_target_dirent()
61 const int mid = head + (back - head) / 2; in find_target_dirent()
79 head = mid + 1; in find_target_dirent()
95 int head, back; in find_target_block_classic() local
100 head = 0; in find_target_block_classic()
103 while (head <= back) { in find_target_block_classic()
104 const int mid = head in find_target_block_classic()
[all...]
/kernel/linux/linux-6.6/kernel/bpf/
H A Dqueue_stack_maps.c19 u32 head, tail; member
32 return qs->head == qs->tail; in queue_stack_map_is_empty()
37 u32 head = qs->head + 1; in queue_stack_map_is_full() local
39 if (unlikely(head >= qs->size)) in queue_stack_map_is_full()
40 head = 0; in queue_stack_map_is_full()
42 return head == qs->tail; in queue_stack_map_is_full()
149 index = qs->head - 1; in __stack_map_get()
157 qs->head = index; in __stack_map_get()
223 dst = &qs->elements[qs->head * q in queue_stack_map_push_elem()
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/nouveau/dispnv50/
H A Dcurs507a.c24 #include "head.h"
102 struct nv50_head *head = nv50_head(asyw->state.crtc); in curs507a_acquire() local
136 ret = head->func->curs_layout(head, asyw, asyh); in curs507a_acquire()
144 ret = head->func->curs_format(head, asyw, asyh); in curs507a_acquire()
170 int head, s32 oclass, u32 interlock_data, in curs507a_new_()
174 .id = head, in curs507a_new_()
181 "curs", head, curs507a_format, BIT(head), in curs507a_new_()
169 curs507a_new_(const struct nv50_wimm_func *func, struct nouveau_drm *drm, int head, s32 oclass, u32 interlock_data, struct nv50_wndw **pwndw) curs507a_new_() argument
200 curs507a_new(struct nouveau_drm *drm, int head, s32 oclass, struct nv50_wndw **pwndw) curs507a_new() argument
[all...]
H A Dhead917d.c22 #include "head.h"
31 head917d_dither(struct nv50_head *head, struct nv50_head_atom *asyh) in head917d_dither() argument
33 struct nvif_push *push = nv50_disp(head->base.base.dev)->core->chan.push; in head917d_dither()
34 const int i = head->base.index; in head917d_dither()
49 head917d_base(struct nv50_head *head, struct nv50_head_atom *asyh) in head917d_base() argument
51 struct nvif_push *push = nv50_disp(head->base.base.dev)->core->chan.push; in head917d_base()
52 const int i = head->base.index; in head917d_base()
78 head917d_curs_set(struct nv50_head *head, struct nv50_head_atom *asyh) in head917d_curs_set() argument
80 struct nvif_push *push = nv50_disp(head->base.base.dev)->core->chan.push; in head917d_curs_set()
81 const int i = head in head917d_curs_set()
103 head917d_curs_layout(struct nv50_head *head, struct nv50_wndw_atom *asyw, struct nv50_head_atom *asyh) head917d_curs_layout() argument
[all...]
/third_party/selinux/libsepol/src/
H A Dibendports.c113 ocontext_t *c, *head; in sepol_ibendport_count() local
116 head = policydb->ocontexts[OCON_IBENDPORT]; in sepol_ibendport_count()
117 for (c = head; c; c = c->next) in sepol_ibendport_count()
131 ocontext_t *c, *head; in sepol_ibendport_exists() local
137 head = policydb->ocontexts[OCON_IBENDPORT]; in sepol_ibendport_exists()
138 for (c = head; c; c = c->next) { in sepol_ibendport_exists()
159 ocontext_t *c, *head; in sepol_ibendport_query() local
165 head = policydb->ocontexts[OCON_IBENDPORT]; in sepol_ibendport_query()
166 for (c = head; c; c = c->next) { in sepol_ibendport_query()
225 ocontext_t *c, *head; in sepol_ibendport_iterate() local
[all...]
/third_party/selinux/libsepol/cil/src/
H A Dcil_list.c50 new_list->head = NULL; in cil_list_init()
64 item = (*list)->head; in cil_list_destroy()
112 list->head = item; in cil_list_append()
134 list->head = item; in cil_list_prepend()
139 item->next = list->head; in cil_list_prepend()
140 list->head = item; in cil_list_prepend()
154 return list->head; in cil_list_insert()
189 list->head = item; in cil_list_append_item()
216 list->head = item; in cil_list_prepend_item()
221 last->next = list->head; in cil_list_prepend_item()
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Dtimerqueue.h19 extern bool timerqueue_add(struct timerqueue_head *head,
21 extern bool timerqueue_del(struct timerqueue_head *head,
29 * @head: head of timerqueue
34 struct timerqueue_node *timerqueue_getnext(struct timerqueue_head *head) in timerqueue_getnext() argument
36 struct rb_node *leftmost = rb_first_cached(&head->rb_root); in timerqueue_getnext()
56 static inline void timerqueue_init_head(struct timerqueue_head *head) in timerqueue_init_head() argument
58 head->rb_root = RB_ROOT_CACHED; in timerqueue_init_head()
/kernel/linux/linux-6.6/include/linux/
H A Dtimerqueue.h19 extern bool timerqueue_add(struct timerqueue_head *head,
21 extern bool timerqueue_del(struct timerqueue_head *head,
29 * @head: head of timerqueue
34 struct timerqueue_node *timerqueue_getnext(struct timerqueue_head *head) in timerqueue_getnext() argument
36 struct rb_node *leftmost = rb_first_cached(&head->rb_root); in timerqueue_getnext()
56 static inline void timerqueue_init_head(struct timerqueue_head *head) in timerqueue_init_head() argument
58 head->rb_root = RB_ROOT_CACHED; in timerqueue_init_head()
/kernel/linux/linux-5.10/drivers/gpu/drm/nouveau/nvkm/subdev/top/
H A Dbase.c38 list_add_tail(&info->head, &top->device); in nvkm_top_device_new()
50 list_for_each_entry(info, &top->device, head) { in nvkm_top_addr()
66 list_for_each_entry(info, &top->device, head) { in nvkm_top_reset()
82 list_for_each_entry(info, &top->device, head) { in nvkm_top_intr_mask()
100 list_for_each_entry(info, &top->device, head) { in nvkm_top_intr()
120 list_for_each_entry(info, &top->device, head) { in nvkm_top_fault_id()
134 list_for_each_entry(info, &top->device, head) { in nvkm_top_fault()
149 list_for_each_entry(info, &top->device, head) { in nvkm_top_engine()
173 list_for_each_entry_safe(info, temp, &top->device, head) { in nvkm_top_dtor()
174 list_del(&info->head); in nvkm_top_dtor()
[all...]
/kernel/linux/linux-5.10/net/ceph/
H A Dpagelist.c17 INIT_LIST_HEAD(&pl->head); in ceph_pagelist_alloc()
32 struct page *page = list_entry(pl->head.prev, struct page, lru); in ceph_pagelist_unmap_tail()
43 while (!list_empty(&pl->head)) { in ceph_pagelist_release()
44 struct page *page = list_first_entry(&pl->head, struct page, in ceph_pagelist_release()
69 list_add_tail(&page->lru, &pl->head); in ceph_pagelist_addpage()
140 c->page_lru = pl->head.prev; in ceph_pagelist_set_cursor()
158 while (pl->head.prev != c->page_lru) { in ceph_pagelist_truncate()
159 page = list_entry(pl->head.prev, struct page, lru); in ceph_pagelist_truncate()
165 if (!list_empty(&pl->head)) { in ceph_pagelist_truncate()
166 page = list_entry(pl->head in ceph_pagelist_truncate()
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/nouveau/dispnv50/
H A Dhead917d.c22 #include "head.h"
31 head917d_dither(struct nv50_head *head, struct nv50_head_atom *asyh) in head917d_dither() argument
33 struct nvif_push *push = nv50_disp(head->base.base.dev)->core->chan.push; in head917d_dither()
34 const int i = head->base.index; in head917d_dither()
49 head917d_base(struct nv50_head *head, struct nv50_head_atom *asyh) in head917d_base() argument
51 struct nvif_push *push = nv50_disp(head->base.base.dev)->core->chan.push; in head917d_base()
52 const int i = head->base.index; in head917d_base()
78 head917d_curs_set(struct nv50_head *head, struct nv50_head_atom *asyh) in head917d_curs_set() argument
80 struct nvif_push *push = nv50_disp(head->base.base.dev)->core->chan.push; in head917d_curs_set()
81 const int i = head in head917d_curs_set()
103 head917d_curs_layout(struct nv50_head *head, struct nv50_wndw_atom *asyw, struct nv50_head_atom *asyh) head917d_curs_layout() argument
[all...]
/kernel/linux/linux-6.6/net/ceph/
H A Dpagelist.c17 INIT_LIST_HEAD(&pl->head); in ceph_pagelist_alloc()
32 struct page *page = list_entry(pl->head.prev, struct page, lru); in ceph_pagelist_unmap_tail()
43 while (!list_empty(&pl->head)) { in ceph_pagelist_release()
44 struct page *page = list_first_entry(&pl->head, struct page, in ceph_pagelist_release()
69 list_add_tail(&page->lru, &pl->head); in ceph_pagelist_addpage()
140 c->page_lru = pl->head.prev; in ceph_pagelist_set_cursor()
158 while (pl->head.prev != c->page_lru) { in ceph_pagelist_truncate()
159 page = list_entry(pl->head.prev, struct page, lru); in ceph_pagelist_truncate()
165 if (!list_empty(&pl->head)) { in ceph_pagelist_truncate()
166 page = list_entry(pl->head in ceph_pagelist_truncate()
[all...]
/third_party/mesa3d/src/gallium/frontends/nine/
H A Dnine_queue.c71 unsigned head; member
141 struct nine_cmdbuf *cmdbuf = &ctx->pool[ctx->head]; in nine_queue_flush()
156 ctx->head = (ctx->head + 1) & NINE_CMD_BUFS_MASK; in nine_queue_flush()
158 cmdbuf = &ctx->pool[ctx->head]; in nine_queue_flush()
180 struct nine_cmdbuf *cmdbuf = &ctx->pool[ctx->head]; in nine_queue_alloc()
192 cmdbuf = &ctx->pool[ctx->head]; in nine_queue_alloc()
213 return (ctx->tail == ctx->head); in nine_queue_no_flushed_work()
222 struct nine_cmdbuf *cmdbuf = &ctx->pool[ctx->head]; in nine_queue_isempty()
224 return (ctx->tail == ctx->head) in nine_queue_isempty()
[all...]
/third_party/pulseaudio/src/pulsecore/
H A Dstrbuf.c45 struct chunk *head, *tail; member
53 sb->head = sb->tail = NULL; in pa_strbuf_new()
61 while (sb->head) { in pa_strbuf_free()
62 struct chunk *c = sb->head; in pa_strbuf_free()
63 sb->head = sb->head->next; in pa_strbuf_free()
80 for (c = sb->head; c; c = c->next) { in pa_strbuf_to_string()
127 pa_assert(sb->head); in append()
130 pa_assert(!sb->head); in append()
131 sb->head in append()
[all...]
/kernel/linux/linux-5.10/net/sunrpc/auth_gss/
H A Dgss_krb5_wrap.c58 iov = &buf->head[0]; in gss_krb5_add_padding()
72 if (len <= buf->head[0].iov_len) { in gss_krb5_remove_padding()
73 pad = *(u8 *)(buf->head[0].iov_base + len - 1); in gss_krb5_remove_padding()
74 if (pad > buf->head[0].iov_len) in gss_krb5_remove_padding()
76 buf->head[0].iov_len -= pad; in gss_krb5_remove_padding()
79 len -= buf->head[0].iov_len; in gss_krb5_remove_padding()
97 * However adjusting the head length, as we do above, is harmless. in gss_krb5_remove_padding()
99 * also uses length and head length together to determine the original in gss_krb5_remove_padding()
101 * easier on the server if we adjust head and tail length in tandem. in gss_krb5_remove_padding()
149 /* Assumptions: the head an
372 char head[LOCAL_BUF_LEN]; rotate_buf_a_little() local
[all...]
/kernel/linux/linux-5.10/tools/power/acpi/tools/acpidbg/
H A Dacpidbg.c42 (CIRC_CNT((circ)->head, (circ)->tail, ACPI_AML_BUF_SIZE))
44 (CIRC_CNT_TO_END((circ)->head, (circ)->tail, ACPI_AML_BUF_SIZE))
46 (CIRC_SPACE((circ)->head, (circ)->tail, ACPI_AML_BUF_SIZE))
48 (CIRC_SPACE_TO_END((circ)->head, (circ)->tail, ACPI_AML_BUF_SIZE))
77 .head = 0,
82 .head = 0,
128 p = &crc->buf[crc->head]; in acpi_aml_read()
134 crc->head = (crc->head + len) & (ACPI_AML_BUF_SIZE - 1); in acpi_aml_read()
144 p = &crc->buf[crc->head]; in acpi_aml_read_batch_cmd()
[all...]
/kernel/linux/linux-5.10/fs/befs/
H A Dbtree.c82 befs_host_btree_nodehead head; /* head of node converted to cpu byteorder */ member
185 * starts at @node_off, with the node->head fields in cpu byte order.
214 node->head.left = fs64_to_cpu(sb, node->od_node->left); in befs_bt_read_node()
215 node->head.right = fs64_to_cpu(sb, node->od_node->right); in befs_bt_read_node()
216 node->head.overflow = fs64_to_cpu(sb, node->od_node->overflow); in befs_bt_read_node()
217 node->head.all_key_count = in befs_bt_read_node()
219 node->head.all_key_length = in befs_bt_read_node()
283 node_off = this_node->head.overflow; in befs_btree_find()
345 last = node->head in befs_find_key()
[all...]
/kernel/linux/linux-6.6/fs/befs/
H A Dbtree.c82 befs_host_btree_nodehead head; /* head of node converted to cpu byteorder */ member
185 * starts at @node_off, with the node->head fields in cpu byte order.
214 node->head.left = fs64_to_cpu(sb, node->od_node->left); in befs_bt_read_node()
215 node->head.right = fs64_to_cpu(sb, node->od_node->right); in befs_bt_read_node()
216 node->head.overflow = fs64_to_cpu(sb, node->od_node->overflow); in befs_bt_read_node()
217 node->head.all_key_count = in befs_bt_read_node()
219 node->head.all_key_length = in befs_bt_read_node()
283 node_off = this_node->head.overflow; in befs_btree_find()
345 last = node->head in befs_find_key()
[all...]
/kernel/linux/linux-6.6/tools/power/acpi/tools/acpidbg/
H A Dacpidbg.c42 (CIRC_CNT((circ)->head, (circ)->tail, ACPI_AML_BUF_SIZE))
44 (CIRC_CNT_TO_END((circ)->head, (circ)->tail, ACPI_AML_BUF_SIZE))
46 (CIRC_SPACE((circ)->head, (circ)->tail, ACPI_AML_BUF_SIZE))
48 (CIRC_SPACE_TO_END((circ)->head, (circ)->tail, ACPI_AML_BUF_SIZE))
77 .head = 0,
82 .head = 0,
128 p = &crc->buf[crc->head]; in acpi_aml_read()
134 crc->head = (crc->head + len) & (ACPI_AML_BUF_SIZE - 1); in acpi_aml_read()
144 p = &crc->buf[crc->head]; in acpi_aml_read_batch_cmd()
[all...]
/third_party/python/Lib/idlelib/
H A Dformat.py231 head = text.index(first + " linestart")
234 head = text.index("insert linestart")
236 chars = text.get(head, tail)
238 return head, tail, chars, lines
240 def set_region(self, head, tail, chars, lines):
244 head: Starting index of text to replace.
247 between head and tail.
248 lines: List of new lines to insert between head
257 text.mark_set("insert", head)
259 text.delete(head, tai
[all...]
/kernel/linux/linux-5.10/net/sched/
H A Dsch_hhf.c121 struct sk_buff *head; member
181 struct list_head *head, in seek_list()
187 if (list_empty(head)) in seek_list()
190 list_for_each_entry_safe(flow, next, head, flowchain) { in seek_list()
197 if (list_is_last(&flow->flowchain, head)) in seek_list()
212 static struct hh_flow_state *alloc_new_hh(struct list_head *head, in alloc_new_hh() argument
218 if (!list_empty(head)) { in alloc_new_hh()
220 list_for_each_entry(flow, head, flowchain) { in alloc_new_hh()
239 list_add_tail(&flow->flowchain, head); in alloc_new_hh()
328 /* Removes one skb from head o
180 seek_list(const u32 hash, struct list_head *head, struct hhf_sched_data *q) seek_list() argument
423 struct list_head *head; hhf_dequeue() local
486 struct list_head *head = &q->hh_flows[i]; hhf_destroy() local
[all...]
/kernel/linux/linux-6.6/net/sched/
H A Dsch_hhf.c121 struct sk_buff *head; member
181 struct list_head *head, in seek_list()
187 if (list_empty(head)) in seek_list()
190 list_for_each_entry_safe(flow, next, head, flowchain) { in seek_list()
197 if (list_is_last(&flow->flowchain, head)) in seek_list()
212 static struct hh_flow_state *alloc_new_hh(struct list_head *head, in alloc_new_hh() argument
218 if (!list_empty(head)) { in alloc_new_hh()
220 list_for_each_entry(flow, head, flowchain) { in alloc_new_hh()
239 list_add_tail(&flow->flowchain, head); in alloc_new_hh()
328 /* Removes one skb from head o
180 seek_list(const u32 hash, struct list_head *head, struct hhf_sched_data *q) seek_list() argument
423 struct list_head *head; hhf_dequeue() local
486 struct list_head *head = &q->hh_flows[i]; hhf_destroy() local
[all...]
/kernel/linux/linux-5.10/arch/x86/kernel/
H A Dnmi.c43 struct list_head head; member
50 .head = LIST_HEAD_INIT(nmi_desc[0].head),
54 .head = LIST_HEAD_INIT(nmi_desc[1].head),
58 .head = LIST_HEAD_INIT(nmi_desc[2].head),
62 .head = LIST_HEAD_INIT(nmi_desc[3].head),
135 list_for_each_entry_rcu(a, &desc->head, lis in nmi_handle()
[all...]

Completed in 14 milliseconds

1...<<11121314151617181920>>...245