123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566 |
- /*
- * 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, 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).back = NULL)
- #define LIST_UNLINK_PART(list, node, part) \
- do { \
- if ((node)->part back) \
- (node)->part back->part next = (node)->part next; \
- else \
- (list).head = (node)->part next; \
- if ((node)->part next) \
- (node)->part next->part back = (node)->part back; \
- else \
- (list).tail = (node)->part back; \
- } while (0)
- #define LIST_LINK_TAIL_PART(list, node, part) \
- do { \
- (node)->part next = NULL; \
- (node)->part back = (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 back == (node)); \
- else \
- assert((node) == (list).tail); \
- if ((node)->back) \
- assert((node)->part back->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
|