| 241 | } |
| 242 | |
| 243 | rt_inline rt_slist_t *rt_slist_remove(rt_slist_t *l, rt_slist_t *n) |
| 244 | { |
| 245 | /* remove slist head */ |
| 246 | struct rt_slist_node *node = l; |
| 247 | while (node->next && node->next != n) node = node->next; |
| 248 | |
| 249 | /* remove node */ |
| 250 | if (node->next != (rt_slist_t *)0) |
| 251 | { |
| 252 | node->next = node->next->next; |
| 253 | n->next = RT_NULL; |
| 254 | } |
| 255 | |
| 256 | return l; |
| 257 | } |
| 258 | |
| 259 | rt_inline rt_slist_t *rt_slist_first(rt_slist_t *l) |
| 260 | { |
no outgoing calls
no test coverage detected