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.7 2001/11/16 17:39:38 zarq 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 */
41 int node_compare(node_t *a, node_t *b)
43 return strcmp(a->name, b->name);
46 int node_udp_compare(node_t *a, node_t *b)
48 if(a->address < b->address)
50 else if (a->address > b->address)
53 return a->port - b->port;
59 node_tree = avl_alloc_tree((avl_compare_t)node_compare, NULL);
60 node_udp_tree = avl_alloc_tree((avl_compare_t)node_udp_compare, NULL);
67 avl_delete_tree(node_tree);
68 avl_delete_tree(node_udp_tree);
72 node_t *new_node(void)
74 node_t *n = (node_t *)xmalloc_and_zero(sizeof(*n));
76 n->subnet_tree = new_subnet_tree();
77 n->edge_tree = new_edge_tree();
78 n->queue = list_alloc((list_action_t)free);
83 void free_node(node_t *n)
87 list_delete_list(n->queue);
95 free_subnet_tree(n->subnet_tree);
97 free_edge_tree(n->edge_tree);
102 void node_add(node_t *n)
105 avl_insert(node_tree, n);
106 avl_insert(node_udp_tree, n);
110 void node_del(node_t *n)
112 avl_node_t *node, *next;
116 for(node = n->subnet_tree->head; node; node = next)
119 s = (subnet_t *)node->data;
123 for(node = n->subnet_tree->head; node; node = next)
126 e = (edge_t *)node->data;
130 avl_delete(node_tree, n);
131 avl_delete(node_udp_tree, n);
135 node_t *lookup_node(char *name)
140 return avl_search(node_tree, &n);
143 node_t *lookup_node_udp(struct addrinfo *address)
148 return avl_search(node_udp_tree, &n);
151 void dump_nodes(void)
156 syslog(LOG_DEBUG, _("Nodes:"));
158 for(node = node_tree->head; node; node = node->next)
160 n = (node_t *)node->data;
161 syslog(LOG_DEBUG, _(" %s at %s port %s options %ld status %04x nexthop %s via %s"),
162 n->name, n->hostname, n->port, n->options,
163 n->status, n->nexthop->name, n->via->name);
166 syslog(LOG_DEBUG, _("End of nodes."));