Lines Matching full:list
15 * Simple doubly linked list implementation.
40 * This is only for internal list manipulation where we know
56 * @head: list head to add it after
69 * @head: list head to add it before
80 * Delete a list entry by making the prev/next entries
83 * This is only for internal list manipulation where we know
94 * list_del - deletes entry from list.
95 * @entry: the element to delete from the list.
106 * list_del_init - deletes entry from list and reinitialize it.
107 * @entry: the element to delete from the list.
116 * list_empty - tests whether a list is empty
117 * @head: the list to test.
126 * @list: the new list to add.
127 * @head: the place to add it in the first list.
129 _INLINE_ void list_splice(struct list_head *list, struct list_head *head)
131 struct list_head *first = list->next;
133 if (first != list) {
134 struct list_head *last = list->prev;
155 * list_for_each - iterate over elements in a list
157 * @head: the head for your list.
163 * list_for_each_safe - iterate over elements in a list, but don't dereference
167 * @head: the head for your list (not included in iteration).
