Remove redundant spaces.

[tinc] / lib / list.c

diff --git a/lib/list.c b/lib/list.c
index d47ce0e..4c4a3f6 100644 (file)
--- a/lib/list.c
+++ b/lib/list.c
@@ -17,7 +17,7 @@
     along with this program; if not, write to the Free Software
     Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 
-    $Id: list.c,v 1.1.2.12 2002/09/09 21:49:16 guus Exp $
+    $Id: list.c,v 1.1.2.13 2002/09/09 22:32:27 guus Exp $
 */
 
 #include "config.h"
@@ -41,7 +41,7 @@ list_t *list_alloc(list_action_t delete)
        return list;
 }
 
-void list_free(list_t * list)
+void list_free(list_t *list)
 {
        free(list);
 }
@@ -51,7 +51,7 @@ list_node_t *list_alloc_node(void)
        return (list_node_t *)xmalloc_and_zero(sizeof(list_node_t));
 }
 
-void list_free_node(list_t * list, list_node_t * node)
+void list_free_node(list_t *list, list_node_t *node)
 {
        if(node->data && list->delete)
                list->delete(node->data);
@@ -61,7 +61,7 @@ void list_free_node(list_t * list, list_node_t * node)
 
 /* Insertion and deletion */
 
-list_node_t *list_insert_head(list_t * list, void *data)
+list_node_t *list_insert_head(list_t *list, void *data)
 {
        list_node_t *node;
 
@@ -82,7 +82,7 @@ list_node_t *list_insert_head(list_t * list, void *data)
        return node;
 }
 
-list_node_t *list_insert_tail(list_t * list, void *data)
+list_node_t *list_insert_tail(list_t *list, void *data)
 {
        list_node_t *node;
 
@@ -103,7 +103,7 @@ list_node_t *list_insert_tail(list_t * list, void *data)
        return node;
 }
 
-void list_unlink_node(list_t * list, list_node_t * node)
+void list_unlink_node(list_t *list, list_node_t *node)
 {
        if(node->prev)
                node->prev->next = node->next;
@@ -118,25 +118,25 @@ void list_unlink_node(list_t * list, list_node_t * node)
        list->count--;
 }
 
-void list_delete_node(list_t * list, list_node_t * node)
+void list_delete_node(list_t *list, list_node_t *node)
 {
        list_unlink_node(list, node);
        list_free_node(list, node);
 }
 
-void list_delete_head(list_t * list)
+void list_delete_head(list_t *list)
 {
        list_delete_node(list, list->head);
 }
 
-void list_delete_tail(list_t * list)
+void list_delete_tail(list_t *list)
 {
        list_delete_node(list, list->tail);
 }
 
 /* Head/tail lookup */
 
-void *list_get_head(list_t * list)
+void *list_get_head(list_t *list)
 {
        if(list->head)
                return list->head->data;
@@ -144,7 +144,7 @@ void *list_get_head(list_t * list)
                return NULL;
 }
 
-void *list_get_tail(list_t * list)
+void *list_get_tail(list_t *list)
 {
        if(list->tail)
                return list->tail->data;
@@ -154,7 +154,7 @@ void *list_get_tail(list_t * list)
 
 /* Fast list deletion */
 
-void list_delete_list(list_t * list)
+void list_delete_list(list_t *list)
 {
        list_node_t *node, *next;
 
@@ -168,7 +168,7 @@ void list_delete_list(list_t * list)
 
 /* Traversing */
 
-void list_foreach_node(list_t * list, list_action_node_t action)
+void list_foreach_node(list_t *list, list_action_node_t action)
 {
        list_node_t *node, *next;
 
@@ -178,7 +178,7 @@ void list_foreach_node(list_t * list, list_action_node_t action)
        }
 }
 
-void list_foreach(list_t * list, list_action_t action)
+void list_foreach(list_t *list, list_action_t action)
 {
        list_node_t *node, *next;