30 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
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()
102 void LST_remove_head (tListNode * listHead, tListNode ** node )  in LST_remove_head()  argument
109   *node = listHead->next;  in LST_remove_head()
110   LST_remove_node (listHead->next);  in LST_remove_head()
116 void LST_remove_tail (tListNode * listHead, tListNode ** node )  in LST_remove_tail()  argument
123   *node = listHead->prev;  in LST_remove_tail()
124   LST_remove_node (listHead->prev);  in LST_remove_tail()
162 int LST_get_size (tListNode * listHead)  in LST_get_size()  argument
171   temp = listHead->next;  in LST_get_size()
172   while (temp != listHead)  in LST_get_size()