X-Git-Url: https://tinc-vpn.org/git/browse?p=tinc;a=blobdiff_plain;f=lib%2Flist.h;h=175d640e17fe282d147a32c0b5f508c104026467;hp=33035734cc10d595f517eed39c5192bd00649ed5;hb=1401faf608e1c8af0d0754e545b0ec79d2bd5d93;hpb=d9ce5a7f3f5eddb193b6a9b5974c7c49eac41ea1

diff --git a/lib/list.h b/lib/list.h
index 33035734..175d640e 100644
--- a/lib/list.h
+++ b/lib/list.h
@@ -1,7 +1,7 @@
 /*
     list.h -- header file for list.c
-    Copyright (C) 2000 Ivo Timmermans <itimmermans@bigfoot.com>
-                  2000 Guus Sliepen <guus@sliepen.warande.net>
+    Copyright (C) 2000,2001 Ivo Timmermans <ivo@o2w.nl>
+                  2000,2001 Guus Sliepen <guus@sliepen.eu.org>
 
     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
@@ -17,28 +17,64 @@
     along with this program; if not, write to the Free Software
     Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 
-    $Id: list.h,v 1.1.2.1 2000/11/15 22:04:48 zarq Exp $
+    $Id: list.h,v 1.1.2.9 2003/07/06 23:16:28 guus Exp $
 */
 
 #ifndef __TINC_LIST_H__
 #define __TINC_LIST_H__
 
-typedef struct list_callbacks_t {
-  int (*delete) (void *);
-} list_callbacks_t;
-
 typedef struct list_node_t {
-  void *data;
-  struct list_node_t *prev;
-  struct list_node_t *next;
+	struct list_node_t *prev;
+	struct list_node_t *next;
+
+	/* Payload */
+
+	void *data;
 } list_node_t;
 
+typedef void (*list_action_t)(const void *);
+typedef void (*list_action_node_t)(const list_node_t *);
+
 typedef struct list_t {
-  list_node_t *head;
-  list_node_t *tail;
-  list_callbacks_t *callbacks;
+	list_node_t *head;
+	list_node_t *tail;
+	int count;
+
+	/* Callbacks */
+
+	list_action_t delete;
 } list_t;
 
+/* (De)constructors */
+
+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 *);
+
+/* Insertion and deletion */
+
+extern list_node_t *list_insert_head(list_t *, void *);
+extern list_node_t *list_insert_tail(list_t *, void *);
+
+extern void list_unlink_node(list_t *, list_node_t *);
+extern void list_delete_node(list_t *, list_node_t *);
+
+extern void list_delete_head(list_t *);
+extern void list_delete_tail(list_t *);
+
+/* Head/tail lookup */
+
+extern void *list_get_head(list_t *);
+extern void *list_get_tail(list_t *);
+
+/* Fast list deletion */
+
+extern void list_delete_list(list_t *);
+
+/* Traversing */
 
+extern void list_foreach(list_t *, list_action_t);
+extern void list_foreach_node(list_t *, list_action_node_t);
 
-#endif /* __TINC_LIST_H__ */
+#endif							/* __TINC_LIST_H__ */