Don't ask questions if we are not running interactively.
[tinc] / src / edge.c
1 /*
2     edge.c -- edge tree management
3     Copyright (C) 2000-2013 Guus Sliepen <guus@tinc-vpn.org>,
4                   2000-2005 Ivo Timmermans
5
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.
10
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.
15
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.
19 */
20
21 #include "system.h"
22
23 #include "splay_tree.h"
24 #include "control_common.h"
25 #include "edge.h"
26 #include "logger.h"
27 #include "netutl.h"
28 #include "node.h"
29 #include "utils.h"
30 #include "xalloc.h"
31
32 splay_tree_t *edge_weight_tree;
33
34 static int edge_compare(const edge_t *a, const edge_t *b) {
35         return strcmp(a->to->name, b->to->name);
36 }
37
38 static int edge_weight_compare(const edge_t *a, const edge_t *b) {
39         int result;
40
41         result = a->weight - b->weight;
42
43         if(result)
44                 return result;
45
46         result = strcmp(a->from->name, b->from->name);
47
48         if(result)
49                 return result;
50
51         return strcmp(a->to->name, b->to->name);
52 }
53
54 void init_edges(void) {
55         edge_weight_tree = splay_alloc_tree((splay_compare_t) edge_weight_compare, NULL);
56 }
57
58 splay_tree_t *new_edge_tree(void) {
59         return splay_alloc_tree((splay_compare_t) edge_compare, (splay_action_t) free_edge);
60 }
61
62 void free_edge_tree(splay_tree_t *edge_tree) {
63         splay_delete_tree(edge_tree);
64 }
65
66 void exit_edges(void) {
67         splay_delete_tree(edge_weight_tree);
68 }
69
70 /* Creation and deletion of connection elements */
71
72 edge_t *new_edge(void) {
73         return xzalloc(sizeof(edge_t));
74 }
75
76 void free_edge(edge_t *e) {
77         sockaddrfree(&e->address);
78
79         free(e);
80 }
81
82 void edge_add(edge_t *e) {
83         splay_insert(edge_weight_tree, e);
84         splay_insert(e->from->edge_tree, e);
85
86         e->reverse = lookup_edge(e->to, e->from);
87
88         if(e->reverse)
89                 e->reverse->reverse = e;
90 }
91
92 void edge_del(edge_t *e) {
93         if(e->reverse)
94                 e->reverse->reverse = NULL;
95
96         splay_delete(edge_weight_tree, e);
97         splay_delete(e->from->edge_tree, e);
98 }
99
100 edge_t *lookup_edge(node_t *from, node_t *to) {
101         edge_t v;
102
103         v.from = from;
104         v.to = to;
105
106         return splay_search(from->edge_tree, &v);
107 }
108
109 bool dump_edges(connection_t *c) {
110         for splay_each(node_t, n, node_tree) {
111                 for splay_each(edge_t, e, n->edge_tree) {
112                         char *address = sockaddr2hostname(&e->address);
113                         send_request(c, "%d %d %s %s %s %x %d",
114                                         CONTROL, REQ_DUMP_EDGES,
115                                         e->from->name, e->to->name, address,
116                                         e->options, e->weight);
117                         free(address);
118                 }
119         }
120
121         return send_request(c, "%d %d", CONTROL, REQ_DUMP_EDGES);
122 }