40 	struct list_head *next, *prev;  member
43 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)
45 …T_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_head * next)  in __list_add()  argument
47 	next->prev = _new;  in __list_add()
48 	_new->next = next;  in __list_add()
50 	prev->next = _new;  in __list_add()
55 	__list_add(_new, head, head->next);  in list_add()
63 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next)  in __list_del()  argument
65 	next->prev = prev;  in __list_del()
66 	prev->next = next;  in __list_del()
71 	__list_del(entry->prev, entry->next);  in list_del()
76 	__list_del(entry->prev, entry->next);  in list_del_init()
82 	HPT_ASSERT(!(head->next==head && head->prev!=head));  in list_empty()
83 	return head->next == head;  in list_empty()
89 	struct list_head *first = list->next;  in __list_splice()
91 	struct list_head *at = head->next;  in __list_splice()
94 	head->next = first;  in __list_splice()
96 	last->next = at;  in __list_splice()
118 	for (pos = (head)->next; pos != (head); pos = pos->next)
121 	for (pos = (head)->next, n = pos->next; pos != (head); \
122 		pos = n, n = pos->next)
125 	((type *)((char *)((attached)->next)-(HPT_UPTR)(&((type *)0)->member)))