Home
last modified time | relevance | path

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

/hal_stm32-latest/lib/stm32wba/BLE_TransparentMode/System/Modules/
Dstm_list.c124 void LST_insert_node_after (tListNode * node, tListNode * ref_node) in LST_insert_node_after() argument
131 node->next = ref_node->next; in LST_insert_node_after()
132 node->prev = ref_node; in LST_insert_node_after()
133 ref_node->next = node; in LST_insert_node_after()
139 void LST_insert_node_before (tListNode * node, tListNode * ref_node) in LST_insert_node_before() argument
146 node->next = ref_node; in LST_insert_node_before()
147 node->prev = ref_node->prev; in LST_insert_node_before()
148 ref_node->prev = node; in LST_insert_node_before()
175 void LST_get_next_node (tListNode * ref_node, tListNode ** node) in LST_get_next_node() argument
182 *node = ref_node->next; in LST_get_next_node()
[all …]
Dstm_list.h46 void LST_insert_node_after (tListNode * node, tListNode * ref_node);
48 void LST_insert_node_before (tListNode * node, tListNode * ref_node);
52 void LST_get_next_node (tListNode * ref_node, tListNode ** node);
54 void LST_get_prev_node (tListNode * ref_node, tListNode ** node);
/hal_stm32-latest/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);