X-Git-Url: http://git.meshlink.io/?a=blobdiff_plain;f=src%2Fedge.c;h=d3dbf78e90200c9c5994dfccf0adf9ab65f4701a;hb=93f89bcae11e8d250831896bc5694ee8bd2ad22b;hp=f185b4fec35329dcb8e8f482a1b28efd8ab94049;hpb=5e00a24e1f13fa70a6945831c409d873b7809d11;p=meshlink

diff --git a/src/edge.c b/src/edge.c
index f185b4fe..d3dbf78e 100644
--- a/src/edge.c
+++ b/src/edge.c
@@ -1,7 +1,6 @@
 /*
     edge.c -- edge tree management
-    Copyright (C) 2000-2013 Guus Sliepen <guus@tinc-vpn.org>,
-                  2000-2005 Ivo Timmermans
+    Copyright (C) 2014 Guus Sliepen <guus@meshlink.io>
 
     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
@@ -21,16 +20,14 @@
 #include "system.h"
 
 #include "splay_tree.h"
-#include "control_common.h"
 #include "edge.h"
 #include "logger.h"
+#include "meshlink_internal.h"
 #include "netutl.h"
 #include "node.h"
 #include "utils.h"
 #include "xalloc.h"
 
-splay_tree_t *edge_weight_tree;
-
 static int edge_compare(const edge_t *a, const edge_t *b) {
 	return strcmp(a->to->name, b->to->name);
 }
@@ -52,7 +49,7 @@ static int edge_weight_compare(const edge_t *a, const edge_t *b) {
 }
 
 void init_edges(void) {
-	edge_weight_tree = splay_alloc_tree((splay_compare_t) edge_weight_compare, NULL);
+	mesh->edges = splay_alloc_tree((splay_compare_t) edge_weight_compare, NULL);
 }
 
 splay_tree_t *new_edge_tree(void) {
@@ -64,7 +61,7 @@ void free_edge_tree(splay_tree_t *edge_tree) {
 }
 
 void exit_edges(void) {
-	splay_delete_tree(edge_weight_tree);
+	splay_delete_tree(mesh->edges);
 }
 
 /* Creation and deletion of connection elements */
@@ -80,7 +77,7 @@ void free_edge(edge_t *e) {
 }
 
 void edge_add(edge_t *e) {
-	splay_insert(edge_weight_tree, e);
+	splay_insert(mesh->edges, e);
 	splay_insert(e->from->edge_tree, e);
 
 	e->reverse = lookup_edge(e->to, e->from);
@@ -93,7 +90,7 @@ void edge_del(edge_t *e) {
 	if(e->reverse)
 		e->reverse->reverse = NULL;
 
-	splay_delete(edge_weight_tree, e);
+	splay_delete(mesh->edges, e);
 	splay_delete(e->from->edge_tree, e);
 }
 
@@ -105,18 +102,3 @@ edge_t *lookup_edge(node_t *from, node_t *to) {
 
 	return splay_search(from->edge_tree, &v);
 }
-
-bool dump_edges(connection_t *c) {
-	for splay_each(node_t, n, node_tree) {
-		for splay_each(edge_t, e, n->edge_tree) {
-			char *address = sockaddr2hostname(&e->address);
-			send_request(c, "%d %d %s %s %s %x %d",
-					CONTROL, REQ_DUMP_EDGES,
-					e->from->name, e->to->name, address,
-					e->options, e->weight);
-			free(address);
-		}
-	}
-
-	return send_request(c, "%d %d", CONTROL, REQ_DUMP_EDGES);
-}