Home
last modified time | relevance | path

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

12345678910>>...101

/linux/drivers/gpu/drm/nouveau/dispnv04/
H A 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 …]
H A 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/drivers/scsi/aic7xxx/
H A 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/security/tomoyo/
H A 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/tools/include/linux/
H A 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/fs/btrfs/tests/
H A Ddelayed-refs-tests.c44 struct btrfs_delayed_ref_head *head) in delete_delayed_ref_head() argument
51 spin_lock(&head->lock); in delete_delayed_ref_head()
52 btrfs_delete_ref_head(fs_info, delayed_refs, head); in delete_delayed_ref_head()
53 spin_unlock(&head->lock); in delete_delayed_ref_head()
56 btrfs_delayed_ref_unlock(head); in delete_delayed_ref_head()
57 btrfs_put_delayed_ref_head(head); in delete_delayed_ref_head()
60 static void delete_delayed_ref_node(struct btrfs_delayed_ref_head *head, in delete_delayed_ref_node() argument
63 rb_erase_cached(&node->ref_node, &head->ref_tree); in delete_delayed_ref_node()
70 static int validate_ref_head(struct btrfs_delayed_ref_head *head, in validate_ref_head() argument
73 if (head->bytenr != check->bytenr) { in validate_ref_head()
[all …]
/linux/drivers/nvme/host/
H A Dmultipath.c156 spin_lock_irqsave(&ns->head->requeue_lock, flags); in nvme_failover_req()
158 bio_set_dev(bio, ns->head->disk->part0); in nvme_failover_req()
172 blk_steal_bios(&ns->head->requeue_list, req); in nvme_failover_req()
173 spin_unlock_irqrestore(&ns->head->requeue_lock, flags); in nvme_failover_req()
177 kblockd_schedule_work(&ns->head->requeue_work); in nvme_failover_req()
183 struct gendisk *disk = ns->head->disk; in nvme_mpath_start_request()
185 if ((READ_ONCE(ns->head->subsys->iopolicy) == NVME_IOPOLICY_QD) && in nvme_mpath_start_request()
210 bdev_end_io_acct(ns->head->disk->part0, req_op(rq), in nvme_mpath_end_request()
223 if (!ns->head->disk) in nvme_kick_requeue_lists()
225 kblockd_schedule_work(&ns->head->requeue_work); in nvme_kick_requeue_lists()
[all …]
/linux/net/sched/
H A 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 …]
H A 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/scripts/include/
H A Dlist.h76 * @head: list head to add it after
78 * Insert a new entry after the specified head.
81 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
83 __list_add(new, head, head->next); in list_add()
89 * @head: list head to add it before
91 * Insert a new entry before the specified head.
94 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
96 __list_add(new, head->prev, head); in list_add_tail()
161 * list_move - delete from one list and add as another's head
163 * @head: the head that will precede our entry
[all …]
/linux/include/linux/
H A Dplist.h35 * HEAD| NODE(S)
84 * @head: struct plist_head variable name
86 #define PLIST_HEAD_INIT(head) \ argument
88 .node_list = LIST_HEAD_INIT((head).node_list) \
93 * @head: name for struct plist_head variable
95 #define PLIST_HEAD(head) \ argument
96 struct plist_head head = PLIST_HEAD_INIT(head)
112 * @head: &struct plist_head pointer
115 plist_head_init(struct plist_head *head) in plist_head_init() argument
117 INIT_LIST_HEAD(&head->node_list); in plist_head_init()
[all …]
H A 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 …]
H A 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 …]
H A 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/net/netlabel/
H A 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 …]
H A 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/drivers/gpu/drm/nouveau/nvkm/engine/disp/
H A 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 …]
/linux/kernel/bpf/
H A Dpercpu_freelist.c15 struct pcpu_freelist_head *head = per_cpu_ptr(s->freelist, cpu); in pcpu_freelist_init() local
17 raw_res_spin_lock_init(&head->lock); in pcpu_freelist_init()
18 head->first = NULL; in pcpu_freelist_init()
28 static inline void pcpu_freelist_push_node(struct pcpu_freelist_head *head, in pcpu_freelist_destroy()
31 node->next = head->first; in pcpu_freelist_push_node()
32 WRITE_ONCE(head->first, node); in pcpu_freelist_push_node()
35 static inline bool ___pcpu_freelist_push(struct pcpu_freelist_head *head, in pcpu_freelist_push_node()
38 if (raw_res_spin_lock(&head->lock)) in ___pcpu_freelist_push()
40 pcpu_freelist_push_node(head, node); in ___pcpu_freelist_push()
41 raw_res_spin_unlock(&head in ___pcpu_freelist_push()
30 pcpu_freelist_push_node(struct pcpu_freelist_head * head,struct pcpu_freelist_node * node) pcpu_freelist_push_node() argument
37 ___pcpu_freelist_push(struct pcpu_freelist_head * head,struct pcpu_freelist_node * node) ___pcpu_freelist_push() argument
64 struct pcpu_freelist_head *head; ___pcpu_freelist_push_nmi() local
102 struct pcpu_freelist_head *head; pcpu_freelist_populate() local
123 struct pcpu_freelist_head *head; ___pcpu_freelist_pop() local
155 struct pcpu_freelist_head *head; ___pcpu_freelist_pop_nmi() local
[all...]
/linux/scripts/gdb/linux/
H A 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/drivers/gpu/drm/nouveau/dispnv50/
H A Dhead.c22 #include "head.h"
40 nv50_head_flush_clr(struct nv50_head *head, in nv50_head_flush_clr() argument
47 lockdep_assert_held(&head->disp->mutex); in nv50_head_flush_clr()
49 if (clr.crc) nv50_crc_atomic_clr(head); in nv50_head_flush_clr()
50 if (clr.olut) head->func->olut_clr(head); in nv50_head_flush_clr()
51 if (clr.core) head->func->core_clr(head); in nv50_head_flush_clr()
52 if (clr.curs) head->func->curs_clr(head); in nv50_head_flush_clr()
56 nv50_head_flush_set_wndw(struct nv50_head *head, struct nv50_head_atom *asyh) in nv50_head_flush_set_wndw() argument
58 if (asyh->set.curs ) head->func->curs_set(head, asyh); in nv50_head_flush_set_wndw()
60 asyh->olut.offset = nv50_lut_load(&head->olut, in nv50_head_flush_set_wndw()
[all …]
/linux/lib/
H A Dbtree.c92 static unsigned long *btree_node_alloc(struct btree_head *head, gfp_t gfp) in btree_node_alloc() argument
96 node = mempool_alloc(head->mempool, gfp); in btree_node_alloc()
175 static inline void __btree_init(struct btree_head *head) in __btree_init() argument
177 head->node = NULL; in __btree_init()
178 head->height = 0; in __btree_init()
181 void btree_init_mempool(struct btree_head *head, mempool_t *mempool) in btree_init_mempool() argument
183 __btree_init(head); in btree_init_mempool()
184 head->mempool = mempool; in btree_init_mempool()
188 int btree_init(struct btree_head *head) in btree_init() argument
190 __btree_init(head); in btree_init()
[all …]
/linux/tools/testing/selftests/futex/functional/
H A Drobust_list.c47 static int set_robust_list(struct robust_list_head *head, size_t len) in set_robust_list() argument
49 return syscall(SYS_set_robust_list, head, len); in set_robust_list()
52 static int get_robust_list(int pid, struct robust_list_head **head, size_t *len_ptr) in get_robust_list() argument
54 return syscall(SYS_get_robust_list, pid, head, len_ptr); in get_robust_list()
92 static int set_list(struct robust_list_head *head) in set_list() argument
96 ret = set_robust_list(head, sizeof(*head)); in set_list()
100 head->futex_offset = (size_t) offsetof(struct lock_struct, futex) - in set_list()
102 head->list.next = &head->list; in set_list()
103 head->list_op_pending = NULL; in set_list()
111 static int mutex_lock(struct lock_struct *lock, struct robust_list_head *head, bool error_inject) in mutex_lock() argument
[all …]
/linux/fs/proc/
H A Dproc_sysctl.c93 static int insert_links(struct ctl_table_header *head);
116 struct ctl_table_header *head; in find_entry() local
129 head = ctl_node->header; in find_entry()
130 entry = &head->ctl_table[ctl_node - head->node]; in find_entry()
139 *phead = head; in find_entry()
146 static int insert_entry(struct ctl_table_header *head, const struct ctl_table *entry) in insert_entry() argument
148 struct rb_node *node = &head->node[entry - head->ctl_table].node; in insert_entry()
149 struct rb_node **p = &head->parent->root.rb_node; in insert_entry()
174 sysctl_print_dir(head->parent); in insert_entry()
181 rb_insert_color(node, &head->parent->root); in insert_entry()
[all …]
/linux/drivers/scsi/sym53c8xx_2/
H A Dsym_misc.h42 static inline struct sym_quehead *sym_que_first(struct sym_quehead *head) in sym_que_first() argument
44 return (head->flink == head) ? 0 : head->flink; in sym_que_first()
47 static inline struct sym_quehead *sym_que_last(struct sym_quehead *head) in sym_que_last() argument
49 return (head->blink == head) ? 0 : head->blink; in sym_que_last()
69 static inline int sym_que_empty(struct sym_quehead *head) in sym_que_empty() argument
71 return head->flink == head; in sym_que_empty()
75 struct sym_quehead *head) in sym_que_splice() argument
81 struct sym_quehead *at = head->flink; in sym_que_splice()
83 first->blink = head; in sym_que_splice()
84 head->flink = first; in sym_que_splice()
[all …]
/linux/scripts/
H A 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 …]

12345678910>>...101