| /* |
| * dlist.h - macros for handling doubly linked lists |
| * |
| * Copyright © 1997-1999 Ian Jackson <ian@davenant.greenend.org.uk> |
| * |
| * This program is free software; you can redistribute it and/or modify |
| * it under the terms of the GNU General Public License as published by |
| * the Free Software Foundation; either version 2 of the License, or |
| * (at your option) any later version. |
| * |
| * This program is distributed in the hope that it will be useful, |
| * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| * GNU General Public License for more details. |
| * |
| * You should have received a copy of the GNU General Public License |
| * along with this program. If not, see <http://www.gnu.org/licenses/>. |
| */ |
| |
| #ifndef ADNS_DLIST_H_INCLUDED |
| #define ADNS_DLIST_H_INCLUDED |
| |
| #define LIST_INIT(list) ((list).head = (list).tail = NULL) |
| #define LINK_INIT(link) ((link).next = (link).prev = NULL) |
| |
| #define LIST_UNLINK_PART(list, node, part) \ |
| do { \ |
| if ((node)->part prev) \ |
| (node)->part prev->part next = (node)->part next; \ |
| else \ |
| (list).head = (node)->part next; \ |
| if ((node)->part next) \ |
| (node)->part next->part prev = (node)->part prev; \ |
| else \ |
| (list).tail = (node)->part prev; \ |
| } while (0) |
| |
| #define LIST_LINK_TAIL_PART(list, node, part) \ |
| do { \ |
| (node)->part next = NULL; \ |
| (node)->part prev = (list).tail; \ |
| if ((list).tail) \ |
| (list).tail->part next = (node); \ |
| else (list).head = (node); \ |
| (list).tail = (node); \ |
| } while (0) |
| |
| |
| #define LIST_CHECKNODE_PART(list, node, part) \ |
| do { \ |
| if ((node)->next) \ |
| assert((node)->part next->part prev == (node)); \ |
| else \ |
| assert((node) == (list).tail); \ |
| if ((node)->prev) \ |
| assert((node)->part prev->part next == (node)); \ |
| else \ |
| assert((node) == (list).head); \ |
| } while (0) |
| |
| #define LIST_UNLINK(list, node) LIST_UNLINK_PART(list, node,) |
| #define LIST_LINK_TAIL(list, node) LIST_LINK_TAIL_PART(list, node,) |
| #define LIST_CHECKNODE(list, node) LIST_CHECKNODE_PART(list, node,) |
| |
| #endif |