21 #define inline __inline__ 32 #define container_of(ptr, type, member) ({ \ 33 const typeof( ((type *)0)->member ) *__mptr = (ptr); \ 34 (type *)( (char *)__mptr - offsetof(type, member) );}) 42 #define LLIST_POISON1 ((void *) 0x00100100) 43 #define LLIST_POISON2 ((void *) 0x00200200) 51 #define LLIST_HEAD_INIT(name) { &(name), &(name) } 58 #define LLIST_HEAD(name) \ 59 struct llist_head name = LLIST_HEAD_INIT(name) 62 #define INIT_LLIST_HEAD(ptr) do { \ 63 (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 167 return head->
next == head;
214 #define llist_entry(ptr, type, member) \ 215 container_of(ptr, type, member) 224 #define llist_first_entry(ptr, type, member) \ 225 llist_entry((ptr)->next, type, member) 234 #define llist_last_entry(ptr, type, member) \ 235 llist_entry((ptr)->prev, type, member) 244 #define llist_first_entry_or_null(ptr, type, member) \ 245 (!llist_empty(ptr) ? llist_first_entry(ptr, type, member) : NULL) 251 #define llist_for_each(pos, head) \ 252 for (pos = (head)->next, prefetch(pos->next); pos != (head); \ 253 pos = pos->next, prefetch(pos->next)) 264 #define __llist_for_each(pos, head) \ 265 for (pos = (head)->next; pos != (head); pos = pos->next) 271 #define llist_for_each_prev(pos, head) \ 272 for (pos = (head)->prev, prefetch(pos->prev); pos != (head); \ 273 pos = pos->prev, prefetch(pos->prev)) 280 #define llist_for_each_safe(pos, n, head) \ 281 for (pos = (head)->next, n = pos->next; pos != (head); \ 282 pos = n, n = pos->next) 289 #define llist_for_each_entry(pos, head, member) \ 290 for (pos = llist_entry((head)->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)) 301 #define llist_for_each_entry_reverse(pos, head, member) \ 302 for (pos = llist_entry((head)->prev, typeof(*pos), member), \ 303 prefetch(pos->member.prev); \ 304 &pos->member != (head); \ 305 pos = llist_entry(pos->member.prev, typeof(*pos), member), \ 306 prefetch(pos->member.prev)) 314 #define llist_for_each_entry_continue(pos, head, member) \ 315 for (pos = llist_entry(pos->member.next, typeof(*pos), member), \ 316 prefetch(pos->member.next); \ 317 &pos->member != (head); \ 318 pos = llist_entry(pos->member.next, typeof(*pos), member), \ 319 prefetch(pos->member.next)) 328 #define llist_for_each_entry_safe(pos, n, head, member) \ 329 for (pos = llist_entry((head)->next, typeof(*pos), member), \ 330 n = llist_entry(pos->member.next, typeof(*pos), member); \ 331 &pos->member != (head); \ 332 pos = n, n = llist_entry(n->member.next, typeof(*n), member)) 339 #define llist_for_each_rcu(pos, head) \ 340 for (pos = (head)->next, prefetch(pos->next); pos != (head); \ 341 pos = pos->next, ({ smp_read_barrier_depends(); 0;}), prefetch(pos->next)) 343 #define __llist_for_each_rcu(pos, head) \ 344 for (pos = (head)->next; pos != (head); \ 345 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) 364 #define llist_for_each_entry_rcu(pos, head, member) \ 365 for (pos = llist_entry((head)->next, typeof(*pos), member), \ 366 prefetch(pos->member.next); \ 367 &pos->member != (head); \ 368 pos = llist_entry(pos->member.next, typeof(*pos), member), \ 369 ({ smp_read_barrier_depends(); 0;}), \ 370 prefetch(pos->member.next)) 379 #define llist_for_each_continue_rcu(pos, head) \ 380 for ((pos) = (pos)->next, prefetch((pos)->next); (pos) != (head); \ 381 (pos) = (pos)->next, ({ smp_read_barrier_depends(); 0;}), prefetch((pos)->next)) static void llist_del(struct llist_head *entry)
Delete entry from linked list.
Definition: linuxlist.h:124
static unsigned int llist_count(struct llist_head *head)
count nr of llist items by iterating.
Definition: linuxlist.h:390
static void llist_splice(struct llist_head *llist, struct llist_head *head)
Join two llists.
Definition: linuxlist.h:188
static void __llist_del(struct llist_head *prev, struct llist_head *next)
Definition: linuxlist.h:112
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:88
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:71
#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:42
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:144
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:154
struct llist_head * prev
Definition: linuxlist.h:48
(double) linked list header structure
Definition: linuxlist.h:46
#define INIT_LLIST_HEAD(ptr)
initialize a llist_head to point back to self
Definition: linuxlist.h:62
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:100
static int llist_empty(const struct llist_head *head)
Test whether a linked list is empty.
Definition: linuxlist.h:165
static void __llist_splice(struct llist_head *llist, struct llist_head *head)
Definition: linuxlist.h:170
static void llist_splice_init(struct llist_head *llist, struct llist_head *head)
join two llists and reinitialise the emptied llist.
Definition: linuxlist.h:200
struct llist_head * next
Pointer to next and previous item.
Definition: linuxlist.h:48
static void prefetch(const void *x)
Definition: linuxlist.h:24
#define LLIST_POISON2
Definition: linuxlist.h:43
#define llist_for_each(pos, head)
Iterate over a linked list.
Definition: linuxlist.h:251
static void llist_del_init(struct llist_head *entry)
Delete entry from linked list and reinitialize it.
Definition: linuxlist.h:134