r6.0.1:lfds601_slist_delete_element
Source Files
/liblfds601/src/lfds601_slist/lfds601_slist_delete.c /liblfds601/inc/liblfds601.h
Prototype
void lfds601_slist_delete_element( struct lfds601_slist_state *ss, struct lfds601_slist_element *se );
Parameters
struct lfds601_slist_state *ss
- An slist state as allocated by lfds601_slist_new.
struct lfds601_slist_element *se
- A pointer to an slist element, as obtained from lfds601_slist_new_head, lfds601_slist_new_next, lfds601_slist_get_head, lfds601_slist_get_next or lfds601_slist_get_head_and_then_next.
Return Value
No return value.
Notes
This function logically deletes se. By logically delete, it is meant that the memory for the slist element is not freed and the element remains in the list (thus continuing to affect traversal performance) but that the element is no longer apparent to the user of the list; for example, calling lfds601_slist_get_next on the element immediately before a deleted element will return the element immediately after the deleted element.
It may be that other threads still hold a pointer to the logically deleted element. The element however is still in the list and all operations on the list properly update the pointers in deleted elements, so it is safe to perform all slist operations on a deleted element so you can also for example call lfds601_slist_new_next on a deleted element and insert a new element after the deleted element.
As such, it is expected and normal after an element has been deleted to call lfds601_slist_get_next to progress on to the next element in the slist.