2
Unix SMB/CIFS implementation.
4
Copyright (C) Andrew Tridgell 1998-2005
5
Copyright (C) Jelmer Vernooij 2005
7
This program is free software; you can redistribute it and/or modify
8
it under the terms of the GNU General Public License as published by
9
the Free Software Foundation; either version 3 of the License, or
10
(at your option) any later version.
12
This program is distributed in the hope that it will be useful,
13
but WITHOUT ANY WARRANTY; without even the implied warranty of
14
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15
GNU General Public License for more details.
17
You should have received a copy of the GNU General Public License
18
along with this program. If not, see <http://www.gnu.org/licenses/>.
21
/* To use these macros you must have a structure containing a next and
28
/* hook into the front of the list */
29
#define DLIST_ADD(list, p) \
33
(p)->next = (p)->prev = NULL; \
42
/* remove an element from a list - element doesn't have to be in list. */
43
#define DLIST_REMOVE(list, p) \
45
if ((p) == (list)) { \
47
if (list) (list)->prev = NULL; \
49
if ((p)->prev) (p)->prev->next = (p)->next; \
50
if ((p)->next) (p)->next->prev = (p)->prev; \
52
if ((p) != (list)) (p)->next = (p)->prev = NULL; \
55
/* promote an element to the top of the list */
56
#define DLIST_PROMOTE(list, p) \
58
DLIST_REMOVE(list, p); \
62
/* hook into the end of the list - needs a tmp pointer */
63
#define DLIST_ADD_END(list, p, type) \
67
(p)->next = (p)->prev = NULL; \
70
for (tmp = (list); tmp->next; tmp = tmp->next) ; \
77
/* insert 'p' after the given element 'el' in a list. If el is NULL then
78
this is the same as a DLIST_ADD() */
79
#define DLIST_ADD_AFTER(list, p, el) \
81
if (!(list) || !(el)) { \
87
if (p->next) p->next->prev = p; \
91
/* demote an element to the end of the list, needs a tmp pointer */
92
#define DLIST_DEMOTE(list, p, tmp) \
94
DLIST_REMOVE(list, p); \
95
DLIST_ADD_END(list, p, tmp); \
98
/* concatenate two lists - putting all elements of the 2nd list at the
99
end of the first list */
100
#define DLIST_CONCATENATE(list1, list2, type) \
106
for (tmp = (list1); tmp->next; tmp = tmp->next) ; \
107
tmp->next = (list2); \
109
(list2)->prev = tmp; \
114
#endif /* _DLINKLIST_H */
116
const char **ev_str_list_add(const char **list, const char *s);
117
int ev_set_blocking(int fd, bool set);
118
size_t ev_str_list_length(const char **list);
120
/* Defined here so we can build against older talloc versions that don't
121
* have this define yet. */
123
#define TALLOC_FREE(ctx) do { talloc_free(ctx); ctx=NULL; } while(0)