Lines Matching refs:head
55 * @head: list head to add it after
57 * Insert a new entry after the specified head.
60 static inline void list_add(struct list_head *new, struct list_head *head)
62 __list_add(new, head, head->next);
68 * @head: list head to add it before
70 * Insert a new entry before the specified head.
73 static inline void list_add_tail(struct list_head *new, struct list_head *head)
75 __list_add(new, head->prev, head);
97 * @head: list head to add it after
99 * Insert a new entry after the specified head.
110 static inline void list_add_rcu(struct list_head *new, struct list_head *head)
112 __list_add_rcu(new, head, head->next);
118 * @head: list head to add it before
120 * Insert a new entry before the specified head.
132 struct list_head *head)
134 __list_add_rcu(new, head->prev, head);
245 * list_move - delete from one list and add as another's head
247 * @head: the head that will precede our entry
249 static inline void list_move(struct list_head *list, struct list_head *head)
252 list_add(list, head);
258 * @head: the head that will follow our entry
261 struct list_head *head)
264 list_add_tail(list, head);
268 * list_is_last - tests whether @list is the last entry in list @head
270 * @head: the head of the list
273 const struct list_head *head)
275 return list->next == head;
280 * @head: the list to test.
282 static inline int list_empty(const struct list_head *head)
284 return head->next == head;
289 * @head: the list to test
300 static inline int list_empty_careful(const struct list_head *head)
302 struct list_head *next = head->next;
303 return (next == head) && (next == head->prev);
307 struct list_head *head)
311 struct list_head *at = head->next;
313 first->prev = head;
314 head->next = first;
323 * @head: the place to add it in the first list.
325 static inline void list_splice(struct list_head *list, struct list_head *head)
328 __list_splice(list, head);
334 * @head: the place to add it in the first list.
339 struct list_head *head)
342 __list_splice(list, head);
359 * @head: the head for your list.
361 #define list_for_each(pos, head) \
362 for (pos = (head)->next; prefetch(pos->next), pos != (head); \
368 * @head: the head for your list.
375 #define __list_for_each(pos, head) \
376 for (pos = (head)->next; pos != (head); pos = pos->next)
381 * @head: the head for your list.
383 #define list_for_each_prev(pos, head) \
384 for (pos = (head)->prev; prefetch(pos->prev), pos != (head); \
391 * @head: the head for your list.
393 #define list_for_each_safe(pos, n, head) \
394 for (pos = (head)->next, n = pos->next; pos != (head); \
400 * @head: the head for your list.
403 #define list_for_each_entry(pos, head, member) \
404 for (pos = list_entry((head)->next, typeof(*pos), member); \
405 prefetch(pos->member.next), &pos->member != (head); \
411 * @head: the head for your list.
414 #define list_for_each_entry_reverse(pos, head, member) \
415 for (pos = list_entry((head)->prev, typeof(*pos), member); \
416 prefetch(pos->member.prev), &pos->member != (head); \
422 * @head: the head of the list
427 #define list_prepare_entry(pos, head, member) \
428 ((pos) ? : list_entry(head, typeof(*pos), member))
433 * @head: the head for your list.
439 #define list_for_each_entry_continue(pos, head, member) \
441 prefetch(pos->member.next), &pos->member != (head); \
447 * @head: the head for your list.
452 #define list_for_each_entry_from(pos, head, member) \
453 for (; prefetch(pos->member.next), &pos->member != (head); \
460 * @head: the head for your list.
463 #define list_for_each_entry_safe(pos, n, head, member) \
464 for (pos = list_entry((head)->next, typeof(*pos), member), \
466 &pos->member != (head); \
473 * @head: the head for your list.
479 #define list_for_each_entry_safe_continue(pos, n, head, member) \
482 &pos->member != (head); \
489 * @head: the head for your list.
495 #define list_for_each_entry_safe_from(pos, n, head, member) \
497 &pos->member != (head); \
504 * @head: the head for your list.
510 #define list_for_each_entry_safe_reverse(pos, n, head, member) \
511 for (pos = list_entry((head)->prev, typeof(*pos), member), \
513 &pos->member != (head); \
519 * @head: the head for your list.
525 #define list_for_each_rcu(pos, head) \
526 for (pos = (head)->next; \
527 prefetch(rcu_dereference(pos)->next), pos != (head); \
530 #define __list_for_each_rcu(pos, head) \
531 for (pos = (head)->next; \
532 rcu_dereference(pos) != (head); \
539 * @head: the head for your list.
547 #define list_for_each_safe_rcu(pos, n, head) \
548 for (pos = (head)->next; \
549 n = rcu_dereference(pos)->next, pos != (head); \
555 * @head: the head for your list.
562 #define list_for_each_entry_rcu(pos, head, member) \
563 for (pos = list_entry((head)->next, typeof(*pos), member); \
565 &pos->member != (head); \
572 * @head: the head for your list.
580 #define list_for_each_continue_rcu(pos, head) \
582 prefetch(rcu_dereference((pos))->next), (pos) != (head); \
586 * Double linked lists with a single pointer list head.
587 * Mostly useful for hash tables where the two pointer list head is
811 #define hlist_for_each(pos, head) \
812 for (pos = (head)->first; pos && ({ prefetch(pos->next); 1; }); \
815 #define hlist_for_each_safe(pos, n, head) \
816 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
823 * @head: the head for your list.
826 #define hlist_for_each_entry(tpos, pos, head, member) \
827 for (pos = (head)->first; \
860 * @head: the head for your list.
863 #define hlist_for_each_entry_safe(tpos, pos, n, head, member) \
864 for (pos = (head)->first; \
873 * @head: the head for your list.
880 #define hlist_for_each_entry_rcu(tpos, pos, head, member) \
881 for (pos = (head)->first; \