Lines Matching +full:- +full:- +full:head
1 /* SPDX-License-Identifier: GPL-2.0-or-later */
7 #define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
11 const typeof(((type *)0)->member) * __mptr = (ptr); \
12 (type *)((char *)__mptr - offsetof(type, member)); \
16 * These are non-NULL pointers that will result in page faults
18 * non-initialized list entries.
30 * using the generic single-entry routines.
42 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
55 next->prev = new; in __list_add()
56 new->next = next; in __list_add()
57 new->prev = prev; in __list_add()
58 prev->next = new; in __list_add()
62 * list_add - add a new entry
64 * @head: list head to add it after
66 * Insert a new entry after the specified head.
69 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
71 __list_add(new, head, head->next); in list_add()
75 * list_add_tail - add a new entry
77 * @head: list head to add it before
79 * Insert a new entry before the specified head.
82 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
84 __list_add(new, head->prev, head); in list_add_tail()
96 next->prev = prev; in __list_del()
97 prev->next = next; in __list_del()
101 * list_del - deletes entry from list.
108 __list_del(entry->prev, entry->next); in list_del()
109 entry->next = LIST_POISON1; in list_del()
110 entry->prev = LIST_POISON2; in list_del()
114 * list_del_init - deletes entry from list and reinitialize it.
119 __list_del(entry->prev, entry->next); in list_del_init()
124 * list_move - delete from one list and add as another's head
126 * @head: the head that will precede our entry
128 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
130 __list_del(list->prev, list->next); in list_move()
131 list_add(list, head); in list_move()
135 * list_move_tail - delete from one list and add as another's tail
137 * @head: the head that will follow our entry
140 struct list_head *head) in list_move_tail() argument
142 __list_del(list->prev, list->next); in list_move_tail()
143 list_add_tail(list, head); in list_move_tail()
147 * list_empty - tests whether a list is empty
148 * @head: the list to test.
150 static inline int list_empty(const struct list_head *head) in list_empty() argument
152 return head->next == head; in list_empty()
156 struct list_head *head) in __list_splice() argument
158 struct list_head *first = list->next; in __list_splice()
159 struct list_head *last = list->prev; in __list_splice()
160 struct list_head *at = head->next; in __list_splice()
162 first->prev = head; in __list_splice()
163 head->next = first; in __list_splice()
165 last->next = at; in __list_splice()
166 at->prev = last; in __list_splice()
170 * list_splice - join two lists
172 * @head: the place to add it in the first list.
174 static inline void list_splice(struct list_head *list, struct list_head *head) in list_splice() argument
177 __list_splice(list, head); in list_splice()
181 * list_splice_init - join two lists and reinitialise the emptied list.
183 * @head: the place to add it in the first list.
188 struct list_head *head) in list_splice_init() argument
191 __list_splice(list, head); in list_splice_init()
197 * list_entry - get the struct for this entry
206 * list_for_each - iterate over a list
208 * @head: the head for your list.
211 #define list_for_each(pos, head) \ argument
212 for (pos = (head)->next; pos != (head); \
213 pos = pos->next)
216 * __list_for_each - iterate over a list
218 * @head: the head for your list.
225 #define __list_for_each(pos, head) \ argument
226 for (pos = (head)->next; pos != (head); pos = pos->next)
229 * list_for_each_prev - iterate over a list backwards
231 * @head: the head for your list.
233 #define list_for_each_prev(pos, head) \ argument
234 for (pos = (head)->prev; prefetch(pos->prev), pos != (head); \
235 pos = pos->prev)
238 * list_for_each_safe - iterate over a list safe against removal of list entry
241 * @head: the head for your list.
243 #define list_for_each_safe(pos, n, head) \ argument
244 for (pos = (head)->next, n = pos->next; pos != (head); \
245 pos = n, n = pos->next)
248 * list_for_each_entry - iterate over list of given type
250 * @head: the head for your list.
253 #define list_for_each_entry(pos, head, member) \ argument
254 for (pos = list_entry((head)->next, typeof(*pos), member); \
255 &pos->member != (head); \
256 pos = list_entry(pos->member.next, typeof(*pos), member))
259 * list_for_each_entry_reverse - iterate backwards over list of given type.
261 * @head: the head for your list.
264 #define list_for_each_entry_reverse(pos, head, member) \ argument
265 for (pos = list_entry((head)->prev, typeof(*pos), member); \
266 &pos->member != (head); \
267 pos = list_entry(pos->member.prev, typeof(*pos), member))
270 * list_prepare_entry - prepare a pos entry for use as a start point in
273 * @head: the head of the list
276 #define list_prepare_entry(pos, head, member) \ argument
277 ((pos) ? : list_entry(head, typeof(*pos), member))
280 * list_for_each_entry_continue - iterate over list of given type
283 * @head: the head for your list.
286 #define list_for_each_entry_continue(pos, head, member) \ argument
287 for (pos = list_entry(pos->member.next, typeof(*pos), member); \
288 &pos->member != (head); \
289 pos = list_entry(pos->member.next, typeof(*pos), member))
292 * list_for_each_entry_safe - iterate over list of given type safe against
296 * @head: the head for your list.
299 #define list_for_each_entry_safe(pos, n, head, member) \ argument
300 for (pos = list_entry((head)->next, typeof(*pos), member), \
301 n = list_entry(pos->member.next, typeof(*pos), member); \
302 &pos->member != (head); \
303 pos = n, n = list_entry(n->member.next, typeof(*n), member))
306 * list_for_each_entry_safe_continue - iterate over list of given type
310 * @head: the head for your list.
313 #define list_for_each_entry_safe_continue(pos, n, head, member) \ argument
314 for (pos = list_entry(pos->member.next, typeof(*pos), member), \
315 n = list_entry(pos->member.next, typeof(*pos), member); \
316 &pos->member != (head); \
317 pos = n, n = list_entry(n->member.next, typeof(*n), member))
320 * list_for_each_entry_safe_reverse - iterate backwards over list of given
324 * @head: the head for your list.
327 #define list_for_each_entry_safe_reverse(pos, n, head, member) \ argument
328 for (pos = list_entry((head)->prev, typeof(*pos), member), \
329 n = list_entry(pos->member.prev, typeof(*pos), member); \
330 &pos->member != (head); \
331 pos = n, n = list_entry(n->member.prev, typeof(*n), member))