src/edge.c

   1 /*
   2     edge.c -- edge tree management
   3     Copyright (C) 2000-2003 Guus Sliepen <guus@sliepen.eu.org>,
   4                   2000-2003 Ivo Timmermans <ivo@o2w.nl>
   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: edge.c,v 1.1.2.21 2003/07/12 17:41:45 guus Exp $
  21 */
  22
  23 #include "config.h"
  24
  25 #include <stdio.h>
  26 #include <string.h>
  27
  28 #include <avl_tree.h>
  29 #include <list.h>
  30
  31 #include "net.h"                                /* Don't ask. */
  32 #include "netutl.h"
  33 #include "conf.h"
  34 #include <utils.h>
  35 #include "subnet.h"
  36 #include "edge.h"
  37 #include "node.h"
  38 #include "logger.h"
  39
  40 #include "xalloc.h"
  41 #include "system.h"
  42
  43 avl_tree_t *edge_weight_tree;   /* Tree with all edges, sorted on weight */
  44
  45 static int edge_compare(edge_t *a, edge_t *b)
  46 {
  47         return strcmp(a->to->name, b->to->name);
  48 }
  49
  50 static int edge_weight_compare(edge_t *a, edge_t *b)
  51 {
  52         int result;
  53
  54         result = a->weight - b->weight;
  55
  56         if(result)
  57                 return result;
  58
  59         result = strcmp(a->from->name, b->from->name);
  60
  61         if(result)
  62                 return result;
  63
  64         return strcmp(a->to->name, b->to->name);
  65 }
  66
  67 void init_edges(void)
  68 {
  69         cp();
  70
  71         edge_weight_tree =
  72                 avl_alloc_tree((avl_compare_t) edge_weight_compare, NULL);
  73 }
  74
  75 avl_tree_t *new_edge_tree(void)
  76 {
  77         cp();
  78
  79         return avl_alloc_tree((avl_compare_t) edge_compare, NULL);
  80 }
  81
  82 void free_edge_tree(avl_tree_t *edge_tree)
  83 {
  84         cp();
  85
  86         avl_delete_tree(edge_tree);
  87 }
  88
  89 void exit_edges(void)
  90 {
  91         cp();
  92
  93         avl_delete_tree(edge_weight_tree);
  94 }
  95
  96 /* Creation and deletion of connection elements */
  97
  98 edge_t *new_edge(void)
  99 {
 100         cp();
 101
 102         return (edge_t *) xmalloc_and_zero(sizeof(edge_t));
 103 }
 104
 105 void free_edge(edge_t *e)
 106 {
 107         cp();
 108
 109         free(e);
 110 }
 111
 112 void edge_add(edge_t *e)
 113 {
 114         cp();
 115
 116         avl_insert(edge_weight_tree, e);
 117         avl_insert(e->from->edge_tree, e);
 118
 119         e->reverse = lookup_edge(e->to, e->from);
 120
 121         if(e->reverse)
 122                 e->reverse->reverse = e;
 123 }
 124
 125 void edge_del(edge_t *e)
 126 {
 127         cp();
 128
 129         if(e->reverse)
 130                 e->reverse->reverse = NULL;
 131
 132         avl_delete(e->from->edge_tree, e);
 133         avl_delete(edge_weight_tree, e);
 134 }
 135
 136 edge_t *lookup_edge(node_t *from, node_t *to)
 137 {
 138         edge_t v;
 139
 140         cp();
 141
 142         v.from = from;
 143         v.to = to;
 144
 145         return avl_search(from->edge_tree, &v);
 146 }
 147
 148 void dump_edges(void)
 149 {
 150         avl_node_t *node, *node2;
 151         node_t *n;
 152         edge_t *e;
 153         char *address;
 154
 155         cp();
 156
 157         logger(LOG_DEBUG, _("Edges:"));
 158
 159         for(node = node_tree->head; node; node = node->next) {
 160                 n = (node_t *) node->data;
 161                 for(node2 = n->edge_tree->head; node2; node2 = node2->next) {
 162                         e = (edge_t *) node2->data;
 163                         address = sockaddr2hostname(&e->address);
 164                         logger(LOG_DEBUG, _(" %s to %s at %s options %lx weight %d"),
 165                                    e->from->name, e->to->name, address, e->options, e->weight);
 166                         free(address);
 167                 }
 168         }
 169
 170         logger(LOG_DEBUG, _("End of edges."));
 171 }