Go to the documentation of this file.
20 #if (defined(_WIN16) || defined(_WIN32) || defined(_WIN64)) && !defined(__WINDOWS__)
26 # define inline __inline__
28 # define inline __inline
40 #define container_of(ptr, type, member) ({ \
41 const typeof( ((type *)0)->member ) *__mptr = (ptr); \
42 (type *)( (char *)__mptr - offsetof(type, member) );})
50 #define LLIST_POISON1 ((void *) 0x00100100)
51 #define LLIST_POISON2 ((void *) 0x00200200)
59 #define LLIST_HEAD_INIT(name) { &(name), &(name) }
66 #define LLIST_HEAD(name) \
67 struct llist_head name = LLIST_HEAD_INIT(name)
70 #define INIT_LLIST_HEAD(ptr) do { \
71 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
175 return head->
next == head;
222 #define llist_entry(ptr, type, member) \
223 container_of(ptr, type, member)
232 #define llist_first_entry(ptr, type, member) \
233 llist_entry((ptr)->next, type, member)
242 #define llist_last_entry(ptr, type, member) \
243 llist_entry((ptr)->prev, type, member)
252 #define llist_first_entry_or_null(ptr, type, member) \
253 (!llist_empty(ptr) ? llist_first_entry(ptr, type, member) : NULL)
259 #define llist_for_each(pos, head) \
260 for (pos = (head)->next, prefetch(pos->next); pos != (head); \
261 pos = pos->next, prefetch(pos->next))
272 #define __llist_for_each(pos, head) \
273 for (pos = (head)->next; pos != (head); pos = pos->next)
279 #define llist_for_each_prev(pos, head) \
280 for (pos = (head)->prev, prefetch(pos->prev); pos != (head); \
281 pos = pos->prev, prefetch(pos->prev))
288 #define llist_for_each_safe(pos, n, head) \
289 for (pos = (head)->next, n = pos->next; pos != (head); \
290 pos = n, n = pos->next)
297 #define llist_for_each_entry(pos, head, member) \
298 for (pos = llist_entry((head)->next, typeof(*pos), member), \
299 prefetch(pos->member.next); \
300 &pos->member != (head); \
301 pos = llist_entry(pos->member.next, typeof(*pos), member), \
302 prefetch(pos->member.next))
309 #define llist_for_each_entry_reverse(pos, head, member) \
310 for (pos = llist_entry((head)->prev, typeof(*pos), member), \
311 prefetch(pos->member.prev); \
312 &pos->member != (head); \
313 pos = llist_entry(pos->member.prev, typeof(*pos), member), \
314 prefetch(pos->member.prev))
322 #define llist_for_each_entry_continue(pos, head, member) \
323 for (pos = llist_entry(pos->member.next, typeof(*pos), member), \
324 prefetch(pos->member.next); \
325 &pos->member != (head); \
326 pos = llist_entry(pos->member.next, typeof(*pos), member), \
327 prefetch(pos->member.next))
336 #define llist_for_each_entry_safe(pos, n, head, member) \
337 for (pos = llist_entry((head)->next, typeof(*pos), member), \
338 n = llist_entry(pos->member.next, typeof(*pos), member); \
339 &pos->member != (head); \
340 pos = n, n = llist_entry(n->member.next, typeof(*n), member))
347 #define llist_for_each_rcu(pos, head) \
348 for (pos = (head)->next, prefetch(pos->next); pos != (head); \
349 pos = pos->next, ({ smp_read_barrier_depends(); 0;}), prefetch(pos->next))
351 #define __llist_for_each_rcu(pos, head) \
352 for (pos = (head)->next; pos != (head); \
353 pos = pos->next, ({ smp_read_barrier_depends(); 0;}))
362 #define llist_for_each_safe_rcu(pos, n, head) \
363 for (pos = (head)->next, n = pos->next; pos != (head); \
364 pos = n, ({ smp_read_barrier_depends(); 0;}), n = pos->next)
372 #define llist_for_each_entry_rcu(pos, head, member) \
373 for (pos = llist_entry((head)->next, typeof(*pos), member), \
374 prefetch(pos->member.next); \
375 &pos->member != (head); \
376 pos = llist_entry(pos->member.next, typeof(*pos), member), \
377 ({ smp_read_barrier_depends(); 0;}), \
378 prefetch(pos->member.next))
387 #define llist_for_each_continue_rcu(pos, head) \
388 for ((pos) = (pos)->next, prefetch((pos)->next); (pos) != (head); \
389 (pos) = (pos)->next, ({ smp_read_barrier_depends(); 0;}), prefetch((pos)->next))
#define LLIST_POISON1
Definition: linuxlist.h:50
static void llist_splice(struct llist_head *llist, struct llist_head *head)
Definition: linuxlist.h:196
#define llist_for_each(pos, head)
Definition: linuxlist.h:259
struct llist_head * next
Definition: linuxlist.h:56
static void llist_del_init(struct llist_head *entry)
Definition: linuxlist.h:142
#define INIT_LLIST_HEAD(ptr)
Definition: linuxlist.h:70
static void llist_del(struct llist_head *entry)
Definition: linuxlist.h:132
static void llist_move(struct llist_head *llist, struct llist_head *head)
Definition: linuxlist.h:152
static void __llist_del(struct llist_head *prev, struct llist_head *next)
Definition: linuxlist.h:120
static void __llist_add(struct llist_head *_new, struct llist_head *prev, struct llist_head *next)
Definition: linuxlist.h:79
static void llist_move_tail(struct llist_head *llist, struct llist_head *head)
Definition: linuxlist.h:162
#define LLIST_POISON2
Definition: linuxlist.h:51
Definition: linuxlist.h:54
static void llist_add(struct llist_head *_new, struct llist_head *head)
Definition: linuxlist.h:96
static void llist_add_tail(struct llist_head *_new, struct llist_head *head)
Definition: linuxlist.h:108
static void __llist_splice(struct llist_head *llist, struct llist_head *head)
Definition: linuxlist.h:178
static int llist_empty(const struct llist_head *head)
Definition: linuxlist.h:173
struct llist_head * prev
Definition: linuxlist.h:56
static unsigned int llist_count(struct llist_head *head)
Definition: linuxlist.h:398
static void prefetch(const void *x)
Definition: linuxlist.h:32
static void llist_splice_init(struct llist_head *llist, struct llist_head *head)
Definition: linuxlist.h:208