Home
last modified time | relevance | path

Searched defs:head (Results 1 – 25 of 373) sorted by relevance

12345678910>>...15

/linux-4.19.296/include/linux/
Dplist.h95 #define PLIST_HEAD_INIT(head) \ argument
104 #define PLIST_HEAD(head) \ argument
124 plist_head_init(struct plist_head *head) in plist_head_init()
151 #define plist_for_each(pos, head) \ argument
161 #define plist_for_each_continue(pos, head) \ argument
172 #define plist_for_each_safe(pos, n, head) \ argument
181 #define plist_for_each_entry(pos, head, mem) \ argument
193 #define plist_for_each_entry_continue(pos, head, m) \ argument
205 #define plist_for_each_entry_safe(pos, n, head, m) \ argument
212 static inline int plist_head_empty(const struct plist_head *head) in plist_head_empty()
[all …]
Dlist.h77 static inline void list_add(struct list_head *new, struct list_head *head) in list_add()
91 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail()
168 static inline void list_move(struct list_head *list, struct list_head *head) in list_move()
180 struct list_head *head) in list_move_tail()
192 const struct list_head *head) in list_is_last()
201 static inline int list_empty(const struct list_head *head) in list_empty()
219 static inline int list_empty_careful(const struct list_head *head) in list_empty_careful()
229 static inline void list_rotate_left(struct list_head *head) in list_rotate_left()
243 static inline int list_is_singular(const struct list_head *head) in list_is_singular()
249 struct list_head *head, struct list_head *entry) in __list_cut_position()
[all …]
Dbtree-128.h6 static inline void btree_init_mempool128(struct btree_head128 *head, in btree_init_mempool128()
12 static inline int btree_init128(struct btree_head128 *head) in btree_init128()
17 static inline void btree_destroy128(struct btree_head128 *head) in btree_destroy128()
22 static inline void *btree_lookup128(struct btree_head128 *head, u64 k1, u64 k2) in btree_lookup128()
28 static inline void *btree_get_prev128(struct btree_head128 *head, in btree_get_prev128()
41 static inline int btree_insert128(struct btree_head128 *head, u64 k1, u64 k2, in btree_insert128()
49 static inline int btree_update128(struct btree_head128 *head, u64 k1, u64 k2, in btree_update128()
57 static inline void *btree_remove128(struct btree_head128 *head, u64 k1, u64 k2) in btree_remove128()
63 static inline void *btree_last128(struct btree_head128 *head, u64 *k1, u64 *k2) in btree_last128()
90 static inline size_t btree_visitor128(struct btree_head128 *head, in btree_visitor128()
[all …]
Drculist.h77 static inline void list_add_rcu(struct list_head *new, struct list_head *head) in list_add_rcu()
99 struct list_head *head) in list_add_tail_rcu()
246 struct list_head *head, in list_splice_init_rcu()
261 struct list_head *head, in list_splice_tail_init_rcu()
332 #define list_next_or_null_rcu(head, ptr, type, member) \ argument
351 #define list_for_each_entry_rcu(pos, head, member) \ argument
387 #define list_for_each_entry_lockless(pos, head, member) \ argument
410 #define list_for_each_entry_continue_rcu(pos, head, member) \ argument
432 #define list_for_each_entry_from_rcu(pos, head, member) \ argument
484 #define hlist_first_rcu(head) (*((struct hlist_node __rcu **)(&(head)->first))) argument
[all …]
Dcirc_buf.h11 int head; member
16 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1)) argument
21 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size)) argument
26 #define CIRC_CNT_TO_END(head,tail,size) \ argument
32 #define CIRC_SPACE_TO_END(head,tail,size) \ argument
Drculist_nulls.h41 #define hlist_nulls_first_rcu(head) \ argument
152 #define hlist_nulls_for_each_entry_rcu(tpos, pos, head, member) \ argument
167 #define hlist_nulls_for_each_entry_safe(tpos, pos, head, member) \ argument
Dbtree.h216 #define btree_for_each_safel(head, key, val) \ argument
227 #define btree_for_each_safe32(head, key, val) \ argument
239 #define btree_for_each_safe64(head, key, val) \ argument
Dtimerqueue.h34 struct timerqueue_node *timerqueue_getnext(struct timerqueue_head *head) in timerqueue_getnext()
46 static inline void timerqueue_init_head(struct timerqueue_head *head) in timerqueue_init_head()
Dllist.h199 static inline bool llist_empty(const struct llist_head *head) in llist_empty()
219 static inline bool llist_add(struct llist_node *new, struct llist_head *head) in llist_add()
232 static inline struct llist_node *llist_del_all(struct llist_head *head) in llist_del_all()
Dnotifier.h62 struct notifier_block __rcu *head; member
67 struct notifier_block __rcu *head; member
71 struct notifier_block __rcu *head; member
77 struct notifier_block __rcu *head; member
/linux-4.19.296/fs/proc/
Dproc_sysctl.c31 static bool is_empty_dir(struct ctl_table_header *head) in is_empty_dir()
108 struct ctl_table_header *head; in find_entry() local
136 static int insert_entry(struct ctl_table_header *head, struct ctl_table *entry) in insert_entry()
175 static void erase_entry(struct ctl_table_header *head, struct ctl_table *entry) in erase_entry()
182 static void init_header(struct ctl_table_header *head, in init_header()
204 static void erase_header(struct ctl_table_header *head) in erase_header()
266 static void proc_sys_prune_dcache(struct ctl_table_header *head) in proc_sys_prune_dcache()
335 static struct ctl_table_header *sysctl_head_grab(struct ctl_table_header *head) in sysctl_head_grab()
345 static void sysctl_head_finish(struct ctl_table_header *head) in sysctl_head_finish()
367 struct ctl_table_header *head; in lookup_entry() local
[all …]
/linux-4.19.296/lib/
Dbtree.c95 static unsigned long *btree_node_alloc(struct btree_head *head, gfp_t gfp) in btree_node_alloc()
178 static inline void __btree_init(struct btree_head *head) in __btree_init()
184 void btree_init_mempool(struct btree_head *head, mempool_t *mempool) in btree_init_mempool()
191 int btree_init(struct btree_head *head) in btree_init()
201 void btree_destroy(struct btree_head *head) in btree_destroy()
209 void *btree_last(struct btree_head *head, struct btree_geo *geo, in btree_last()
243 void *btree_lookup(struct btree_head *head, struct btree_geo *geo, in btree_lookup()
273 int btree_update(struct btree_head *head, struct btree_geo *geo, in btree_update()
313 void *btree_get_prev(struct btree_head *head, struct btree_geo *geo, in btree_get_prev()
390 static unsigned long *find_level(struct btree_head *head, struct btree_geo *geo, in find_level()
[all …]
Dllist.c39 struct llist_head *head) in llist_add_batch()
65 struct llist_node *llist_del_first(struct llist_head *head) in llist_del_first()
91 struct llist_node *llist_reverse_order(struct llist_node *head) in llist_reverse_order()
Dplist.c57 static void plist_check_head(struct plist_head *head) in plist_check_head()
74 void plist_add(struct plist_node *node, struct plist_head *head) in plist_add()
113 void plist_del(struct plist_node *node, struct plist_head *head) in plist_del()
146 void plist_requeue(struct plist_node *node, struct plist_head *head) in plist_requeue()
Dlist_sort.c22 struct list_head head, *tail = &head; in merge() local
49 struct list_head *head, in merge_and_restore_back_links()
102 void list_sort(void *priv, struct list_head *head, in list_sort()
Dtimerqueue.c40 bool timerqueue_add(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_add()
76 bool timerqueue_del(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_del()
/linux-4.19.296/drivers/misc/mic/scif/
Dscif_rma_list.c28 void scif_insert_tcw(struct scif_window *window, struct list_head *head) in scif_insert_tcw()
58 void scif_insert_window(struct scif_window *window, struct list_head *head) in scif_insert_window()
87 struct list_head *item, *temp, *head = req->head; in scif_query_tcw() local
207 struct list_head *head = &ep->rma_info.reg_list; in scif_rma_list_unregister() local
239 struct list_head *head = &ep->rma_info.reg_list; in scif_unmap_all_windows() local
261 struct list_head *head = &ep->rma_info.reg_list; in scif_unregister_all_windows() local
/linux-4.19.296/fs/gfs2/
Drecovery.c60 struct list_head *head = &jd->jd_revoke_list; in gfs2_revoke_add() local
113 struct list_head *head = &jd->jd_revoke_list; in gfs2_revoke_clean() local
138 struct gfs2_log_header_host *head) in get_log_header()
187 struct gfs2_log_header_host *head) in find_good_lh()
218 static int jhead_scan(struct gfs2_jdesc *jd, struct gfs2_log_header_host *head) in jhead_scan()
258 int gfs2_find_jhead(struct gfs2_jdesc *jd, struct gfs2_log_header_host *head) in gfs2_find_jhead()
375 struct gfs2_log_header_host *head) in clean_journal()
411 struct gfs2_log_header_host head; in gfs2_recover_func() local
/linux-4.19.296/drivers/isdn/capi/
Dcapilib.c81 void capilib_new_ncci(struct list_head *head, u16 applid, u32 ncci, u32 winsize) in capilib_new_ncci()
105 void capilib_free_ncci(struct list_head *head, u16 applid, u32 ncci) in capilib_free_ncci()
126 void capilib_release_appl(struct list_head *head, u16 applid) in capilib_release_appl()
143 void capilib_release(struct list_head *head) in capilib_release()
158 u16 capilib_data_b3_req(struct list_head *head, u16 applid, u32 ncci, u16 msgid) in capilib_data_b3_req()
181 void capilib_data_b3_conf(struct list_head *head, u16 applid, u32 ncci, u16 msgid) in capilib_data_b3_conf()
/linux-4.19.296/fs/nilfs2/
Dsegbuf.h85 #define NILFS_LIST_SEGBUF(head) \ argument
89 #define NILFS_LAST_SEGBUF(head) NILFS_LIST_SEGBUF((head)->prev) argument
90 #define NILFS_FIRST_SEGBUF(head) NILFS_LIST_SEGBUF((head)->next) argument
91 #define NILFS_SEGBUF_IS_LAST(segbuf, head) ((segbuf)->sb_list.next == (head)) argument
97 #define NILFS_SEGBUF_FIRST_BH(head) \ argument
102 #define NILFS_SEGBUF_BH_IS_LAST(bh, head) ((bh)->b_assoc_buffers.next == head) argument
Dpage.c143 struct buffer_head *bh, *head; in nilfs_page_buffers_clean() local
173 struct buffer_head *bh, *head; in nilfs_page_bug() local
412 struct buffer_head *bh, *head; in nilfs_clear_dirty_page() local
438 struct buffer_head *bh, *head; in nilfs_page_count_clean_buffers() local
537 struct buffer_head *bh, *head; in nilfs_find_uncommitted_extent() local
/linux-4.19.296/fs/
Dseq_file.c887 struct list_head *seq_list_start(struct list_head *head, loff_t pos) in seq_list_start()
899 struct list_head *seq_list_start_head(struct list_head *head, loff_t pos) in seq_list_start_head()
908 struct list_head *seq_list_next(void *v, struct list_head *head, loff_t *ppos) in seq_list_next()
925 struct hlist_node *seq_hlist_start(struct hlist_head *head, loff_t pos) in seq_hlist_start()
944 struct hlist_node *seq_hlist_start_head(struct hlist_head *head, loff_t pos) in seq_hlist_start_head()
961 struct hlist_node *seq_hlist_next(void *v, struct hlist_head *head, in seq_hlist_next()
985 struct hlist_node *seq_hlist_start_rcu(struct hlist_head *head, in seq_hlist_start_rcu()
1009 struct hlist_node *seq_hlist_start_head_rcu(struct hlist_head *head, in seq_hlist_start_head_rcu()
1032 struct hlist_head *head, in seq_hlist_next_rcu()
1054 seq_hlist_start_percpu(struct hlist_head __percpu *head, int *cpu, loff_t pos) in seq_hlist_start_percpu()
[all …]
Dmbcache.c78 struct hlist_bl_head *head; in mb_cache_entry_create() local
128 struct hlist_bl_head *head; in __mb_cache_entry_free() local
157 struct hlist_bl_head *head; in __entry_find() local
225 struct hlist_bl_head *head; in mb_cache_entry_get() local
252 struct hlist_bl_head *head; in mb_cache_entry_delete() local
/linux-4.19.296/drivers/char/agp/
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()
40 struct list_head *pos, *tmp, *head = &list->list, *start = head->next; in agp_3_5_dev_list_sort() local
81 struct list_head *head = &dev_list->list, *pos; in agp_3_5_isochronous_node_enable() local
292 struct list_head *head = &dev_list->list, *pos; in agp_3_5_nonisochronous_node_enable() local
327 struct list_head *head, *pos; in agp_3_5_enable() local
/linux-4.19.296/drivers/misc/ocxl/
Dpasid.c13 static void dump_list(struct list_head *head, char *type_str) in dump_list()
24 static int range_alloc(struct list_head *head, u32 size, int max_id, in range_alloc()
61 static void range_free(struct list_head *head, u32 start, u32 size, in range_free()

12345678910>>...15