Append the node to the end of the list.
| 64 | |
| 65 | // Append the node to the end of the list. |
| 66 | static inline void list_append(struct list_node *node, struct list_node *head) |
| 67 | { |
| 68 | _list_init(head); |
| 69 | /* With a circular list, we just need to insert before the head. */ |
| 70 | list_insert_before(node, head); |
| 71 | } |
| 72 | |
| 73 | // Pop the node from the end of the list. |
| 74 | static inline struct list_node *list_pop(struct list_node *head) |