29  * Circular doubly linked list implementation.
49  * @list: list_head structure to be initialized.
51  * Initializes the list_head to point to itself.  If it is a list header,
52  * the result is an empty list.
54 static inline void INIT_LIST_HEAD(struct list_head *list)  in INIT_LIST_HEAD()  argument
56 	list->next = list;  in INIT_LIST_HEAD()
57 	list->prev = list;  in INIT_LIST_HEAD()
63  * This is only for internal list manipulation where we know
79  * @head: list head to add it after
92  * @head: list head to add it before
103  * Delete a list entry by making the prev/next entries
106  * This is only for internal list manipulation where we know
121  * list_del - deletes entry from list.
122  * @entry: the element to delete from the list.
134  * list_is_head - tests whether @list is the list @head
135  * @list: the entry to test
136  * @head: the head of the list
138 static inline int list_is_head(const struct list_head *list, const struct list_head *head)  in list_is_head()  argument
140 	return list == head;  in list_is_head()
144  * list_empty - tests whether a list is empty
145  * @head: the list to test.
162  * list_first_entry - get the first element from a list
163  * @ptr:	the list head to take the element from.
167  * Note, that list is expected to be not empty.
173  * list_next_entry - get the next element in list
181  * list_entry_is_head - test if the entry points to the head of the list
183  * @head:	the head for your list.
190  * list_for_each_entry - iterate over list of given type
192  * @head:	the head for your list.
201  * list_for_each_entry_safe - iterate over list of given type. Safe against removal of list entry
204  * @head:	the head for your list.