2 node.c -- node tree management
3 Copyright (C) 2001-2002 Guus Sliepen <guus@sliepen.eu.org>,
4 2001-2002 Ivo Timmermans <ivo@o2w.nl>
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.1.2.13 2002/06/21 10:11:13 guus Exp $
37 avl_tree_t *node_tree; /* Known nodes, sorted by name */
38 avl_tree_t *node_udp_tree; /* Known nodes, sorted by address and port */
42 int node_compare(node_t *a, node_t *b)
44 return strcmp(a->name, b->name);
47 int node_udp_compare(node_t *a, node_t *b)
51 result = sockaddrcmp(&a->address, &b->address);
56 return (a->name && b->name)?strcmp(a->name, b->name):0;
62 node_tree = avl_alloc_tree((avl_compare_t)node_compare, NULL);
63 node_udp_tree = avl_alloc_tree((avl_compare_t)node_udp_compare, NULL);
70 avl_delete_tree(node_tree);
71 avl_delete_tree(node_udp_tree);
75 node_t *new_node(void)
77 node_t *n = (node_t *)xmalloc_and_zero(sizeof(*n));
79 n->subnet_tree = new_subnet_tree();
80 n->edge_tree = new_edge_tree();
81 n->queue = list_alloc((list_action_t)free);
86 void free_node(node_t *n)
90 list_delete_list(n->queue);
98 free_subnet_tree(n->subnet_tree);
100 free_edge_tree(n->edge_tree);
105 void node_add(node_t *n)
108 avl_insert(node_tree, n);
109 avl_insert(node_udp_tree, n);
113 void node_del(node_t *n)
115 avl_node_t *node, *next;
119 for(node = n->subnet_tree->head; node; node = next)
122 s = (subnet_t *)node->data;
126 for(node = n->edge_tree->head; node; node = next)
129 e = (edge_t *)node->data;
133 avl_delete(node_tree, n);
134 avl_delete(node_udp_tree, n);
138 node_t *lookup_node(char *name)
143 return avl_search(node_tree, &n);
146 node_t *lookup_node_udp(sockaddr_t *sa)
153 return avl_search(node_udp_tree, &n);
156 void dump_nodes(void)
161 syslog(LOG_DEBUG, _("Nodes:"));
163 for(node = node_tree->head; node; node = node->next)
165 n = (node_t *)node->data;
166 syslog(LOG_DEBUG, _(" %s at %s cipher %d digest %d maclength %d compression %d options %lx status %04x nexthop %s via %s"),
167 n->name, n->hostname, n->cipher?n->cipher->nid:0, n->digest?n->digest->type:0, n->maclength, n->compression, n->options,
168 n->status, n->nexthop?n->nexthop->name:"-", n->via?n->via->name:"-");
171 syslog(LOG_DEBUG, _("End of nodes."));