Lines Matching defs:entry
57 * using the generic single-entry routines.
76 * Insert a new entry between two known consecutive entries.
92 * list_add - add a new entry
93 * @new: new entry to be added
96 * Insert a new entry after the specified head.
105 * list_add_tail - add a new entry
106 * @new: new entry to be added
109 * Insert a new entry before the specified head.
118 * Delete a list entry by making the prev/next entries
131 * list_del - deletes entry from list.
132 * @entry: the element to delete from the list.
133 * Note: list_empty on entry does not return true after this, the entry is
136 static inline void list_del(struct list_head *entry)
138 __list_del(entry->prev, entry->next);
139 entry->next = LIST_POISON1;
140 entry->prev = LIST_POISON2;
144 * list_del_init - deletes entry from list and reinitialize it.
145 * @entry: the element to delete from the list.
147 static inline void list_del_init(struct list_head *entry)
149 __list_del(entry->prev, entry->next);
150 INIT_LIST_HEAD(entry);
155 * @list: the entry to move
156 * @head: the head that will precede our entry
166 * @list: the entry to move
167 * @head: the head that will follow our entry
192 * to the list entry is list_del_init(). Eg. it cannot be used
258 * list_entry - get the struct for this entry
285 * list_for_each_safe - iterate over a list safe against removal of list entry
317 * list_prepare_entry - prepare a pos entry for use as a start point in
339 * list_for_each_entry_safe - iterate over list of given type safe against removal of list entry
353 * continuing after existing point safe against removal of list entry
367 * removal of list entry