libosmocore  0.9.3
Osmocom core library
linuxlist.h
1 #pragma once
2 
3 #include <stddef.h>
4 
5 #ifndef inline
6 #define inline __inline__
7 #endif
8 
9 static inline void prefetch(const void *x) {;}
10 
19 #define container_of(ptr, type, member) ({ \
20  const typeof( ((type *)0)->member ) *__mptr = (ptr); \
21  (type *)( (char *)__mptr - offsetof(type, member) );})
22 
23 
24 /*
25  * These are non-NULL pointers that will result in page faults
26  * under normal circumstances, used to verify that nobody uses
27  * non-initialized llist entries.
28  */
29 #define LLIST_POISON1 ((void *) 0x00100100)
30 #define LLIST_POISON2 ((void *) 0x00200200)
31 
32 /*
33  * Simple doubly linked llist implementation.
34  *
35  * Some of the internal functions ("__xxx") are useful when
36  * manipulating whole llists rather than single entries, as
37  * sometimes we already know the next/prev entries and we can
38  * generate better code by using them directly rather than
39  * using the generic single-entry routines.
40  */
41 
42 struct llist_head {
43  struct llist_head *next, *prev;
44 };
45 
46 #define LLIST_HEAD_INIT(name) { &(name), &(name) }
47 
48 #define LLIST_HEAD(name) \
49  struct llist_head name = LLIST_HEAD_INIT(name)
50 
51 #define INIT_LLIST_HEAD(ptr) do { \
52  (ptr)->next = (ptr); (ptr)->prev = (ptr); \
53 } while (0)
54 
55 /*
56  * Insert a new entry between two known consecutive entries.
57  *
58  * This is only for internal llist manipulation where we know
59  * the prev/next entries already!
60  */
61 static inline void __llist_add(struct llist_head *_new,
62  struct llist_head *prev,
63  struct llist_head *next)
64 {
65  next->prev = _new;
66  _new->next = next;
67  _new->prev = prev;
68  prev->next = _new;
69 }
70 
79 static inline void llist_add(struct llist_head *_new, struct llist_head *head)
80 {
81  __llist_add(_new, head, head->next);
82 }
83 
92 static inline void llist_add_tail(struct llist_head *_new, struct llist_head *head)
93 {
94  __llist_add(_new, head->prev, head);
95 }
96 
97 /*
98  * Delete a llist entry by making the prev/next entries
99  * point to each other.
100  *
101  * This is only for internal llist manipulation where we know
102  * the prev/next entries already!
103  */
104 static inline void __llist_del(struct llist_head * prev, struct llist_head * next)
105 {
106  next->prev = prev;
107  prev->next = next;
108 }
109 
116 static inline void llist_del(struct llist_head *entry)
117 {
118  __llist_del(entry->prev, entry->next);
119  entry->next = (struct llist_head *)LLIST_POISON1;
120  entry->prev = (struct llist_head *)LLIST_POISON2;
121 }
122 
127 static inline void llist_del_init(struct llist_head *entry)
128 {
129  __llist_del(entry->prev, entry->next);
130  INIT_LLIST_HEAD(entry);
131 }
132 
138 static inline void llist_move(struct llist_head *llist, struct llist_head *head)
139 {
140  __llist_del(llist->prev, llist->next);
141  llist_add(llist, head);
142 }
143 
149 static inline void llist_move_tail(struct llist_head *llist,
150  struct llist_head *head)
151 {
152  __llist_del(llist->prev, llist->next);
153  llist_add_tail(llist, head);
154 }
155 
160 static inline int llist_empty(const struct llist_head *head)
161 {
162  return head->next == head;
163 }
164 
165 static inline void __llist_splice(struct llist_head *llist,
166  struct llist_head *head)
167 {
168  struct llist_head *first = llist->next;
169  struct llist_head *last = llist->prev;
170  struct llist_head *at = head->next;
171 
172  first->prev = head;
173  head->next = first;
174 
175  last->next = at;
176  at->prev = last;
177 }
178 
184 static inline void llist_splice(struct llist_head *llist, struct llist_head *head)
185 {
186  if (!llist_empty(llist))
187  __llist_splice(llist, head);
188 }
189 
197 static inline void llist_splice_init(struct llist_head *llist,
198  struct llist_head *head)
199 {
200  if (!llist_empty(llist)) {
201  __llist_splice(llist, head);
202  INIT_LLIST_HEAD(llist);
203  }
204 }
205 
212 #define llist_entry(ptr, type, member) \
213  container_of(ptr, type, member)
214 
220 #define llist_for_each(pos, head) \
221  for (pos = (head)->next, prefetch(pos->next); pos != (head); \
222  pos = pos->next, prefetch(pos->next))
223 
234 #define __llist_for_each(pos, head) \
235  for (pos = (head)->next; pos != (head); pos = pos->next)
236 
242 #define llist_for_each_prev(pos, head) \
243  for (pos = (head)->prev, prefetch(pos->prev); pos != (head); \
244  pos = pos->prev, prefetch(pos->prev))
245 
252 #define llist_for_each_safe(pos, n, head) \
253  for (pos = (head)->next, n = pos->next; pos != (head); \
254  pos = n, n = pos->next)
255 
262 #define llist_for_each_entry(pos, head, member) \
263  for (pos = llist_entry((head)->next, typeof(*pos), member), \
264  prefetch(pos->member.next); \
265  &pos->member != (head); \
266  pos = llist_entry(pos->member.next, typeof(*pos), member), \
267  prefetch(pos->member.next))
268 
275 #define llist_for_each_entry_reverse(pos, head, member) \
276  for (pos = llist_entry((head)->prev, typeof(*pos), member), \
277  prefetch(pos->member.prev); \
278  &pos->member != (head); \
279  pos = llist_entry(pos->member.prev, typeof(*pos), member), \
280  prefetch(pos->member.prev))
281 
289 #define llist_for_each_entry_continue(pos, head, member) \
290  for (pos = llist_entry(pos->member.next, typeof(*pos), member), \
291  prefetch(pos->member.next); \
292  &pos->member != (head); \
293  pos = llist_entry(pos->member.next, typeof(*pos), member), \
294  prefetch(pos->member.next))
295 
304 #define llist_for_each_entry_safe(pos, n, head, member) \
305  for (pos = llist_entry((head)->next, typeof(*pos), member), \
306  n = llist_entry(pos->member.next, typeof(*pos), member); \
307  &pos->member != (head); \
308  pos = n, n = llist_entry(n->member.next, typeof(*n), member))
309 
315 #define llist_for_each_rcu(pos, head) \
316  for (pos = (head)->next, prefetch(pos->next); pos != (head); \
317  pos = pos->next, ({ smp_read_barrier_depends(); 0;}), prefetch(pos->next))
318 
319 #define __llist_for_each_rcu(pos, head) \
320  for (pos = (head)->next; pos != (head); \
321  pos = pos->next, ({ smp_read_barrier_depends(); 0;}))
322 
330 #define llist_for_each_safe_rcu(pos, n, head) \
331  for (pos = (head)->next, n = pos->next; pos != (head); \
332  pos = n, ({ smp_read_barrier_depends(); 0;}), n = pos->next)
333 
340 #define llist_for_each_entry_rcu(pos, head, member) \
341  for (pos = llist_entry((head)->next, typeof(*pos), member), \
342  prefetch(pos->member.next); \
343  &pos->member != (head); \
344  pos = llist_entry(pos->member.next, typeof(*pos), member), \
345  ({ smp_read_barrier_depends(); 0;}), \
346  prefetch(pos->member.next))
347 
348 
355 #define llist_for_each_continue_rcu(pos, head) \
356  for ((pos) = (pos)->next, prefetch((pos)->next); (pos) != (head); \
357  (pos) = (pos)->next, ({ smp_read_barrier_depends(); 0;}), prefetch((pos)->next))
Definition: linuxlist.h:42