53                    sl_slist_node_t *item)  in sl_slist_push()  argument
55   EFM_ASSERT((item != NULL) && (head != NULL));  in sl_slist_push()
57   item->node = *head;  in sl_slist_push()
58   *head = item;  in sl_slist_push()
65                         sl_slist_node_t *item)  in sl_slist_push_back()  argument
69   EFM_ASSERT((item != NULL) && (head != NULL));  in sl_slist_push_back()
75   item->node = NULL;  in sl_slist_push_back()
76   *node_ptr = item;  in sl_slist_push_back()
84   sl_slist_node_t *item;  in sl_slist_pop()  local
88   item = *head;  in sl_slist_pop()
89   if (item == NULL) {  in sl_slist_pop()
93   *head = item->node;  in sl_slist_pop()
95   item->node = NULL;  in sl_slist_pop()
97   return (item);  in sl_slist_pop()
103 void sl_slist_insert(sl_slist_node_t *item,  in sl_slist_insert()  argument
106   EFM_ASSERT((item != NULL) && (pos != NULL));  in sl_slist_insert()
108   item->node = pos->node;  in sl_slist_insert()
109   pos->node = item;  in sl_slist_insert()
116                      sl_slist_node_t *item)  in sl_slist_remove()  argument
120   EFM_ASSERT((item != NULL) && (head != NULL));  in sl_slist_remove()
123     if (*node_ptr == item) {  in sl_slist_remove()
124       *node_ptr = item->node;  in sl_slist_remove()