2002-02-18 16:25:19 +00:00
|
|
|
/*
|
|
|
|
net_packet.c -- Handles in- and outgoing VPN packets
|
2006-04-26 13:52:58 +00:00
|
|
|
Copyright (C) 1998-2005 Ivo Timmermans,
|
2013-01-20 20:03:22 +00:00
|
|
|
2000-2013 Guus Sliepen <guus@tinc-vpn.org>
|
2010-10-22 11:40:04 +00:00
|
|
|
2010 Timothy Redaelli <timothy@redaelli.eu>
|
2010-11-16 16:28:41 +00:00
|
|
|
2010 Brandon Black <blblack@gmail.com>
|
2002-02-18 16:25:19 +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.
|
|
|
|
|
2009-09-24 22:01:00 +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.
|
2002-02-18 16:25:19 +00:00
|
|
|
*/
|
|
|
|
|
2003-07-17 15:06:27 +00:00
|
|
|
#include "system.h"
|
2002-02-18 16:25:19 +00:00
|
|
|
|
2010-02-10 13:52:15 +00:00
|
|
|
#ifdef HAVE_ZLIB
|
2002-02-18 16:25:19 +00:00
|
|
|
#include <zlib.h>
|
2010-02-10 13:52:15 +00:00
|
|
|
#endif
|
2010-02-10 12:24:33 +00:00
|
|
|
|
|
|
|
#ifdef HAVE_LZO
|
2006-11-29 17:18:39 +00:00
|
|
|
#include LZO1X_H
|
2010-02-10 12:24:33 +00:00
|
|
|
#endif
|
2002-02-18 16:25:19 +00:00
|
|
|
|
2008-12-11 14:44:44 +00:00
|
|
|
#include "cipher.h"
|
2002-02-18 16:25:19 +00:00
|
|
|
#include "conf.h"
|
|
|
|
#include "connection.h"
|
2008-12-11 14:44:44 +00:00
|
|
|
#include "crypto.h"
|
|
|
|
#include "digest.h"
|
2003-07-17 15:06:27 +00:00
|
|
|
#include "device.h"
|
2003-12-27 16:32:52 +00:00
|
|
|
#include "ethernet.h"
|
2003-07-17 15:06:27 +00:00
|
|
|
#include "graph.h"
|
|
|
|
#include "logger.h"
|
2002-02-18 16:25:19 +00:00
|
|
|
#include "net.h"
|
|
|
|
#include "netutl.h"
|
|
|
|
#include "protocol.h"
|
|
|
|
#include "process.h"
|
|
|
|
#include "route.h"
|
2003-07-17 15:06:27 +00:00
|
|
|
#include "utils.h"
|
|
|
|
#include "xalloc.h"
|
2002-02-18 16:25:19 +00:00
|
|
|
|
|
|
|
int keylifetime = 0;
|
2010-02-10 12:24:33 +00:00
|
|
|
#ifdef HAVE_LZO
|
2003-07-06 23:16:29 +00:00
|
|
|
static char lzo_wrkmem[LZO1X_999_MEM_COMPRESS > LZO1X_1_MEM_COMPRESS ? LZO1X_999_MEM_COMPRESS : LZO1X_1_MEM_COMPRESS];
|
2010-02-10 12:24:33 +00:00
|
|
|
#endif
|
2003-05-06 21:13:18 +00:00
|
|
|
|
2003-12-20 19:47:53 +00:00
|
|
|
static void send_udppacket(node_t *, vpn_packet_t *);
|
2002-02-18 16:25:19 +00:00
|
|
|
|
2010-11-13 18:05:50 +00:00
|
|
|
unsigned replaywin = 16;
|
2012-02-22 22:17:43 +00:00
|
|
|
bool localdiscovery = false;
|
2010-11-13 18:05:50 +00:00
|
|
|
|
2002-02-18 16:25:19 +00:00
|
|
|
#define MAX_SEQNO 1073741824
|
|
|
|
|
2012-02-22 22:17:43 +00:00
|
|
|
/* mtuprobes == 1..30: initial discovery, send bursts with 1 second interval
|
|
|
|
mtuprobes == 31: sleep pinginterval seconds
|
|
|
|
mtuprobes == 32: send 1 burst, sleep pingtimeout second
|
|
|
|
mtuprobes == 33: no response from other side, restart PMTU discovery process
|
|
|
|
|
2013-01-31 14:58:33 +00:00
|
|
|
Probes are sent in batches of at least three, with random sizes between the
|
|
|
|
lower and upper boundaries for the MTU thus far discovered.
|
2012-02-22 22:17:43 +00:00
|
|
|
|
2013-01-31 14:58:33 +00:00
|
|
|
After the initial discovery, a fourth packet is added to each batch with a
|
|
|
|
size larger than the currently known PMTU, to test if the PMTU has increased.
|
|
|
|
|
|
|
|
In case local discovery is enabled, another packet is added to each batch,
|
2012-02-22 22:17:43 +00:00
|
|
|
which will be broadcast to the local network.
|
2013-01-31 14:58:33 +00:00
|
|
|
|
2012-02-22 22:17:43 +00:00
|
|
|
*/
|
2009-10-11 16:57:58 +00:00
|
|
|
|
2012-11-29 11:28:23 +00:00
|
|
|
static void send_mtu_probe_handler(void *data) {
|
2007-05-17 22:01:07 +00:00
|
|
|
node_t *n = data;
|
2009-10-11 16:57:58 +00:00
|
|
|
int timeout = 1;
|
2012-10-10 15:17:49 +00:00
|
|
|
|
2003-12-20 19:47:53 +00:00
|
|
|
n->mtuprobes++;
|
|
|
|
|
2009-10-11 16:57:58 +00:00
|
|
|
if(!n->status.reachable || !n->status.validkey) {
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_INFO, "Trying to send MTU probe to unreachable or rekeying node %s (%s)", n->name, n->hostname);
|
2009-10-11 16:57:58 +00:00
|
|
|
n->mtuprobes = 0;
|
2009-06-11 16:36:08 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2009-10-11 16:57:58 +00:00
|
|
|
if(n->mtuprobes > 32) {
|
2011-01-02 14:02:23 +00:00
|
|
|
if(!n->minmtu) {
|
|
|
|
n->mtuprobes = 31;
|
|
|
|
timeout = pinginterval;
|
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_INFO, "%s (%s) did not respond to UDP ping, restarting PMTU discovery", n->name, n->hostname);
|
2012-10-10 12:46:22 +00:00
|
|
|
n->status.udp_confirmed = false;
|
2009-10-11 16:57:58 +00:00
|
|
|
n->mtuprobes = 1;
|
|
|
|
n->minmtu = 0;
|
|
|
|
n->maxmtu = MTU;
|
|
|
|
}
|
|
|
|
|
2011-01-02 14:02:23 +00:00
|
|
|
if(n->mtuprobes >= 10 && n->mtuprobes < 32 && !n->minmtu) {
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_INFO, "No response to MTU probes from %s (%s)", n->name, n->hostname);
|
2011-01-02 14:02:23 +00:00
|
|
|
n->mtuprobes = 31;
|
2003-12-20 21:09:33 +00:00
|
|
|
}
|
|
|
|
|
2009-10-11 16:57:58 +00:00
|
|
|
if(n->mtuprobes == 30 || (n->mtuprobes < 30 && n->minmtu >= n->maxmtu)) {
|
2009-10-24 19:35:40 +00:00
|
|
|
if(n->minmtu > n->maxmtu)
|
|
|
|
n->minmtu = n->maxmtu;
|
|
|
|
else
|
|
|
|
n->maxmtu = n->minmtu;
|
2009-10-11 16:57:58 +00:00
|
|
|
n->mtu = n->minmtu;
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_INFO, "Fixing MTU of %s (%s) to %d after %d probes", n->name, n->hostname, n->mtu, n->mtuprobes);
|
2009-10-11 16:57:58 +00:00
|
|
|
n->mtuprobes = 31;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(n->mtuprobes == 31) {
|
|
|
|
timeout = pinginterval;
|
|
|
|
goto end;
|
|
|
|
} else if(n->mtuprobes == 32) {
|
|
|
|
timeout = pingtimeout;
|
|
|
|
}
|
|
|
|
|
2013-01-31 14:58:33 +00:00
|
|
|
for(int i = 0; i < 4 + localdiscovery; i++) {
|
2012-10-07 22:35:38 +00:00
|
|
|
int len;
|
|
|
|
|
2013-01-31 14:58:33 +00:00
|
|
|
if(i == 0) {
|
|
|
|
if(n->mtuprobes < 30 || n->maxmtu + 8 >= MTU)
|
|
|
|
continue;
|
|
|
|
len = n->maxmtu + 8;
|
|
|
|
} else if(n->maxmtu <= n->minmtu) {
|
2009-10-11 16:57:58 +00:00
|
|
|
len = n->maxmtu;
|
2013-01-31 14:58:33 +00:00
|
|
|
} else {
|
2009-10-11 16:57:58 +00:00
|
|
|
len = n->minmtu + 1 + rand() % (n->maxmtu - n->minmtu);
|
2013-01-31 14:58:33 +00:00
|
|
|
}
|
2003-12-20 19:47:53 +00:00
|
|
|
|
|
|
|
if(len < 64)
|
|
|
|
len = 64;
|
2012-10-10 15:17:49 +00:00
|
|
|
|
2012-10-07 22:35:38 +00:00
|
|
|
vpn_packet_t packet;
|
2003-12-20 19:47:53 +00:00
|
|
|
memset(packet.data, 0, 14);
|
2008-12-11 14:44:44 +00:00
|
|
|
randomize(packet.data + 14, len - 14);
|
2003-12-20 19:47:53 +00:00
|
|
|
packet.len = len;
|
2013-01-31 14:58:33 +00:00
|
|
|
if(i >= 4 && n->mtuprobes <= 10)
|
2012-02-26 15:23:02 +00:00
|
|
|
packet.priority = -1;
|
|
|
|
else
|
|
|
|
packet.priority = 0;
|
2003-12-20 19:47:53 +00:00
|
|
|
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_INFO, "Sending MTU probe length %d to %s (%s)", len, n->name, n->hostname);
|
2003-12-20 19:47:53 +00:00
|
|
|
|
|
|
|
send_udppacket(n, &packet);
|
|
|
|
}
|
|
|
|
|
2013-01-16 15:31:56 +00:00
|
|
|
n->probe_counter = 0;
|
|
|
|
gettimeofday(&n->probe_time, NULL);
|
|
|
|
|
|
|
|
/* Calculate the packet loss of incoming traffic by comparing the rate of
|
|
|
|
packets received to the rate with which the sequence number has increased.
|
|
|
|
*/
|
|
|
|
|
|
|
|
if(n->received > n->prev_received)
|
|
|
|
n->packetloss = 1.0 - (n->received - n->prev_received) / (float)(n->received_seqno - n->prev_received_seqno);
|
|
|
|
else
|
|
|
|
n->packetloss = n->received_seqno <= n->prev_received_seqno;
|
|
|
|
|
|
|
|
n->prev_received_seqno = n->received_seqno;
|
|
|
|
n->prev_received = n->received;
|
|
|
|
|
2009-10-11 16:57:58 +00:00
|
|
|
end:
|
2012-11-29 11:28:23 +00:00
|
|
|
timeout_set(&n->mtutimeout, &(struct timeval){timeout, rand() % 100000});
|
2007-05-17 22:01:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void send_mtu_probe(node_t *n) {
|
2012-11-29 11:28:23 +00:00
|
|
|
timeout_add(&n->mtutimeout, send_mtu_probe_handler, n, &(struct timeval){1, 0});
|
|
|
|
send_mtu_probe_handler(n);
|
2003-12-20 19:47:53 +00:00
|
|
|
}
|
|
|
|
|
2011-05-28 01:56:06 +00:00
|
|
|
static void mtu_probe_h(node_t *n, vpn_packet_t *packet, length_t len) {
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_INFO, "Got MTU probe length %d from %s (%s)", packet->len, n->name, n->hostname);
|
2003-12-20 19:47:53 +00:00
|
|
|
|
|
|
|
if(!packet->data[0]) {
|
2012-11-19 13:20:50 +00:00
|
|
|
/* It's a probe request, send back a reply */
|
|
|
|
|
2003-12-20 19:47:53 +00:00
|
|
|
packet->data[0] = 1;
|
2012-11-19 13:20:50 +00:00
|
|
|
|
|
|
|
/* Temporarily set udp_confirmed, so that the reply is sent
|
|
|
|
back exactly the way it came in. */
|
|
|
|
|
|
|
|
bool udp_confirmed = n->status.udp_confirmed;
|
|
|
|
n->status.udp_confirmed = true;
|
2009-10-24 19:32:06 +00:00
|
|
|
send_udppacket(n, packet);
|
2012-11-19 13:20:50 +00:00
|
|
|
n->status.udp_confirmed = udp_confirmed;
|
2003-12-20 19:47:53 +00:00
|
|
|
} else {
|
2012-11-19 13:20:50 +00:00
|
|
|
/* It's a valid reply: now we know bidirectional communication
|
|
|
|
is possible using the address and socket that the reply
|
|
|
|
packet used. */
|
|
|
|
|
2012-10-10 12:46:22 +00:00
|
|
|
n->status.udp_confirmed = true;
|
|
|
|
|
2012-11-19 13:20:50 +00:00
|
|
|
/* If we haven't established the PMTU yet, restart the discovery process. */
|
|
|
|
|
2011-01-02 14:02:23 +00:00
|
|
|
if(n->mtuprobes > 30) {
|
2013-01-31 14:58:33 +00:00
|
|
|
if (len == n->maxmtu + 8) {
|
|
|
|
logger(DEBUG_TRAFFIC, LOG_INFO, "Increase in PMTU to %s (%s) detected, restarting PMTU discovery", n->name, n->hostname);
|
|
|
|
n->maxmtu = MTU;
|
|
|
|
n->mtuprobes = 10;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2011-01-02 14:02:23 +00:00
|
|
|
if(n->minmtu)
|
|
|
|
n->mtuprobes = 30;
|
|
|
|
else
|
|
|
|
n->mtuprobes = 1;
|
|
|
|
}
|
|
|
|
|
2012-11-19 13:20:50 +00:00
|
|
|
/* If applicable, raise the minimum supported MTU */
|
|
|
|
|
2009-10-11 16:57:58 +00:00
|
|
|
if(len > n->maxmtu)
|
|
|
|
len = n->maxmtu;
|
2009-05-25 10:19:37 +00:00
|
|
|
if(n->minmtu < len)
|
|
|
|
n->minmtu = len;
|
2013-01-16 15:31:56 +00:00
|
|
|
|
|
|
|
/* Calculate RTT and bandwidth.
|
|
|
|
The RTT is the time between the MTU probe burst was sent and the first
|
|
|
|
reply is received. The bandwidth is measured using the time between the
|
|
|
|
arrival of the first and third probe reply.
|
|
|
|
*/
|
|
|
|
|
|
|
|
struct timeval now, diff;
|
|
|
|
gettimeofday(&now, NULL);
|
|
|
|
timersub(&now, &n->probe_time, &diff);
|
|
|
|
n->probe_counter++;
|
|
|
|
|
|
|
|
if(n->probe_counter == 1) {
|
|
|
|
n->rtt = diff.tv_sec + diff.tv_usec * 1e-6;
|
|
|
|
n->probe_time = now;
|
|
|
|
} else if(n->probe_counter == 3) {
|
|
|
|
n->bandwidth = 2.0 * len / (diff.tv_sec + diff.tv_usec * 1e-6);
|
|
|
|
logger(DEBUG_TRAFFIC, LOG_DEBUG, "%s (%s) RTT %.2f ms, burst bandwidth %.3f Mbit/s, rx packet loss %.2f %%", n->name, n->hostname, n->rtt * 1e3, n->bandwidth * 8e-6, n->packetloss * 1e2);
|
|
|
|
}
|
2003-12-20 19:47:53 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-05-18 10:00:00 +00:00
|
|
|
static length_t compress_packet(uint8_t *dest, const uint8_t *source, length_t len, int level) {
|
2010-02-10 13:52:15 +00:00
|
|
|
if(level == 0) {
|
|
|
|
memcpy(dest, source, len);
|
|
|
|
return len;
|
|
|
|
} else if(level == 10) {
|
2010-02-10 12:24:33 +00:00
|
|
|
#ifdef HAVE_LZO
|
2003-05-07 11:21:58 +00:00
|
|
|
lzo_uint lzolen = MAXSIZE;
|
2003-05-06 21:13:18 +00:00
|
|
|
lzo1x_1_compress(source, len, dest, &lzolen, lzo_wrkmem);
|
|
|
|
return lzolen;
|
2010-02-10 12:24:33 +00:00
|
|
|
#else
|
|
|
|
return -1;
|
|
|
|
#endif
|
2003-05-06 21:13:18 +00:00
|
|
|
} else if(level < 10) {
|
2010-02-10 13:52:15 +00:00
|
|
|
#ifdef HAVE_ZLIB
|
2003-05-06 23:14:45 +00:00
|
|
|
unsigned long destlen = MAXSIZE;
|
2003-05-06 21:13:18 +00:00
|
|
|
if(compress2(dest, &destlen, source, len, level) == Z_OK)
|
|
|
|
return destlen;
|
|
|
|
else
|
2010-02-10 13:52:15 +00:00
|
|
|
#endif
|
2003-05-06 21:13:18 +00:00
|
|
|
return -1;
|
|
|
|
} else {
|
2010-02-10 12:24:33 +00:00
|
|
|
#ifdef HAVE_LZO
|
2003-05-07 11:21:58 +00:00
|
|
|
lzo_uint lzolen = MAXSIZE;
|
2003-05-06 21:13:18 +00:00
|
|
|
lzo1x_999_compress(source, len, dest, &lzolen, lzo_wrkmem);
|
|
|
|
return lzolen;
|
2010-02-10 12:24:33 +00:00
|
|
|
#else
|
|
|
|
return -1;
|
|
|
|
#endif
|
2003-05-06 21:13:18 +00:00
|
|
|
}
|
2012-10-10 15:17:49 +00:00
|
|
|
|
2003-05-06 21:13:18 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2007-05-18 10:00:00 +00:00
|
|
|
static length_t uncompress_packet(uint8_t *dest, const uint8_t *source, length_t len, int level) {
|
2010-02-10 13:52:15 +00:00
|
|
|
if(level == 0) {
|
|
|
|
memcpy(dest, source, len);
|
|
|
|
return len;
|
|
|
|
} else if(level > 9) {
|
2010-02-10 12:24:33 +00:00
|
|
|
#ifdef HAVE_LZO
|
2003-05-07 11:21:58 +00:00
|
|
|
lzo_uint lzolen = MAXSIZE;
|
2003-05-06 21:13:18 +00:00
|
|
|
if(lzo1x_decompress_safe(source, len, dest, &lzolen, NULL) == LZO_E_OK)
|
|
|
|
return lzolen;
|
|
|
|
else
|
2010-02-10 12:24:33 +00:00
|
|
|
#endif
|
2003-05-06 21:13:18 +00:00
|
|
|
return -1;
|
2010-02-10 13:52:15 +00:00
|
|
|
}
|
|
|
|
#ifdef HAVE_ZLIB
|
|
|
|
else {
|
2003-05-06 23:14:45 +00:00
|
|
|
unsigned long destlen = MAXSIZE;
|
2003-05-06 21:13:18 +00:00
|
|
|
if(uncompress(dest, &destlen, source, len) == Z_OK)
|
|
|
|
return destlen;
|
|
|
|
else
|
|
|
|
return -1;
|
|
|
|
}
|
2010-02-10 13:52:15 +00:00
|
|
|
#endif
|
|
|
|
|
2003-05-06 21:13:18 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2002-02-18 16:25:19 +00:00
|
|
|
/* VPN packet I/O */
|
|
|
|
|
2007-05-18 10:00:00 +00:00
|
|
|
static void receive_packet(node_t *n, vpn_packet_t *packet) {
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_DEBUG, "Received packet of %d bytes from %s (%s)",
|
2003-07-06 23:16:29 +00:00
|
|
|
packet->len, n->name, n->hostname);
|
|
|
|
|
2011-05-14 22:42:29 +00:00
|
|
|
n->in_packets++;
|
|
|
|
n->in_bytes += packet->len;
|
|
|
|
|
2003-12-12 19:52:25 +00:00
|
|
|
route(n, packet);
|
2003-07-06 23:16:29 +00:00
|
|
|
}
|
|
|
|
|
2009-09-29 12:55:29 +00:00
|
|
|
static bool try_mac(node_t *n, const vpn_packet_t *inpkt) {
|
2012-07-31 19:43:49 +00:00
|
|
|
if(n->status.sptps)
|
2012-08-02 15:44:59 +00:00
|
|
|
return sptps_verify_datagram(&n->sptps, (char *)&inpkt->seqno, inpkt->len);
|
2012-07-31 18:36:35 +00:00
|
|
|
|
2013-05-01 15:17:22 +00:00
|
|
|
if(!digest_active(n->indigest) || inpkt->len < sizeof inpkt->seqno + digest_length(n->indigest))
|
2009-04-02 23:05:23 +00:00
|
|
|
return false;
|
|
|
|
|
2013-05-01 15:17:22 +00:00
|
|
|
return digest_verify(n->indigest, &inpkt->seqno, inpkt->len - digest_length(n->indigest), (const char *)&inpkt->seqno + inpkt->len - digest_length(n->indigest));
|
2009-04-02 23:05:23 +00:00
|
|
|
}
|
|
|
|
|
2009-09-24 22:14:03 +00:00
|
|
|
static void receive_udppacket(node_t *n, vpn_packet_t *inpkt) {
|
2002-09-09 21:25:28 +00:00
|
|
|
vpn_packet_t pkt1, pkt2;
|
|
|
|
vpn_packet_t *pkt[] = { &pkt1, &pkt2, &pkt1, &pkt2 };
|
|
|
|
int nextpkt = 0;
|
|
|
|
vpn_packet_t *outpkt = pkt[0];
|
2008-12-11 14:44:44 +00:00
|
|
|
size_t outlen;
|
2002-09-09 21:25:28 +00:00
|
|
|
|
2012-07-31 19:43:49 +00:00
|
|
|
if(n->status.sptps) {
|
2012-08-02 15:44:59 +00:00
|
|
|
sptps_receive_data(&n->sptps, (char *)&inpkt->seqno, inpkt->len);
|
2012-07-30 16:36:59 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2013-05-01 15:17:22 +00:00
|
|
|
if(!cipher_active(n->incipher)) {
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_DEBUG, "Got packet from %s (%s) but he hasn't got our key yet",
|
2009-04-02 23:05:23 +00:00
|
|
|
n->name, n->hostname);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2004-03-20 22:23:42 +00:00
|
|
|
/* Check packet length */
|
|
|
|
|
2013-05-01 15:17:22 +00:00
|
|
|
if(inpkt->len < sizeof inpkt->seqno + digest_length(n->indigest)) {
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_DEBUG, "Got too short packet from %s (%s)",
|
2004-03-20 22:23:42 +00:00
|
|
|
n->name, n->hostname);
|
2003-09-23 20:59:01 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2004-03-20 22:23:42 +00:00
|
|
|
/* Check the message authentication code */
|
|
|
|
|
2013-05-01 15:17:22 +00:00
|
|
|
if(digest_active(n->indigest)) {
|
|
|
|
inpkt->len -= digest_length(n->indigest);
|
|
|
|
if(!digest_verify(n->indigest, &inpkt->seqno, inpkt->len, (const char *)&inpkt->seqno + inpkt->len)) {
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_DEBUG, "Got unauthenticated packet from %s (%s)", n->name, n->hostname);
|
2009-12-18 00:15:25 +00:00
|
|
|
return;
|
|
|
|
}
|
2004-03-20 22:23:42 +00:00
|
|
|
}
|
2002-09-09 21:25:28 +00:00
|
|
|
/* Decrypt the packet */
|
|
|
|
|
2013-05-01 15:17:22 +00:00
|
|
|
if(cipher_active(n->incipher)) {
|
2002-09-09 21:25:28 +00:00
|
|
|
outpkt = pkt[nextpkt++];
|
2008-12-11 14:44:44 +00:00
|
|
|
outlen = MAXSIZE;
|
2002-09-09 21:25:28 +00:00
|
|
|
|
2013-05-01 15:17:22 +00:00
|
|
|
if(!cipher_decrypt(n->incipher, &inpkt->seqno, inpkt->len, &outpkt->seqno, &outlen, true)) {
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_DEBUG, "Error decrypting packet from %s (%s)", n->name, n->hostname);
|
2003-10-10 16:24:24 +00:00
|
|
|
return;
|
|
|
|
}
|
2012-10-10 15:17:49 +00:00
|
|
|
|
2008-12-11 14:44:44 +00:00
|
|
|
outpkt->len = outlen;
|
2002-09-09 21:25:28 +00:00
|
|
|
inpkt = outpkt;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Check the sequence number */
|
|
|
|
|
2008-12-11 15:56:18 +00:00
|
|
|
inpkt->len -= sizeof inpkt->seqno;
|
2002-09-09 21:25:28 +00:00
|
|
|
inpkt->seqno = ntohl(inpkt->seqno);
|
|
|
|
|
2010-11-13 18:05:50 +00:00
|
|
|
if(replaywin) {
|
|
|
|
if(inpkt->seqno != n->received_seqno + 1) {
|
|
|
|
if(inpkt->seqno >= n->received_seqno + replaywin * 8) {
|
2010-11-13 18:05:51 +00:00
|
|
|
if(n->farfuture++ < replaywin >> 2) {
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_ALWAYS, LOG_WARNING, "Packet from %s (%s) is %d seqs in the future, dropped (%u)",
|
2010-11-13 18:05:51 +00:00
|
|
|
n->name, n->hostname, inpkt->seqno - n->received_seqno - 1, n->farfuture);
|
|
|
|
return;
|
|
|
|
}
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_ALWAYS, LOG_WARNING, "Lost %d packets from %s (%s)",
|
2012-10-10 15:17:49 +00:00
|
|
|
inpkt->seqno - n->received_seqno - 1, n->name, n->hostname);
|
2010-11-13 18:05:50 +00:00
|
|
|
memset(n->late, 0, replaywin);
|
|
|
|
} else if (inpkt->seqno <= n->received_seqno) {
|
|
|
|
if((n->received_seqno >= replaywin * 8 && inpkt->seqno <= n->received_seqno - replaywin * 8) || !(n->late[(inpkt->seqno / 8) % replaywin] & (1 << inpkt->seqno % 8))) {
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_ALWAYS, LOG_WARNING, "Got late or replayed packet from %s (%s), seqno %d, last received %d",
|
2012-10-10 15:17:49 +00:00
|
|
|
n->name, n->hostname, inpkt->seqno, n->received_seqno);
|
2010-11-13 18:05:50 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
} else {
|
2011-06-02 16:22:26 +00:00
|
|
|
for(int i = n->received_seqno + 1; i < inpkt->seqno; i++)
|
2010-11-13 18:05:50 +00:00
|
|
|
n->late[(i / 8) % replaywin] |= 1 << i % 8;
|
2004-09-20 20:55:49 +00:00
|
|
|
}
|
2003-04-18 21:18:36 +00:00
|
|
|
}
|
2010-11-13 18:05:51 +00:00
|
|
|
|
|
|
|
n->farfuture = 0;
|
2010-11-13 18:05:50 +00:00
|
|
|
n->late[(inpkt->seqno / 8) % replaywin] &= ~(1 << inpkt->seqno % 8);
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
2004-11-08 22:30:13 +00:00
|
|
|
|
2004-11-09 09:51:35 +00:00
|
|
|
if(inpkt->seqno > n->received_seqno)
|
2004-11-08 22:30:13 +00:00
|
|
|
n->received_seqno = inpkt->seqno;
|
2012-10-10 15:17:49 +00:00
|
|
|
|
2013-01-15 12:33:16 +00:00
|
|
|
n->received++;
|
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
if(n->received_seqno > MAX_SEQNO)
|
2007-05-17 23:57:48 +00:00
|
|
|
regenerate_key();
|
2002-09-09 21:25:28 +00:00
|
|
|
|
|
|
|
/* Decompress the packet */
|
|
|
|
|
2009-05-25 10:19:37 +00:00
|
|
|
length_t origlen = inpkt->len;
|
|
|
|
|
2009-04-02 23:05:23 +00:00
|
|
|
if(n->incompression) {
|
2002-09-09 21:25:28 +00:00
|
|
|
outpkt = pkt[nextpkt++];
|
|
|
|
|
2009-04-02 23:05:23 +00:00
|
|
|
if((outpkt->len = uncompress_packet(outpkt->data, inpkt->data, inpkt->len, n->incompression)) < 0) {
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_ERR, "Error while uncompressing packet from %s (%s)",
|
2012-10-10 15:17:49 +00:00
|
|
|
n->name, n->hostname);
|
2002-09-09 21:25:28 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
inpkt = outpkt;
|
2009-05-25 10:19:37 +00:00
|
|
|
|
|
|
|
origlen -= MTU/64 + 20;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
2009-01-03 21:33:55 +00:00
|
|
|
inpkt->priority = 0;
|
|
|
|
|
2003-12-20 19:47:53 +00:00
|
|
|
if(!inpkt->data[12] && !inpkt->data[13])
|
2009-05-25 10:19:37 +00:00
|
|
|
mtu_probe_h(n, inpkt, origlen);
|
2003-12-20 19:47:53 +00:00
|
|
|
else
|
|
|
|
receive_packet(n, inpkt);
|
2002-02-18 16:25:19 +00:00
|
|
|
}
|
|
|
|
|
2011-05-28 21:36:52 +00:00
|
|
|
void receive_tcppacket(connection_t *c, const char *buffer, int len) {
|
2002-09-09 21:25:28 +00:00
|
|
|
vpn_packet_t outpkt;
|
|
|
|
|
2013-04-12 15:15:05 +00:00
|
|
|
if(len > sizeof outpkt.data)
|
|
|
|
return;
|
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
outpkt.len = len;
|
2009-01-03 21:33:55 +00:00
|
|
|
if(c->options & OPTION_TCPONLY)
|
|
|
|
outpkt.priority = 0;
|
|
|
|
else
|
|
|
|
outpkt.priority = -1;
|
2002-09-09 21:25:28 +00:00
|
|
|
memcpy(outpkt.data, buffer, len);
|
|
|
|
|
|
|
|
receive_packet(c->node, &outpkt);
|
2002-02-18 16:25:19 +00:00
|
|
|
}
|
|
|
|
|
2012-08-02 15:44:59 +00:00
|
|
|
static void send_sptps_packet(node_t *n, vpn_packet_t *origpkt) {
|
2012-10-07 11:31:19 +00:00
|
|
|
if(!n->status.validkey) {
|
|
|
|
logger(DEBUG_TRAFFIC, LOG_INFO, "No valid key known yet for %s (%s)", n->name, n->hostname);
|
|
|
|
if(!n->status.waitingforkey)
|
|
|
|
send_req_key(n);
|
2013-03-08 13:11:15 +00:00
|
|
|
else if(n->last_req_key + 10 < now.tv_sec) {
|
2012-10-14 12:33:54 +00:00
|
|
|
logger(DEBUG_ALWAYS, LOG_DEBUG, "No key from %s after 10 seconds, restarting SPTPS", n->name);
|
2012-10-07 11:31:19 +00:00
|
|
|
sptps_stop(&n->sptps);
|
|
|
|
n->status.waitingforkey = false;
|
|
|
|
send_req_key(n);
|
2012-08-02 15:44:59 +00:00
|
|
|
}
|
2012-10-07 12:03:50 +00:00
|
|
|
return;
|
2012-10-07 11:31:19 +00:00
|
|
|
}
|
2012-08-02 15:44:59 +00:00
|
|
|
|
2012-10-07 11:31:19 +00:00
|
|
|
uint8_t type = 0;
|
|
|
|
int offset = 0;
|
2012-08-02 15:44:59 +00:00
|
|
|
|
2012-10-07 11:31:19 +00:00
|
|
|
if(!(origpkt->data[12] | origpkt->data[13])) {
|
|
|
|
sptps_send_record(&n->sptps, PKT_PROBE, (char *)origpkt->data, origpkt->len);
|
|
|
|
return;
|
|
|
|
}
|
2012-08-02 15:44:59 +00:00
|
|
|
|
2012-10-07 11:31:19 +00:00
|
|
|
if(routing_mode == RMODE_ROUTER)
|
|
|
|
offset = 14;
|
|
|
|
else
|
|
|
|
type = PKT_MAC;
|
2012-08-02 15:44:59 +00:00
|
|
|
|
2012-10-07 11:31:19 +00:00
|
|
|
if(origpkt->len < offset)
|
2012-08-02 15:44:59 +00:00
|
|
|
return;
|
2012-10-07 11:31:19 +00:00
|
|
|
|
|
|
|
vpn_packet_t outpkt;
|
|
|
|
|
|
|
|
if(n->outcompression) {
|
|
|
|
int len = compress_packet(outpkt.data + offset, origpkt->data + offset, origpkt->len - offset, n->outcompression);
|
|
|
|
if(len < 0) {
|
|
|
|
logger(DEBUG_TRAFFIC, LOG_ERR, "Error while compressing packet to %s (%s)", n->name, n->hostname);
|
|
|
|
} else if(len < origpkt->len - offset) {
|
|
|
|
outpkt.len = len + offset;
|
|
|
|
origpkt = &outpkt;
|
|
|
|
type |= PKT_COMPRESSED;
|
|
|
|
}
|
2012-08-02 15:44:59 +00:00
|
|
|
}
|
2012-10-07 11:31:19 +00:00
|
|
|
|
|
|
|
sptps_send_record(&n->sptps, type, (char *)origpkt->data + offset, origpkt->len - offset);
|
|
|
|
return;
|
2012-08-02 15:44:59 +00:00
|
|
|
}
|
|
|
|
|
2012-11-17 21:48:06 +00:00
|
|
|
static void choose_udp_address(const node_t *n, const sockaddr_t **sa, int *sock) {
|
|
|
|
/* Latest guess */
|
|
|
|
*sa = &n->address;
|
|
|
|
*sock = n->sock;
|
|
|
|
|
|
|
|
/* If the UDP address is confirmed, use it. */
|
|
|
|
if(n->status.udp_confirmed)
|
|
|
|
return;
|
|
|
|
|
2012-11-19 12:50:17 +00:00
|
|
|
/* Send every third packet to n->address; that could be set
|
|
|
|
to the node's reflexive UDP address discovered during key
|
|
|
|
exchange. */
|
2012-11-17 21:48:06 +00:00
|
|
|
|
2012-11-19 12:50:17 +00:00
|
|
|
static int x = 0;
|
|
|
|
if(++x >= 3) {
|
|
|
|
x = 0;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Otherwise, address are found in edges to this node.
|
|
|
|
So we pick a random edge and a random socket. */
|
2012-11-17 21:48:06 +00:00
|
|
|
|
|
|
|
int i = 0;
|
|
|
|
int j = rand() % n->edge_tree->count;
|
|
|
|
edge_t *candidate = NULL;
|
|
|
|
|
2012-11-19 12:50:17 +00:00
|
|
|
for splay_each(edge_t, e, n->edge_tree) {
|
|
|
|
if(i++ == j) {
|
|
|
|
candidate = e->reverse;
|
|
|
|
break;
|
|
|
|
}
|
2012-11-17 21:48:06 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if(candidate) {
|
|
|
|
*sa = &candidate->address;
|
|
|
|
*sock = rand() % listen_sockets;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Make sure we have a suitable socket for the chosen address */
|
|
|
|
if(listen_socket[*sock].sa.sa.sa_family != (*sa)->sa.sa_family) {
|
|
|
|
for(int i = 0; i < listen_sockets; i++) {
|
|
|
|
if(listen_socket[i].sa.sa.sa_family == (*sa)->sa.sa_family) {
|
|
|
|
*sock = i;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void choose_broadcast_address(const node_t *n, const sockaddr_t **sa, int *sock) {
|
|
|
|
static sockaddr_t broadcast_ipv4 = {
|
|
|
|
.in = {
|
|
|
|
.sin_family = AF_INET,
|
|
|
|
.sin_addr.s_addr = -1,
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
static sockaddr_t broadcast_ipv6 = {
|
|
|
|
.in6 = {
|
|
|
|
.sin6_family = AF_INET6,
|
|
|
|
.sin6_addr.s6_addr[0x0] = 0xff,
|
|
|
|
.sin6_addr.s6_addr[0x1] = 0x02,
|
|
|
|
.sin6_addr.s6_addr[0xf] = 0x01,
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
*sock = rand() % listen_sockets;
|
|
|
|
|
|
|
|
if(listen_socket[*sock].sa.sa.sa_family == AF_INET6) {
|
|
|
|
broadcast_ipv6.in6.sin6_port = n->prevedge->address.in.sin_port;
|
|
|
|
broadcast_ipv6.in6.sin6_scope_id = listen_socket[*sock].sa.in6.sin6_scope_id;
|
|
|
|
*sa = &broadcast_ipv6;
|
|
|
|
} else {
|
|
|
|
broadcast_ipv4.in.sin_port = n->prevedge->address.in.sin_port;
|
|
|
|
*sa = &broadcast_ipv4;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-05-18 10:00:00 +00:00
|
|
|
static void send_udppacket(node_t *n, vpn_packet_t *origpkt) {
|
2002-09-09 21:25:28 +00:00
|
|
|
vpn_packet_t pkt1, pkt2;
|
|
|
|
vpn_packet_t *pkt[] = { &pkt1, &pkt2, &pkt1, &pkt2 };
|
2006-04-26 16:29:47 +00:00
|
|
|
vpn_packet_t *inpkt = origpkt;
|
2002-09-09 21:25:28 +00:00
|
|
|
int nextpkt = 0;
|
|
|
|
vpn_packet_t *outpkt;
|
2011-06-02 16:22:26 +00:00
|
|
|
int origlen = origpkt->len;
|
2008-12-11 14:44:44 +00:00
|
|
|
size_t outlen;
|
2010-05-04 13:43:48 +00:00
|
|
|
#if defined(SOL_IP) && defined(IP_TOS)
|
2002-09-09 21:25:28 +00:00
|
|
|
static int priority = 0;
|
2010-05-04 13:43:48 +00:00
|
|
|
#endif
|
2012-07-21 10:51:53 +00:00
|
|
|
int origpriority = origpkt->priority;
|
2002-03-18 22:47:20 +00:00
|
|
|
|
2009-06-11 16:36:08 +00:00
|
|
|
if(!n->status.reachable) {
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_INFO, "Trying to send UDP packet to unreachable node %s (%s)", n->name, n->hostname);
|
2009-06-11 16:36:08 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2012-08-02 15:44:59 +00:00
|
|
|
if(n->status.sptps)
|
|
|
|
return send_sptps_packet(n, origpkt);
|
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
/* Make sure we have a valid key */
|
2002-02-18 16:25:19 +00:00
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
if(!n->status.validkey) {
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_INFO,
|
2009-09-24 22:54:07 +00:00
|
|
|
"No valid key known yet for %s (%s), forwarding via TCP",
|
2002-09-09 21:25:28 +00:00
|
|
|
n->name, n->hostname);
|
2002-02-18 16:25:19 +00:00
|
|
|
|
2012-11-29 11:28:23 +00:00
|
|
|
if(n->last_req_key + 10 <= now.tv_sec) {
|
2009-04-02 23:05:23 +00:00
|
|
|
send_req_key(n);
|
2012-11-29 11:28:23 +00:00
|
|
|
n->last_req_key = now.tv_sec;
|
2010-01-23 17:48:01 +00:00
|
|
|
}
|
2002-02-20 19:31:15 +00:00
|
|
|
|
2009-01-03 21:33:55 +00:00
|
|
|
send_tcppacket(n->nexthop->connection, origpkt);
|
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
return;
|
|
|
|
}
|
2002-02-18 16:25:19 +00:00
|
|
|
|
2009-09-15 21:22:13 +00:00
|
|
|
if(n->options & OPTION_PMTU_DISCOVERY && inpkt->len > n->minmtu && (inpkt->data[12] | inpkt->data[13])) {
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_INFO,
|
2009-10-24 19:53:01 +00:00
|
|
|
"Packet for %s (%s) larger than minimum MTU, forwarding via %s",
|
|
|
|
n->name, n->hostname, n != n->nexthop ? n->nexthop->name : "TCP");
|
2009-01-03 21:33:55 +00:00
|
|
|
|
2009-10-24 19:53:01 +00:00
|
|
|
if(n != n->nexthop)
|
|
|
|
send_packet(n->nexthop, origpkt);
|
|
|
|
else
|
|
|
|
send_tcppacket(n->nexthop->connection, origpkt);
|
2009-04-02 23:05:23 +00:00
|
|
|
|
|
|
|
return;
|
2009-01-03 21:33:55 +00:00
|
|
|
}
|
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
/* Compress the packet */
|
2002-02-18 16:25:19 +00:00
|
|
|
|
2009-04-02 23:05:23 +00:00
|
|
|
if(n->outcompression) {
|
2002-09-09 21:25:28 +00:00
|
|
|
outpkt = pkt[nextpkt++];
|
2002-02-18 16:25:19 +00:00
|
|
|
|
2009-04-02 23:05:23 +00:00
|
|
|
if((outpkt->len = compress_packet(outpkt->data, inpkt->data, inpkt->len, n->outcompression)) < 0) {
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_ERR, "Error while compressing packet to %s (%s)",
|
2002-09-09 21:25:28 +00:00
|
|
|
n->name, n->hostname);
|
|
|
|
return;
|
|
|
|
}
|
2002-02-18 16:25:19 +00:00
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
inpkt = outpkt;
|
|
|
|
}
|
2002-02-18 16:25:19 +00:00
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
/* Add sequence number */
|
2002-02-18 16:25:19 +00:00
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
inpkt->seqno = htonl(++(n->sent_seqno));
|
2008-12-11 15:56:18 +00:00
|
|
|
inpkt->len += sizeof inpkt->seqno;
|
2002-02-18 16:25:19 +00:00
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
/* Encrypt the packet */
|
2002-02-18 16:25:19 +00:00
|
|
|
|
2013-05-01 15:17:22 +00:00
|
|
|
if(cipher_active(n->outcipher)) {
|
2002-09-09 21:25:28 +00:00
|
|
|
outpkt = pkt[nextpkt++];
|
2008-12-11 14:44:44 +00:00
|
|
|
outlen = MAXSIZE;
|
2002-02-18 16:25:19 +00:00
|
|
|
|
2013-05-01 15:17:22 +00:00
|
|
|
if(!cipher_encrypt(n->outcipher, &inpkt->seqno, inpkt->len, &outpkt->seqno, &outlen, true)) {
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_ERR, "Error while encrypting packet to %s (%s)", n->name, n->hostname);
|
2003-12-24 10:48:15 +00:00
|
|
|
goto end;
|
2003-10-10 16:24:24 +00:00
|
|
|
}
|
2002-02-18 16:25:19 +00:00
|
|
|
|
2008-12-11 14:44:44 +00:00
|
|
|
outpkt->len = outlen;
|
2002-09-09 21:25:28 +00:00
|
|
|
inpkt = outpkt;
|
|
|
|
}
|
2002-03-18 22:47:20 +00:00
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
/* Add the message authentication code */
|
2002-03-18 22:47:20 +00:00
|
|
|
|
2013-05-01 15:17:22 +00:00
|
|
|
if(digest_active(n->outdigest)) {
|
2013-05-10 18:30:47 +00:00
|
|
|
if(!digest_create(n->outdigest, &inpkt->seqno, inpkt->len, (char *)&inpkt->seqno + inpkt->len)) {
|
|
|
|
logger(DEBUG_TRAFFIC, LOG_ERR, "Error while encrypting packet to %s (%s)", n->name, n->hostname);
|
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
|
2013-05-01 15:17:22 +00:00
|
|
|
inpkt->len += digest_length(n->outdigest);
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Send the packet */
|
2002-02-18 16:25:19 +00:00
|
|
|
|
2012-11-17 21:48:06 +00:00
|
|
|
const sockaddr_t *sa;
|
2012-02-22 22:17:43 +00:00
|
|
|
int sock;
|
|
|
|
|
|
|
|
/* Overloaded use of priority field: -1 means local broadcast */
|
|
|
|
|
2012-11-17 21:48:06 +00:00
|
|
|
if(origpriority == -1 && n->prevedge)
|
|
|
|
choose_broadcast_address(n, &sa, &sock);
|
|
|
|
else
|
|
|
|
choose_udp_address(n, &sa, &sock);
|
2012-10-10 12:46:22 +00:00
|
|
|
|
2002-03-01 15:14:29 +00:00
|
|
|
#if defined(SOL_IP) && defined(IP_TOS)
|
2002-09-09 21:25:28 +00:00
|
|
|
if(priorityinheritance && origpriority != priority
|
2012-02-18 10:48:21 +00:00
|
|
|
&& listen_socket[n->sock].sa.sa.sa_family == AF_INET) {
|
2002-09-09 21:25:28 +00:00
|
|
|
priority = origpriority;
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_DEBUG, "Setting outgoing packet priority to %d", priority);
|
2012-11-29 11:28:23 +00:00
|
|
|
if(setsockopt(listen_socket[n->sock].udp.fd, SOL_IP, IP_TOS, &priority, sizeof(priority))) /* SO_PRIORITY doesn't seem to work */
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_ALWAYS, LOG_ERR, "System call `%s' failed: %s", "setsockopt", strerror(errno));
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
2002-03-01 15:14:29 +00:00
|
|
|
#endif
|
2002-03-01 12:26:56 +00:00
|
|
|
|
2012-11-29 11:28:23 +00:00
|
|
|
if(sendto(listen_socket[sock].udp.fd, (char *) &inpkt->seqno, inpkt->len, 0, &sa->sa, SALEN(sa->sa)) < 0 && !sockwouldblock(sockerrno)) {
|
2009-10-24 23:40:07 +00:00
|
|
|
if(sockmsgsize(sockerrno)) {
|
2003-12-22 11:04:17 +00:00
|
|
|
if(n->maxmtu >= origlen)
|
|
|
|
n->maxmtu = origlen - 1;
|
2003-12-20 19:47:53 +00:00
|
|
|
if(n->mtu >= origlen)
|
|
|
|
n->mtu = origlen - 1;
|
2003-12-24 10:48:15 +00:00
|
|
|
} else
|
2012-03-08 20:15:08 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_WARNING, "Error sending packet to %s (%s): %s", n->name, n->hostname, sockstrerror(sockerrno));
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
2003-12-24 10:48:15 +00:00
|
|
|
end:
|
2006-04-26 16:29:47 +00:00
|
|
|
origpkt->len = origlen;
|
2002-02-18 16:25:19 +00:00
|
|
|
}
|
|
|
|
|
2012-07-30 16:36:59 +00:00
|
|
|
bool send_sptps_data(void *handle, uint8_t type, const char *data, size_t len) {
|
|
|
|
node_t *to = handle;
|
|
|
|
|
2012-10-14 12:33:54 +00:00
|
|
|
/* Send it via TCP if it is a handshake packet, TCPOnly is in use, or this packet is larger than the MTU. */
|
|
|
|
|
|
|
|
if(type >= SPTPS_HANDSHAKE || ((myself->options | to->options) & OPTION_TCPONLY) || (type != PKT_PROBE && len > to->minmtu)) {
|
2012-07-30 16:36:59 +00:00
|
|
|
char buf[len * 4 / 3 + 5];
|
|
|
|
b64encode(data, buf, len);
|
2012-10-14 12:33:54 +00:00
|
|
|
/* If no valid key is known yet, send the packets using ANS_KEY requests,
|
|
|
|
to ensure we get to learn the reflexive UDP address. */
|
2012-07-30 16:36:59 +00:00
|
|
|
if(!to->status.validkey)
|
2012-08-02 15:44:59 +00:00
|
|
|
return send_request(to->nexthop->connection, "%d %s %s %s -1 -1 -1 %d", ANS_KEY, myself->name, to->name, buf, myself->incompression);
|
2012-07-30 16:36:59 +00:00
|
|
|
else
|
2012-10-14 12:33:54 +00:00
|
|
|
return send_request(to->nexthop->connection, "%d %s %s %d %s", REQ_KEY, myself->name, to->name, REQ_SPTPS, buf);
|
2012-07-30 16:36:59 +00:00
|
|
|
}
|
|
|
|
|
2012-10-14 12:33:54 +00:00
|
|
|
/* Otherwise, send the packet via UDP */
|
2012-07-30 16:36:59 +00:00
|
|
|
|
2012-11-17 21:48:06 +00:00
|
|
|
const sockaddr_t *sa;
|
2012-07-30 16:36:59 +00:00
|
|
|
int sock;
|
|
|
|
|
2012-11-17 21:48:06 +00:00
|
|
|
choose_udp_address(to, &sa, &sock);
|
2012-07-30 16:36:59 +00:00
|
|
|
|
2012-11-29 11:28:23 +00:00
|
|
|
if(sendto(listen_socket[sock].udp.fd, data, len, 0, &sa->sa, SALEN(sa->sa)) < 0 && !sockwouldblock(sockerrno)) {
|
2012-07-30 16:36:59 +00:00
|
|
|
if(sockmsgsize(sockerrno)) {
|
|
|
|
if(to->maxmtu >= len)
|
|
|
|
to->maxmtu = len - 1;
|
|
|
|
if(to->mtu >= len)
|
|
|
|
to->mtu = len - 1;
|
|
|
|
} else {
|
|
|
|
logger(DEBUG_TRAFFIC, LOG_WARNING, "Error sending UDP SPTPS packet to %s (%s): %s", to->name, to->hostname, sockstrerror(sockerrno));
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool receive_sptps_record(void *handle, uint8_t type, const char *data, uint16_t len) {
|
|
|
|
node_t *from = handle;
|
|
|
|
|
|
|
|
if(type == SPTPS_HANDSHAKE) {
|
2012-10-14 12:45:27 +00:00
|
|
|
if(!from->status.validkey) {
|
|
|
|
from->status.validkey = true;
|
|
|
|
from->status.waitingforkey = false;
|
|
|
|
logger(DEBUG_META, LOG_INFO, "SPTPS key exchange with %s (%s) succesful", from->name, from->hostname);
|
|
|
|
}
|
2012-07-30 16:36:59 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(len > MTU) {
|
|
|
|
logger(DEBUG_ALWAYS, LOG_ERR, "Packet from %s (%s) larger than maximum supported size (%d > %d)", from->name, from->hostname, len, MTU);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
vpn_packet_t inpkt;
|
|
|
|
|
|
|
|
if(type == PKT_PROBE) {
|
2012-08-02 15:44:59 +00:00
|
|
|
inpkt.len = len;
|
|
|
|
memcpy(inpkt.data, data, len);
|
2012-07-30 16:36:59 +00:00
|
|
|
mtu_probe_h(from, &inpkt, len);
|
|
|
|
return true;
|
|
|
|
}
|
2012-08-02 15:44:59 +00:00
|
|
|
|
|
|
|
if(type & ~(PKT_COMPRESSED | PKT_MAC)) {
|
2012-07-30 16:36:59 +00:00
|
|
|
logger(DEBUG_ALWAYS, LOG_ERR, "Unexpected SPTPS record type %d len %d from %s (%s)", type, len, from->name, from->hostname);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2012-08-30 12:21:23 +00:00
|
|
|
/* Check if we have the headers we need */
|
|
|
|
if(routing_mode != RMODE_ROUTER && !(type & PKT_MAC)) {
|
|
|
|
logger(DEBUG_TRAFFIC, LOG_ERR, "Received packet from %s (%s) without MAC header (maybe Mode is not set correctly)", from->name, from->hostname);
|
|
|
|
return false;
|
|
|
|
} else if(routing_mode == RMODE_ROUTER && (type & PKT_MAC)) {
|
|
|
|
logger(DEBUG_TRAFFIC, LOG_WARNING, "Received packet from %s (%s) with MAC header (maybe Mode is not set correctly)", from->name, from->hostname);
|
|
|
|
}
|
|
|
|
|
2012-08-02 15:44:59 +00:00
|
|
|
int offset = (type & PKT_MAC) ? 0 : 14;
|
|
|
|
if(type & PKT_COMPRESSED) {
|
2012-12-05 13:42:21 +00:00
|
|
|
length_t ulen = uncompress_packet(inpkt.data + offset, (const uint8_t *)data, len, from->incompression);
|
|
|
|
if(ulen < 0) {
|
2012-08-02 15:44:59 +00:00
|
|
|
return false;
|
|
|
|
} else {
|
2012-12-05 13:42:21 +00:00
|
|
|
inpkt.len = ulen + offset;
|
2012-08-02 15:44:59 +00:00
|
|
|
}
|
|
|
|
if(inpkt.len > MAXSIZE)
|
|
|
|
abort();
|
|
|
|
} else {
|
|
|
|
memcpy(inpkt.data + offset, data, len);
|
|
|
|
inpkt.len = len + offset;
|
|
|
|
}
|
|
|
|
|
2012-08-30 12:21:23 +00:00
|
|
|
/* Generate the Ethernet packet type if necessary */
|
|
|
|
if(offset) {
|
|
|
|
switch(inpkt.data[14] >> 4) {
|
|
|
|
case 4:
|
|
|
|
inpkt.data[12] = 0x08;
|
|
|
|
inpkt.data[13] = 0x00;
|
|
|
|
break;
|
|
|
|
case 6:
|
|
|
|
inpkt.data[12] = 0x86;
|
|
|
|
inpkt.data[13] = 0xDD;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
logger(DEBUG_TRAFFIC, LOG_ERR,
|
|
|
|
"Unknown IP version %d while reading packet from %s (%s)",
|
|
|
|
inpkt.data[14] >> 4, from->name, from->hostname);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-07-30 16:36:59 +00:00
|
|
|
receive_packet(from, &inpkt);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2002-02-18 16:25:19 +00:00
|
|
|
/*
|
|
|
|
send a packet to the given vpn ip.
|
|
|
|
*/
|
2011-05-14 22:42:29 +00:00
|
|
|
void send_packet(node_t *n, vpn_packet_t *packet) {
|
2002-09-09 21:25:28 +00:00
|
|
|
node_t *via;
|
|
|
|
|
|
|
|
if(n == myself) {
|
2003-12-27 16:32:52 +00:00
|
|
|
if(overwrite_mac)
|
|
|
|
memcpy(packet->data, mymac.x, ETH_ALEN);
|
2011-05-14 22:42:29 +00:00
|
|
|
n->out_packets++;
|
|
|
|
n->out_bytes += packet->len;
|
2011-12-04 00:20:59 +00:00
|
|
|
devops.write(packet);
|
2002-09-09 21:25:28 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_ERR, "Sending packet of %d bytes to %s (%s)",
|
2003-12-12 19:52:25 +00:00
|
|
|
packet->len, n->name, n->hostname);
|
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
if(!n->status.reachable) {
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_INFO, "Node %s (%s) is not reachable",
|
2002-09-09 21:25:28 +00:00
|
|
|
n->name, n->hostname);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2011-05-14 22:42:29 +00:00
|
|
|
n->out_packets++;
|
|
|
|
n->out_bytes += packet->len;
|
|
|
|
|
2012-08-02 15:44:59 +00:00
|
|
|
if(n->status.sptps) {
|
|
|
|
send_sptps_packet(n, packet);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2009-01-03 21:33:55 +00:00
|
|
|
via = (packet->priority == -1 || n->via == myself) ? n->nexthop : n->via;
|
2002-09-09 21:25:28 +00:00
|
|
|
|
2003-07-06 22:11:37 +00:00
|
|
|
if(via != n)
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_INFO, "Sending packet to %s via %s (%s)",
|
2002-09-09 21:25:28 +00:00
|
|
|
n->name, via->name, n->via->hostname);
|
|
|
|
|
2009-01-03 21:33:55 +00:00
|
|
|
if(packet->priority == -1 || ((myself->options | via->options) & OPTION_TCPONLY)) {
|
2003-07-22 20:55:21 +00:00
|
|
|
if(!send_tcppacket(via->connection, packet))
|
|
|
|
terminate_connection(via->connection, true);
|
2002-09-09 21:25:28 +00:00
|
|
|
} else
|
|
|
|
send_udppacket(via, packet);
|
2002-02-18 16:25:19 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Broadcast a packet using the minimum spanning tree */
|
|
|
|
|
2007-05-18 10:00:00 +00:00
|
|
|
void broadcast_packet(const node_t *from, vpn_packet_t *packet) {
|
2012-04-15 23:57:25 +00:00
|
|
|
// Always give ourself a copy of the packet.
|
|
|
|
if(from != myself)
|
|
|
|
send_packet(myself, packet);
|
|
|
|
|
|
|
|
// In TunnelServer mode, do not forward broadcast packets.
|
2012-10-10 15:17:49 +00:00
|
|
|
// The MST might not be valid and create loops.
|
2012-04-15 23:57:25 +00:00
|
|
|
if(tunnelserver || broadcast_mode == BMODE_NONE)
|
|
|
|
return;
|
2002-09-09 21:25:28 +00:00
|
|
|
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_TRAFFIC, LOG_INFO, "Broadcasting packet of %d bytes from %s (%s)",
|
2002-09-09 21:25:28 +00:00
|
|
|
packet->len, from->name, from->hostname);
|
|
|
|
|
2012-04-15 23:57:25 +00:00
|
|
|
switch(broadcast_mode) {
|
|
|
|
// In MST mode, broadcast packets travel via the Minimum Spanning Tree.
|
|
|
|
// This guarantees all nodes receive the broadcast packet, and
|
|
|
|
// usually distributes the sending of broadcast packets over all nodes.
|
|
|
|
case BMODE_MST:
|
2012-10-07 22:35:38 +00:00
|
|
|
for list_each(connection_t, c, connection_list)
|
2012-04-15 23:57:25 +00:00
|
|
|
if(c->status.active && c->status.mst && c != from->nexthop->connection)
|
|
|
|
send_packet(c->node, packet);
|
|
|
|
break;
|
|
|
|
|
|
|
|
// In direct mode, we send copies to each node we know of.
|
2012-10-10 15:17:49 +00:00
|
|
|
// However, this only reaches nodes that can be reached in a single hop.
|
2012-04-15 23:57:25 +00:00
|
|
|
// We don't have enough information to forward broadcast packets in this case.
|
|
|
|
case BMODE_DIRECT:
|
|
|
|
if(from != myself)
|
|
|
|
break;
|
|
|
|
|
2012-10-07 22:35:38 +00:00
|
|
|
for splay_each(node_t, n, node_tree)
|
2012-04-15 23:57:25 +00:00
|
|
|
if(n->status.reachable && ((n->via == myself && n->nexthop == n) || n->via == n))
|
2012-06-25 17:03:54 +00:00
|
|
|
send_packet(n, packet);
|
2012-04-15 23:57:25 +00:00
|
|
|
break;
|
2002-09-09 21:25:28 +00:00
|
|
|
|
2012-04-15 23:57:25 +00:00
|
|
|
default:
|
|
|
|
break;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
2002-02-18 16:25:19 +00:00
|
|
|
}
|
|
|
|
|
2009-04-02 23:05:23 +00:00
|
|
|
static node_t *try_harder(const sockaddr_t *from, const vpn_packet_t *pkt) {
|
|
|
|
node_t *n = NULL;
|
2011-02-18 22:02:11 +00:00
|
|
|
bool hard = false;
|
2009-10-24 18:54:44 +00:00
|
|
|
static time_t last_hard_try = 0;
|
2009-04-02 23:05:23 +00:00
|
|
|
|
2012-10-07 22:35:38 +00:00
|
|
|
for splay_each(edge_t, e, edge_weight_tree) {
|
2012-09-26 20:20:43 +00:00
|
|
|
if(!e->to->status.reachable || e->to == myself)
|
2009-04-02 23:05:23 +00:00
|
|
|
continue;
|
|
|
|
|
2009-10-24 18:54:44 +00:00
|
|
|
if(sockaddrcmp_noport(from, &e->address)) {
|
2012-11-29 11:28:23 +00:00
|
|
|
if(last_hard_try == now.tv_sec)
|
2009-10-24 18:54:44 +00:00
|
|
|
continue;
|
2011-02-18 22:02:11 +00:00
|
|
|
hard = true;
|
2009-12-18 00:15:25 +00:00
|
|
|
}
|
2009-04-02 23:05:23 +00:00
|
|
|
|
|
|
|
if(!try_mac(e->to, pkt))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
n = e->to;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2011-02-18 22:02:11 +00:00
|
|
|
if(hard)
|
2012-11-29 11:28:23 +00:00
|
|
|
last_hard_try = now.tv_sec;
|
2011-02-18 22:02:11 +00:00
|
|
|
|
2012-11-29 11:28:23 +00:00
|
|
|
last_hard_try = now.tv_sec;
|
2009-04-02 23:05:23 +00:00
|
|
|
return n;
|
|
|
|
}
|
|
|
|
|
2012-11-29 11:28:23 +00:00
|
|
|
void handle_incoming_vpn_data(void *data, int flags) {
|
|
|
|
listen_socket_t *ls = data;
|
2002-09-09 21:25:28 +00:00
|
|
|
vpn_packet_t pkt;
|
|
|
|
char *hostname;
|
2012-09-05 11:05:48 +00:00
|
|
|
sockaddr_t from = {{0}};
|
2008-12-11 15:56:18 +00:00
|
|
|
socklen_t fromlen = sizeof from;
|
2002-09-09 21:25:28 +00:00
|
|
|
node_t *n;
|
2009-12-19 19:52:19 +00:00
|
|
|
int len;
|
2002-09-09 21:25:28 +00:00
|
|
|
|
2012-11-29 11:28:23 +00:00
|
|
|
len = recvfrom(ls->udp.fd, (char *) &pkt.seqno, MAXSIZE, 0, &from.sa, &fromlen);
|
2002-09-09 21:25:28 +00:00
|
|
|
|
2009-12-19 19:52:19 +00:00
|
|
|
if(len <= 0 || len > MAXSIZE) {
|
2009-10-24 23:40:07 +00:00
|
|
|
if(!sockwouldblock(sockerrno))
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_ALWAYS, LOG_ERR, "Receiving packet failed: %s", sockstrerror(sockerrno));
|
2002-09-09 21:25:28 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2009-12-19 19:52:19 +00:00
|
|
|
pkt.len = len;
|
|
|
|
|
2012-10-10 15:17:49 +00:00
|
|
|
sockaddrunmap(&from); /* Some braindead IPv6 implementations do stupid things. */
|
2002-09-09 21:25:28 +00:00
|
|
|
|
|
|
|
n = lookup_node_udp(&from);
|
|
|
|
|
|
|
|
if(!n) {
|
2009-04-02 23:05:23 +00:00
|
|
|
n = try_harder(&from, &pkt);
|
|
|
|
if(n)
|
|
|
|
update_node_udp(n, &from);
|
2012-02-26 17:37:36 +00:00
|
|
|
else if(debug_level >= DEBUG_PROTOCOL) {
|
2009-04-02 23:05:23 +00:00
|
|
|
hostname = sockaddr2hostname(&from);
|
2012-02-26 17:37:36 +00:00
|
|
|
logger(DEBUG_PROTOCOL, LOG_WARNING, "Received UDP packet from unknown source %s", hostname);
|
2009-04-02 23:05:23 +00:00
|
|
|
free(hostname);
|
|
|
|
return;
|
|
|
|
}
|
2009-05-21 21:10:16 +00:00
|
|
|
else
|
|
|
|
return;
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
2012-11-29 11:28:23 +00:00
|
|
|
n->sock = ls - listen_socket;
|
2012-02-18 10:48:21 +00:00
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
receive_udppacket(n, &pkt);
|
2002-02-18 16:25:19 +00:00
|
|
|
}
|
2007-02-27 01:57:01 +00:00
|
|
|
|
2012-11-29 11:28:23 +00:00
|
|
|
void handle_device_data(void *data, int flags) {
|
2007-02-27 01:57:01 +00:00
|
|
|
vpn_packet_t packet;
|
|
|
|
|
2011-05-29 20:14:35 +00:00
|
|
|
packet.priority = 0;
|
|
|
|
|
2012-02-22 13:23:59 +00:00
|
|
|
if(devops.read(&packet)) {
|
2011-05-14 22:42:29 +00:00
|
|
|
myself->in_packets++;
|
|
|
|
myself->in_bytes += packet.len;
|
2007-02-27 01:57:01 +00:00
|
|
|
route(myself, &packet);
|
2011-05-14 22:42:29 +00:00
|
|
|
}
|
2007-02-27 01:57:01 +00:00
|
|
|
}
|