Home
last modified time | relevance | path

Searched refs:ref_node (Results 1 – 2 of 2) sorted by relevance

/hal_stm32-3.5.0/lib/stm32wb/hci/
Dstm_list.c130 void LST_insert_node_after (tListNode * node, tListNode * ref_node) in LST_insert_node_after() argument
137 node->next = ref_node->next; in LST_insert_node_after()
138 node->prev = ref_node; in LST_insert_node_after()
139 ref_node->next = node; in LST_insert_node_after()
146 void LST_insert_node_before (tListNode * node, tListNode * ref_node) in LST_insert_node_before() argument
153 node->next = ref_node; in LST_insert_node_before()
154 node->prev = ref_node->prev; in LST_insert_node_before()
155 ref_node->prev = node; in LST_insert_node_before()
183 void LST_get_next_node (tListNode * ref_node, tListNode ** node) in LST_get_next_node() argument
190 *node = ref_node->next; in LST_get_next_node()
[all …]
Dstm_list.h45 void LST_insert_node_after (tListNode * node, tListNode * ref_node);
47 void LST_insert_node_before (tListNode * node, tListNode * ref_node);
51 void LST_get_next_node (tListNode * ref_node, tListNode ** node);
53 void LST_get_prev_node (tListNode * ref_node, tListNode ** node);