2 node.c -- node tree management
3 Copyright (C) 2001-2002 Guus Sliepen <guus@sliepen.warande.net>,
4 2001-2002 Ivo Timmermans <itimmermans@bigfoot.com>
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 $Id: node.c,v 1.2.2.1 2002/04/14 09:31:52 zarq Exp $
36 avl_tree_t *node_tree; /* Known nodes, sorted by name */
37 avl_tree_t *node_udp_tree; /* Known nodes, sorted by address and port */
41 int node_compare(node_t *a, node_t *b)
43 return strcmp(a->name, b->name);
46 int node_udp_compare(node_t *a, node_t *b)
50 result = sockaddrcmp(&a->address, &b->address);
55 return (a->name && b->name)?strcmp(a->name, b->name):0;
61 node_tree = avl_alloc_tree((avl_compare_t)node_compare, NULL);
62 node_udp_tree = avl_alloc_tree((avl_compare_t)node_udp_compare, NULL);
69 avl_delete_tree(node_tree);
70 avl_delete_tree(node_udp_tree);
74 node_t *new_node(void)
76 node_t *n = (node_t *)xmalloc_and_zero(sizeof(*n));
78 n->subnet_tree = new_subnet_tree();
79 n->edge_tree = new_edge_tree();
80 n->queue = list_alloc((list_action_t)free);
85 void free_node(node_t *n)
89 list_delete_list(n->queue);
97 free_subnet_tree(n->subnet_tree);
99 free_edge_tree(n->edge_tree);
104 void node_add(node_t *n)
107 avl_insert(node_tree, n);
108 avl_insert(node_udp_tree, n);
112 void node_del(node_t *n)
114 avl_node_t *node, *next;
118 for(node = n->subnet_tree->head; node; node = next)
121 s = (subnet_t *)node->data;
125 for(node = n->subnet_tree->head; node; node = next)
128 e = (edge_t *)node->data;
132 avl_delete(node_tree, n);
133 avl_delete(node_udp_tree, n);
137 node_t *lookup_node(char *name)
142 return avl_search(node_tree, &n);
145 node_t *lookup_node_udp(sockaddr_t *sa)
152 return avl_search(node_udp_tree, &n);
155 void dump_nodes(void)
160 syslog(LOG_DEBUG, _("Nodes:"));
162 for(node = node_tree->head; node; node = node->next)
164 n = (node_t *)node->data;
165 syslog(LOG_DEBUG, _(" %s at %s cipher %d digest %d maclength %d compression %d options %lx status %04x nexthop %s via %s"),
166 n->name, n->hostname, n->cipher?n->cipher->nid:0, n->digest?n->digest->type:0, n->maclength, n->compression, n->options,
167 n->status, n->nexthop?n->nexthop->name:"-", n->via?n->via->name:"-");
170 syslog(LOG_DEBUG, _("End of nodes."));