Lines Matching refs:new
57 * Insert a new entry between two known consecutive entries.
63 static inline void __list_add(struct list_head *new,
66 next->prev = new;
67 new->next = next;
68 new->prev = prev;
69 prev->next = new;
72 extern void __list_add(struct list_head *new,
77 * list_add - add a new entry
78 * @new: new entry to be added
81 * Insert a new entry after the specified head.
84 static inline void list_add(struct list_head *new, struct list_head *head)
86 __list_add(new, head, head->next);
90 * list_add_tail - add a new entry
91 * @new: new entry to be added
94 * Insert a new entry before the specified head.
97 static inline void list_add_tail(struct list_head *new, struct list_head *head)
99 __list_add(new, head->prev, head);
133 * list_replace - replace old entry by new one
135 * @new : the new element to insert
139 static inline void list_replace(struct list_head *old, struct list_head *new)
141 new->next = old->next;
142 new->next->prev = new;
143 new->prev = old->prev;
144 new->prev->next = new;
148 struct list_head *new)
150 list_replace(old, new);
250 * @list: a new list to add all removed entries
291 * @list: the new list to add.
303 * @list: the new list to add.
315 * @list: the new list to add.
331 * @list: the new list to add.