edebf579f2
The control socket code was completely different from how meta connections are handled, resulting in lots of extra code to handle requests. Also, not every operating system has UNIX sockets, so we have to resort to another type of sockets or pipes for those anyway. To reduce code duplication and make control sockets work the same on all platforms, we now just connect to the TCP port where tincd is already listening on. To authenticate, the program that wants to control a running tinc daemon must send the contents of a cookie file. The cookie is a random 256 bits number that is regenerated every time tincd starts. The cookie file should only be readable by the same user that can start a tincd. Instead of the binary-ish protocol previously used, we now use an ASCII protocol similar to that of the meta connections, but this can still change.
129 lines
3.1 KiB
C
129 lines
3.1 KiB
C
/*
|
|
edge.c -- edge tree management
|
|
Copyright (C) 2000-2006 Guus Sliepen <guus@tinc-vpn.org>,
|
|
2000-2005 Ivo Timmermans
|
|
|
|
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.,
|
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
*/
|
|
|
|
#include "system.h"
|
|
|
|
#include "splay_tree.h"
|
|
#include "control_common.h"
|
|
#include "edge.h"
|
|
#include "logger.h"
|
|
#include "netutl.h"
|
|
#include "node.h"
|
|
#include "utils.h"
|
|
#include "xalloc.h"
|
|
|
|
splay_tree_t *edge_weight_tree; /* Tree with all edges, sorted on weight */
|
|
|
|
static int edge_compare(const edge_t *a, const edge_t *b) {
|
|
return strcmp(a->to->name, b->to->name);
|
|
}
|
|
|
|
static int edge_weight_compare(const edge_t *a, const edge_t *b) {
|
|
int result;
|
|
|
|
result = a->weight - b->weight;
|
|
|
|
if(result)
|
|
return result;
|
|
|
|
result = strcmp(a->from->name, b->from->name);
|
|
|
|
if(result)
|
|
return result;
|
|
|
|
return strcmp(a->to->name, b->to->name);
|
|
}
|
|
|
|
void init_edges(void) {
|
|
edge_weight_tree = splay_alloc_tree((splay_compare_t) edge_weight_compare, NULL);
|
|
}
|
|
|
|
splay_tree_t *new_edge_tree(void) {
|
|
return splay_alloc_tree((splay_compare_t) edge_compare, (splay_action_t) free_edge);
|
|
}
|
|
|
|
void free_edge_tree(splay_tree_t *edge_tree) {
|
|
splay_delete_tree(edge_tree);
|
|
}
|
|
|
|
void exit_edges(void) {
|
|
splay_delete_tree(edge_weight_tree);
|
|
}
|
|
|
|
/* Creation and deletion of connection elements */
|
|
|
|
edge_t *new_edge(void) {
|
|
return xmalloc_and_zero(sizeof(edge_t));
|
|
}
|
|
|
|
void free_edge(edge_t *e) {
|
|
sockaddrfree(&e->address);
|
|
|
|
free(e);
|
|
}
|
|
|
|
void edge_add(edge_t *e) {
|
|
splay_insert(edge_weight_tree, e);
|
|
splay_insert(e->from->edge_tree, e);
|
|
|
|
e->reverse = lookup_edge(e->to, e->from);
|
|
|
|
if(e->reverse)
|
|
e->reverse->reverse = e;
|
|
}
|
|
|
|
void edge_del(edge_t *e) {
|
|
if(e->reverse)
|
|
e->reverse->reverse = NULL;
|
|
|
|
splay_delete(edge_weight_tree, e);
|
|
splay_delete(e->from->edge_tree, e);
|
|
}
|
|
|
|
edge_t *lookup_edge(node_t *from, node_t *to) {
|
|
edge_t v;
|
|
|
|
v.from = from;
|
|
v.to = to;
|
|
|
|
return splay_search(from->edge_tree, &v);
|
|
}
|
|
|
|
bool dump_edges(connection_t *c) {
|
|
splay_node_t *node, *node2;
|
|
node_t *n;
|
|
edge_t *e;
|
|
char *address;
|
|
|
|
for(node = node_tree->head; node; node = node->next) {
|
|
n = node->data;
|
|
for(node2 = n->edge_tree->head; node2; node2 = node2->next) {
|
|
e = node2->data;
|
|
address = sockaddr2hostname(&e->address);
|
|
send_request(c, "%d %d %s to %s at %s options %x weight %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);
|
|
}
|