1 #ifndef MESHLINK_LIST_H
2 #define MESHLINK_LIST_H
5 list.h -- header file for list.c
6 Copyright (C) 2014, 2017 Guus Sliepen <guus@meshlink.io>
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License along
19 with this program; if not, write to the Free Software Foundation, Inc.,
20 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
23 typedef struct list_node_t {
24 struct list_node_t *prev;
25 struct list_node_t *next;
32 typedef void (*list_action_t)(const void *);
33 typedef void (*list_action_node_t)(const list_node_t *);
35 typedef struct list_t {
45 /* (De)constructors */
47 extern list_t *list_alloc(list_action_t) __attribute__((__malloc__));
48 extern void list_free(list_t *);
50 /* Insertion and deletion */
52 extern list_node_t *list_insert_head(list_t *, void *);
53 extern list_node_t *list_insert_tail(list_t *, void *);
55 extern void list_delete(list_t *, const void *);
57 extern void list_delete_node(list_t *, list_node_t *);
59 extern void list_delete_head(list_t *);
60 extern void list_delete_tail(list_t *);
62 /* Head/tail lookup */
64 extern void *list_get_head(list_t *);
65 extern void *list_get_tail(list_t *);
67 /* Fast list deletion */
69 extern void list_delete_list(list_t *);
73 extern void list_foreach(list_t *, list_action_t);
74 extern void list_foreach_node(list_t *, list_action_node_t);
76 #define list_each(type, item, list) (type *item = (type *)1; item; item = NULL) for(list_node_t *node = (list)->head, *next; item = node ? node->data : NULL, next = node ? node->next : NULL, node; node = next)