2002-02-11 10:05:58 +00:00
|
|
|
/*
|
|
|
|
protocol_edge.c -- handle the meta-protocol, edges
|
2003-07-12 17:41:48 +00:00
|
|
|
Copyright (C) 1999-2003 Ivo Timmermans <ivo@o2w.nl>,
|
|
|
|
2000-2003 Guus Sliepen <guus@sliepen.eu.org>
|
2002-02-11 10:05:58 +00:00
|
|
|
|
|
|
|
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.
|
|
|
|
|
2003-11-10 22:31:53 +00:00
|
|
|
$Id: protocol_edge.c,v 1.1.4.22 2003/11/10 22:31:53 guus Exp $
|
2002-02-11 10:05:58 +00:00
|
|
|
*/
|
|
|
|
|
2003-07-17 15:06:27 +00:00
|
|
|
#include "system.h"
|
2002-02-11 10:05:58 +00:00
|
|
|
|
2003-07-17 15:06:27 +00:00
|
|
|
#include "avl_tree.h"
|
2002-02-11 10:05:58 +00:00
|
|
|
#include "conf.h"
|
|
|
|
#include "connection.h"
|
|
|
|
#include "edge.h"
|
|
|
|
#include "graph.h"
|
2003-07-06 22:11:37 +00:00
|
|
|
#include "logger.h"
|
2003-07-17 15:06:27 +00:00
|
|
|
#include "meta.h"
|
|
|
|
#include "net.h"
|
|
|
|
#include "netutl.h"
|
|
|
|
#include "node.h"
|
|
|
|
#include "protocol.h"
|
|
|
|
#include "utils.h"
|
|
|
|
#include "xalloc.h"
|
2002-02-11 10:05:58 +00:00
|
|
|
|
2003-07-24 12:08:16 +00:00
|
|
|
bool send_add_edge(connection_t *c, const edge_t *e)
|
2002-02-11 10:05:58 +00:00
|
|
|
{
|
2003-07-22 20:55:21 +00:00
|
|
|
bool x;
|
2002-09-09 21:25:28 +00:00
|
|
|
char *address, *port;
|
|
|
|
|
|
|
|
cp();
|
|
|
|
|
|
|
|
sockaddr2str(&e->address, &address, &port);
|
|
|
|
|
|
|
|
x = send_request(c, "%d %lx %s %s %s %s %lx %d", ADD_EDGE, random(),
|
|
|
|
e->from->name, e->to->name, address, port,
|
|
|
|
e->options, e->weight);
|
|
|
|
free(address);
|
|
|
|
free(port);
|
|
|
|
|
|
|
|
return x;
|
2002-02-11 10:05:58 +00:00
|
|
|
}
|
|
|
|
|
2003-07-22 20:55:21 +00:00
|
|
|
bool add_edge_h(connection_t *c)
|
2002-02-11 10:05:58 +00:00
|
|
|
{
|
2002-09-09 21:25:28 +00:00
|
|
|
edge_t *e;
|
|
|
|
node_t *from, *to;
|
|
|
|
char from_name[MAX_STRING_SIZE];
|
|
|
|
char to_name[MAX_STRING_SIZE];
|
|
|
|
char to_address[MAX_STRING_SIZE];
|
|
|
|
char to_port[MAX_STRING_SIZE];
|
|
|
|
sockaddr_t address;
|
|
|
|
long int options;
|
|
|
|
int weight;
|
|
|
|
|
|
|
|
cp();
|
|
|
|
|
|
|
|
if(sscanf(c->buffer, "%*d %*x "MAX_STRING" "MAX_STRING" "MAX_STRING" "MAX_STRING" %lx %d",
|
|
|
|
from_name, to_name, to_address, to_port, &options, &weight) != 6) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Got bad %s from %s (%s)"), "ADD_EDGE", c->name,
|
2002-09-09 21:25:28 +00:00
|
|
|
c->hostname);
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Check if names are valid */
|
|
|
|
|
2003-07-22 20:55:21 +00:00
|
|
|
if(!check_id(from_name)) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Got bad %s from %s (%s): %s"), "ADD_EDGE", c->name,
|
2002-09-09 21:25:28 +00:00
|
|
|
c->hostname, _("invalid name"));
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
2003-07-22 20:55:21 +00:00
|
|
|
if(!check_id(to_name)) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Got bad %s from %s (%s): %s"), "ADD_EDGE", c->name,
|
2002-09-09 21:25:28 +00:00
|
|
|
c->hostname, _("invalid name"));
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if(seen_request(c->buffer))
|
2003-07-22 20:55:21 +00:00
|
|
|
return true;
|
2002-09-09 21:25:28 +00:00
|
|
|
|
|
|
|
/* Lookup nodes */
|
|
|
|
|
|
|
|
from = lookup_node(from_name);
|
|
|
|
|
|
|
|
if(!from) {
|
|
|
|
from = new_node();
|
|
|
|
from->name = xstrdup(from_name);
|
|
|
|
node_add(from);
|
|
|
|
}
|
|
|
|
|
|
|
|
to = lookup_node(to_name);
|
|
|
|
|
|
|
|
if(!to) {
|
|
|
|
to = new_node();
|
|
|
|
to->name = xstrdup(to_name);
|
|
|
|
node_add(to);
|
|
|
|
}
|
|
|
|
|
2003-11-10 22:31:53 +00:00
|
|
|
if(c->status.opaque && from != myself && from != c->node && to != myself && to != c->node)
|
|
|
|
return false;
|
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
/* Convert addresses */
|
|
|
|
|
|
|
|
address = str2sockaddr(to_address, to_port);
|
|
|
|
|
|
|
|
/* Check if edge already exists */
|
|
|
|
|
|
|
|
e = lookup_edge(from, to);
|
|
|
|
|
|
|
|
if(e) {
|
|
|
|
if(e->weight != weight || e->options != options || sockaddrcmp(&e->address, &address)) {
|
|
|
|
if(from == myself) {
|
2003-07-12 17:41:48 +00:00
|
|
|
ifdebug(PROTOCOL) logger(LOG_WARNING, _("Got %s from %s (%s) for ourself which does not match existing entry"),
|
2002-09-09 21:25:28 +00:00
|
|
|
"ADD_EDGE", c->name, c->hostname);
|
|
|
|
send_add_edge(c, e);
|
2003-07-22 20:55:21 +00:00
|
|
|
return true;
|
2002-09-09 21:25:28 +00:00
|
|
|
} else {
|
2003-07-12 17:41:48 +00:00
|
|
|
ifdebug(PROTOCOL) logger(LOG_WARNING, _("Got %s from %s (%s) which does not match existing entry"),
|
2002-09-09 21:25:28 +00:00
|
|
|
"ADD_EDGE", c->name, c->hostname);
|
|
|
|
edge_del(e);
|
2002-09-24 11:43:34 +00:00
|
|
|
graph();
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
} else
|
2003-07-22 20:55:21 +00:00
|
|
|
return true;
|
2002-09-09 21:25:28 +00:00
|
|
|
} else if(from == myself) {
|
2003-07-12 17:41:48 +00:00
|
|
|
ifdebug(PROTOCOL) logger(LOG_WARNING, _("Got %s from %s (%s) for ourself which does not exist"),
|
2002-09-09 21:25:28 +00:00
|
|
|
"ADD_EDGE", c->name, c->hostname);
|
|
|
|
e = new_edge();
|
|
|
|
e->from = from;
|
|
|
|
e->to = to;
|
|
|
|
send_del_edge(c, e);
|
|
|
|
free_edge(e);
|
2003-07-22 20:55:21 +00:00
|
|
|
return true;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
e = new_edge();
|
|
|
|
e->from = from;
|
|
|
|
e->to = to;
|
|
|
|
e->address = address;
|
|
|
|
e->options = options;
|
|
|
|
e->weight = weight;
|
|
|
|
edge_add(e);
|
|
|
|
|
|
|
|
/* Tell the rest about the new edge */
|
|
|
|
|
2003-11-10 22:31:53 +00:00
|
|
|
if(!c->status.opaque)
|
|
|
|
forward_request(c);
|
2002-09-09 21:25:28 +00:00
|
|
|
|
|
|
|
/* Run MST before or after we tell the rest? */
|
|
|
|
|
|
|
|
graph();
|
|
|
|
|
2003-07-22 20:55:21 +00:00
|
|
|
return true;
|
2002-02-11 10:05:58 +00:00
|
|
|
}
|
|
|
|
|
2003-07-24 12:08:16 +00:00
|
|
|
bool send_del_edge(connection_t *c, const edge_t *e)
|
2002-02-11 10:05:58 +00:00
|
|
|
{
|
2002-09-09 21:25:28 +00:00
|
|
|
cp();
|
|
|
|
|
|
|
|
return send_request(c, "%d %lx %s %s", DEL_EDGE, random(),
|
|
|
|
e->from->name, e->to->name);
|
2002-02-11 10:05:58 +00:00
|
|
|
}
|
|
|
|
|
2003-07-22 20:55:21 +00:00
|
|
|
bool del_edge_h(connection_t *c)
|
2002-02-11 10:05:58 +00:00
|
|
|
{
|
2002-09-09 21:25:28 +00:00
|
|
|
edge_t *e;
|
|
|
|
char from_name[MAX_STRING_SIZE];
|
|
|
|
char to_name[MAX_STRING_SIZE];
|
|
|
|
node_t *from, *to;
|
|
|
|
|
|
|
|
cp();
|
|
|
|
|
|
|
|
if(sscanf(c->buffer, "%*d %*x "MAX_STRING" "MAX_STRING, from_name, to_name) != 2) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Got bad %s from %s (%s)"), "DEL_EDGE", c->name,
|
2002-09-09 21:25:28 +00:00
|
|
|
c->hostname);
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Check if names are valid */
|
|
|
|
|
2003-07-22 20:55:21 +00:00
|
|
|
if(!check_id(from_name)) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Got bad %s from %s (%s): %s"), "DEL_EDGE", c->name,
|
2002-09-09 21:25:28 +00:00
|
|
|
c->hostname, _("invalid name"));
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
2003-07-22 20:55:21 +00:00
|
|
|
if(!check_id(to_name)) {
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_ERR, _("Got bad %s from %s (%s): %s"), "DEL_EDGE", c->name,
|
2002-09-09 21:25:28 +00:00
|
|
|
c->hostname, _("invalid name"));
|
2003-07-22 20:55:21 +00:00
|
|
|
return false;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if(seen_request(c->buffer))
|
2003-07-22 20:55:21 +00:00
|
|
|
return true;
|
2002-09-09 21:25:28 +00:00
|
|
|
|
|
|
|
/* Lookup nodes */
|
|
|
|
|
|
|
|
from = lookup_node(from_name);
|
|
|
|
|
|
|
|
if(!from) {
|
2003-07-12 17:41:48 +00:00
|
|
|
ifdebug(PROTOCOL) logger(LOG_ERR, _("Got %s from %s (%s) which does not appear in the edge tree"),
|
2002-09-09 21:25:28 +00:00
|
|
|
"DEL_EDGE", c->name, c->hostname);
|
2003-07-22 20:55:21 +00:00
|
|
|
return true;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
to = lookup_node(to_name);
|
|
|
|
|
|
|
|
if(!to) {
|
2003-07-12 17:41:48 +00:00
|
|
|
ifdebug(PROTOCOL) logger(LOG_ERR, _("Got %s from %s (%s) which does not appear in the edge tree"),
|
2002-09-09 21:25:28 +00:00
|
|
|
"DEL_EDGE", c->name, c->hostname);
|
2003-07-22 20:55:21 +00:00
|
|
|
return true;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
2003-11-10 22:31:53 +00:00
|
|
|
if(c->status.opaque && from != myself && from != c->node && to != myself && to != c->node)
|
|
|
|
return false;
|
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
/* Check if edge exists */
|
|
|
|
|
|
|
|
e = lookup_edge(from, to);
|
|
|
|
|
|
|
|
if(!e) {
|
2003-07-12 17:41:48 +00:00
|
|
|
ifdebug(PROTOCOL) logger(LOG_WARNING, _("Got %s from %s (%s) which does not appear in the edge tree"),
|
2002-09-09 21:25:28 +00:00
|
|
|
"DEL_EDGE", c->name, c->hostname);
|
2003-07-22 20:55:21 +00:00
|
|
|
return true;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if(e->from == myself) {
|
2003-07-12 17:41:48 +00:00
|
|
|
ifdebug(PROTOCOL) logger(LOG_WARNING, _("Got %s from %s (%s) for ourself"),
|
2002-09-09 21:25:28 +00:00
|
|
|
"DEL_EDGE", c->name, c->hostname);
|
|
|
|
send_add_edge(c, e); /* Send back a correction */
|
2003-07-22 20:55:21 +00:00
|
|
|
return true;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Tell the rest about the deleted edge */
|
|
|
|
|
2003-11-10 22:31:53 +00:00
|
|
|
if(!c->status.opaque)
|
|
|
|
forward_request(c);
|
2002-09-09 21:25:28 +00:00
|
|
|
|
|
|
|
/* Delete the edge */
|
|
|
|
|
|
|
|
edge_del(e);
|
|
|
|
|
|
|
|
/* Run MST before or after we tell the rest? */
|
|
|
|
|
|
|
|
graph();
|
|
|
|
|
2003-08-28 15:27:12 +00:00
|
|
|
/* If the node is not reachable anymore but we remember it had an edge to us, clean it up */
|
|
|
|
|
|
|
|
if(!to->status.reachable) {
|
|
|
|
e = lookup_edge(to, myself);
|
|
|
|
if(e) {
|
|
|
|
send_del_edge(broadcast, e);
|
|
|
|
edge_del(e);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2003-07-22 20:55:21 +00:00
|
|
|
return true;
|
2002-02-11 10:05:58 +00:00
|
|
|
}
|