21 #define inline __inline__ 31 #define container_of(ptr, type, member) ({ \ 32 const typeof( ((type *)0)->member ) *__mptr = (ptr); \ 33 (type *)( (char *)__mptr - offsetof(type, member) );}) 41 #define LLIST_POISON1 ((void *) 0x00100100) 42 #define LLIST_POISON2 ((void *) 0x00200200) 53 #define LLIST_HEAD_INIT(name) { &(name), &(name) } 58 #define LLIST_HEAD(name) \ 59 struct llist_head name = LLIST_HEAD_INIT(name) 64 #define INIT_LLIST_HEAD(ptr) do { \ 65 (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 170 return head->
next == head;
217 #define llist_entry(ptr, type, member) \ 218 container_of(ptr, type, member) 227 #define llist_first_entry(ptr, type, member) \ 228 llist_entry((ptr)->next, type, member) 237 #define llist_last_entry(ptr, type, member) \ 238 llist_entry((ptr)->prev, type, member) 247 #define llist_first_entry_or_null(ptr, type, member) \ 248 (!llist_empty(ptr) ? llist_first_entry(ptr, type, member) : NULL) 254 #define llist_for_each(pos, head) \ 255 for (pos = (head)->next, prefetch(pos->next); pos != (head); \ 256 pos = pos->next, prefetch(pos->next)) 267 #define __llist_for_each(pos, head) \ 268 for (pos = (head)->next; pos != (head); pos = pos->next) 274 #define llist_for_each_prev(pos, head) \ 275 for (pos = (head)->prev, prefetch(pos->prev); pos != (head); \ 276 pos = pos->prev, prefetch(pos->prev)) 283 #define llist_for_each_safe(pos, n, head) \ 284 for (pos = (head)->next, n = pos->next; pos != (head); \ 285 pos = n, n = pos->next) 292 #define llist_for_each_entry(pos, head, member) \ 293 for (pos = llist_entry((head)->next, typeof(*pos), member), \ 294 prefetch(pos->member.next); \ 295 &pos->member != (head); \ 296 pos = llist_entry(pos->member.next, typeof(*pos), member), \ 297 prefetch(pos->member.next)) 304 #define llist_for_each_entry_reverse(pos, head, member) \ 305 for (pos = llist_entry((head)->prev, typeof(*pos), member), \ 306 prefetch(pos->member.prev); \ 307 &pos->member != (head); \ 308 pos = llist_entry(pos->member.prev, typeof(*pos), member), \ 309 prefetch(pos->member.prev)) 317 #define llist_for_each_entry_continue(pos, head, member) \ 318 for (pos = llist_entry(pos->member.next, typeof(*pos), member), \ 319 prefetch(pos->member.next); \ 320 &pos->member != (head); \ 321 pos = llist_entry(pos->member.next, typeof(*pos), member), \ 322 prefetch(pos->member.next)) 331 #define llist_for_each_entry_safe(pos, n, head, member) \ 332 for (pos = llist_entry((head)->next, typeof(*pos), member), \ 333 n = llist_entry(pos->member.next, typeof(*pos), member); \ 334 &pos->member != (head); \ 335 pos = n, n = llist_entry(n->member.next, typeof(*n), member)) 341 #define llist_for_each_rcu(pos, head) \ 342 for (pos = (head)->next, prefetch(pos->next); pos != (head); \ 343 pos = pos->next, ({ smp_read_barrier_depends(); 0;}), prefetch(pos->next)) 345 #define __llist_for_each_rcu(pos, head) \ 346 for (pos = (head)->next; pos != (head); \ 347 pos = pos->next, ({ smp_read_barrier_depends(); 0;})) 354 #define llist_for_each_safe_rcu(pos, n, head) \ 355 for (pos = (head)->next, n = pos->next; pos != (head); \ 356 pos = n, ({ smp_read_barrier_depends(); 0;}), n = pos->next) 363 #define llist_for_each_entry_rcu(pos, head, member) \ 364 for (pos = llist_entry((head)->next, typeof(*pos), member), \ 365 prefetch(pos->member.next); \ 366 &pos->member != (head); \ 367 pos = llist_entry(pos->member.next, typeof(*pos), member), \ 368 ({ smp_read_barrier_depends(); 0;}), \ 369 prefetch(pos->member.next)) 376 #define llist_for_each_continue_rcu(pos, head) \ 377 for ((pos) = (pos)->next, prefetch((pos)->next); (pos) != (head); \ 378 (pos) = (pos)->next, ({ smp_read_barrier_depends(); 0;}), prefetch((pos)->next)) static void llist_del(struct llist_head *entry)
Delete a single entry from a linked list.
Definition: linuxlist.h:127
static void llist_splice(struct llist_head *llist, struct llist_head *head)
Join two linked lists.
Definition: linuxlist.h:191
static void __llist_del(struct llist_head *prev, struct llist_head *next)
Definition: linuxlist.h:115
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:91
static void __llist_add(struct llist_head *_new, struct llist_head *prev, struct llist_head *next)
Definition: linuxlist.h:74
#define LLIST_POISON1
These are non-NULL pointers that will result in page faults under normal circumstances, used to verify that nobody uses non-initialized llist entries.
Definition: linuxlist.h:41
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:147
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:157
struct llist_head * prev
Definition: linuxlist.h:47
(double) linked list header structure
Definition: linuxlist.h:45
#define INIT_LLIST_HEAD(ptr)
Initialize a llist_head to point back to itself.
Definition: linuxlist.h:64
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:103
static int llist_empty(const struct llist_head *head)
Test whether a linked list is empty.
Definition: linuxlist.h:168
static void __llist_splice(struct llist_head *llist, struct llist_head *head)
Definition: linuxlist.h:173
static void llist_splice_init(struct llist_head *llist, struct llist_head *head)
Join two llists and reinitialise the emptied llist.
Definition: linuxlist.h:203
struct llist_head * next
Pointer to next and previous item.
Definition: linuxlist.h:47
static void prefetch(const void *x)
Definition: linuxlist.h:24
#define LLIST_POISON2
Definition: linuxlist.h:42
#define llist_for_each(pos, head)
Iterate over a linked list.
Definition: linuxlist.h:254
static unsigned int llist_count(const struct llist_head *head)
Count number of llist items by iterating.
Definition: linuxlist.h:387
static void llist_del_init(struct llist_head *entry)
Delete a single entry from a linked list and reinitialize it.
Definition: linuxlist.h:137