Home
last modified time | relevance | path

Searched refs:head (Results 1 – 25 of 174) sorted by relevance

1234567

/include/linux/
Dplist.h86 #define PLIST_HEAD_INIT(head) \ argument
88 .node_list = LIST_HEAD_INIT((head).node_list) \
95 #define PLIST_HEAD(head) \ argument
96 struct plist_head head = PLIST_HEAD_INIT(head)
115 plist_head_init(struct plist_head *head) in plist_head_init() argument
117 INIT_LIST_HEAD(&head->node_list); in plist_head_init()
132 extern void plist_add(struct plist_node *node, struct plist_head *head);
133 extern void plist_del(struct plist_node *node, struct plist_head *head);
135 extern void plist_requeue(struct plist_node *node, struct plist_head *head);
142 #define plist_for_each(pos, head) \ argument
[all …]
Dlist.h167 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()
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()
296 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
299 list_add(list, head); in list_move()
308 struct list_head *head) in list_move_tail() argument
311 list_add_tail(list, head); in list_move_tail()
323 static inline void list_bulk_move_tail(struct list_head *head, in list_bulk_move_tail() argument
330 head->prev->next = first; in list_bulk_move_tail()
[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.h67 void btree_init_mempool(struct btree_head *head, mempool_t *mempool);
79 int __must_check btree_init(struct btree_head *head);
89 void btree_destroy(struct btree_head *head);
100 void *btree_lookup(struct btree_head *head, struct btree_geo *geo,
115 int __must_check btree_insert(struct btree_head *head, struct btree_geo *geo,
128 int btree_update(struct btree_head *head, struct btree_geo *geo,
140 void *btree_remove(struct btree_head *head, struct btree_geo *geo,
172 void *btree_last(struct btree_head *head, struct btree_geo *geo,
186 void *btree_get_prev(struct btree_head *head, struct btree_geo *geo,
191 size_t btree_visitor(struct btree_head *head, struct btree_geo *geo,
[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
28 int n = ((head) + end) & ((size)-1); \
32 #define CIRC_SPACE_TO_END(head,tail,size) \ argument
33 ({int end = (size) - 1 - (head); \
Dllist.h216 static inline bool llist_empty(const struct llist_head *head) in llist_empty() argument
218 return READ_ONCE(head->first) == NULL; in llist_empty()
228 struct llist_head *head);
232 struct llist_head *head) in __llist_add_batch() argument
234 new_last->next = head->first; in __llist_add_batch()
235 head->first = new_first; in __llist_add_batch()
246 static inline bool llist_add(struct llist_node *new, struct llist_head *head) in llist_add() argument
248 return llist_add_batch(new, new, head); in llist_add()
251 static inline bool __llist_add(struct llist_node *new, struct llist_head *head) in __llist_add() argument
253 return __llist_add_batch(new, new, head); in __llist_add()
[all …]
Drcu_segcblist.h22 struct rcu_head *head; member
27 #define RCU_CBLIST_INITIALIZER(n) { .head = NULL, .tail = &n.head }
191 struct rcu_head *head; member
205 .head = NULL, \
206 .tails[RCU_DONE_TAIL] = &n.head, \
207 .tails[RCU_WAIT_TAIL] = &n.head, \
208 .tails[RCU_NEXT_READY_TAIL] = &n.head, \
209 .tails[RCU_NEXT_TAIL] = &n.head, \
Dobjpool.h54 uint32_t head; member
70 typedef int (*objpool_fini_cb)(struct objpool_head *head, void *context);
130 uint32_t head = smp_load_acquire(&slot->head); in __objpool_try_get_slot() local
132 while (head != READ_ONCE(slot->last)) { in __objpool_try_get_slot()
147 if (READ_ONCE(slot->last) - head - 1 >= pool->nr_objs) { in __objpool_try_get_slot()
148 head = READ_ONCE(slot->head); in __objpool_try_get_slot()
153 obj = READ_ONCE(slot->entries[head & slot->mask]); in __objpool_try_get_slot()
156 if (try_cmpxchg_release(&slot->head, &head, head + 1)) in __objpool_try_get_slot()
195 uint32_t head, tail; in __objpool_try_add_slot() local
201 head = READ_ONCE(slot->head); in __objpool_try_add_slot()
[all …]
Dtimerqueue.h8 extern bool timerqueue_add(struct timerqueue_head *head,
10 extern bool timerqueue_del(struct timerqueue_head *head,
23 struct timerqueue_node *timerqueue_getnext(struct timerqueue_head *head) in timerqueue_getnext() argument
25 struct rb_node *leftmost = rb_first_cached(&head->rb_root); in timerqueue_getnext()
40 static inline void timerqueue_init_head(struct timerqueue_head *head) in timerqueue_init_head() argument
42 head->rb_root = RB_ROOT_CACHED; in timerqueue_init_head()
Drculist.h42 #define list_tail_rcu(head) (*((struct list_head __rcu **)(&(head)->prev))) argument
104 static inline void list_add_rcu(struct list_head *new, struct list_head *head) in list_add_rcu() argument
106 __list_add_rcu(new, head, head->next); in list_add_rcu()
126 struct list_head *head) in list_add_tail_rcu() argument
128 __list_add_rcu(new, head->prev, head); in list_add_tail_rcu()
278 struct list_head *head, in list_splice_init_rcu() argument
282 __list_splice_init_rcu(list, head, head->next, sync); in list_splice_init_rcu()
293 struct list_head *head, in list_splice_tail_init_rcu() argument
297 __list_splice_init_rcu(list, head->prev, head, sync); in list_splice_tail_init_rcu()
372 #define list_next_or_null_rcu(head, ptr, type, member) \ argument
[all …]
Drcutiny.h101 static inline void __kvfree_call_rcu(struct rcu_head *head, void *ptr) in __kvfree_call_rcu() argument
103 if (head) { in __kvfree_call_rcu()
104 call_rcu(head, (rcu_callback_t) ((void *) head - ptr)); in __kvfree_call_rcu()
120 void kvfree_call_rcu(struct rcu_head *head, void *ptr);
122 static inline void kvfree_call_rcu(struct rcu_head *head, void *ptr) in kvfree_call_rcu() argument
124 __kvfree_call_rcu(head, ptr); in kvfree_call_rcu()
Dpipe_fs_i.h61 unsigned int head; member
148 static inline bool pipe_empty(unsigned int head, unsigned int tail) in pipe_empty() argument
150 return head == tail; in pipe_empty()
158 static inline unsigned int pipe_occupancy(unsigned int head, unsigned int tail) in pipe_occupancy() argument
160 return head - tail; in pipe_occupancy()
169 static inline bool pipe_full(unsigned int head, unsigned int tail, in pipe_full() argument
172 return pipe_occupancy(head, tail) >= limit; in pipe_full()
192 return pipe_buf(pipe, pipe->head); in pipe_head_buf()
253 while (pipe->head > old_head) in pipe_discard_from()
254 pipe_buf_release(pipe, &pipe->bufs[--pipe->head & mask]); in pipe_discard_from()
Dnotifier.h62 struct notifier_block __rcu *head; member
67 struct notifier_block __rcu *head; member
71 struct notifier_block __rcu *head; member
78 struct notifier_block __rcu *head; member
83 (name)->head = NULL; \
87 (name)->head = NULL; \
90 (name)->head = NULL; \
100 .head = NULL }
103 .head = NULL }
105 .head = NULL }
[all …]
Ddma-fence-array.h78 #define dma_fence_array_for_each(fence, index, head) \ argument
79 for (index = 0, fence = dma_fence_array_first(head); fence; \
80 ++(index), fence = dma_fence_array_next(head, index))
95 struct dma_fence *dma_fence_array_first(struct dma_fence *head);
96 struct dma_fence *dma_fence_array_next(struct dma_fence *head,
Dresource_ext.h32 extern void resource_list_free(struct list_head *head);
35 struct list_head *head) in resource_list_add() argument
37 list_add(&entry->node, head); in resource_list_add()
41 struct list_head *head) in resource_list_add_tail() argument
43 list_add_tail(&entry->node, head); in resource_list_add_tail()
Dacpi_iort.h38 struct list_head *head);
40 struct list_head *head);
44 void iort_iommu_get_resv_regions(struct device *dev, struct list_head *head);
54 void iort_get_rmr_sids(struct fwnode_handle *iommu_fwnode, struct list_head *head) { } in iort_get_rmr_sids() argument
56 void iort_put_rmr_sids(struct fwnode_handle *iommu_fwnode, struct list_head *head) { } in iort_put_rmr_sids() argument
63 void iort_iommu_get_resv_regions(struct device *dev, struct list_head *head) in iort_iommu_get_resv_regions() argument
Dposix-timers.h49 struct timerqueue_head *head; member
56 static inline bool cpu_timer_enqueue(struct timerqueue_head *head, in cpu_timer_enqueue() argument
59 ctmr->head = head; in cpu_timer_enqueue()
60 return timerqueue_add(head, &ctmr->node); in cpu_timer_enqueue()
65 return !!ctmr->head; in cpu_timer_queued()
71 timerqueue_del(ctmr->head, &ctmr->node); in cpu_timer_dequeue()
72 ctmr->head = NULL; in cpu_timer_dequeue()
Drculist_nulls.h45 #define hlist_nulls_first_rcu(head) \ argument
46 (*((struct hlist_nulls_node __rcu __force **)&(head)->first))
167 #define hlist_nulls_for_each_entry_rcu(tpos, pos, head, member) \ argument
169 pos = rcu_dereference_raw(hlist_nulls_first_rcu(head)); \
182 #define hlist_nulls_for_each_entry_safe(tpos, pos, head, member) \ argument
184 pos = rcu_dereference_raw(hlist_nulls_first_rcu(head)); \
Ddma-fence-unwrap.h33 struct dma_fence *dma_fence_unwrap_first(struct dma_fence *head,
47 #define dma_fence_unwrap_for_each(fence, cursor, head) \ argument
48 for (fence = dma_fence_unwrap_first(head, cursor); fence; \
Dseq_file.h299 extern struct list_head *seq_list_start(struct list_head *head,
301 extern struct list_head *seq_list_start_head(struct list_head *head,
303 extern struct list_head *seq_list_next(void *v, struct list_head *head,
306 extern struct list_head *seq_list_start_rcu(struct list_head *head, loff_t pos);
307 extern struct list_head *seq_list_start_head_rcu(struct list_head *head, loff_t pos);
308 extern struct list_head *seq_list_next_rcu(void *v, struct list_head *head, loff_t *ppos);
314 extern struct hlist_node *seq_hlist_start(struct hlist_head *head,
316 extern struct hlist_node *seq_hlist_start_head(struct hlist_head *head,
318 extern struct hlist_node *seq_hlist_next(void *v, struct hlist_head *head,
321 extern struct hlist_node *seq_hlist_start_rcu(struct hlist_head *head,
[all …]
/include/linux/sched/
Dwake_q.h52 static inline void wake_q_init(struct wake_q_head *head) in wake_q_init() argument
54 head->first = WAKE_Q_TAIL; in wake_q_init()
55 head->lastp = &head->first; in wake_q_init()
56 head->count = 0; in wake_q_init()
59 static inline bool wake_q_empty(struct wake_q_head *head) in wake_q_empty() argument
61 return head->first == WAKE_Q_TAIL; in wake_q_empty()
64 extern void wake_q_add(struct wake_q_head *head, struct task_struct *task);
65 extern void wake_q_add_safe(struct wake_q_head *head, struct task_struct *task);
66 extern void wake_up_q(struct wake_q_head *head);
/include/drm/
Dspsc_queue.h40 struct spsc_node *head; member
50 queue->head = NULL; in spsc_queue_init()
51 atomic_long_set(&queue->tail, (long)&queue->head); in spsc_queue_init()
57 return queue->head; in spsc_queue_peek()
87 return tail == &queue->head; in spsc_queue_push()
98 node = READ_ONCE(queue->head); in spsc_queue_pop()
104 WRITE_ONCE(queue->head, next); in spsc_queue_pop()
110 (long)&node->next, (long) &queue->head) != (long)&node->next) { in spsc_queue_pop()
114 } while (unlikely(!(queue->head = READ_ONCE(node->next)))); in spsc_queue_pop()
/include/uapi/linux/
Dvirtio_iommu.h75 struct virtio_iommu_req_head head; member
84 struct virtio_iommu_req_head head; member
100 struct virtio_iommu_req_head head; member
110 struct virtio_iommu_req_head head; member
132 struct virtio_iommu_probe_property head; member
140 struct virtio_iommu_req_head head; member
Dfsmap.h82 struct fsmap_head *head) in fsmap_advance() argument
84 head->fmh_keys[0] = head->fmh_recs[head->fmh_entries - 1]; in fsmap_advance()

1234567