Lines Matching defs:entry
30 * using the generic single-entry routines.
46 * Insert a new entry between two known consecutive entries.
62 * list_add - add a new entry
63 * @new: new entry to be added
66 * Insert a new entry after the specified head.
75 * list_add_tail - add a new entry
76 * @new: new entry to be added
79 * Insert a new entry before the specified head.
88 * Delete a list entry by making the prev/next entries
101 * list_del - deletes entry from list.
102 * @entry: the element to delete from the list.
103 * Note: list_empty on entry does not return true after this, the entry is
106 static inline void list_del(struct list_head *entry)
108 __list_del(entry->prev, entry->next);
109 entry->next = LIST_POISON1;
110 entry->prev = LIST_POISON2;
114 * list_del_init - deletes entry from list and reinitialize it.
115 * @entry: the element to delete from the list.
117 static inline void list_del_init(struct list_head *entry)
119 __list_del(entry->prev, entry->next);
120 INIT_LIST_HEAD(entry);
125 * @list: the entry to move
126 * @head: the head that will precede our entry
136 * @list: the entry to move
137 * @head: the head that will follow our entry
197 * list_entry - get the struct for this entry
223 * or 1 entry) most of the time.
238 * list_for_each_safe - iterate over a list safe against removal of list entry
270 * list_prepare_entry - prepare a pos entry for use as a start point in
293 * removal of list entry
307 * continuing after existing point safe against removal of list entry
321 * type safe against removal of list entry