Home
last modified time | relevance | path

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

12345678

/include/linux/
A Dplist.h86 #define PLIST_HEAD_INIT(head) \ argument
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()
142 #define plist_for_each(pos, head) \ argument
205 return list_empty(&head->node_list); in plist_head_empty()
228 WARN_ON(plist_head_empty(head)); \
245 WARN_ON(plist_head_empty(head)); \
275 return list_entry(head->node_list.next, in plist_first()
[all …]
A Dlist.h169 __list_add(new, head, head->next); in list_add()
183 __list_add(new, head->prev, head); in list_add_tail()
333 last->next = head; in list_bulk_move_tail()
373 return READ_ONCE(head->next) == head; in list_empty()
410 return list_is_head(next, head) && (next == READ_ONCE(head->prev)); in list_empty_careful()
451 return !list_empty(head) && (head->next == head->prev); in list_is_singular()
485 if (list_is_singular(head) && !list_is_head(entry, head) && (entry != head->next)) in list_cut_position()
546 __list_splice(list, head, head->next); in list_splice()
558 __list_splice(list, head->prev, head); in list_splice_tail()
572 __list_splice(list, head, head->next); in list_splice_init()
[all …]
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()
41 return btree_lookup(&head->h, BTREE_TYPE_GEO, &_key); in BTREE_FN()
55 return btree_update(&head->h, BTREE_TYPE_GEO, &_key, val); in BTREE_FN()
61 return btree_remove(&head->h, BTREE_TYPE_GEO, &_key); in BTREE_FN()
67 void *val = btree_last(&head->h, BTREE_TYPE_GEO, &_key); in BTREE_FN()
[all …]
A Dbtree-128.h9 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()
19 btree_destroy(&head->h); in btree_destroy128()
34 val = btree_get_prev(&head->h, &btree_geo128, in btree_get_prev128()
45 return btree_insert(&head->h, &btree_geo128, in btree_insert128()
53 return btree_update(&head->h, &btree_geo128, in btree_update128()
94 return btree_visitor(&head->h, &btree_geo128, opaque, in btree_visitor128()
106 #define btree_for_each_safe128(head, k1, k2, val) \ argument
107 for (val = btree_last128(head, &k1, &k2); \
[all …]
A Dbtree.h79 int __must_check btree_init(struct btree_head *head);
89 void btree_destroy(struct btree_head *head);
216 #define btree_for_each_safel(head, key, val) \ argument
217 for (val = btree_lastl(head, &key); \
219 val = btree_get_prevl(head, &key))
227 #define btree_for_each_safe32(head, key, val) \ argument
228 for (val = btree_last32(head, &key); \
230 val = btree_get_prev32(head, &key))
239 #define btree_for_each_safe64(head, key, val) \ argument
240 for (val = btree_last64(head, &key); \
[all …]
A 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); \
A Dllist.h218 return READ_ONCE(head->first) == NULL; in llist_empty()
236 struct llist_head *head) in llist_add_batch() argument
249 struct llist_head *head) in __llist_add_batch() argument
251 new_last->next = head->first; in __llist_add_batch()
252 head->first = new_first; in __llist_add_batch()
265 return llist_add_batch(new, new, head); in llist_add()
270 return __llist_add_batch(new, new, head); in __llist_add()
283 return xchg(&head->first, NULL); in llist_del_all()
288 struct llist_node *first = head->first; in __llist_del_all()
290 head->first = NULL; in __llist_del_all()
[all …]
A 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, \
A 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()
194 uint32_t head, tail; in __objpool_try_add_slot() local
200 head = READ_ONCE(slot->head); in __objpool_try_add_slot()
[all …]
A 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()
A Drculist.h53 #define list_tail_rcu(head) (*((struct list_head __rcu **)(&(head)->prev))) argument
117 __list_add_rcu(new, head, head->next); in list_add_rcu()
137 struct list_head *head) in list_add_tail_rcu() argument
139 __list_add_rcu(new, head->prev, head); in list_add_tail_rcu()
322 struct list_head *head, in list_splice_init_rcu() argument
326 __list_splice_init_rcu(list, head, head->next, sync); in list_splice_init_rcu()
341 __list_splice_init_rcu(list, head->prev, head, sync); in list_splice_tail_init_rcu()
439 &pos->member != (head); \
458 &pos->member != (head); \
492 &pos->member != (head); \
[all …]
A Dpipe_fs_i.h56 pipe_index_t head; member
94 pipe_index_t head; member
186 return (pipe_index_t)(head - tail); in pipe_occupancy()
194 static inline bool pipe_empty(unsigned int head, unsigned int tail) in pipe_empty() argument
196 return !pipe_occupancy(head, tail); in pipe_empty()
205 static inline bool pipe_full(unsigned int head, unsigned int tail, in pipe_full() argument
208 return pipe_occupancy(head, tail) >= limit; in pipe_full()
217 return pipe_full(pipe->head, pipe->tail, pipe->max_usage); in pipe_is_full()
226 return pipe_empty(pipe->head, pipe->tail); in pipe_is_empty()
235 return pipe_occupancy(pipe->head, pipe->tail); in pipe_buf_usage()
[all …]
A 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 …]
A 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,
A 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()
A 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
A 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)); \
A 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; \
A Dseq_file.h300 extern struct list_head *seq_list_start(struct list_head *head,
302 extern struct list_head *seq_list_start_head(struct list_head *head,
304 extern struct list_head *seq_list_next(void *v, struct list_head *head,
307 extern struct list_head *seq_list_start_rcu(struct list_head *head, loff_t pos);
308 extern struct list_head *seq_list_start_head_rcu(struct list_head *head, loff_t pos);
315 extern struct hlist_node *seq_hlist_start(struct hlist_head *head,
317 extern struct hlist_node *seq_hlist_start_head(struct hlist_head *head,
319 extern struct hlist_node *seq_hlist_next(void *v, struct hlist_head *head,
322 extern struct hlist_node *seq_hlist_start_rcu(struct hlist_head *head,
324 extern struct hlist_node *seq_hlist_start_head_rcu(struct hlist_head *head,
[all …]
/include/uapi/linux/
A Dvirtio_rtc.h63 struct virtio_rtc_req_head head; member
69 struct virtio_rtc_resp_head head; member
76 struct virtio_rtc_req_head head; member
89 struct virtio_rtc_resp_head head; member
99 struct virtio_rtc_req_head head; member
104 struct virtio_rtc_resp_head head; member
113 struct virtio_rtc_req_head head; member
138 struct virtio_rtc_req_head head; member
154 struct virtio_rtc_req_head head; member
170 struct virtio_rtc_req_head head; member
[all …]
A 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
A 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()
/include/linux/sched/
A Dwake_q.h51 static inline void wake_q_init(struct wake_q_head *head) in wake_q_init() argument
53 head->first = WAKE_Q_TAIL; in wake_q_init()
54 head->lastp = &head->first; in wake_q_init()
57 static inline bool wake_q_empty(struct wake_q_head *head) in wake_q_empty() argument
59 return head->first == WAKE_Q_TAIL; in wake_q_empty()
62 extern void wake_q_add(struct wake_q_head *head, struct task_struct *task);
63 extern void wake_q_add_safe(struct wake_q_head *head, struct task_struct *task);
64 extern void wake_up_q(struct wake_q_head *head);
/include/drm/
A 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/net/
A Dipv6_frag.h68 struct sk_buff *head; in ip6frag_expire_frag_queue() local
98 head = inet_frag_pull_head(&fq->q); in ip6frag_expire_frag_queue()
99 if (!head) in ip6frag_expire_frag_queue()
102 head->dev = dev; in ip6frag_expire_frag_queue()
105 icmpv6_send(head, ICMPV6_TIME_EXCEED, ICMPV6_EXC_FRAGTIME, 0); in ip6frag_expire_frag_queue()
106 kfree_skb_reason(head, SKB_DROP_REASON_FRAG_REASM_TIMEOUT); in ip6frag_expire_frag_queue()

Completed in 95 milliseconds

12345678