Home
last modified time | relevance | path

Searched full:head (Results 1 – 25 of 2841) sorted by relevance

12345678910>>...114

/Linux-v6.6/security/tomoyo/
Dcommon.c201 * @head: Pointer to "struct tomoyo_io_buffer".
205 static bool tomoyo_flush(struct tomoyo_io_buffer *head) in tomoyo_flush() argument
207 while (head->r.w_pos) { in tomoyo_flush()
208 const char *w = head->r.w[0]; in tomoyo_flush()
212 if (len > head->read_user_buf_avail) in tomoyo_flush()
213 len = head->read_user_buf_avail; in tomoyo_flush()
216 if (copy_to_user(head->read_user_buf, w, len)) in tomoyo_flush()
218 head->read_user_buf_avail -= len; in tomoyo_flush()
219 head->read_user_buf += len; in tomoyo_flush()
222 head->r.w[0] = w; in tomoyo_flush()
[all …]
/Linux-v6.6/drivers/scsi/aic7xxx/
Dqueue.h40 * added to the list after an existing element or at the head of the list.
41 * Elements being removed from the head of the list should use the explicit
48 * head of the list and the other to the tail of the list. The elements are
51 * to the list after an existing element, at the head of the list, or at the
52 * end of the list. Elements being removed from the head of the tail queue
62 * or after an existing element or at the head of the list. A list
65 * A tail queue is headed by a pair of pointers, one to the head of the
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
[all …]
/Linux-v6.6/drivers/gpu/drm/nouveau/dispnv04/
Dhw.c39 NVWriteVgaSeq(struct drm_device *dev, int head, uint8_t index, uint8_t value) in NVWriteVgaSeq() argument
41 NVWritePRMVIO(dev, head, NV_PRMVIO_SRX, index); in NVWriteVgaSeq()
42 NVWritePRMVIO(dev, head, NV_PRMVIO_SR, value); in NVWriteVgaSeq()
46 NVReadVgaSeq(struct drm_device *dev, int head, uint8_t index) in NVReadVgaSeq() argument
48 NVWritePRMVIO(dev, head, NV_PRMVIO_SRX, index); in NVReadVgaSeq()
49 return NVReadPRMVIO(dev, head, NV_PRMVIO_SR); in NVReadVgaSeq()
53 NVWriteVgaGr(struct drm_device *dev, int head, uint8_t index, uint8_t value) in NVWriteVgaGr() argument
55 NVWritePRMVIO(dev, head, NV_PRMVIO_GRX, index); in NVWriteVgaGr()
56 NVWritePRMVIO(dev, head, NV_PRMVIO_GX, value); in NVWriteVgaGr()
60 NVReadVgaGr(struct drm_device *dev, int head, uint8_t index) in NVReadVgaGr() argument
[all …]
Dhw.h37 void NVWriteVgaSeq(struct drm_device *, int head, uint8_t index, uint8_t value);
38 uint8_t NVReadVgaSeq(struct drm_device *, int head, uint8_t index);
39 void NVWriteVgaGr(struct drm_device *, int head, uint8_t index, uint8_t value);
40 uint8_t NVReadVgaGr(struct drm_device *, int head, uint8_t index);
42 void NVBlankScreen(struct drm_device *, int head, bool blank);
48 void nouveau_hw_save_state(struct drm_device *, int head,
50 void nouveau_hw_load_state(struct drm_device *, int head,
52 void nouveau_hw_load_state_palette(struct drm_device *, int head,
60 int head, uint32_t reg) in NVReadCRTC() argument
64 if (head) in NVReadCRTC()
[all …]
/Linux-v6.6/include/linux/
Dlist.h162 * @head: list head to add it after
164 * Insert a new entry after the specified head.
167 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
169 __list_add(new, head, head->next); in list_add()
176 * @head: list head to add it before
178 * Insert a new entry before the specified head.
181 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
183 __list_add(new, head->prev, head); in list_add_tail()
292 * list_move - delete from one list and add as another's head
294 * @head: the head that will precede our entry
[all …]
Dplist.h35 * HEAD| NODE(S)
94 * @head: struct plist_head variable name
96 #define PLIST_HEAD_INIT(head) \ argument
98 .node_list = LIST_HEAD_INIT((head).node_list) \
103 * @head: name for struct plist_head variable
105 #define PLIST_HEAD(head) \ argument
106 struct plist_head head = PLIST_HEAD_INIT(head)
122 * @head: &struct plist_head pointer
125 plist_head_init(struct plist_head *head) in plist_head_init() argument
127 INIT_LIST_HEAD(&head->node_list); in plist_head_init()
[all …]
Dbtree-type.h14 static inline void BTREE_FN(init_mempool)(BTREE_TYPE_HEAD *head, in BTREE_FN()
17 btree_init_mempool(&head->h, mempool); in BTREE_FN()
20 static inline int BTREE_FN(init)(BTREE_TYPE_HEAD *head) in BTREE_FN()
22 return btree_init(&head->h); in BTREE_FN()
25 static inline void BTREE_FN(destroy)(BTREE_TYPE_HEAD *head) in BTREE_FN()
27 btree_destroy(&head->h); in BTREE_FN()
38 static inline void *BTREE_FN(lookup)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key) in BTREE_FN()
41 return btree_lookup(&head->h, BTREE_TYPE_GEO, &_key); in BTREE_FN()
44 static inline int BTREE_FN(insert)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, in BTREE_FN()
48 return btree_insert(&head->h, BTREE_TYPE_GEO, &_key, val, gfp); in BTREE_FN()
[all …]
Dbtree-128.h6 static inline void btree_init_mempool128(struct btree_head128 *head, in btree_init_mempool128() argument
9 btree_init_mempool(&head->h, mempool); in btree_init_mempool128()
12 static inline int btree_init128(struct btree_head128 *head) in btree_init128() argument
14 return btree_init(&head->h); in btree_init128()
17 static inline void btree_destroy128(struct btree_head128 *head) in btree_destroy128() argument
19 btree_destroy(&head->h); in btree_destroy128()
22 static inline void *btree_lookup128(struct btree_head128 *head, u64 k1, u64 k2) in btree_lookup128() argument
25 return btree_lookup(&head->h, &btree_geo128, (unsigned long *)&key); in btree_lookup128()
28 static inline void *btree_get_prev128(struct btree_head128 *head, in btree_get_prev128() argument
34 val = btree_get_prev(&head->h, &btree_geo128, in btree_get_prev128()
[all …]
Dbtree.h16 * Each B+Tree consists of a head, that contains bookkeeping information and
29 * struct btree_head - btree head
61 * @head: the btree head to initialise
67 void btree_init_mempool(struct btree_head *head, mempool_t *mempool);
72 * @head: the btree head to initialise
79 int __must_check btree_init(struct btree_head *head);
84 * @head: the btree head to destroy
89 void btree_destroy(struct btree_head *head);
94 * @head: the btree to look in
100 void *btree_lookup(struct btree_head *head, struct btree_geo *geo,
[all …]
/Linux-v6.6/tools/include/linux/
Dlist.h56 * @head: list head to add it after
58 * Insert a new entry after the specified head.
61 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
63 __list_add(new, head, head->next); in list_add()
70 * @head: list head to add it before
72 * Insert a new entry before the specified head.
75 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
77 __list_add(new, head->prev, head); in list_add_tail()
150 * list_move - delete from one list and add as another's head
152 * @head: the head that will precede our entry
[all …]
/Linux-v6.6/net/sched/
Dcls_matchall.c32 struct cls_mall_head *head = rcu_dereference_bh(tp->root); in mall_classify() local
34 if (unlikely(!head)) in mall_classify()
37 if (tc_skip_sw(head->flags)) in mall_classify()
40 *res = head->res; in mall_classify()
41 __this_cpu_inc(head->pf->rhit); in mall_classify()
42 return tcf_exts_exec(skb, &head->exts, res); in mall_classify()
50 static void __mall_destroy(struct cls_mall_head *head) in __mall_destroy() argument
52 tcf_exts_destroy(&head->exts); in __mall_destroy()
53 tcf_exts_put_net(&head->exts); in __mall_destroy()
54 free_percpu(head->pf); in __mall_destroy()
[all …]
Dcls_cgroup.c30 struct cls_cgroup_head *head = rcu_dereference_bh(tp->root); in cls_cgroup_classify() local
33 if (unlikely(!head)) in cls_cgroup_classify()
37 if (!tcf_em_tree_match(skb, &head->ematches, NULL)) in cls_cgroup_classify()
43 return tcf_exts_exec(skb, &head->exts, res); in cls_cgroup_classify()
60 static void __cls_cgroup_destroy(struct cls_cgroup_head *head) in __cls_cgroup_destroy() argument
62 tcf_exts_destroy(&head->exts); in __cls_cgroup_destroy()
63 tcf_em_tree_destroy(&head->ematches); in __cls_cgroup_destroy()
64 tcf_exts_put_net(&head->exts); in __cls_cgroup_destroy()
65 kfree(head); in __cls_cgroup_destroy()
70 struct cls_cgroup_head *head = container_of(to_rcu_work(work), in cls_cgroup_destroy_work() local
[all …]
/Linux-v6.6/drivers/nvme/host/
Dmultipath.c102 spin_lock_irqsave(&ns->head->requeue_lock, flags); in nvme_failover_req()
104 bio_set_dev(bio, ns->head->disk->part0); in nvme_failover_req()
118 blk_steal_bios(&ns->head->requeue_list, req); in nvme_failover_req()
119 spin_unlock_irqrestore(&ns->head->requeue_lock, flags); in nvme_failover_req()
122 kblockd_schedule_work(&ns->head->requeue_work); in nvme_failover_req()
128 struct gendisk *disk = ns->head->disk; in nvme_mpath_start_request()
145 bdev_end_io_acct(ns->head->disk->part0, req_op(rq), in nvme_mpath_end_request()
156 if (!ns->head->disk) in nvme_kick_requeue_lists()
158 kblockd_schedule_work(&ns->head->requeue_work); in nvme_kick_requeue_lists()
160 disk_uevent(ns->head->disk, KOBJ_CHANGE); in nvme_kick_requeue_lists()
[all …]
/Linux-v6.6/net/netlabel/
Dnetlabel_addrlist.h82 #define netlbl_af4list_foreach(iter, head) \ argument
83 for (iter = __af4list_valid((head)->next, head); \
84 &iter->list != (head); \
85 iter = __af4list_valid(iter->list.next, head))
87 #define netlbl_af4list_foreach_rcu(iter, head) \ argument
88 for (iter = __af4list_valid_rcu((head)->next, head); \
89 &iter->list != (head); \
90 iter = __af4list_valid_rcu(iter->list.next, head))
92 #define netlbl_af4list_foreach_safe(iter, tmp, head) \ argument
93 for (iter = __af4list_valid((head)->next, head), \
[all …]
Dnetlabel_addrlist.c38 * @head: the list head
41 * Searches the IPv4 address list given by @head. If a matching address entry
47 struct list_head *head) in netlbl_af4list_search() argument
51 list_for_each_entry_rcu(iter, head, list) in netlbl_af4list_search()
62 * @head: the list head
65 * Searches the IPv4 address list given by @head. If an exact match if found
72 struct list_head *head) in netlbl_af4list_search_exact() argument
76 list_for_each_entry_rcu(iter, head, list) in netlbl_af4list_search_exact()
88 * @head: the list head
91 * Searches the IPv6 address list given by @head. If a matching address entry
[all …]
/Linux-v6.6/drivers/gpu/drm/nouveau/nvkm/engine/disp/
Dvga.c27 nvkm_rdport(struct nvkm_device *device, int head, u16 port) in nvkm_rdport() argument
35 return nvkm_rd08(device, 0x601000 + (head * 0x2000) + port); in nvkm_rdport()
41 head = 0; /* CR44 selects head */ in nvkm_rdport()
42 return nvkm_rd08(device, 0x0c0000 + (head * 0x2000) + port); in nvkm_rdport()
49 nvkm_wrport(struct nvkm_device *device, int head, u16 port, u8 data) in nvkm_wrport() argument
57 nvkm_wr08(device, 0x601000 + (head * 0x2000) + port, data); in nvkm_wrport()
63 head = 0; /* CR44 selects head */ in nvkm_wrport()
64 nvkm_wr08(device, 0x0c0000 + (head * 0x2000) + port, data); in nvkm_wrport()
69 nvkm_rdvgas(struct nvkm_device *device, int head, u8 index) in nvkm_rdvgas() argument
71 nvkm_wrport(device, head, 0x03c4, index); in nvkm_rdvgas()
[all …]
Dhead.c24 #include "head.h"
34 struct nvkm_head *head; in nvkm_head_find() local
35 list_for_each_entry(head, &disp->heads, head) { in nvkm_head_find()
36 if (head->id == id) in nvkm_head_find()
37 return head; in nvkm_head_find()
45 struct nvkm_head *head = *phead; in nvkm_head_del() local
46 if (head) { in nvkm_head_del()
47 HEAD_DBG(head, "dtor"); in nvkm_head_del()
48 list_del(&head->head); in nvkm_head_del()
58 struct nvkm_head *head; in nvkm_head_new_() local
[all …]
/Linux-v6.6/kernel/bpf/
Dpercpu_freelist.c15 struct pcpu_freelist_head *head = per_cpu_ptr(s->freelist, cpu); in pcpu_freelist_init() local
17 raw_spin_lock_init(&head->lock); in pcpu_freelist_init()
18 head->first = NULL; in pcpu_freelist_init()
30 static inline void pcpu_freelist_push_node(struct pcpu_freelist_head *head, in pcpu_freelist_push_node() argument
33 node->next = head->first; in pcpu_freelist_push_node()
34 WRITE_ONCE(head->first, node); in pcpu_freelist_push_node()
37 static inline void ___pcpu_freelist_push(struct pcpu_freelist_head *head, in ___pcpu_freelist_push() argument
40 raw_spin_lock(&head->lock); in ___pcpu_freelist_push()
41 pcpu_freelist_push_node(head, node); in ___pcpu_freelist_push()
42 raw_spin_unlock(&head->lock); in ___pcpu_freelist_push()
[all …]
/Linux-v6.6/scripts/gdb/linux/
Dlists.py23 def list_for_each(head): argument
24 if head.type == list_head.get_type().pointer():
25 head = head.dereference()
26 elif head.type != list_head.get_type():
28 .format(head.type))
30 if head['next'] == 0:
32 .format(head.address))
35 node = head['next'].dereference()
36 while node.address != head.address:
41 def list_for_each_entry(head, gdbtype, member): argument
[all …]
/Linux-v6.6/scripts/
Dhead-object-list.txt1 # Head objects
3 # The objects listed here are placed at the head of vmlinux. A typical use-case
5 # with head-y, which Kbuild used to support.
8 # The code marked as __HEAD goes into the ".head.text" section, which is placed
14 arch/alpha/kernel/head.o
15 arch/arc/kernel/head.o
16 arch/arm/kernel/head-nommu.o
17 arch/arm/kernel/head.o
18 arch/csky/kernel/head.o
19 arch/hexagon/kernel/head.o
[all …]
/Linux-v6.6/tools/testing/selftests/arm64/signal/testcases/
Dtestcases.c9 struct _aarch64_ctx *get_header(struct _aarch64_ctx *head, uint32_t magic, in get_header() argument
15 if (!head || resv_sz < HDR_SZ) in get_header()
19 head->magic != magic && head->magic) { in get_header()
20 offs += head->size; in get_header()
21 head = GET_RESV_NEXT_HEAD(head); in get_header()
23 if (head->magic == magic) { in get_header()
24 found = head; in get_header()
41 term = GET_RESV_NEXT_HEAD(&extra->head); in validate_extra_context()
71 if ((sve->head.size != sizeof(struct sve_context)) && in validate_sve_context()
72 (sve->head.size != regs_size)) { in validate_sve_context()
[all …]
/Linux-v6.6/scripts/mod/
Dlist.h79 * @head: list head to add it after
81 * Insert a new entry after the specified head.
84 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
86 __list_add(new, head, head->next); in list_add()
92 * @head: list head to add it before
94 * Insert a new entry before the specified head.
97 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
99 __list_add(new, head->prev, head); in list_add_tail()
134 * list_is_head - tests whether @list is the list @head
136 * @head: the head of the list
[all …]
/Linux-v6.6/lib/
Dbtree.c93 static unsigned long *btree_node_alloc(struct btree_head *head, gfp_t gfp) in btree_node_alloc() argument
97 node = mempool_alloc(head->mempool, gfp); in btree_node_alloc()
176 static inline void __btree_init(struct btree_head *head) in __btree_init() argument
178 head->node = NULL; in __btree_init()
179 head->height = 0; in __btree_init()
182 void btree_init_mempool(struct btree_head *head, mempool_t *mempool) in btree_init_mempool() argument
184 __btree_init(head); in btree_init_mempool()
185 head->mempool = mempool; in btree_init_mempool()
189 int btree_init(struct btree_head *head) in btree_init() argument
191 __btree_init(head); in btree_init()
[all …]
/Linux-v6.6/drivers/gpu/drm/nouveau/dispnv50/
Dhead.c22 #include "head.h"
39 nv50_head_flush_clr(struct nv50_head *head, in nv50_head_flush_clr() argument
45 if (clr.crc) nv50_crc_atomic_clr(head); in nv50_head_flush_clr()
46 if (clr.olut) head->func->olut_clr(head); in nv50_head_flush_clr()
47 if (clr.core) head->func->core_clr(head); in nv50_head_flush_clr()
48 if (clr.curs) head->func->curs_clr(head); in nv50_head_flush_clr()
52 nv50_head_flush_set_wndw(struct nv50_head *head, struct nv50_head_atom *asyh) in nv50_head_flush_set_wndw() argument
54 if (asyh->set.curs ) head->func->curs_set(head, asyh); in nv50_head_flush_set_wndw()
56 asyh->olut.offset = nv50_lut_load(&head->olut, in nv50_head_flush_set_wndw()
60 head->func->olut_set(head, asyh); in nv50_head_flush_set_wndw()
[all …]
Dcrc.c16 #include "head.h"
70 nv50_crc_program_ctx(struct nv50_head *head, in nv50_crc_program_ctx() argument
73 struct nv50_disp *disp = nv50_disp(head->base.base.dev); in nv50_crc_program_ctx()
77 core->func->crc->set_ctx(head, ctx); in nv50_crc_program_ctx()
85 struct nv50_head *head = container_of(crc, struct nv50_head, crc); in nv50_crc_ctx_flip_work() local
86 struct drm_crtc *crtc = &head->base.base; in nv50_crc_ctx_flip_work()
106 nv50_crc_program_ctx(head, NULL); in nv50_crc_ctx_flip_work()
107 nv50_crc_program_ctx(head, &crc->ctx[new_idx]); in nv50_crc_ctx_flip_work()
127 nv50_crc_get_entries(struct nv50_head *head, in nv50_crc_get_entries() argument
131 struct drm_crtc *crtc = &head->base.base; in nv50_crc_get_entries()
[all …]

12345678910>>...114