X-Git-Url: https://www.tinc-vpn.org/git/browse?p=tinc;a=blobdiff_plain;f=src%2Fnode.c;h=20453612dd10efb23bc0af68e0d3a584992b0ac2;hp=f40fb19ed26a403b62ed619eba6cd09beb31171f;hb=503c32eb0ef9d6329e931559082f4ddf6d487dc6;hpb=72bdc05cb7e246e56ed21a25256d441c45fccca8

diff --git a/src/node.c b/src/node.c
index f40fb19e..20453612 100644
--- a/src/node.c
+++ b/src/node.c
@@ -1,7 +1,7 @@
 /*
     node.c -- node tree management
-    Copyright (C) 2001-2003 Guus Sliepen <guus@sliepen.eu.org>,
-                  2001-2003 Ivo Timmermans <ivo@o2w.nl>
+    Copyright (C) 2001-2006 Guus Sliepen <guus@tinc-vpn.org>,
+                  2001-2005 Ivo Timmermans
 
     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,7 +17,7 @@
     along with this program; if not, write to the Free Software
     Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 
-    $Id: node.c,v 1.1.2.27 2003/08/22 11:18:42 guus Exp $
+    $Id$
 */
 
 #include "system.h"
@@ -72,14 +72,15 @@ void exit_nodes(void)
 
 node_t *new_node(void)
 {
-	node_t *n = (node_t *) xmalloc_and_zero(sizeof(*n));
+	node_t *n = xmalloc_and_zero(sizeof(*n));
 
 	cp();
 
 	n->subnet_tree = new_subnet_tree();
 	n->edge_tree = new_edge_tree();
-	n->queue = list_alloc((list_action_t) free);
 	EVP_CIPHER_CTX_init(&n->packet_ctx);
+	n->mtu = MTU;
+	n->maxmtu = MTU;
 
 	return n;
 }
@@ -88,15 +89,6 @@ void free_node(node_t *n)
 {
 	cp();
 
-	if(n->queue)
-		list_delete_list(n->queue);
-
-	if(n->name)
-		free(n->name);
-
-	if(n->hostname)
-		free(n->hostname);
-
 	if(n->key)
 		free(n->key);
 
@@ -109,7 +101,16 @@ void free_node(node_t *n)
 	sockaddrfree(&n->address);
 
 	EVP_CIPHER_CTX_cleanup(&n->packet_ctx);
+
+	if(n->mtuevent)
+		event_del(n->mtuevent);
 	
+	if(n->hostname)
+		free(n->hostname);
+
+	if(n->name)
+		free(n->name);
+
 	free(n);
 }
 
@@ -118,7 +119,6 @@ void node_add(node_t *n)
 	cp();
 
 	avl_insert(node_tree, n);
-	avl_insert(node_udp_tree, n);
 }
 
 void node_del(node_t *n)
@@ -131,18 +131,17 @@ void node_del(node_t *n)
 
 	for(node = n->subnet_tree->head; node; node = next) {
 		next = node->next;
-		s = (subnet_t *) node->data;
+		s = node->data;
 		subnet_del(n, s);
 	}
 
 	for(node = n->edge_tree->head; node; node = next) {
 		next = node->next;
-		e = (edge_t *) node->data;
+		e = node->data;
 		edge_del(e);
 	}
 
 	avl_delete(node_tree, n);
-	avl_delete(node_udp_tree, n);
 }
 
 node_t *lookup_node(char *name)
@@ -178,12 +177,12 @@ void dump_nodes(void)
 	logger(LOG_DEBUG, _("Nodes:"));
 
 	for(node = node_tree->head; node; node = node->next) {
-		n = (node_t *) node->data;
-		logger(LOG_DEBUG, _(" %s at %s cipher %d digest %d maclength %d compression %d options %lx status %04x nexthop %s via %s"),
+		n = node->data;
+		logger(LOG_DEBUG, _(" %s at %s cipher %d digest %d maclength %d compression %d options %lx status %04x nexthop %s via %s pmtu %d (min %d max %d)"),
 			   n->name, n->hostname, n->cipher ? n->cipher->nid : 0,
 			   n->digest ? n->digest->type : 0, n->maclength, n->compression,
 			   n->options, *(uint32_t *)&n->status, n->nexthop ? n->nexthop->name : "-",
-			   n->via ? n->via->name : "-");
+			   n->via ? n->via->name : "-", n->mtu, n->minmtu, n->maxmtu);
 	}
 
 	logger(LOG_DEBUG, _("End of nodes."));