git.meshlink.io Git - meshlink/blob - src/edge.c

   1 /*
   2     edge.c -- edge tree management
   3     Copyright (C) 2000-2006 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
  17     along with this program; if not, write to the Free Software
  18     Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  19
  20     $Id$
  21 */
  22
  23 #include "system.h"
  24
  25 #include "splay_tree.h"
  26 #include "edge.h"
  27 #include "logger.h"
  28 #include "netutl.h"
  29 #include "node.h"
  30 #include "utils.h"
  31 #include "xalloc.h"
  32
  33 splay_tree_t *edge_weight_tree; /* Tree with all edges, sorted on weight */
  34
  35 static int edge_compare(const edge_t *a, const edge_t *b) {
  36         return strcmp(a->to->name, b->to->name);
  37 }
  38
  39 static int edge_weight_compare(const edge_t *a, const edge_t *b) {
  40         int result;
  41
  42         result = a->weight - b->weight;
  43
  44         if(result)
  45                 return result;
  46
  47         result = strcmp(a->from->name, b->from->name);
  48
  49         if(result)
  50                 return result;
  51
  52         return strcmp(a->to->name, b->to->name);
  53 }
  54
  55 void init_edges(void) {
  56         cp();
  57
  58         edge_weight_tree = splay_alloc_tree((splay_compare_t) edge_weight_compare, NULL);
  59 }
  60
  61 splay_tree_t *new_edge_tree(void) {
  62         cp();
  63
  64         return splay_alloc_tree((splay_compare_t) edge_compare, (splay_action_t) free_edge);
  65 }
  66
  67 void free_edge_tree(splay_tree_t *edge_tree) {
  68         cp();
  69
  70         splay_delete_tree(edge_tree);
  71 }
  72
  73 void exit_edges(void) {
  74         cp();
  75
  76         splay_delete_tree(edge_weight_tree);
  77 }
  78
  79 /* Creation and deletion of connection elements */
  80
  81 edge_t *new_edge(void) {
  82         cp();
  83
  84         return xmalloc_and_zero(sizeof(edge_t));
  85 }
  86
  87 void free_edge(edge_t *e) {
  88         cp();
  89
  90         sockaddrfree(&e->address);
  91
  92         free(e);
  93 }
  94
  95 void edge_add(edge_t *e) {
  96         cp();
  97
  98         splay_insert(edge_weight_tree, e);
  99         splay_insert(e->from->edge_tree, e);
 100
 101         e->reverse = lookup_edge(e->to, e->from);
 102
 103         if(e->reverse)
 104                 e->reverse->reverse = e;
 105 }
 106
 107 void edge_del(edge_t *e) {
 108         cp();
 109
 110         if(e->reverse)
 111                 e->reverse->reverse = NULL;
 112
 113         splay_delete(edge_weight_tree, e);
 114         splay_delete(e->from->edge_tree, e);
 115 }
 116
 117 edge_t *lookup_edge(node_t *from, node_t *to) {
 118         edge_t v;
 119
 120         cp();
 121
 122         v.from = from;
 123         v.to = to;
 124
 125         return splay_search(from->edge_tree, &v);
 126 }
 127
 128 int dump_edges(struct evbuffer *out) {
 129         splay_node_t *node, *node2;
 130         node_t *n;
 131         edge_t *e;
 132         char *address;
 133
 134         cp();
 135
 136         for(node = node_tree->head; node; node = node->next) {
 137                 n = node->data;
 138                 for(node2 = n->edge_tree->head; node2; node2 = node2->next) {
 139                         e = node2->data;
 140                         address = sockaddr2hostname(&e->address);
 141                         if(evbuffer_add_printf(out,
 142                                                                    _(" %s to %s at %s options %lx weight %d\n"),
 143                                                                    e->from->name, e->to->name, address,
 144                                                                    e->options, e->weight) == -1) {
 145                                 free(address);
 146                                 return errno;
 147                         }
 148                         free(address);
 149                 }
 150         }
 151
 152         return 0;
 153 }