tinc/src/protocol.c

227 lines
5.8 KiB
C
Raw Normal View History

2019-08-26 11:44:36 +00:00
/*
protocol.c -- handle the meta-protocol, basic functions
2019-08-26 11:44:37 +00:00
Copyright (C) 1999-2005 Ivo Timmermans,
2019-08-26 11:44:38 +00:00
2000-2009 Guus Sliepen <guus@tinc-vpn.org>
2019-08-26 11:44:36 +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.
2019-08-26 11:44:38 +00:00
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.
2019-08-26 11:44:36 +00:00
*/
2019-08-26 11:44:36 +00:00
#include "system.h"
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:36 +00:00
#include "conf.h"
#include "connection.h"
#include "logger.h"
#include "meta.h"
#include "protocol.h"
#include "utils.h"
#include "xalloc.h"
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:36 +00:00
bool tunnelserver = false;
2019-08-26 11:44:40 +00:00
bool strictsubnets = false;
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:36 +00:00
/* Jumptable for the request handlers */
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:36 +00:00
static bool (*request_handlers[])(connection_t *) = {
id_h, metakey_h, challenge_h, chal_reply_h, ack_h,
status_h, error_h, termreq_h,
ping_h, pong_h,
add_subnet_h, del_subnet_h,
add_edge_h, del_edge_h,
key_changed_h, req_key_h, ans_key_h, tcppacket_h,
};
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:36 +00:00
/* Request names */
static char (*request_name[]) = {
"ID", "METAKEY", "CHALLENGE", "CHAL_REPLY", "ACK",
"STATUS", "ERROR", "TERMREQ",
"PING", "PONG",
"ADD_SUBNET", "DEL_SUBNET",
"ADD_EDGE", "DEL_EDGE", "KEY_CHANGED", "REQ_KEY", "ANS_KEY", "PACKET",
};
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:36 +00:00
static avl_tree_t *past_request_tree;
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:38 +00:00
bool check_id(const char *id) {
2019-08-26 11:44:36 +00:00
for(; *id; id++)
if(!isalnum(*id) && *id != '_')
return false;
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:36 +00:00
return true;
2019-08-26 11:44:36 +00:00
}
/* Generic request routines - takes care of logging and error
detection as well */
2019-08-26 11:44:38 +00:00
bool send_request(connection_t *c, const char *format, ...) {
2019-08-26 11:44:36 +00:00
va_list args;
char buffer[MAXBUFSIZE];
int len, request;
2019-08-26 11:44:38 +00:00
/* Use vsnprintf instead of vxasprintf: faster, no memory
2019-08-26 11:44:36 +00:00
fragmentation, cleanup is automatic, and there is a limit on the
input buffer anyway */
va_start(args, format);
len = vsnprintf(buffer, MAXBUFSIZE, format, args);
va_end(args);
if(len < 0 || len > MAXBUFSIZE - 1) {
2019-08-26 11:44:38 +00:00
logger(LOG_ERR, "Output buffer overflow while sending request to %s (%s)",
2019-08-26 11:44:36 +00:00
c->name, c->hostname);
return false;
}
ifdebug(PROTOCOL) {
sscanf(buffer, "%d", &request);
ifdebug(META)
2019-08-26 11:44:38 +00:00
logger(LOG_DEBUG, "Sending %s to %s (%s): %s",
2019-08-26 11:44:36 +00:00
request_name[request], c->name, c->hostname, buffer);
else
2019-08-26 11:44:38 +00:00
logger(LOG_DEBUG, "Sending %s to %s (%s)", request_name[request],
2019-08-26 11:44:36 +00:00
c->name, c->hostname);
}
buffer[len++] = '\n';
if(c == broadcast) {
broadcast_meta(NULL, buffer, len);
return true;
} else
return send_meta(c, buffer, len);
2019-08-26 11:44:36 +00:00
}
2019-08-26 11:44:38 +00:00
void forward_request(connection_t *from) {
2019-08-26 11:44:36 +00:00
int request;
ifdebug(PROTOCOL) {
sscanf(from->buffer, "%d", &request);
ifdebug(META)
2019-08-26 11:44:38 +00:00
logger(LOG_DEBUG, "Forwarding %s from %s (%s): %s",
2019-08-26 11:44:36 +00:00
request_name[request], from->name, from->hostname,
from->buffer);
else
2019-08-26 11:44:38 +00:00
logger(LOG_DEBUG, "Forwarding %s from %s (%s)",
2019-08-26 11:44:36 +00:00
request_name[request], from->name, from->hostname);
2019-08-26 11:44:36 +00:00
}
2019-08-26 11:44:36 +00:00
from->buffer[from->reqlen - 1] = '\n';
broadcast_meta(from, from->buffer, from->reqlen);
2019-08-26 11:44:36 +00:00
}
2019-08-26 11:44:38 +00:00
bool receive_request(connection_t *c) {
2019-08-26 11:44:36 +00:00
int request;
if(sscanf(c->buffer, "%d", &request) == 1) {
if((request < 0) || (request >= LAST) || !request_handlers[request]) {
ifdebug(META)
2019-08-26 11:44:38 +00:00
logger(LOG_DEBUG, "Unknown request from %s (%s): %s",
2019-08-26 11:44:36 +00:00
c->name, c->hostname, c->buffer);
else
2019-08-26 11:44:38 +00:00
logger(LOG_ERR, "Unknown request from %s (%s)",
2019-08-26 11:44:36 +00:00
c->name, c->hostname);
return false;
} else {
ifdebug(PROTOCOL) {
ifdebug(META)
2019-08-26 11:44:38 +00:00
logger(LOG_DEBUG, "Got %s from %s (%s): %s",
2019-08-26 11:44:36 +00:00
request_name[request], c->name, c->hostname,
c->buffer);
else
2019-08-26 11:44:38 +00:00
logger(LOG_DEBUG, "Got %s from %s (%s)",
2019-08-26 11:44:36 +00:00
request_name[request], c->name, c->hostname);
}
}
if((c->allow_request != ALL) && (c->allow_request != request)) {
2019-08-26 11:44:38 +00:00
logger(LOG_ERR, "Unauthorized request from %s (%s)", c->name,
2019-08-26 11:44:36 +00:00
c->hostname);
return false;
}
if(!request_handlers[request](c)) {
/* Something went wrong. Probably scriptkiddies. Terminate. */
2019-08-26 11:44:38 +00:00
logger(LOG_ERR, "Error while processing %s from %s (%s)",
2019-08-26 11:44:36 +00:00
request_name[request], c->name, c->hostname);
return false;
}
} else {
2019-08-26 11:44:38 +00:00
logger(LOG_ERR, "Bogus data received from %s (%s)",
2019-08-26 11:44:36 +00:00
c->name, c->hostname);
return false;
}
return true;
2019-08-26 11:44:36 +00:00
}
2019-08-26 11:44:38 +00:00
static int past_request_compare(const past_request_t *a, const past_request_t *b) {
2019-08-26 11:44:36 +00:00
return strcmp(a->request, b->request);
}
2019-08-26 11:44:38 +00:00
static void free_past_request(past_request_t *r) {
2019-08-26 11:44:36 +00:00
if(r->request)
free(r->request);
free(r);
2019-08-26 11:44:36 +00:00
}
2019-08-26 11:44:38 +00:00
void init_requests(void) {
2019-08-26 11:44:36 +00:00
past_request_tree = avl_alloc_tree((avl_compare_t) past_request_compare, (avl_action_t) free_past_request);
2019-08-26 11:44:36 +00:00
}
2019-08-26 11:44:38 +00:00
void exit_requests(void) {
2019-08-26 11:44:36 +00:00
avl_delete_tree(past_request_tree);
2019-08-26 11:44:36 +00:00
}
2019-08-26 11:44:38 +00:00
bool seen_request(char *request) {
2019-08-26 11:44:36 +00:00
past_request_t *new, p = {0};
p.request = request;
if(avl_search(past_request_tree, &p)) {
2019-08-26 11:44:38 +00:00
ifdebug(SCARY_THINGS) logger(LOG_DEBUG, "Already seen request");
2019-08-26 11:44:36 +00:00
return true;
} else {
new = xmalloc(sizeof(*new));
new->request = xstrdup(request);
new->firstseen = now;
avl_insert(past_request_tree, new);
return false;
}
2019-08-26 11:44:36 +00:00
}
2019-08-26 11:44:38 +00:00
void age_past_requests(void) {
2019-08-26 11:44:36 +00:00
avl_node_t *node, *next;
past_request_t *p;
int left = 0, deleted = 0;
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:36 +00:00
for(node = past_request_tree->head; node; node = next) {
next = node->next;
p = node->data;
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:37 +00:00
if(p->firstseen + pinginterval < now)
2019-08-26 11:44:36 +00:00
avl_delete_node(past_request_tree, node), deleted++;
else
left++;
}
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:36 +00:00
if(left || deleted)
2019-08-26 11:44:38 +00:00
ifdebug(SCARY_THINGS) logger(LOG_DEBUG, "Aging past requests: deleted %d, left %d",
2019-08-26 11:44:36 +00:00
deleted, left);
}