2 edge.c -- edge tree management
3 Copyright (C) 2000-2021 Guus Sliepen <guus@tinc-vpn.org>,
4 2000-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 along
17 with this program; if not, write to the Free Software Foundation, Inc.,
18 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
23 #include "splay_tree.h"
24 #include "control_common.h"
31 splay_tree_t *edge_weight_tree;
33 static int edge_compare(const edge_t *a, const edge_t *b) {
34 return strcmp(a->to->name, b->to->name);
37 static int edge_weight_compare(const edge_t *a, const edge_t *b) {
40 result = a->weight - b->weight;
46 result = strcmp(a->from->name, b->from->name);
52 return strcmp(a->to->name, b->to->name);
55 void init_edges(void) {
56 edge_weight_tree = splay_alloc_tree((splay_compare_t) edge_weight_compare, NULL);
59 splay_tree_t *new_edge_tree(void) {
60 return splay_alloc_tree((splay_compare_t) edge_compare, (splay_action_t) free_edge);
63 void free_edge_tree(splay_tree_t *edge_tree) {
64 splay_delete_tree(edge_tree);
67 void exit_edges(void) {
68 splay_delete_tree(edge_weight_tree);
71 /* Creation and deletion of connection elements */
73 edge_t *new_edge(void) {
74 return xzalloc(sizeof(edge_t));
77 void free_edge(edge_t *e) {
78 sockaddrfree(&e->address);
79 sockaddrfree(&e->local_address);
84 void edge_add(edge_t *e) {
85 splay_node_t *node = splay_insert(e->from->edge_tree, e);
88 logger(DEBUG_ALWAYS, LOG_ERR, "Edge from %s to %s already exists in edge_tree\n", e->from->name, e->to->name);
93 e->reverse = lookup_edge(e->to, e->from);
96 e->reverse->reverse = e;
99 node = splay_insert(edge_weight_tree, e);
102 logger(DEBUG_ALWAYS, LOG_ERR, "Edge from %s to %s already exists in edge_weight_tree\n", e->from->name, e->to->name);
107 void edge_del(edge_t *e) {
109 e->reverse->reverse = NULL;
112 splay_delete(edge_weight_tree, e);
113 splay_delete(e->from->edge_tree, e);
116 edge_t *lookup_edge(node_t *from, node_t *to) {
122 return splay_search(from->edge_tree, &v);
125 bool dump_edges(connection_t *c) {
126 for splay_each(node_t, n, node_tree) {
127 for splay_each(edge_t, e, n->edge_tree) {
128 char *address = sockaddr2hostname(&e->address);
129 char *local_address = sockaddr2hostname(&e->local_address);
130 send_request(c, "%d %d %s %s %s %s %x %d",
131 CONTROL, REQ_DUMP_EDGES,
132 e->from->name, e->to->name, address,
133 local_address, e->options, e->weight);
139 return send_request(c, "%d %d", CONTROL, REQ_DUMP_EDGES);