Home
last modified time | relevance | path

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

/hal_stm32-3.5.0/lib/stm32wb/hci/
Dstm_list.c30 void LST_init_head (tListNode * listHead) in LST_init_head() argument
32 listHead->next = listHead; in LST_init_head()
33 listHead->prev = listHead; in LST_init_head()
36 uint8_t LST_is_empty (tListNode * listHead) in LST_is_empty() argument
43 if(listHead->next == listHead) in LST_is_empty()
56 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()
72 void LST_insert_tail (tListNode * listHead, tListNode * node) in LST_insert_tail() argument
[all …]
Dstm_list.h31 void LST_init_head (tListNode * listHead);
33 uint8_t LST_is_empty (tListNode * listHead);
35 void LST_insert_head (tListNode * listHead, tListNode * node);
37 void LST_insert_tail (tListNode * listHead, tListNode * node);
41 void LST_remove_head (tListNode * listHead, tListNode ** node );
43 void LST_remove_tail (tListNode * listHead, tListNode ** node );
49 int LST_get_size (tListNode * listHead);