Home
last modified time | relevance | path

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

/hal_stm32-3.5.0/lib/stm32wb/hci/
Dstm_list.c56 void LST_insert_head (tListNode * listHead, tListNode * node) in LST_insert_head() argument
63 node->next = listHead->next; in LST_insert_head()
64 node->prev = listHead; in LST_insert_head()
65 listHead->next = node; in LST_insert_head()
66 (node->next)->prev = node; in LST_insert_head()
72 void LST_insert_tail (tListNode * listHead, tListNode * node) in LST_insert_tail() argument
79 node->next = listHead; in LST_insert_tail()
80 node->prev = listHead->prev; in LST_insert_tail()
81 listHead->prev = node; in LST_insert_tail()
82 (node->prev)->next = node; in LST_insert_tail()
[all …]
Dstm_list.h35 void LST_insert_head (tListNode * listHead, tListNode * node);
37 void LST_insert_tail (tListNode * listHead, tListNode * node);
39 void LST_remove_node (tListNode * node);
41 void LST_remove_head (tListNode * listHead, tListNode ** node );
43 void LST_remove_tail (tListNode * listHead, tListNode ** node );
45 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);