5 #include <linux/stddef.h> 6 #include <linux/poison.h> 7 #include <linux/prefetch.h> 8 #include <asm/system.h> 34 #define LIST_HEAD_INIT(name) { &(name), &(name) } 36 #define LIST_HEAD(name) \ 37 struct list_head name = LIST_HEAD_INIT(name) 51 #ifndef CONFIG_DEBUG_LIST 62 extern void __list_add(
struct list_head *new_,
77 __list_add(new_, head, head->next);
91 __list_add(new_, head->prev, head);
113 #ifndef CONFIG_DEBUG_LIST 116 __list_del(entry->prev, entry->next);
117 entry->next = (
struct list_head *)LIST_POISON1;
118 entry->prev = (
struct list_head *)LIST_POISON2;
121 extern void list_del(
struct list_head *entry);
134 new_->next = old->next;
135 new_->next->prev = new_;
136 new_->prev = old->prev;
137 new_->prev->next = new_;
143 list_replace(old, new_);
153 __list_del(entry->prev, entry->next);
154 INIT_LIST_HEAD(entry);
164 __list_del(list->prev, list->next);
165 list_add(list, head);
176 __list_del(list->prev, list->next);
177 list_add_tail(list, head);
188 return list->next == head;
197 return head->next == head;
216 return (next == head) && (next == head->prev);
227 if (!list_empty(head)) {
229 list_move_tail(first, head);
239 return !list_empty(head) && (head->next == head->prev);
245 struct list_head *new_first = entry->next;
246 list->next = head->next;
247 list->next->prev = list;
250 head->next = new_first;
251 new_first->prev = head;
271 if (list_empty(head))
273 if (list_is_singular(head) &&
274 (head->next != entry && head != entry))
277 INIT_LIST_HEAD(list);
279 __list_cut_position(list, head, entry);
304 if (!list_empty(list))
305 __list_splice(list, head, head->next);
316 if (!list_empty(list))
317 __list_splice(list, head->prev, head);
330 if (!list_empty(list)) {
331 __list_splice(list, head, head->next);
332 INIT_LIST_HEAD(list);
347 if (!list_empty(list)) {
348 __list_splice(list, head->prev, head);
349 INIT_LIST_HEAD(list);
359 #define list_entry(ptr, type, member) \ 360 container_of(ptr, type, member) 370 #define list_first_entry(ptr, type, member) \ 371 list_entry((ptr)->next, type, member) 378 #define list_for_each(pos, head) \ 379 for (pos = (head)->next; prefetch(pos->next), pos != (head); \ 392 #define __list_for_each(pos, head) \ 393 for (pos = (head)->next; pos != (head); pos = pos->next) 400 #define list_for_each_prev(pos, head) \ 401 for (pos = (head)->prev; prefetch(pos->prev), pos != (head); \ 410 #define list_for_each_safe(pos, n, head) \ 411 for (pos = (head)->next, n = pos->next; pos != (head); \ 412 pos = n, n = pos->next) 420 #define list_for_each_prev_safe(pos, n, head) \ 421 for (pos = (head)->prev, n = pos->prev; \ 422 prefetch(pos->prev), pos != (head); \ 423 pos = n, n = pos->prev) 431 #define list_for_each_entry(pos, head, member) \ 432 for (pos = list_entry((head)->next, typeof(*pos), member); \ 433 prefetch(pos->member.next), &pos->member != (head); \ 434 pos = list_entry(pos->member.next, typeof(*pos), member)) 442 #define list_for_each_entry_reverse(pos, head, member) \ 443 for (pos = list_entry((head)->prev, typeof(*pos), member); \ 444 prefetch(pos->member.prev), &pos->member != (head); \ 445 pos = list_entry(pos->member.prev, typeof(*pos), member)) 455 #define list_prepare_entry(pos, head, member) \ 456 ((pos) ? : list_entry(head, typeof(*pos), member)) 467 #define list_for_each_entry_continue(pos, head, member) \ 468 for (pos = list_entry(pos->member.next, typeof(*pos), member); \ 469 prefetch(pos->member.next), &pos->member != (head); \ 470 pos = list_entry(pos->member.next, typeof(*pos), member)) 481 #define list_for_each_entry_continue_reverse(pos, head, member) \ 482 for (pos = list_entry(pos->member.prev, typeof(*pos), member); \ 483 prefetch(pos->member.prev), &pos->member != (head); \ 484 pos = list_entry(pos->member.prev, typeof(*pos), member)) 494 #define list_for_each_entry_from(pos, head, member) \ 495 for (; prefetch(pos->member.next), &pos->member != (head); \ 496 pos = list_entry(pos->member.next, typeof(*pos), member)) 505 #define list_for_each_entry_safe(pos, n, head, member) \ 506 for (pos = list_entry((head)->next, typeof(*pos), member), \ 507 n = list_entry(pos->member.next, typeof(*pos), member); \ 508 &pos->member != (head); \ 509 pos = n, n = list_entry(n->member.next, typeof(*n), member)) 521 #define list_for_each_entry_safe_continue(pos, n, head, member) \ 522 for (pos = list_entry(pos->member.next, typeof(*pos), member), \ 523 n = list_entry(pos->member.next, typeof(*pos), member); \ 524 &pos->member != (head); \ 525 pos = n, n = list_entry(n->member.next, typeof(*n), member)) 537 #define list_for_each_entry_safe_from(pos, n, head, member) \ 538 for (n = list_entry(pos->member.next, typeof(*pos), member); \ 539 &pos->member != (head); \ 540 pos = n, n = list_entry(n->member.next, typeof(*n), member)) 552 #define list_for_each_entry_safe_reverse(pos, n, head, member) \ 553 for (pos = list_entry((head)->prev, typeof(*pos), member), \ 554 n = list_entry(pos->member.prev, typeof(*pos), member); \ 555 &pos->member != (head); \ 556 pos = n, n = list_entry(n->member.prev, typeof(*n), member)) 573 #define HLIST_HEAD_INIT { .first = NULL } 574 #define HLIST_HEAD(name) struct hlist_head name = { .first = NULL } 575 #define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL) 605 n->pprev = (
struct hlist_node **)LIST_POISON2;
610 if (!hlist_unhashed(n)) {
621 first->pprev = &n->next;
623 n->pprev = &h->first;
630 n->pprev = next->pprev;
632 next->pprev = &n->next;
639 next->next = n->next;
641 next->pprev = &n->next;
644 next->next->pprev = &next->next;
654 new_->first = old->first;
656 new_->first->pprev = &new_->first;
660 #define hlist_entry(ptr, type, member) container_of(ptr,type,member) 662 #define hlist_for_each(pos, head) \ 663 for (pos = (head)->first; pos && ({ prefetch(pos->next); 1; }); \ 666 #define hlist_for_each_safe(pos, n, head) \ 667 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \ 677 #define hlist_for_each_entry(tpos, pos, head, member) \ 678 for (pos = (head)->first; \ 679 pos && ({ prefetch(pos->next); 1;}) && \ 680 ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \ 689 #define hlist_for_each_entry_continue(tpos, pos, member) \ 690 for (pos = (pos)->next; \ 691 pos && ({ prefetch(pos->next); 1;}) && \ 692 ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \ 701 #define hlist_for_each_entry_from(tpos, pos, member) \ 702 for (; pos && ({ prefetch(pos->next); 1;}) && \ 703 ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \ 714 #define hlist_for_each_entry_safe(tpos, pos, n, head, member) \ 715 for (pos = (head)->first; \ 716 pos && ({ n = pos->next; 1; }) && \ 717 ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
#define UPNP_INLINE
Declares an inline function.
Definition: UpnpGlobal.h:99