Lines Matching defs:entry
38 * using the generic single-entry routines.
55 * Insert a new entry between two known consecutive entries.
71 * list_add - add a new entry
72 * @new: new entry to be added
75 * Insert a new entry after the specified head.
84 * list_add_tail - add a new entry
85 * @new: new entry to be added
88 * Insert a new entry before the specified head.
97 * Delete a list entry by making the prev/next entries
110 * list_del - deletes entry from list.
111 * @entry: the element to delete from the list.
112 * Note: list_empty on entry does not return true after this, the entry is
115 static inline void list_del(struct list_head *entry)
117 __list_del(entry->prev, entry->next);
118 entry->next = LIST_POISON1;
119 entry->prev = LIST_POISON2;
123 * list_del_init - deletes entry from list and reinitialize it.
124 * @entry: the element to delete from the list.
126 static inline void list_del_init(struct list_head *entry)
128 __list_del(entry->prev, entry->next);
129 INIT_LIST_HEAD(entry);
134 * @list: the entry to move
135 * @head: the head that will precede our entry
145 * @list: the entry to move
146 * @head: the head that will follow our entry
206 * list_entry - get the struct for this entry
231 * or 1 entry) most of the time.
245 * list_for_each_safe - iterate over a list safe against removal of list entry
277 * list_for_each_entry_safe - iterate over list of given type safe against removal of list entry