/* See the end of this file for copyright, license, and warranty information. */ #include #include void list_insert(struct list_head *head, struct list_head *new) { new->next = head->next; head->next->prev = new; new->prev = head; head->next = new; } void list_insert_before(struct list_head *head, struct list_head *new) { new->next = head; head->prev->next = new; new->prev = head->prev; head->prev = new; } void list_delete(struct list_head *head) { head->next->prev = head->prev; head->prev->next = head->next; # ifdef DEBUG head->next = NULL; head->prev = NULL; # endif } /* * This file is part of Ardix. * Copyright (c) 2020, 2021 Felix Kopp . * * Ardix is non-violent software: you may only use, redistribute, * and/or modify it under the terms of the CNPLv6+ as found in * the LICENSE file in the source code root directory or at * . * * Ardix comes with ABSOLUTELY NO WARRANTY, to the extent * permitted by applicable law. See the CNPLv6+ for details. */