7 #define inline __inline__
10 static inline void prefetch(
const void *x) {;}
20 #define container_of(ptr, type, member) ({ \
21 const typeof( ((type *)0)->member ) *__mptr = (typeof( ((type *)0)->member ) *)(ptr); \
22 (type *)( (char *)__mptr - offsetof(type, member) );})
30 #define LLIST_POISON1 ((void *) 0x00100100)
31 #define LLIST_POISON2 ((void *) 0x00200200)
47 #define LLIST_HEAD_INIT(name) { &(name), &(name) }
49 #define LLIST_HEAD(name) \
50 struct llist_head name = LLIST_HEAD_INIT(name)
52 #define INIT_LLIST_HEAD(ptr) do { \
53 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
62 static inline void __llist_add(
struct llist_head *_new,
82 __llist_add(_new, head, head->next);
95 __llist_add(_new, head->prev, head);
117 static inline void llist_del(
struct llist_head *entry)
119 __llist_del(entry->prev, entry->next);
120 entry->next = (
struct llist_head *)LLIST_POISON1;
121 entry->prev = (
struct llist_head *)LLIST_POISON2;
128 static inline void llist_del_init(
struct llist_head *entry)
130 __llist_del(entry->prev, entry->next);
131 INIT_LLIST_HEAD(entry);
141 __llist_del(llist->prev, llist->next);
142 llist_add(llist, head);
150 static inline void llist_move_tail(
struct llist_head *llist,
153 __llist_del(llist->prev, llist->next);
154 llist_add_tail(llist, head);
161 static inline int llist_empty(
const struct llist_head *head)
163 return head->next == head;
166 static inline void __llist_splice(
struct llist_head *llist,
187 if (!llist_empty(llist))
188 __llist_splice(llist, head);
198 static inline void llist_splice_init(
struct llist_head *llist,
201 if (!llist_empty(llist)) {
202 __llist_splice(llist, head);
203 INIT_LLIST_HEAD(llist);
213 #define llist_entry(ptr, type, member) \
214 container_of(ptr, type, member)
221 #define llist_for_each(pos, head) \
222 for (pos = (head)->next, prefetch(pos->next); pos != (head); \
223 pos = pos->next, prefetch(pos->next))
235 #define __llist_for_each(pos, head) \
236 for (pos = (head)->next; pos != (head); pos = pos->next)
243 #define llist_for_each_prev(pos, head) \
244 for (pos = (head)->prev, prefetch(pos->prev); pos != (head); \
245 pos = pos->prev, prefetch(pos->prev))
253 #define llist_for_each_safe(pos, n, head) \
254 for (pos = (head)->next, n = pos->next; pos != (head); \
255 pos = n, n = pos->next)
263 #define llist_for_each_entry(pos, head, member) \
264 for (pos = llist_entry((head)->next, typeof(*pos), member), \
265 prefetch(pos->member.next); \
266 &pos->member != (head); \
267 pos = llist_entry(pos->member.next, typeof(*pos), member), \
268 prefetch(pos->member.next))
276 #define llist_for_each_entry_reverse(pos, head, member) \
277 for (pos = llist_entry((head)->prev, typeof(*pos), member), \
278 prefetch(pos->member.prev); \
279 &pos->member != (head); \
280 pos = llist_entry(pos->member.prev, typeof(*pos), member), \
281 prefetch(pos->member.prev))
290 #define llist_for_each_entry_continue(pos, head, member) \
291 for (pos = llist_entry(pos->member.next, typeof(*pos), member), \
292 prefetch(pos->member.next); \
293 &pos->member != (head); \
294 pos = llist_entry(pos->member.next, typeof(*pos), member), \
295 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))