| 1 | /* |
| 2 | * dlist.h |
| 3 | * - macros for handling doubly linked lists |
| 4 | */ |
| 5 | /* |
| 6 | * This file is part of adns, which is |
| 7 | * Copyright (C) 1997-2000,2003,2006 Ian Jackson |
| 8 | * Copyright (C) 1999-2000,2003,2006 Tony Finch |
| 9 | * Copyright (C) 1991 Massachusetts Institute of Technology |
| 10 | * (See the file INSTALL for full details.) |
| 11 | * |
| 12 | * This program is free software; you can redistribute it and/or modify |
| 13 | * it under the terms of the GNU General Public License as published by |
| 14 | * the Free Software Foundation; either version 2, or (at your option) |
| 15 | * any later version. |
| 16 | * |
| 17 | * This program is distributed in the hope that it will be useful, |
| 18 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 19 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 20 | * GNU General Public License for more details. |
| 21 | * |
| 22 | * You should have received a copy of the GNU General Public License |
| 23 | * along with this program; if not, write to the Free Software Foundation, |
| 24 | * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
| 25 | */ |
| 26 | |
| 27 | #ifndef ADNS_DLIST_H_INCLUDED |
| 28 | #define ADNS_DLIST_H_INCLUDED |
| 29 | |
| 30 | #define LIST_INIT(list) ((list).head= (list).tail= 0) |
| 31 | #define LINK_INIT(link) ((link).next= (link).back= 0) |
| 32 | |
| 33 | #define LIST_UNLINK_PART(list,node,part) \ |
| 34 | do { \ |
| 35 | if ((node)->part back) (node)->part back->part next= (node)->part next; \ |
| 36 | else (list).head= (node)->part next; \ |
| 37 | if ((node)->part next) (node)->part next->part back= (node)->part back; \ |
| 38 | else (list).tail= (node)->part back; \ |
| 39 | } while(0) |
| 40 | |
| 41 | #define LIST_LINK_TAIL_PART(list,node,part) \ |
| 42 | do { \ |
| 43 | (node)->part next= 0; \ |
| 44 | (node)->part back= (list).tail; \ |
| 45 | if ((list).tail) (list).tail->part next= (node); \ |
| 46 | else (list).head= (node); \ |
| 47 | (list).tail= (node); \ |
| 48 | } while(0) |
| 49 | |
| 50 | #define LIST_UNLINK(list,node) LIST_UNLINK_PART(list,node,) |
| 51 | #define LIST_LINK_TAIL(list,node) LIST_LINK_TAIL_PART(list,node,) |
| 52 | |
| 53 | #endif |