2 node.c -- node tree management
3 Copyright (C) 2001-2006 Guus Sliepen <guus@tinc-vpn.org>,
4 2001-2005 Ivo Timmermans
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.
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, (avl_action_t) free_node);
62 node_udp_tree = avl_alloc_tree((avl_compare_t) node_udp_compare, NULL);
69 avl_delete_tree(node_udp_tree);
70 avl_delete_tree(node_tree);
73 node_t *new_node(void)
75 node_t *n = 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);
89 void free_node(node_t *n)
94 list_delete_list(n->queue);
106 free_subnet_tree(n->subnet_tree);
109 free_edge_tree(n->edge_tree);
111 sockaddrfree(&n->address);
113 EVP_CIPHER_CTX_cleanup(&n->packet_ctx);
116 event_del(n->mtuevent);
121 void node_add(node_t *n)
125 avl_insert(node_tree, n);
128 void node_del(node_t *n)
130 avl_node_t *node, *next;
136 for(node = n->subnet_tree->head; node; node = next) {
142 for(node = n->edge_tree->head; node; node = next) {
148 avl_delete(node_tree, n);
151 node_t *lookup_node(char *name)
159 return avl_search(node_tree, &n);
162 node_t *lookup_node_udp(const sockaddr_t *sa)
171 return avl_search(node_udp_tree, &n);
174 void dump_nodes(void)
181 logger(LOG_DEBUG, _("Nodes:"));
183 for(node = node_tree->head; node; node = node->next) {
185 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)"),
186 n->name, n->hostname, n->cipher ? n->cipher->nid : 0,
187 n->digest ? n->digest->type : 0, n->maclength, n->compression,
188 n->options, *(uint32_t *)&n->status, n->nexthop ? n->nexthop->name : "-",
189 n->via ? n->via->name : "-", n->mtu, n->minmtu, n->maxmtu);
192 logger(LOG_DEBUG, _("End of nodes."));