X-Git-Url: https://tinc-vpn.org/git/browse?a=blobdiff_plain;f=lib%2Fedge.c;fp=lib%2Fedge.c;h=0000000000000000000000000000000000000000;hb=013a2e159e42c46808ea8d0b6abd57525db30a50;hp=d959d514900337243629716e3b4b36a6daa1818f;hpb=efa5148bc76effb440d807d653dda02de050fde0;p=tinc

diff --git a/lib/edge.c b/lib/edge.c
deleted file mode 100644
index d959d514..00000000
--- a/lib/edge.c
+++ /dev/null
@@ -1,212 +0,0 @@
-/*
-    edge.c -- edge tree management
-    Copyright (C) 2000-2002 Guus Sliepen <guus@sliepen.warande.net>,
-                  2000-2002 Ivo Timmermans <itimmermans@bigfoot.com>
-
-    This program is free software; you can redistribute it and/or modify
-    it under the terms of the GNU General Public License as published by
-    the Free Software Foundation; either version 2 of the License, or
-    (at your option) any later version.
-
-    This program is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU General Public License for more details.
-
-    You should have received a copy of the GNU General Public License
-    along with this program; if not, write to the Free Software
-    Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
-
-    $Id: edge.c,v 1.1 2002/04/28 12:46:25 zarq Exp $
-*/
-
-#include "config.h"
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <syslog.h>
-#include <string.h>
-
-#include <avl_tree.h>
-#include <list.h>
-
-#include "net.h"	/* Don't ask. */
-#include "netutl.h"
-#include "config.h"
-#include "conf.h"
-#include <utils.h>
-#include "subnet.h"
-
-#include "xalloc.h"
-#include "system.h"
-
-avl_tree_t *edge_tree;        /* Tree with all known edges (replaces active_tree) */
-avl_tree_t *edge_weight_tree; /* Tree with all edges, sorted on weight */
-
-int edge_compare(edge_t *a, edge_t *b)
-{
-  int result;
-
-  result = strcmp(a->from.node->name, b->from.node->name);
-
-  if(result)
-    return result;
-  else
-    return strcmp(a->to.node->name, b->to.node->name);
-}
-
-/* Evil edge_compare() from a parallel universe ;)
-
-int edge_compare(edge_t *a, edge_t *b)
-{
-  int result;
-
-  return (result = strcmp(a->from.node->name, b->from.node->name)) || (result = strcmp(a->to.node->name, b->to.node->name)), result;
-}
-
-*/
-
-int edge_name_compare(edge_t *a, edge_t *b)
-{
-  int result;
-  char *name_a1, *name_a2, *name_b1, *name_b2;
-
-  if(strcmp(a->from.node->name, a->to.node->name) < 0)
-    name_a1 = a->from.node->name, name_a2 = a->to.node->name;
-  else
-    name_a1 = a->to.node->name, name_a2 = a->from.node->name;
-
-  if(strcmp(b->from.node->name, b->to.node->name) < 0)
-    name_b1 = b->from.node->name, name_b2 = b->to.node->name;
-  else
-    name_b1 = b->to.node->name, name_b2 = b->from.node->name;
-
-  result = strcmp(name_a1, name_b1);
-
-  if(result)
-    return result;
-  else
-    return strcmp(name_a2, name_b2);
-}
-
-int edge_weight_compare(edge_t *a, edge_t *b)
-{
-  int result;
-
-  result = a->weight - b->weight;
-
-  if(result)
-    return result;
-  else
-    return edge_name_compare(a, b);
-}
-
-void init_edges(void)
-{
-cp
-  edge_tree = avl_alloc_tree((avl_compare_t)edge_compare, NULL);
-  edge_weight_tree = avl_alloc_tree((avl_compare_t)edge_weight_compare, NULL);
-cp
-}
-
-avl_tree_t *new_edge_tree(void)
-{
-cp
-  return avl_alloc_tree((avl_compare_t)edge_name_compare, NULL);
-cp
-}
-
-void free_edge_tree(avl_tree_t *edge_tree)
-{
-cp
-  avl_delete_tree(edge_tree);
-cp
-}
-
-void exit_edges(void)
-{
-cp
-  avl_delete_tree(edge_tree);
-cp
-}
-
-/* Creation and deletion of connection elements */
-
-edge_t *new_edge(void)
-{
-  edge_t *e;
-cp
-  e = (edge_t *)xmalloc_and_zero(sizeof(*e));
-cp
-  return e;
-}
-
-void free_edge(edge_t *e)
-{
-cp
-  free(e);
-cp
-}
-
-void edge_add(edge_t *e)
-{
-cp
-  avl_insert(edge_tree, e);
-  avl_insert(edge_weight_tree, e);
-  avl_insert(e->from.node->edge_tree, e);
-  avl_insert(e->to.node->edge_tree, e);
-cp
-}
-
-void edge_del(edge_t *e)
-{
-cp
-  avl_delete(edge_tree, e);
-  avl_delete(edge_weight_tree, e);
-  avl_delete(e->from.node->edge_tree, e);
-  avl_delete(e->to.node->edge_tree, e);
-cp
-}
-
-edge_t *lookup_edge(node_t *from, node_t *to)
-{
-  edge_t v, *result;
-cp
-  v.from.node = from;
-  v.to.node = to;
-
-  result = avl_search(edge_tree, &v);
-
-  if(result)
-    return result;
-cp
-  v.from.node = to;
-  v.to.node = from;
-
-  return avl_search(edge_tree, &v);
-}
-
-void dump_edges(void)
-{
-  avl_node_t *node;
-  edge_t *e;
-  char *from_udp, *to_udp;
-cp
-  syslog(LOG_DEBUG, _("Edges:"));
-
-  for(node = edge_tree->head; node; node = node->next)
-    {
-      e = (edge_t *)node->data;
-      from_udp = sockaddr2hostname(&e->from.udpaddress);
-      to_udp = sockaddr2hostname(&e->to.udpaddress);
-      syslog(LOG_DEBUG, _(" %s at %s - %s at %s options %lx weight %d"),
-             e->from.node->name, from_udp,
-	     e->to.node->name, to_udp,
-	     e->options, e->weight);
-      free(from_udp);
-      free(to_udp);	
-    }
-
-  syslog(LOG_DEBUG, _("End of edges."));
-cp
-}