Lines Matching refs:node
10 the head, tail or any internal node). To do this, the list stores two
11 pointers per node, and thus has somewhat higher runtime code and
23 next/prev pointers of a node with :c:func:`sys_dlist_peek_head`,
29 A dlist can be modified in constant time by removing a node with
30 :c:func:`sys_dlist_remove`, by adding a node to the head or tail of a list
32 inserting a node before an existing node with :c:func:`sys_dlist_insert`.
34 As for slist, each node in a dlist can be processed in a natural code
37 starting point, a "SAFE" variant that allows for removing the node
39 provides the pointer to a containing struct instead of the raw node,
43 :c:func:`sys_dlist_insert_at`, which inserts a node that linearly searches
47 not a node is currently linked into a dlist or not (via an
57 struct is inserted as a node into the list itself. This allows for a
64 prev/next pointers of a node vs. the list struct address.
72 nodes, where one node represents the list tracking struct.