43 	struct list_head *next, *prev;  member
46 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)
48 …T_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_head * next)  in __list_add()  argument
50 	next->prev = _new;  in __list_add()
51 	_new->next = next;  in __list_add()
53 	prev->next = _new;  in __list_add()
58 	__list_add(_new, head, head->next);  in list_add()
66 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next)  in __list_del()  argument
68 	next->prev = prev;  in __list_del()
69 	prev->next = next;  in __list_del()
74 	__list_del(entry->prev, entry->next);  in list_del()
79 	__list_del(entry->prev, entry->next);  in list_del_init()
85 	HPT_ASSERT(!(head->next==head && head->prev!=head));  in list_empty()
86 	return head->next == head;  in list_empty()
92 	struct list_head *first = list->next;  in __list_splice()
94 	struct list_head *at = head->next;  in __list_splice()
97 	head->next = first;  in __list_splice()
99 	last->next = at;  in __list_splice()
121 	for (pos = (head)->next; pos != (head); pos = pos->next)
124 	for (pos = (head)->next, n = pos->next; pos != (head); \
125 		pos = n, n = pos->next)
128 	((type *)((char *)((attached)->next)-(HPT_UPTR)(&((type *)0)->member)))