Lines Matching full:element

45  * We need one list head in bar and a list element in all list_of_foos (both are of
66 * Then we create the first element and add it to this list:
72 * Repeat the above for each element you want to add to the list. Deleting
73 * works with the element itself.
144 * Insert a new element after the given list head. The new element does not
147 * head → some element → ...
149 * head → new element → older element → ...
155 * @param entry The new element to prepend to the list.
165 * Append a new element to the end of the list given with this list head.
168 * head → some element → ... → lastelement
170 * head → some element → ... → lastelement → new element
176 * @param entry The new element to prepend to the list.
193 * Remove the element from the list it is in. Using this function will reset
194 * the pointers to/from this element so it is removed from the list. It does
195 * NOT free the element itself or manipulate it otherwise.
198 * this file) will NOT remove the first element from
204 * @param entry The element to remove.
241 * Returns a pointer to the container of this list element.
249 * @param type Data type of the list element.
250 * @param member Member name of the struct list_head field in the list element.
272 * @param type Data type of the list element to retrieve
273 * @param member Member name of the struct list_head field in the list element.
274 * @return A pointer to the first list element.
287 * @param type Data type of the list element to retrieve
288 * @param member Member name of the struct list_head field in the list element.
289 * @return A pointer to the last list element.
320 * Loop through the list, keeping a backup pointer to the element. This
321 * macro allows for the deletion of a list element while looping through the