2 node.c -- node tree management
3 Copyright (C) 2001 Guus Sliepen <guus@sliepen.warande.net>,
4 2001 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.1.2.2 2001/10/27 12:13:17 guus 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 */
39 int node_compare(node_t *a, node_t *b)
41 return strcmp(a->name, b->name);
44 int node_udp_compare(connection_t *a, connection_t *b)
46 if(a->address < b->address)
48 else if (a->address > b->address)
51 return a->port - b->port;
57 node_tree = avl_alloc_tree((avl_compare_t)node_compare, NULL);
58 node_udp_tree = avl_alloc_tree((avl_compare_t)node_udp_compare, NULL);
65 avl_delete_tree(node_tree);
66 avl_delete_tree(node_udp_tree);
70 node_t *new_node(void)
72 node_t *n = (node_t *)xmalloc_and_zero(sizeof(*n));
74 n->subnet_tree = avl_alloc_tree((avl_compare_t)subnet_compare, NULL);
75 n->queue = list_alloc((list_action_t)free);
80 void free_node(node_t *n)
84 list_delete_list(n->queue);
95 void node_add(node_t *n)
98 avl_insert(node_tree, n);
99 avl_insert(node_udp_tree, n);
103 void node_del(node_t *n)
106 avl_delete(node_tree, n);
107 avl_delete(node_udp_tree, n);
111 node_t *lookup_node(char *name)
116 return avl_search(node_tree, &n);
119 node_t *lookup_node_udp(ipv4_t address, port_t port)
125 return avl_search(node_udp_tree, &n);
128 void dump_nodes(void)
133 syslog(LOG_DEBUG, _("Nodes:"));
135 for(node = node_tree->head; node; node = node->next)
137 n = (node_t *)node->data;
138 syslog(LOG_DEBUG, _(" %s at %s port %hd options %ld status %04x"),
139 n->name, n->hostname, n->port, n->options,
143 syslog(LOG_DEBUG, _("End of nodes."));