58  * Insert a new entry between two known consecutive entries.
63 static inline void __list_add(struct list_head *new,  in __list_add()  argument
67 	next->prev = new;  in __list_add()
68 	new->next = next;  in __list_add()
69 	new->prev = prev;  in __list_add()
70 	prev->next = new;  in __list_add()
74  * list_add - add a new entry
75  * @new: new entry to be added
78  * Insert a new entry after the specified head.
81 static inline void list_add(struct list_head *new, struct list_head *head)  in list_add()  argument
83 	__list_add(new, head, head->next);  in list_add()
87  * list_add_tail - add a new entry
88  * @new: new entry to be added
91  * Insert a new entry before the specified head.
94 static inline void list_add_tail(struct list_head *new, struct list_head *head)  in list_add_tail()  argument
96 	__list_add(new, head->prev, head);  in list_add_tail()
131  * list_replace - replace old entry by new one
133  * @new : the new element to insert
138 				struct list_head *new)  in list_replace()  argument
140 	new->next = old->next;  in list_replace()
141 	new->next->prev = new;  in list_replace()
142 	new->prev = old->prev;  in list_replace()
143 	new->prev->next = new;  in list_replace()
147  * list_replace_init - replace old entry by new one and initialize the old one
149  * @new : the new element to insert
154 				     struct list_head *new)  in list_replace_init()  argument
156 	list_replace(old, new);  in list_replace_init()
380  * hlist_add_head - add a new entry at the beginning of the hlist
381  * @n: new entry to be added
384  * Insert a new entry after the specified head.