57   item->node = *head;  in sl_slist_push()
72     node_ptr = &((*node_ptr)->node);  in sl_slist_push_back()
75   item->node = NULL;  in sl_slist_push_back()
93   *head = item->node;  in sl_slist_pop()
95   item->node = NULL;  in sl_slist_pop()
108   item->node = pos->node;  in sl_slist_insert()
109   pos->node = item;  in sl_slist_insert()
122   for (node_ptr = head; *node_ptr != NULL; node_ptr = &((*node_ptr)->node)) {  in sl_slist_remove()
124       *node_ptr = item->node;  in sl_slist_remove()
149     while ((*pp_item_l != NULL) && ((*pp_item_l)->node != NULL)) {  in sl_slist_sort()
150       sl_slist_node_t *p_item_r = (*pp_item_l)->node;  in sl_slist_sort()
157         sl_slist_node_t *p_tmp = p_item_r->node;  in sl_slist_sort()
160         p_item_r->node = *pp_item_l;  in sl_slist_sort()
161         (*pp_item_l)->node = p_tmp;  in sl_slist_sort()
163         pp_item_l = &(p_item_r->node);  in sl_slist_sort()
167         pp_item_l = &((*pp_item_l)->node);  in sl_slist_sort()