2 node.c -- node tree management
3 Copyright (C) 2001-2003 Guus Sliepen <guus@sliepen.eu.org>,
4 2001-2003 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.26 2003/07/30 11:50:45 guus Exp $
33 avl_tree_t *node_tree; /* Known nodes, sorted by name */
34 avl_tree_t *node_udp_tree; /* Known nodes, sorted by address and port */
38 static int node_compare(const node_t *a, const node_t *b)
40 return strcmp(a->name, b->name);
43 static int node_udp_compare(const node_t *a, const node_t *b)
49 result = sockaddrcmp(&a->address, &b->address);
54 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);
73 node_t *new_node(void)
75 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);
82 EVP_CIPHER_CTX_init(&n->packet_ctx);
87 void free_node(node_t *n)
92 list_delete_list(n->queue);
104 free_subnet_tree(n->subnet_tree);
107 free_edge_tree(n->edge_tree);
109 EVP_CIPHER_CTX_cleanup(&n->packet_ctx);
114 void node_add(node_t *n)
118 avl_insert(node_tree, n);
119 avl_insert(node_udp_tree, n);
122 void node_del(node_t *n)
124 avl_node_t *node, *next;
130 for(node = n->subnet_tree->head; node; node = next) {
132 s = (subnet_t *) node->data;
136 for(node = n->edge_tree->head; node; node = next) {
138 e = (edge_t *) node->data;
142 avl_delete(node_tree, n);
143 avl_delete(node_udp_tree, n);
146 node_t *lookup_node(char *name)
154 return avl_search(node_tree, &n);
157 node_t *lookup_node_udp(const sockaddr_t *sa)
166 return avl_search(node_udp_tree, &n);
169 void dump_nodes(void)
176 logger(LOG_DEBUG, _("Nodes:"));
178 for(node = node_tree->head; node; node = node->next) {
179 n = (node_t *) node->data;
180 logger(LOG_DEBUG, _(" %s at %s cipher %d digest %d maclength %d compression %d options %lx status %04x nexthop %s via %s"),
181 n->name, n->hostname, n->cipher ? n->cipher->nid : 0,
182 n->digest ? n->digest->type : 0, n->maclength, n->compression,
183 n->options, *(uint32_t *)&n->status, n->nexthop ? n->nexthop->name : "-",
184 n->via ? n->via->name : "-");
187 logger(LOG_DEBUG, _("End of nodes."));