5
* Simple doubly linked list implementation.
7
* Some of the internal functions ("__xxx") are useful when
8
* manipulating whole lists rather than single entries, as
9
* sometimes we already know the next/prev entries and we can
10
* generate better code by using them directly rather than
11
* using the generic single-entry routines.
15
struct list_head *next, *prev;
18
#define LIST_HEAD_INIT(name) { &(name), &(name) }
20
#define LIST_HEAD(name) \
21
struct list_head name = { &name, &name }
23
#define INIT_LIST_HEAD(ptr) do { \
24
(ptr)->next = (ptr); (ptr)->prev = (ptr); \
28
* Insert a new entry between two known consecutive entries.
30
* This is only for internal list manipulation where we know
31
* the prev/next entries already!
33
static __inline__ void __list_add(struct list_head * new,
34
struct list_head * prev,
35
struct list_head * next)
44
* Insert a new entry after the specified head..
46
static __inline__ void list_add(struct list_head *new, struct list_head *head)
48
__list_add(new, head, head->next);
52
* Insert a new entry at the tail
54
static __inline__ void list_add_tail(struct list_head *new, struct list_head *head)
56
__list_add(new, head->prev, head);
60
* Delete a list entry by making the prev/next entries
61
* point to each other.
63
* This is only for internal list manipulation where we know
64
* the prev/next entries already!
66
static __inline__ void __list_del(struct list_head * prev,
67
struct list_head * next)
73
static __inline__ void list_del(struct list_head *entry)
75
__list_del(entry->prev, entry->next);
78
static __inline__ int list_empty(struct list_head *head)
80
return head->next == head;
84
* Splice in "list" into "head"
86
static __inline__ void list_splice(struct list_head *list, struct list_head *head)
88
struct list_head *first = list->next;
91
struct list_head *last = list->prev;
92
struct list_head *at = head->next;
102
#define list_entry(ptr, type, member) \
103
((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member)))
105
#define list_for_each(pos, head) \
106
for (pos = (head)->next; pos != (head); pos = pos->next)