2019-08-26 11:44:49 +00:00
|
|
|
/*
|
|
|
|
subnet_parse.c -- handle subnet parsing
|
|
|
|
Copyright (C) 2000-2012 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 "logger.h"
|
|
|
|
#include "net.h"
|
|
|
|
#include "netutl.h"
|
|
|
|
#include "subnet.h"
|
|
|
|
#include "utils.h"
|
|
|
|
#include "xalloc.h"
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
/* Changing this default will affect ADD_SUBNET messages - beware of inconsistencies between versions */
|
|
|
|
static const int DEFAULT_WEIGHT = 10;
|
|
|
|
|
2019-08-26 11:44:49 +00:00
|
|
|
/* Subnet mask handling */
|
|
|
|
|
|
|
|
int maskcmp(const void *va, const void *vb, int masklen) {
|
|
|
|
int i, m, result;
|
|
|
|
const char *a = va;
|
|
|
|
const char *b = vb;
|
|
|
|
|
|
|
|
for(m = masklen, i = 0; m >= 8; m -= 8, i++) {
|
|
|
|
result = a[i] - b[i];
|
|
|
|
if(result)
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(m)
|
|
|
|
return (a[i] & (0x100 - (1 << (8 - m)))) -
|
|
|
|
(b[i] & (0x100 - (1 << (8 - m))));
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void mask(void *va, int masklen, int len) {
|
|
|
|
int i;
|
|
|
|
char *a = va;
|
|
|
|
|
|
|
|
i = masklen / 8;
|
|
|
|
masklen %= 8;
|
|
|
|
|
|
|
|
if(masklen)
|
|
|
|
a[i++] &= (0x100 - (1 << (8 - masklen)));
|
|
|
|
|
|
|
|
for(; i < len; i++)
|
|
|
|
a[i] = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void maskcpy(void *va, const void *vb, int masklen, int len) {
|
|
|
|
int i, m;
|
|
|
|
char *a = va;
|
|
|
|
const char *b = vb;
|
|
|
|
|
|
|
|
for(m = masklen, i = 0; m >= 8; m -= 8, i++)
|
|
|
|
a[i] = b[i];
|
|
|
|
|
|
|
|
if(m) {
|
|
|
|
a[i] = b[i] & (0x100 - (1 << (8 - m)));
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
|
|
|
|
for(; i < len; i++)
|
|
|
|
a[i] = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool maskcheck(const void *va, int masklen, int len) {
|
|
|
|
int i;
|
|
|
|
const char *a = va;
|
|
|
|
|
|
|
|
i = masklen / 8;
|
|
|
|
masklen %= 8;
|
|
|
|
|
|
|
|
if(masklen && a[i++] & (0xff >> masklen))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
for(; i < len; i++)
|
|
|
|
if(a[i] != 0)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Subnet comparison */
|
|
|
|
|
|
|
|
static int subnet_compare_mac(const subnet_t *a, const subnet_t *b) {
|
|
|
|
int result;
|
|
|
|
|
|
|
|
result = memcmp(&a->net.mac.address, &b->net.mac.address, sizeof a->net.mac.address);
|
|
|
|
|
|
|
|
if(result)
|
|
|
|
return result;
|
|
|
|
|
|
|
|
result = a->weight - b->weight;
|
|
|
|
|
|
|
|
if(result || !a->owner || !b->owner)
|
|
|
|
return result;
|
|
|
|
|
|
|
|
return strcmp(a->owner->name, b->owner->name);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int subnet_compare_ipv4(const subnet_t *a, const subnet_t *b) {
|
|
|
|
int result;
|
|
|
|
|
|
|
|
result = b->net.ipv4.prefixlength - a->net.ipv4.prefixlength;
|
|
|
|
|
|
|
|
if(result)
|
|
|
|
return result;
|
|
|
|
|
|
|
|
result = memcmp(&a->net.ipv4.address, &b->net.ipv4.address, sizeof(ipv4_t));
|
|
|
|
|
|
|
|
if(result)
|
|
|
|
return result;
|
|
|
|
|
|
|
|
result = a->weight - b->weight;
|
|
|
|
|
|
|
|
if(result || !a->owner || !b->owner)
|
|
|
|
return result;
|
|
|
|
|
|
|
|
return strcmp(a->owner->name, b->owner->name);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int subnet_compare_ipv6(const subnet_t *a, const subnet_t *b) {
|
|
|
|
int result;
|
|
|
|
|
|
|
|
result = b->net.ipv6.prefixlength - a->net.ipv6.prefixlength;
|
|
|
|
|
|
|
|
if(result)
|
|
|
|
return result;
|
|
|
|
|
|
|
|
result = memcmp(&a->net.ipv6.address, &b->net.ipv6.address, sizeof(ipv6_t));
|
|
|
|
|
|
|
|
if(result)
|
|
|
|
return result;
|
|
|
|
|
|
|
|
result = a->weight - b->weight;
|
|
|
|
|
|
|
|
if(result || !a->owner || !b->owner)
|
|
|
|
return result;
|
|
|
|
|
|
|
|
return strcmp(a->owner->name, b->owner->name);
|
|
|
|
}
|
|
|
|
|
|
|
|
int subnet_compare(const subnet_t *a, const subnet_t *b) {
|
|
|
|
int result;
|
|
|
|
|
|
|
|
result = a->type - b->type;
|
|
|
|
|
|
|
|
if(result)
|
|
|
|
return result;
|
|
|
|
|
|
|
|
switch (a->type) {
|
|
|
|
case SUBNET_MAC:
|
|
|
|
return subnet_compare_mac(a, b);
|
|
|
|
case SUBNET_IPV4:
|
|
|
|
return subnet_compare_ipv4(a, b);
|
|
|
|
case SUBNET_IPV6:
|
|
|
|
return subnet_compare_ipv6(a, b);
|
|
|
|
default:
|
|
|
|
logger(DEBUG_ALWAYS, LOG_ERR, "subnet_compare() was called with unknown subnet type %d, exitting!", a->type);
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Ascii representation of subnets */
|
|
|
|
|
|
|
|
bool str2net(subnet_t *subnet, const char *subnetstr) {
|
2019-08-26 11:44:51 +00:00
|
|
|
char str[1024];
|
|
|
|
strncpy(str, subnetstr, sizeof(str));
|
|
|
|
str[sizeof str - 1] = 0;
|
|
|
|
int consumed;
|
|
|
|
|
|
|
|
int weight = DEFAULT_WEIGHT;
|
|
|
|
char *weight_separator = strchr(str, '#');
|
|
|
|
if (weight_separator) {
|
|
|
|
char *weight_str = weight_separator + 1;
|
|
|
|
if (sscanf(weight_str, "%d%n", &weight, &consumed) < 1)
|
2019-08-26 11:44:49 +00:00
|
|
|
return false;
|
2019-08-26 11:44:51 +00:00
|
|
|
if (weight_str[consumed])
|
|
|
|
return false;
|
|
|
|
*weight_separator = 0;
|
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
int prefixlength = -1;
|
|
|
|
char *prefixlength_separator = strchr(str, '/');
|
|
|
|
if (prefixlength_separator) {
|
|
|
|
char* prefixlength_str = prefixlength_separator + 1;
|
|
|
|
if (sscanf(prefixlength_str, "%d%n", &prefixlength, &consumed) < 1)
|
|
|
|
return false;
|
|
|
|
if (prefixlength_str[consumed])
|
|
|
|
return false;
|
|
|
|
*prefixlength_separator = 0;
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
if (prefixlength < 0)
|
|
|
|
return false;
|
2019-08-26 11:44:49 +00:00
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
uint16_t x[8];
|
|
|
|
if (sscanf(str, "%hx:%hx:%hx:%hx:%hx:%hx%n", &x[0], &x[1], &x[2], &x[3], &x[4], &x[5], &consumed) >= 6 && !str[consumed]) {
|
|
|
|
/*
|
|
|
|
Normally we should check that each part has two digits to prevent ambiguities.
|
|
|
|
However, in old tinc versions net2str() will agressively return MAC addresses with one-digit parts,
|
|
|
|
so we have to accept them otherwise we would be unable to parse ADD_SUBNET messages.
|
|
|
|
*/
|
|
|
|
if (prefixlength >= 0)
|
2019-08-26 11:44:49 +00:00
|
|
|
return false;
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
subnet->type = SUBNET_MAC;
|
2019-08-26 11:44:49 +00:00
|
|
|
subnet->weight = weight;
|
2019-08-26 11:44:51 +00:00
|
|
|
for(int i = 0; i < 6; i++)
|
|
|
|
subnet->net.mac.address.x[i] = x[i];
|
2019-08-26 11:44:49 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
if (sscanf(str, "%hu.%hu.%hu.%hu%n", &x[0], &x[1], &x[2], &x[3], &consumed) >= 4 && !str[consumed]) {
|
|
|
|
if (prefixlength == -1)
|
|
|
|
prefixlength = 32;
|
|
|
|
if (prefixlength > 32)
|
|
|
|
return false;
|
|
|
|
|
2019-08-26 11:44:49 +00:00
|
|
|
subnet->type = SUBNET_IPV4;
|
2019-08-26 11:44:51 +00:00
|
|
|
subnet->net.ipv4.prefixlength = prefixlength;
|
2019-08-26 11:44:49 +00:00
|
|
|
subnet->weight = weight;
|
2019-08-26 11:44:51 +00:00
|
|
|
for(int i = 0; i < 4; i++) {
|
|
|
|
if (x[i] > 255)
|
2019-08-26 11:44:49 +00:00
|
|
|
return false;
|
|
|
|
subnet->net.ipv4.address.x[i] = x[i];
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
/* IPv6 */
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
char* last_colon = strrchr(str, ':');
|
|
|
|
if (last_colon && sscanf(last_colon, ":%hu.%hu.%hu.%hu%n", &x[0], &x[1], &x[2], &x[3], &consumed) >= 4 && !last_colon[consumed]) {
|
|
|
|
/* Dotted quad suffix notation, convert to standard IPv6 notation */
|
|
|
|
for (int i = 0; i < 4; i++)
|
|
|
|
if (x[i] > 255)
|
|
|
|
return false;
|
|
|
|
snprintf(last_colon, sizeof str - (last_colon - str), ":%02x%02x:%02x%02x", x[0], x[1], x[2], x[3]);
|
2019-08-26 11:44:49 +00:00
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
char* double_colon = strstr(str, "::");
|
|
|
|
if (double_colon) {
|
|
|
|
/* Figure out how many zero groups we need to expand */
|
|
|
|
int zero_group_count = 8;
|
|
|
|
for (const char* cur = str; *cur; cur++)
|
|
|
|
if (*cur != ':') {
|
|
|
|
zero_group_count--;
|
|
|
|
while(cur[1] && cur[1] != ':')
|
|
|
|
cur++;
|
|
|
|
}
|
|
|
|
if (zero_group_count < 1)
|
2019-08-26 11:44:49 +00:00
|
|
|
return false;
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
/* Split the double colon in the middle to make room for zero groups */
|
|
|
|
double_colon++;
|
|
|
|
memmove(double_colon + (zero_group_count * 2 - 1), double_colon, strlen(double_colon) + 1);
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
/* Write zero groups in the resulting gap, overwriting the second colon */
|
|
|
|
for (int i = 0; i < zero_group_count; i++)
|
|
|
|
memcpy(&double_colon[i * 2], "0:", 2);
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
/* Remove any leading or trailing colons */
|
|
|
|
if (str[0] == ':')
|
|
|
|
memmove(&str[0], &str[1], strlen(&str[1]) + 1);
|
|
|
|
if (str[strlen(str) - 1] == ':')
|
|
|
|
str[strlen(str) - 1] = 0;
|
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
if (sscanf(str, "%hx:%hx:%hx:%hx:%hx:%hx:%hx:%hx%n",
|
|
|
|
&x[0], &x[1], &x[2], &x[3], &x[4], &x[5], &x[6], &x[7], &consumed) >= 8 && !str[consumed]) {
|
|
|
|
if (prefixlength == -1)
|
|
|
|
prefixlength = 128;
|
|
|
|
if (prefixlength > 128)
|
2019-08-26 11:44:49 +00:00
|
|
|
return false;
|
|
|
|
|
|
|
|
subnet->type = SUBNET_IPV6;
|
2019-08-26 11:44:51 +00:00
|
|
|
subnet->net.ipv6.prefixlength = prefixlength;
|
2019-08-26 11:44:49 +00:00
|
|
|
subnet->weight = weight;
|
2019-08-26 11:44:51 +00:00
|
|
|
for(int i = 0; i < 8; i++)
|
2019-08-26 11:44:49 +00:00
|
|
|
subnet->net.ipv6.address.x[i] = htons(x[i]);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool net2str(char *netstr, int len, const subnet_t *subnet) {
|
|
|
|
if(!netstr || !subnet) {
|
|
|
|
logger(DEBUG_ALWAYS, LOG_ERR, "net2str() was called with netstr=%p, subnet=%p!", netstr, subnet);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
int result;
|
|
|
|
int prefixlength = -1;
|
2019-08-26 11:44:49 +00:00
|
|
|
switch (subnet->type) {
|
|
|
|
case SUBNET_MAC:
|
2019-08-26 11:44:51 +00:00
|
|
|
result = snprintf(netstr, len, "%02x:%02x:%02x:%02x:%02x:%02x",
|
2019-08-26 11:44:49 +00:00
|
|
|
subnet->net.mac.address.x[0],
|
|
|
|
subnet->net.mac.address.x[1],
|
|
|
|
subnet->net.mac.address.x[2],
|
|
|
|
subnet->net.mac.address.x[3],
|
|
|
|
subnet->net.mac.address.x[4],
|
2019-08-26 11:44:51 +00:00
|
|
|
subnet->net.mac.address.x[5]);
|
|
|
|
netstr += result;
|
|
|
|
len -= result;
|
2019-08-26 11:44:49 +00:00
|
|
|
break;
|
|
|
|
|
|
|
|
case SUBNET_IPV4:
|
2019-08-26 11:44:51 +00:00
|
|
|
result = snprintf(netstr, len, "%u.%u.%u.%u",
|
2019-08-26 11:44:49 +00:00
|
|
|
subnet->net.ipv4.address.x[0],
|
|
|
|
subnet->net.ipv4.address.x[1],
|
|
|
|
subnet->net.ipv4.address.x[2],
|
2019-08-26 11:44:51 +00:00
|
|
|
subnet->net.ipv4.address.x[3]);
|
|
|
|
netstr += result;
|
|
|
|
len -= result;
|
|
|
|
prefixlength = subnet->net.ipv4.prefixlength;
|
|
|
|
if (prefixlength == 32)
|
|
|
|
prefixlength = -1;
|
2019-08-26 11:44:49 +00:00
|
|
|
break;
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
case SUBNET_IPV6: {
|
|
|
|
/* Find the longest sequence of consecutive zeroes */
|
|
|
|
int max_zero_length = 0;
|
|
|
|
int max_zero_length_index = 0;
|
|
|
|
int current_zero_length = 0;
|
|
|
|
int current_zero_length_index = 0;
|
|
|
|
for (int i = 0; i < 8; i++) {
|
|
|
|
if (subnet->net.ipv6.address.x[i] != 0)
|
|
|
|
current_zero_length = 0;
|
|
|
|
else {
|
|
|
|
if (current_zero_length == 0)
|
|
|
|
current_zero_length_index = i;
|
|
|
|
current_zero_length++;
|
|
|
|
if (current_zero_length > max_zero_length) {
|
|
|
|
max_zero_length = current_zero_length;
|
|
|
|
max_zero_length_index = current_zero_length_index;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Print the address */
|
|
|
|
for (int i = 0; i < 8;) {
|
|
|
|
if (max_zero_length > 1 && max_zero_length_index == i) {
|
|
|
|
/* Shorten the representation as per RFC 5952 */
|
|
|
|
const char* const FORMATS[] = { "%.1s", "%.2s", "%.3s" };
|
|
|
|
const char* const* format = &FORMATS[0];
|
|
|
|
if (i == 0)
|
|
|
|
format++;
|
|
|
|
if (i + max_zero_length == 8)
|
|
|
|
format++;
|
|
|
|
result = snprintf(netstr, len, *format, ":::");
|
|
|
|
i += max_zero_length;
|
|
|
|
} else {
|
2019-08-26 11:44:52 +00:00
|
|
|
result = snprintf(netstr, len, "%x:", ntohs(subnet->net.ipv6.address.x[i]));
|
2019-08-26 11:44:51 +00:00
|
|
|
i++;
|
|
|
|
}
|
|
|
|
netstr += result;
|
|
|
|
len -= result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Remove the trailing colon */
|
|
|
|
netstr--;
|
|
|
|
len++;
|
|
|
|
*netstr = 0;
|
|
|
|
|
|
|
|
prefixlength = subnet->net.ipv6.prefixlength;
|
|
|
|
if (prefixlength == 128)
|
|
|
|
prefixlength = -1;
|
2019-08-26 11:44:49 +00:00
|
|
|
break;
|
2019-08-26 11:44:51 +00:00
|
|
|
}
|
2019-08-26 11:44:49 +00:00
|
|
|
|
|
|
|
default:
|
|
|
|
logger(DEBUG_ALWAYS, LOG_ERR, "net2str() was called with unknown subnet type %d, exiting!", subnet->type);
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:51 +00:00
|
|
|
if (prefixlength >= 0) {
|
|
|
|
result = snprintf(netstr, len, "/%d", prefixlength);
|
|
|
|
netstr += result;
|
|
|
|
len -= result;
|
|
|
|
}
|
|
|
|
|
2019-08-26 11:44:52 +00:00
|
|
|
if (subnet->weight != DEFAULT_WEIGHT)
|
2019-08-26 11:44:51 +00:00
|
|
|
snprintf(netstr, len, "#%d", subnet->weight);
|
|
|
|
|
2019-08-26 11:44:49 +00:00
|
|
|
return true;
|
|
|
|
}
|