From d7b5499013188ddc78f2b770cce78543b3b7c48c Mon Sep 17 00:00:00 2001
From: venaas <venaas>
Date: Thu, 5 Feb 2009 10:09:14 +0000
Subject: timeout for connect

git-svn-id: https://svn.testnett.uninett.no/radsecproxy/trunk@467 e88ac4ed-0b26-0410-9574-a7f39faa03bf
---
 list.c | 14 +++++++++++---
 1 file changed, 11 insertions(+), 3 deletions(-)

(limited to 'list.c')

diff --git a/list.c b/list.c
index 269ce09..ad0f8d0 100644
--- a/list.c
+++ b/list.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2006-2008 Stig Venaas <venaas@uninett.no>
+ * Copyright (C) 2006-2009 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
@@ -49,7 +49,8 @@ int list_push(struct list *list, void *data) {
     else
 	list->first = node;
     list->last = node;
-    
+
+    list->count++;
     return 1;
 }
 
@@ -67,7 +68,7 @@ void *list_shift(struct list *list) {
 	list->last = NULL;
     data = node->data;
     free(node);
-    
+    list->count--;
     return data;
 }
 
@@ -82,6 +83,7 @@ void list_removedata(struct list *list, void *data) {
     while (node->data == data) {
 	list->first = node->next;
 	free(node);
+	list->count--;
 	node = list->first;
 	if (!node) {
 	    list->last = NULL;
@@ -93,6 +95,7 @@ void list_removedata(struct list *list, void *data) {
 	    t = node->next;
 	    node->next = t->next;
 	    free(t);
+	    list->count--;
 	    if (!node->next) { /* we removed the last one */
 		list->last = node;
 		return;
@@ -109,3 +112,8 @@ struct list_node *list_first(struct list *list) {
 struct list_node *list_next(struct list_node *node) {
     return node->next;
 }
+
+/* returns number of nodes */
+uint32_t list_count(struct list *list) {
+    return list->count;
+}
-- 
cgit v1.2.3