29 #define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
38 #define container_of(ptr, type, member) ({ \
39 const typeof( ((type *)0)->member ) *__mptr = (ptr); \
40 (type *)( (char *)__mptr - offsetof(type,member) );})
49 #define LIST_POISON1 ((void *) 0x00100100)
50 #define LIST_POISON2 ((void *) 0x00200200)
65 #define LIST_HEAD_INIT(name) { &(name), &(name) }
67 #define LIST_HEAD(name) \
68 struct list_head name = LIST_HEAD_INIT(name)
70 #define INIT_LIST_HEAD(ptr) do { \
71 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
80 static inline void __list_add(
struct list_head *neu,
100 __list_add(neu, head, head->next);
113 __list_add(neu, head->prev, head);
136 static inline void list_del(
struct list_head *entry)
138 __list_del(entry->prev, entry->next);
139 entry->next = (
struct list_head *)LIST_POISON1;
140 entry->prev = (
struct list_head *)LIST_POISON2;
149 static inline void list_del_init(
struct list_head *entry)
151 __list_del(entry->prev, entry->next);
152 INIT_LIST_HEAD(entry);
162 __list_del(list->prev, list->next);
163 list_add(list, head);
171 static inline void list_move_tail(
struct list_head *list,
174 __list_del(list->prev, list->next);
175 list_add_tail(list, head);
182 static inline int list_empty(
const struct list_head *head)
184 return head->next == head;
187 static inline void __list_splice(
struct list_head *list,
208 if (!list_empty(list))
209 __list_splice(list, head);
219 static inline void list_splice_init(
struct list_head *list,
222 if (!list_empty(list)) {
223 __list_splice(list, head);
224 INIT_LIST_HEAD(list);
234 #define list_entry(ptr, type, member) \
235 container_of(ptr, type, member)
243 #define list_for_each(pos, head) \
244 for (pos = (head)->next; pos != (head); \
257 #define __list_for_each(pos, head) \
258 for (pos = (head)->next; pos != (head); pos = pos->next)
265 #define list_for_each_prev(pos, head) \
266 for (pos = (head)->prev; prefetch(pos->prev), pos != (head); \
275 #define list_for_each_safe(pos, n, head) \
276 for (pos = (head)->next, n = pos->next; pos != (head); \
277 pos = n, n = pos->next)
285 #define list_for_each_entry(pos, head, member) \
286 for (pos = list_entry((head)->next, typeof(*pos), member); \
287 &pos->member != (head); \
288 pos = list_entry(pos->member.next, typeof(*pos), member))
296 #define list_for_each_entry_reverse(pos, head, member) \
297 for (pos = list_entry((head)->prev, typeof(*pos), member); \
298 &pos->member != (head); \
299 pos = list_entry(pos->member.prev, typeof(*pos), member))
308 #define list_prepare_entry(pos, head, member) \
309 ((pos) ? : list_entry(head, typeof(*pos), member))
318 #define list_for_each_entry_continue(pos, head, member) \
319 for (pos = list_entry(pos->member.next, typeof(*pos), member); \
320 &pos->member != (head); \
321 pos = list_entry(pos->member.next, typeof(*pos), member))
330 #define list_for_each_entry_safe(pos, n, head, member) \
331 for (pos = list_entry((head)->next, typeof(*pos), member), \
332 n = list_entry(pos->member.next, typeof(*pos), member); \
333 &pos->member != (head); \
334 pos = n, n = list_entry(n->member.next, typeof(*n), member))
344 #define list_for_each_entry_safe_continue(pos, n, head, member) \
345 for (pos = list_entry(pos->member.next, typeof(*pos), member), \
346 n = list_entry(pos->member.next, typeof(*pos), member); \
347 &pos->member != (head); \
348 pos = n, n = list_entry(n->member.next, typeof(*n), member))
358 #define list_for_each_entry_safe_reverse(pos, n, head, member) \
359 for (pos = list_entry((head)->prev, typeof(*pos), member), \
360 n = list_entry(pos->member.prev, typeof(*pos), member); \
361 &pos->member != (head); \
362 pos = n, n = list_entry(n->member.prev, typeof(*n), member))
375 struct hlist_node *first;
379 struct hlist_node *next, **pprev;
382 #define HLIST_HEAD_INIT { .first = NULL }
383 #define HLIST_HEAD(name) struct hlist_head name = { .first = NULL }
384 #define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL)
385 #define INIT_HLIST_NODE(ptr) ((ptr)->next = NULL, (ptr)->pprev = NULL)
387 static inline int hlist_unhashed(
const struct hlist_node *h)
392 static inline int hlist_empty(
const struct hlist_head *h)
397 static inline void __hlist_del(
struct hlist_node *n)
399 struct hlist_node *next = n->next;
400 struct hlist_node **pprev = n->pprev;
406 static inline void hlist_del(
struct hlist_node *n)
409 n->next = (
struct hlist_node *) LIST_POISON1;
410 n->pprev = (
struct hlist_node **)LIST_POISON2;
414 static inline void hlist_del_init(
struct hlist_node *n)
422 static inline void hlist_add_head(
struct hlist_node *n,
struct hlist_head *h)
424 struct hlist_node *first = h->first;
427 first->pprev = &n->next;
429 n->pprev = &h->first;
435 static inline void hlist_add_before(
struct hlist_node *n,
436 struct hlist_node *next)
438 n->pprev = next->pprev;
440 next->pprev = &n->next;
444 static inline void hlist_add_after(
struct hlist_node *n,
445 struct hlist_node *next)
447 next->next = n->next;
449 next->pprev = &n->next;
452 next->next->pprev = &next->next;
457 #define hlist_entry(ptr, type, member) container_of(ptr,type,member)
459 #define hlist_for_each(pos, head) \
460 for (pos = (head)->first; pos && ({ prefetch(pos->next); 1; }); \
463 #define hlist_for_each_safe(pos, n, head) \
464 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
474 #define hlist_for_each_entry(tpos, pos, head, member) \
475 for (pos = (head)->first; \
476 pos && ({ prefetch(pos->next); 1;}) && \
477 ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
486 #define hlist_for_each_entry_continue(tpos, pos, member) \
487 for (pos = (pos)->next; \
488 pos && ({ prefetch(pos->next); 1;}) && \
489 ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
498 #define hlist_for_each_entry_from(tpos, pos, member) \
499 for (; pos && ({ prefetch(pos->next); 1;}) && \
500 ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
511 #define hlist_for_each_entry_safe(tpos, pos, n, head, member) \
512 for (pos = (head)->first; \
513 pos && ({ n = pos->next; 1; }) && \
514 ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \