| 195 | } |
| 196 | |
| 197 | rt_inline void rt_slist_append(rt_slist_t *l, rt_slist_t *n) |
| 198 | { |
| 199 | struct rt_slist_node *node; |
| 200 | |
| 201 | node = l; |
| 202 | while (node->next) node = node->next; |
| 203 | |
| 204 | /* append the node to the tail */ |
| 205 | node->next = n; |
| 206 | n->next = RT_NULL; |
| 207 | } |
| 208 | |
| 209 | rt_inline void rt_slist_insert(rt_slist_t *l, rt_slist_t *n) |
| 210 | { |
no outgoing calls
no test coverage detected