32   listHead->next = listHead;  in LST_init_head()
43   if(listHead->next == listHead)  in LST_is_empty()
63   node->next = listHead->next;  in LST_insert_head()
65   listHead->next = node;  in LST_insert_head()
66   (node->next)->prev = node;  in LST_insert_head()
79   node->next = listHead;  in LST_insert_tail()
82   (node->prev)->next = node;  in LST_insert_tail()
95   (node->prev)->next = node->next;  in LST_remove_node()
96   (node->next)->prev = node->prev;  in LST_remove_node()
109   *node = listHead->next;  in LST_remove_head()
110   LST_remove_node (listHead->next);  in LST_remove_head()
137   node->next = ref_node->next;  in LST_insert_node_after()
139   ref_node->next = node;  in LST_insert_node_after()
140   (node->next)->prev = node;  in LST_insert_node_after()
153   node->next = ref_node;  in LST_insert_node_before()
156   (node->prev)->next = node;  in LST_insert_node_before()
171   temp = listHead->next;  in LST_get_size()
175     temp = temp->next;  in LST_get_size()
190   *node = ref_node->next;  in LST_get_next_node()