X-Git-Url: http://git.meshlink.io/?a=blobdiff_plain;f=src%2Flist.h;h=186e0ad616c26b21184a2ebe2a64b165d92a6b1f;hb=bcd1979454cd14087394f0c0a983205f6fbfcaf4;hp=a45803995bdce3e6fe3f5a273a0015aa16b2834e;hpb=4574b04f79d79d53492b7e0eb592d64ff9b2362b;p=meshlink diff --git a/src/list.h b/src/list.h index a4580399..186e0ad6 100644 --- a/src/list.h +++ b/src/list.h @@ -1,7 +1,9 @@ +#ifndef MESHLINK_LIST_H +#define MESHLINK_LIST_H + /* list.h -- header file for list.c - Copyright (C) 2000-2005 Ivo Timmermans - 2000-2006 Guus Sliepen + Copyright (C) 2014, 2017 Guus Sliepen 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 @@ -18,9 +20,6 @@ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */ -#ifndef __TINC_LIST_H__ -#define __TINC_LIST_H__ - typedef struct list_node_t { struct list_node_t *prev; struct list_node_t *next; @@ -36,7 +35,7 @@ typedef void (*list_action_node_t)(const list_node_t *); typedef struct list_t { list_node_t *head; list_node_t *tail; - int count; + unsigned int count; /* Callbacks */ @@ -45,7 +44,7 @@ typedef struct list_t { /* (De)constructors */ -extern list_t *list_alloc(list_action_t) __attribute__ ((__malloc__)); +extern list_t *list_alloc(list_action_t) __attribute__((__malloc__)); extern void list_free(list_t *); extern list_node_t *list_alloc_node(void); extern void list_free_node(list_t *, list_node_t *); @@ -55,6 +54,9 @@ extern void list_free_node(list_t *, list_node_t *); extern list_node_t *list_insert_head(list_t *, void *); extern list_node_t *list_insert_tail(list_t *, void *); extern list_node_t *list_insert_after(list_t *, list_node_t *, void *); +extern list_node_t *list_insert_before(list_t *, list_node_t *, void *); + +extern void list_delete(list_t *, const void *); extern void list_unlink_node(list_t *, list_node_t *); extern void list_delete_node(list_t *, list_node_t *); @@ -76,4 +78,6 @@ extern void list_delete_list(list_t *); extern void list_foreach(list_t *, list_action_t); extern void list_foreach_node(list_t *, list_action_node_t); -#endif /* __TINC_LIST_H__ */ +#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) + +#endif