2
Unix SMB/CIFS implementation.
3
some simple double linked list macros
4
Copyright (C) Andrew Tridgell 1998
6
This program is free software; you can redistribute it and/or modify
7
it under the terms of the GNU General Public License as published by
8
the Free Software Foundation; either version 3 of the License, or
9
(at your option) any later version.
11
This program is distributed in the hope that it will be useful,
12
but WITHOUT ANY WARRANTY; without even the implied warranty of
13
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
GNU General Public License for more details.
16
You should have received a copy of the GNU General Public License
17
along with this program. If not, see <http://www.gnu.org/licenses/>.
20
/* To use these macros you must have a structure containing a next and
24
/* hook into the front of the list */
25
#define DLIST_ADD(list, p) \
29
(p)->next = (p)->prev = NULL; \
38
/* remove an element from a list - element doesn't have to be in list. */
40
#define DLIST_REMOVE(list, p) \
42
if ((p) == (list)) { \
44
if (list) (list)->prev = NULL; \
46
if ((p)->prev) (p)->prev->next = (p)->next; \
47
if ((p)->next) (p)->next->prev = (p)->prev; \
49
if ((p) && ((p) != (list))) (p)->next = (p)->prev = NULL; \
53
/* promote an element to the top of the list */
54
#define DLIST_PROMOTE(list, p) \
56
DLIST_REMOVE(list, p); \
60
/* hook into the end of the list - needs a tmp pointer */
61
#define DLIST_ADD_END(list, p, type) \
65
(p)->next = (p)->prev = NULL; \
68
for (tmp = (list); tmp->next; tmp = tmp->next) ; \
75
/* insert 'p' after the given element 'el' in a list. If el is NULL then
76
this is the same as a DLIST_ADD() */
77
#define DLIST_ADD_AFTER(list, p, el) \
79
if (!(list) || !(el)) { \
85
if (p->next) p->next->prev = p; \
89
/* demote an element to the end of the list, needs a tmp pointer */
90
#define DLIST_DEMOTE(list, p, tmp) \
92
DLIST_REMOVE(list, p); \
93
DLIST_ADD_END(list, p, tmp); \
96
/* concatenate two lists - putting all elements of the 2nd list at the
97
end of the first list */
98
#define DLIST_CONCATENATE(list1, list2, type) \
104
for (tmp = (list1); tmp->next; tmp = tmp->next) ; \
105
tmp->next = (list2); \
107
(list2)->prev = tmp; \