Return free memory more aggressively.

[radsecproxy.git] / list.h

diff --git a/list.h b/list.h
index 777ed78..d9c5199 100644 (file)
--- a/list.h
+++ b/list.h
@@ -1,10 +1,11 @@
-/*
- * Copyright (C) 2006-2008 Stig Venaas <venaas@uninett.no>
- *
- * Permission to use, copy, modify, and distribute this software for any
- * purpose with or without fee is hereby granted, provided that the above
- * copyright notice and this permission notice appear in all copies.
- */
+/* Copyright (c) 2007,2009, UNINETT AS */
+/* See LICENSE for licensing information. */
+
+#ifdef SYS_SOLARIS9
+#include <sys/inttypes.h>
+#else
+#include <stdint.h>
+#endif
 
 struct list_node {
     struct list_node *next;
@@ -13,6 +14,7 @@ struct list_node {
 
 struct list {
     struct list_node *first, *last;
+    uint32_t count;
 };
 
 /* allocates and initialises list structure; returns NULL if malloc fails */
@@ -29,9 +31,16 @@ void *list_shift(struct list *list);
 
 /* removes first entry with matching data pointer */
 void list_removedata(struct list *list, void *data);
-    
+
 /* returns first node */
 struct list_node *list_first(struct list *list);
 
 /* returns the next node after the argument */
 struct list_node *list_next(struct list_node *node);
+
+/* returns number of nodes */
+uint32_t list_count(struct list *list);
+
+/* Local Variables: */
+/* c-file-style: "stroustrup" */
+/* End: */