Lines Matching full:head
89 * @head: list head to add it after
91 * Insert a new entry after the specified head.
94 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
96 __list_add(new, head, head->next); in list_add()
102 * @head: list head to add it before
104 * Insert a new entry before the specified head.
107 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
109 __list_add(new, head->prev, head); in list_add_tail()
131 * @head: list head to add it after
133 * Insert a new entry after the specified head.
144 static inline void list_add_rcu(struct list_head *new, struct list_head *head) in list_add_rcu() argument
146 __list_add_rcu(new, head, head->next); in list_add_rcu()
152 * @head: list head to add it before
154 * Insert a new entry before the specified head.
166 struct list_head *head) in list_add_tail_rcu() argument
168 __list_add_rcu(new, head->prev, head); in list_add_tail_rcu()
238 * list_move - delete from one list and add as another's head
240 * @head: the head that will precede our entry
242 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
245 list_add(list, head); in list_move()
251 * @head: the head that will follow our entry
254 struct list_head *head) in list_move_tail() argument
257 list_add_tail(list, head); in list_move_tail()
262 * @head: the list to test.
264 static inline int list_empty(const struct list_head *head) in list_empty() argument
266 return head->next == head; in list_empty()
279 * @head: the list to test.
281 static inline int list_empty_careful(const struct list_head *head) in list_empty_careful() argument
283 struct list_head *next = head->next; in list_empty_careful()
284 return (next == head) && (next == head->prev); in list_empty_careful()
288 struct list_head *head) in __list_splice() argument
292 struct list_head *at = head->next; in __list_splice()
294 first->prev = head; in __list_splice()
295 head->next = first; in __list_splice()
304 * @head: the place to add it in the first list.
306 static inline void list_splice(struct list_head *list, struct list_head *head) in list_splice() argument
309 __list_splice(list, head); in list_splice()
315 * @head: the place to add it in the first list.
320 struct list_head *head) in list_splice_init() argument
323 __list_splice(list, head); in list_splice_init()
340 * @head: the head for your list.
342 #define list_for_each(pos, head) \ argument
343 for (pos = (head)->next, prefetch(pos->next); pos != (head); \
349 * @head: the head for your list.
356 #define __list_for_each(pos, head) \ argument
357 for (pos = (head)->next; pos != (head); pos = pos->next)
362 * @head: the head for your list.
364 #define list_for_each_prev(pos, head) \ argument
365 for (pos = (head)->prev, prefetch(pos->prev); pos != (head); \
372 * @head: the head for your list.
374 #define list_for_each_safe(pos, n, head) \ argument
375 for (pos = (head)->next, n = pos->next; pos != (head); \
381 * @head: the head for your list.
384 #define list_for_each_entry(pos, head, member) \ argument
385 for (pos = list_entry((head)->next, typeof(*pos), member), \
387 &pos->member != (head); \
394 * @head: the head for your list.
397 #define list_for_each_entry_reverse(pos, head, member) \ argument
398 for (pos = list_entry((head)->prev, typeof(*pos), member), \
400 &pos->member != (head); \
408 * @head: the head of the list
411 #define list_prepare_entry(pos, head, member) \ argument
412 ((pos) ? : list_entry(head, typeof(*pos), member))
418 * @head: the head for your list.
421 #define list_for_each_entry_continue(pos, head, member) \ argument
424 &pos->member != (head); \
432 * @head: the head for your list.
435 #define list_for_each_entry_safe(pos, n, head, member) \ argument
436 for (pos = list_entry((head)->next, typeof(*pos), member), \
438 &pos->member != (head); \
444 * @head: the head for your list.
450 #define list_for_each_rcu(pos, head) \ argument
451 for (pos = (head)->next, prefetch(pos->next); pos != (head); \
454 #define __list_for_each_rcu(pos, head) \ argument
455 for (pos = (head)->next; pos != (head); \
463 * @head: the head for your list.
469 #define list_for_each_safe_rcu(pos, n, head) \ argument
470 for (pos = (head)->next, n = pos->next; pos != (head); \
476 * @head: the head for your list.
483 #define list_for_each_entry_rcu(pos, head, member) \ argument
484 for (pos = list_entry((head)->next, typeof(*pos), member), \
486 &pos->member != (head); \
496 * @head: the head for your list.
502 #define list_for_each_continue_rcu(pos, head) \ argument
503 for ((pos) = (pos)->next, prefetch((pos)->next); (pos) != (head); \
507 * Double linked lists with a single pointer list head.
508 * Mostly useful for hash tables where the two pointer list head is
652 #define hlist_for_each(pos, head) \ argument
653 for (pos = (head)->first; pos && ({ prefetch(pos->next); 1; }); \
656 #define hlist_for_each_safe(pos, n, head) \ argument
657 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
664 * @head: the head for your list.
667 #define hlist_for_each_entry(tpos, pos, head, member) \ argument
668 for (pos = (head)->first; \
701 * @head: the head for your list.
704 #define hlist_for_each_entry_safe(tpos, pos, n, head, member) \ argument
705 for (pos = (head)->first; \
714 * @head: the head for your list.
721 #define hlist_for_each_entry_rcu(tpos, pos, head, member) \ argument
722 for (pos = (head)->first; \