Lines Matching refs:list

18  * non-initialized list entries.
24 * Simple doubly linked list implementation.
48 * This is only for internal list manipulation where we know
64 * @head: list head to add it after
77 * @head: list head to add it before
88 * Delete a list entry by making the prev/next entries
91 * This is only for internal list manipulation where we know
101 * list_del - deletes entry from list.
102 * @entry: the element to delete from the list.
114 * list_del_init - deletes entry from list and reinitialize it.
115 * @entry: the element to delete from the list.
124 * list_move - delete from one list and add as another's head
125 * @list: the entry to move
128 static inline void list_move(struct list_head *list, struct list_head *head)
130 __list_del(list->prev, list->next);
131 list_add(list, head);
135 * list_move_tail - delete from one list and add as another's tail
136 * @list: the entry to move
139 static inline void list_move_tail(struct list_head *list,
142 __list_del(list->prev, list->next);
143 list_add_tail(list, head);
147 * list_empty - tests whether a list is empty
148 * @head: the list to test.
155 static inline void __list_splice(struct list_head *list,
158 struct list_head *first = list->next;
159 struct list_head *last = list->prev;
171 * @list: the new list to add.
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)
176 if (!list_empty(list))
177 __list_splice(list, head);
181 * list_splice_init - join two lists and reinitialise the emptied list.
182 * @list: the new list to add.
183 * @head: the place to add it in the first list.
185 * The list at @list is reinitialised
187 static inline void list_splice_init(struct list_head *list,
190 if (!list_empty(list)) {
191 __list_splice(list, head);
192 INIT_LIST_HEAD(list);
206 * list_for_each - iterate over a list
208 * @head: the head for your list.
216 * __list_for_each - iterate over a list
218 * @head: the head for your list.
221 * simplest possible list iteration code, no prefetching is done.
222 * Use this for code that knows the list to be very short (empty
229 * list_for_each_prev - iterate over a list backwards
231 * @head: the head for your list.
238 * list_for_each_safe - iterate over a list safe against removal of list entry
241 * @head: the head for your list.
248 * list_for_each_entry - iterate over list of given type
250 * @head: the head for your list.
259 * list_for_each_entry_reverse - iterate backwards over list of given type.
261 * @head: the head for your list.
273 * @head: the head of the list
280 * list_for_each_entry_continue - iterate over list of given type
283 * @head: the head for your list.
292 * list_for_each_entry_safe - iterate over list of given type safe against
293 * removal of list entry
296 * @head: the head for your list.
306 * list_for_each_entry_safe_continue - iterate over list of given type
307 * continuing after existing point safe against removal of list entry
310 * @head: the head for your list.
320 * list_for_each_entry_safe_reverse - iterate backwards over list of given
321 * type safe against removal of list entry
324 * @head: the head for your list.