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