* Remove and return the first node from a list (there must be one). */
| 612 | * Remove and return the first node from a list (there must be one). |
| 613 | */ |
| 614 | static inline slist_node * |
| 615 | slist_pop_head_node(slist_head *head) |
| 616 | { |
| 617 | slist_node *node; |
| 618 | |
| 619 | Assert(!slist_is_empty(head)); |
| 620 | node = head->head.next; |
| 621 | head->head.next = node->next; |
| 622 | slist_check(head); |
| 623 | return node; |
| 624 | } |
| 625 | |
| 626 | /* |
| 627 | * Check whether 'node' has a following node. |
no test coverage detected