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 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 "avl_tree.h"
  24 #include "edge.h"
  25 #include "logger.h"
  26 #include "netutl.h"
  27 #include "node.h"
  28 #include "utils.h"
  29 #include "xalloc.h"
  30
  31 avl_tree_t *edge_weight_tree;   /* Tree with all edges, sorted on weight */
  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 = avl_alloc_tree((avl_compare_t) edge_weight_compare, NULL);
  57 }
  58
  59 avl_tree_t *new_edge_tree(void) {
  60         return avl_alloc_tree((avl_compare_t) edge_compare, (avl_action_t) free_edge);
  61 }
  62
  63 void free_edge_tree(avl_tree_t *edge_tree) {
  64         avl_delete_tree(edge_tree);
  65 }
  66
  67 void exit_edges(void) {
  68         avl_delete_tree(edge_weight_tree);
  69 }
  70
  71 /* Creation and deletion of connection elements */
  72
  73 edge_t *new_edge(void) {
  74         return xmalloc_and_zero(sizeof(edge_t));
  75 }
  76
  77 void free_edge(edge_t *e) {
  78         sockaddrfree(&e->address);
  79
  80         free(e);
  81 }
  82
  83 void edge_add(edge_t *e) {
  84         avl_insert(edge_weight_tree, e);
  85         avl_insert(e->from->edge_tree, e);
  86
  87         e->reverse = lookup_edge(e->to, e->from);
  88
  89         if(e->reverse) {
  90                 e->reverse->reverse = e;
  91         }
  92 }
  93
  94 void edge_del(edge_t *e) {
  95         if(e->reverse) {
  96                 e->reverse->reverse = NULL;
  97         }
  98
  99         avl_delete(edge_weight_tree, e);
 100         avl_delete(e->from->edge_tree, e);
 101 }
 102
 103 edge_t *lookup_edge(node_t *from, node_t *to) {
 104         edge_t v;
 105
 106         v.from = from;
 107         v.to = to;
 108
 109         return avl_search(from->edge_tree, &v);
 110 }
 111
 112 void dump_edges(void) {
 113         avl_node_t *node, *node2;
 114         node_t *n;
 115         edge_t *e;
 116         char *address;
 117
 118         logger(LOG_DEBUG, "Edges:");
 119
 120         for(node = node_tree->head; node; node = node->next) {
 121                 n = node->data;
 122
 123                 for(node2 = n->edge_tree->head; node2; node2 = node2->next) {
 124                         e = node2->data;
 125                         address = sockaddr2hostname(&e->address);
 126                         logger(LOG_DEBUG, " %s to %s at %s options %x weight %d",
 127                                e->from->name, e->to->name, address, e->options, e->weight);
 128                         free(address);
 129                 }
 130         }
 131
 132         logger(LOG_DEBUG, "End of edges.");
 133 }