tinc-vpn.org Git - tinc/blob - src/edge.c

   1 /*
   2     edge.c -- edge tree management
   3     Copyright (C) 2000-2021 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 "xalloc.h"
  30
  31 splay_tree_t *edge_weight_tree;
  32
  33 static int edge_compare(const edge_t *a, const edge_t *b) {
  34         return strcmp(a->to->name, b->to->name);
  35 }
  36
  37 static int edge_weight_compare(const edge_t *a, const edge_t *b) {
  38         int result;
  39
  40         result = a->weight - b->weight;
  41
  42         if(result) {
  43                 return result;
  44         }
  45
  46         result = strcmp(a->from->name, b->from->name);
  47
  48         if(result) {
  49                 return result;
  50         }
  51
  52         return strcmp(a->to->name, b->to->name);
  53 }
  54
  55 void init_edges(void) {
  56         edge_weight_tree = splay_alloc_tree((splay_compare_t) edge_weight_compare, NULL);
  57 }
  58
  59 splay_tree_t *new_edge_tree(void) {
  60         return splay_alloc_tree((splay_compare_t) edge_compare, (splay_action_t) free_edge);
  61 }
  62
  63 void free_edge_tree(splay_tree_t *edge_tree) {
  64         splay_delete_tree(edge_tree);
  65 }
  66
  67 void exit_edges(void) {
  68         splay_delete_tree(edge_weight_tree);
  69 }
  70
  71 /* Creation and deletion of connection elements */
  72
  73 edge_t *new_edge(void) {
  74         return xzalloc(sizeof(edge_t));
  75 }
  76
  77 void free_edge(edge_t *e) {
  78         sockaddrfree(&e->address);
  79         sockaddrfree(&e->local_address);
  80
  81         free(e);
  82 }
  83
  84 void edge_add(edge_t *e) {
  85         splay_node_t *node = splay_insert(e->from->edge_tree, e);
  86
  87         if(!node) {
  88                 logger(DEBUG_ALWAYS, LOG_ERR, "Edge from %s to %s already exists in edge_tree\n", e->from->name, e->to->name);
  89                 return;
  90         }
  91
  92
  93         e->reverse = lookup_edge(e->to, e->from);
  94
  95         if(e->reverse) {
  96                 e->reverse->reverse = e;
  97         }
  98
  99         node = splay_insert(edge_weight_tree, e);
 100
 101         if(!node) {
 102                 logger(DEBUG_ALWAYS, LOG_ERR, "Edge from %s to %s already exists in edge_weight_tree\n", e->from->name, e->to->name);
 103                 return;
 104         }
 105 }
 106
 107 void edge_del(edge_t *e) {
 108         if(e->reverse) {
 109                 e->reverse->reverse = NULL;
 110         }
 111
 112         splay_delete(edge_weight_tree, e);
 113         splay_delete(e->from->edge_tree, e);
 114 }
 115
 116 edge_t *lookup_edge(node_t *from, node_t *to) {
 117         edge_t v;
 118
 119         v.from = from;
 120         v.to = to;
 121
 122         return splay_search(from->edge_tree, &v);
 123 }
 124
 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);
 134                         free(address);
 135                         free(local_address);
 136                 }
 137         }
 138
 139         return send_request(c, "%d %d", CONTROL, REQ_DUMP_EDGES);
 140 }