X-Git-Url: https://www.tinc-vpn.org/git/browse?p=tinc;a=blobdiff_plain;f=lib%2Flist.h;h=dc82fc4590bfe8bf39929625c38d31cf324267c1;hp=86e17e62d15ddc8fc7f99727304f3f0db6f7094d;hb=dced64c5c3625f6d2f0674e9fed14455aabc635e;hpb=2626c641aa714a8d776f1bb16340586d935aa6b1

diff --git a/lib/list.h b/lib/list.h
index 86e17e62..dc82fc45 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-2004 Ivo Timmermans <ivo@tinc-vpn.org>
+                  2000-2004 Guus Sliepen <guus@tinc-vpn.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,31 +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.2 2000/11/16 22:13:09 zarq Exp $
+    $Id$
 */
 
 #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;
 
-extern list_t *list_new(void);
-extern void list_append(list_t *, void *);
-extern void list_forall_nodes(list_t *, int (*)(void *));
+/* (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__ */