1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
|
/*
* Copyright (c) 2002-2003 Erik Fears
* Copyright (c) 2014-2019 ircd-hybrid development team
*
* 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 of the License, 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, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301
* USA
*/
/*! \file list.h
* \brief A header for the list manipulation routines.
* \version $Id$
*/
#ifndef LIST_H
#define LIST_H
#define LIST_FOREACH(pos, head) for (pos = (head); pos != NULL; pos = pos->next)
#define LIST_FOREACH_SAFE(pos, n, head) for (pos = (head), n = pos ? pos->next : NULL; pos != NULL; pos = n, n = pos ? pos->next : NULL)
#define LIST_FOREACH_PREV(pos, head) for (pos = (head); pos != NULL; pos = pos->prev)
#define LIST_SIZE(list) (list)->elements
typedef struct _node node_t;
typedef struct _list list_t;
struct _list
{
struct _node *head;
struct _node *tail;
unsigned int elements;
};
struct _node
{
struct _node *next;
struct _node *prev;
void *data;
};
extern node_t *node_create(void);
extern void node_free(node_t *);
extern node_t *list_add(void *, node_t *, list_t *);
extern node_t *list_remove(node_t *, list_t *);
#endif /* LIST_H */
|