6 #define inline __inline__
9 static inline void prefetch(
const void *x) {;}
19 #define container_of(ptr, type, member) ({ \
20 const typeof( ((type *)0)->member ) *__mptr = (ptr); \
21 (type *)( (char *)__mptr - offsetof(type, member) );})
29 #define LLIST_POISON1 ((void *) 0x00100100)
30 #define LLIST_POISON2 ((void *) 0x00200200)
46 #define LLIST_HEAD_INIT(name) { &(name), &(name) }
48 #define LLIST_HEAD(name) \
49 struct llist_head name = LLIST_HEAD_INIT(name)
51 #define INIT_LLIST_HEAD(ptr) do { \
52 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
61 static inline void __llist_add(
struct llist_head *_new,
81 __llist_add(_new, head, head->next);
94 __llist_add(_new, head->prev, head);
116 static inline void llist_del(
struct llist_head *entry)
118 __llist_del(entry->prev, entry->next);
119 entry->next = (
struct llist_head *)LLIST_POISON1;
120 entry->prev = (
struct llist_head *)LLIST_POISON2;
127 static inline void llist_del_init(
struct llist_head *entry)
129 __llist_del(entry->prev, entry->next);
130 INIT_LLIST_HEAD(entry);
140 __llist_del(llist->prev, llist->next);
141 llist_add(llist, head);
149 static inline void llist_move_tail(
struct llist_head *llist,
152 __llist_del(llist->prev, llist->next);
153 llist_add_tail(llist, head);
160 static inline int llist_empty(
const struct llist_head *head)
162 return head->next == head;
165 static inline void __llist_splice(
struct llist_head *llist,
186 if (!llist_empty(llist))
187 __llist_splice(llist, head);
197 static inline void llist_splice_init(
struct llist_head *llist,
200 if (!llist_empty(llist)) {
201 __llist_splice(llist, head);
202 INIT_LLIST_HEAD(llist);
212 #define llist_entry(ptr, type, member) \
213 container_of(ptr, type, member)
220 #define llist_for_each(pos, head) \
221 for (pos = (head)->next, prefetch(pos->next); pos != (head); \
222 pos = pos->next, prefetch(pos->next))
234 #define __llist_for_each(pos, head) \
235 for (pos = (head)->next; pos != (head); pos = pos->next)
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))
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)
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))
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))
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))
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))
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))
319 #define __llist_for_each_rcu(pos, head) \
320 for (pos = (head)->next; pos != (head); \
321 pos = pos->next, ({ smp_read_barrier_depends(); 0;}))
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)
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))
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