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.18 2002/09/09 22:32:49 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)
53 result = sockaddrcmp(&a->address, &b->address);
58 return (a->name && b->name) ? strcmp(a->name, b->name) : 0;
65 node_tree = avl_alloc_tree((avl_compare_t) node_compare, NULL);
66 node_udp_tree = avl_alloc_tree((avl_compare_t) node_udp_compare, NULL);
73 avl_delete_tree(node_tree);
74 avl_delete_tree(node_udp_tree);
77 node_t *new_node(void)
79 node_t *n = (node_t *) xmalloc_and_zero(sizeof(*n));
83 n->subnet_tree = new_subnet_tree();
84 n->edge_tree = new_edge_tree();
85 n->queue = list_alloc((list_action_t) free);
90 void free_node(node_t *n)
95 list_delete_list(n->queue);
107 free_subnet_tree(n->subnet_tree);
110 free_edge_tree(n->edge_tree);
115 void node_add(node_t *n)
119 avl_insert(node_tree, n);
120 avl_insert(node_udp_tree, n);
123 void node_del(node_t *n)
125 avl_node_t *node, *next;
131 for(node = n->subnet_tree->head; node; node = next) {
133 s = (subnet_t *) node->data;
137 for(node = n->edge_tree->head; node; node = next) {
139 e = (edge_t *) node->data;
143 avl_delete(node_tree, n);
144 avl_delete(node_udp_tree, n);
147 node_t *lookup_node(char *name)
152 return avl_search(node_tree, &n);
155 node_t *lookup_node_udp(sockaddr_t *sa)
162 return avl_search(node_udp_tree, &n);
165 void dump_nodes(void)
172 syslog(LOG_DEBUG, _("Nodes:"));
174 for(node = node_tree->head; node; node = node->next) {
175 n = (node_t *) node->data;
176 syslog(LOG_DEBUG, _(" %s at %s cipher %d digest %d maclength %d compression %d options %lx status %04x nexthop %s via %s"),
177 n->name, n->hostname, n->cipher ? n->cipher->nid : 0,
178 n->digest ? n->digest->type : 0, n->maclength, n->compression,
179 n->options, n->status, n->nexthop ? n->nexthop->name : "-",
180 n->via ? n->via->name : "-");
183 syslog(LOG_DEBUG, _("End of nodes."));