25 #define LELY_UTIL_SLLIST_INLINE extern inline 37 while (*pnode && (*pnode)->
next)
38 pnode = &(*pnode)->
next;
39 struct slnode *node = *pnode;
41 *(list->
plast = pnode) = NULL;
52 while (*pnode && *pnode != node)
53 pnode = &(*pnode)->
next;
54 if ((node = *pnode)) {
55 if (!(*pnode = node->
next))
struct slnode ** plast
A pointer to the next field of the last node in the list.
struct slnode * sllist_remove(struct sllist *list, struct slnode *node)
Removes a node from a singly-linked list.
A node in a singly-linked list.
struct slnode * first
A pointer to the first node in the list.
struct slnode * next
A pointer to the next node in the list.
#define structof(ptr, type, member)
Obtains the address of a structure from the address of one of its members.
This header file is part of the utilities library; it contains the singly-linked list declarations...
struct slnode * sllist_last(const struct sllist *list)
Returns a pointer to the last node in a singly-linked list.
This is the public header file of the utilities library.
struct slnode * sllist_pop_back(struct sllist *list)
Pops a node from the back of a singly-linked list.
A node in a pairing heap.