22 #define inline __inline__ 25 static inline void prefetch(
const void *x) {;}
33 #define container_of(ptr, type, member) ({ \ 34 const typeof( ((type *)0)->member ) *__mptr = (ptr); \ 35 (type *)( (char *)__mptr - offsetof(type, member) );}) 43 #define LLIST_POISON1 ((void *) 0x00100100) 44 #define LLIST_POISON2 ((void *) 0x00200200) 52 #define LLIST_HEAD_INIT(name) { &(name), &(name) } 59 #define LLIST_HEAD(name) \ 60 struct llist_head name = LLIST_HEAD_INIT(name) 63 #define INIT_LLIST_HEAD(ptr) do { \ 64 (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 127 __llist_del(entry->prev, entry->
next);
129 entry->prev = (
struct llist_head *)LLIST_POISON2;
137 __llist_del(entry->prev, entry->
next);
147 __llist_del(llist->prev, llist->
next);
158 __llist_del(llist->prev, llist->
next);
168 return head->
next == head;
171 static inline void __llist_splice(
struct llist_head *llist,
192 __llist_splice(llist, head);
205 __llist_splice(llist, head);
215 #define llist_entry(ptr, type, member) \ 216 container_of(ptr, type, member) 222 #define llist_for_each(pos, head) \ 223 for (pos = (head)->next, prefetch(pos->next); pos != (head); \ 224 pos = pos->next, prefetch(pos->next)) 235 #define __llist_for_each(pos, head) \ 236 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)) 251 #define llist_for_each_safe(pos, n, head) \ 252 for (pos = (head)->next, n = pos->next; pos != (head); \ 253 pos = n, n = pos->next) 260 #define llist_for_each_entry(pos, head, member) \ 261 for (pos = llist_entry((head)->next, typeof(*pos), member), \ 262 prefetch(pos->member.next); \ 263 &pos->member != (head); \ 264 pos = llist_entry(pos->member.next, typeof(*pos), member), \ 265 prefetch(pos->member.next)) 272 #define llist_for_each_entry_reverse(pos, head, member) \ 273 for (pos = llist_entry((head)->prev, typeof(*pos), member), \ 274 prefetch(pos->member.prev); \ 275 &pos->member != (head); \ 276 pos = llist_entry(pos->member.prev, typeof(*pos), member), \ 277 prefetch(pos->member.prev)) 285 #define llist_for_each_entry_continue(pos, head, member) \ 286 for (pos = llist_entry(pos->member.next, typeof(*pos), member), \ 287 prefetch(pos->member.next); \ 288 &pos->member != (head); \ 289 pos = llist_entry(pos->member.next, typeof(*pos), member), \ 290 prefetch(pos->member.next)) 299 #define llist_for_each_entry_safe(pos, n, head, member) \ 300 for (pos = llist_entry((head)->next, typeof(*pos), member), \ 301 n = llist_entry(pos->member.next, typeof(*pos), member); \ 302 &pos->member != (head); \ 303 pos = n, n = llist_entry(n->member.next, typeof(*n), member)) 310 #define llist_for_each_rcu(pos, head) \ 311 for (pos = (head)->next, prefetch(pos->next); pos != (head); \ 312 pos = pos->next, ({ smp_read_barrier_depends(); 0;}), prefetch(pos->next)) 314 #define __llist_for_each_rcu(pos, head) \ 315 for (pos = (head)->next; pos != (head); \ 316 pos = pos->next, ({ smp_read_barrier_depends(); 0;})) 325 #define llist_for_each_safe_rcu(pos, n, head) \ 326 for (pos = (head)->next, n = pos->next; pos != (head); \ 327 pos = n, ({ smp_read_barrier_depends(); 0;}), n = pos->next) 335 #define llist_for_each_entry_rcu(pos, head, member) \ 336 for (pos = llist_entry((head)->next, typeof(*pos), member), \ 337 prefetch(pos->member.next); \ 338 &pos->member != (head); \ 339 pos = llist_entry(pos->member.next, typeof(*pos), member), \ 340 ({ smp_read_barrier_depends(); 0;}), \ 341 prefetch(pos->member.next)) 350 #define llist_for_each_continue_rcu(pos, head) \ 351 for ((pos) = (pos)->next, prefetch((pos)->next); (pos) != (head); \ 352 (pos) = (pos)->next, ({ smp_read_barrier_depends(); 0;}), prefetch((pos)->next)) struct llist_head * next
Pointer to next and previous item.
Definition: linuxlist.h:49
static void llist_del(struct llist_head *entry)
Delete entry from linked list.
Definition: linuxlist.h:125
static unsigned int llist_count(struct llist_head *head)
count nr of llist items by iterating.
Definition: linuxlist.h:361
static void llist_splice(struct llist_head *llist, struct llist_head *head)
Join two llists.
Definition: linuxlist.h:189
static void llist_add(struct llist_head *_new, struct llist_head *head)
add a new entry into a linked list (at head)
Definition: linuxlist.h:89
static void __llist_add(struct llist_head *_new, struct llist_head *prev, struct llist_head *next)
Insert a new entry between two known consecutive entries.
Definition: linuxlist.h:72
#define LLIST_POISON1
Definition: linuxlist.h:43
static void llist_move(struct llist_head *llist, struct llist_head *head)
Delete from one llist and add as another's head.
Definition: linuxlist.h:145
static void llist_move_tail(struct llist_head *llist, struct llist_head *head)
Delete from one llist and add as another's tail.
Definition: linuxlist.h:155
(double) linked list header structure
Definition: linuxlist.h:47
#define INIT_LLIST_HEAD(ptr)
initialize a llist_head to point back to self
Definition: linuxlist.h:63
static void llist_add_tail(struct llist_head *_new, struct llist_head *head)
add a new entry into a linked list (at tail)
Definition: linuxlist.h:101
static int llist_empty(const struct llist_head *head)
Test whether a linked list is empty.
Definition: linuxlist.h:166
static void llist_splice_init(struct llist_head *llist, struct llist_head *head)
join two llists and reinitialise the emptied llist.
Definition: linuxlist.h:201
#define llist_for_each(pos, head)
Iterate over a linked list.
Definition: linuxlist.h:222
static void llist_del_init(struct llist_head *entry)
Delete entry from linked list and reinitialize it.
Definition: linuxlist.h:135