2017-06-13 05:14:24 +00:00
|
|
|
#pragma once
|
|
|
|
|
2020-03-19 10:38:34 +00:00
|
|
|
#include <common/types.h>
|
2018-12-13 13:41:47 +00:00
|
|
|
#include <string.h>
|
|
|
|
#include <algorithm>
|
|
|
|
#include <utility>
|
|
|
|
#include <ext/range.h>
|
|
|
|
#include <Common/hex.h>
|
|
|
|
#include <Common/StringUtils/StringUtils.h>
|
2017-06-13 05:14:24 +00:00
|
|
|
|
2018-12-13 13:41:47 +00:00
|
|
|
constexpr size_t IPV4_BINARY_LENGTH = 4;
|
|
|
|
constexpr size_t IPV6_BINARY_LENGTH = 16;
|
|
|
|
constexpr size_t IPV4_MAX_TEXT_LENGTH = 15; /// Does not count tail zero byte.
|
|
|
|
constexpr size_t IPV6_MAX_TEXT_LENGTH = 39;
|
2017-06-13 05:14:24 +00:00
|
|
|
|
|
|
|
namespace DB
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
|
|
/** Rewritten inet_ntop6 from http://svn.apache.org/repos/asf/apr/apr/trunk/network_io/unix/inet_pton.c
|
|
|
|
* performs significantly faster than the reference implementation due to the absence of sprintf calls,
|
|
|
|
* bounds checking, unnecessary string copying and length calculation.
|
|
|
|
*/
|
2020-02-22 05:46:35 +00:00
|
|
|
void formatIPv6(const unsigned char * src, char *& dst, uint8_t zeroed_tail_bytes_count = 0);
|
2017-06-13 05:14:24 +00:00
|
|
|
|
2018-12-13 13:41:47 +00:00
|
|
|
/** Unsafe (no bounds-checking for src nor dst), optimized version of parsing IPv4 string.
|
|
|
|
*
|
|
|
|
* Parses the input string `src` and stores binary BE value into buffer pointed by `dst`,
|
|
|
|
* which should be long enough.
|
|
|
|
* That is "127.0.0.1" becomes 0x7f000001.
|
|
|
|
*
|
|
|
|
* In case of failure returns false and doesn't modify buffer pointed by `dst`.
|
|
|
|
*
|
|
|
|
* @param src - input string, expected to be non-null and null-terminated right after the IPv4 string value.
|
2020-08-08 00:47:03 +00:00
|
|
|
* @param dst - where to put output bytes, expected to be non-null and at IPV4_BINARY_LENGTH-long.
|
2018-12-13 13:41:47 +00:00
|
|
|
* @return false if parsing failed, true otherwise.
|
|
|
|
*/
|
|
|
|
inline bool parseIPv4(const char * src, unsigned char * dst)
|
|
|
|
{
|
|
|
|
UInt32 result = 0;
|
|
|
|
for (int offset = 24; offset >= 0; offset -= 8)
|
|
|
|
{
|
|
|
|
UInt32 value = 0;
|
|
|
|
size_t len = 0;
|
|
|
|
while (isNumericASCII(*src) && len <= 3)
|
|
|
|
{
|
|
|
|
value = value * 10 + (*src - '0');
|
|
|
|
++len;
|
|
|
|
++src;
|
|
|
|
}
|
|
|
|
if (len == 0 || value > 255 || (offset > 0 && *src != '.'))
|
|
|
|
return false;
|
|
|
|
result |= value << offset;
|
|
|
|
++src;
|
|
|
|
}
|
|
|
|
if (*(src - 1) != '\0')
|
|
|
|
return false;
|
|
|
|
|
|
|
|
memcpy(dst, &result, sizeof(result));
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Unsafe (no bounds-checking for src nor dst), optimized version of parsing IPv6 string.
|
|
|
|
*
|
|
|
|
* Slightly altered implementation from http://svn.apache.org/repos/asf/apr/apr/trunk/network_io/unix/inet_pton.c
|
|
|
|
* Parses the input string `src` and stores binary LE value into buffer pointed by `dst`,
|
|
|
|
* which should be long enough. In case of failure zeroes
|
|
|
|
* IPV6_BINARY_LENGTH bytes of buffer pointed by `dst`.
|
|
|
|
*
|
|
|
|
* @param src - input string, expected to be non-null and null-terminated right after the IPv6 string value.
|
2020-08-08 00:47:03 +00:00
|
|
|
* @param dst - where to put output bytes, expected to be non-null and at IPV6_BINARY_LENGTH-long.
|
2018-12-13 13:41:47 +00:00
|
|
|
* @return false if parsing failed, true otherwise.
|
|
|
|
*/
|
|
|
|
inline bool parseIPv6(const char * src, unsigned char * dst)
|
|
|
|
{
|
|
|
|
const auto clear_dst = [dst]()
|
|
|
|
{
|
|
|
|
memset(dst, '\0', IPV6_BINARY_LENGTH);
|
|
|
|
return false;
|
|
|
|
};
|
|
|
|
|
|
|
|
/// Leading :: requires some special handling.
|
|
|
|
if (*src == ':')
|
|
|
|
if (*++src != ':')
|
|
|
|
return clear_dst();
|
|
|
|
|
|
|
|
unsigned char tmp[IPV6_BINARY_LENGTH]{};
|
|
|
|
auto tp = tmp;
|
|
|
|
auto endp = tp + IPV6_BINARY_LENGTH;
|
|
|
|
auto curtok = src;
|
|
|
|
auto saw_xdigit = false;
|
|
|
|
UInt32 val{};
|
|
|
|
unsigned char * colonp = nullptr;
|
|
|
|
|
|
|
|
/// Assuming zero-terminated string.
|
|
|
|
while (const auto ch = *src++)
|
|
|
|
{
|
|
|
|
const auto num = unhex(ch);
|
|
|
|
|
|
|
|
if (num != '\xff')
|
|
|
|
{
|
|
|
|
val <<= 4;
|
|
|
|
val |= num;
|
|
|
|
if (val > 0xffffu)
|
|
|
|
return clear_dst();
|
|
|
|
|
|
|
|
saw_xdigit = 1;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ch == ':')
|
|
|
|
{
|
|
|
|
curtok = src;
|
|
|
|
if (!saw_xdigit)
|
|
|
|
{
|
|
|
|
if (colonp)
|
|
|
|
return clear_dst();
|
|
|
|
|
|
|
|
colonp = tp;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (tp + sizeof(UInt16) > endp)
|
|
|
|
return clear_dst();
|
|
|
|
|
|
|
|
*tp++ = static_cast<unsigned char>((val >> 8) & 0xffu);
|
|
|
|
*tp++ = static_cast<unsigned char>(val & 0xffu);
|
|
|
|
saw_xdigit = false;
|
|
|
|
val = 0;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ch == '.' && (tp + IPV4_BINARY_LENGTH) <= endp)
|
|
|
|
{
|
|
|
|
if (!parseIPv4(curtok, tp))
|
|
|
|
return clear_dst();
|
|
|
|
std::reverse(tp, tp + IPV4_BINARY_LENGTH);
|
|
|
|
|
|
|
|
tp += IPV4_BINARY_LENGTH;
|
|
|
|
saw_xdigit = false;
|
|
|
|
break; /* '\0' was seen by ipv4_scan(). */
|
|
|
|
}
|
|
|
|
|
|
|
|
return clear_dst();
|
|
|
|
}
|
|
|
|
|
|
|
|
if (saw_xdigit)
|
|
|
|
{
|
|
|
|
if (tp + sizeof(UInt16) > endp)
|
|
|
|
return clear_dst();
|
|
|
|
|
|
|
|
*tp++ = static_cast<unsigned char>((val >> 8) & 0xffu);
|
|
|
|
*tp++ = static_cast<unsigned char>(val & 0xffu);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (colonp)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Since some memmove()'s erroneously fail to handle
|
|
|
|
* overlapping regions, we'll do the shift by hand.
|
|
|
|
*/
|
|
|
|
const auto n = tp - colonp;
|
|
|
|
|
|
|
|
for (int i = 1; i <= n; ++i)
|
|
|
|
{
|
|
|
|
endp[- i] = colonp[n - i];
|
|
|
|
colonp[n - i] = 0;
|
|
|
|
}
|
|
|
|
tp = endp;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (tp != endp)
|
|
|
|
return clear_dst();
|
|
|
|
|
|
|
|
memcpy(dst, tmp, sizeof(tmp));
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Format 4-byte binary sequesnce as IPv4 text: 'aaa.bbb.ccc.ddd',
|
2020-08-08 01:01:47 +00:00
|
|
|
* expects in out to be in BE-format, that is 0x7f000001 => "127.0.0.1".
|
2018-12-13 13:41:47 +00:00
|
|
|
*
|
|
|
|
* Any number of the tail bytes can be masked with given mask string.
|
|
|
|
*
|
|
|
|
* Assumptions:
|
|
|
|
* src is IPV4_BINARY_LENGTH long,
|
|
|
|
* dst is IPV4_MAX_TEXT_LENGTH long,
|
|
|
|
* mask_tail_octets <= IPV4_BINARY_LENGTH
|
|
|
|
* mask_string is NON-NULL, if mask_tail_octets > 0.
|
|
|
|
*
|
|
|
|
* Examples:
|
|
|
|
* formatIPv4(&0x7f000001, dst, mask_tail_octets = 0, nullptr);
|
|
|
|
* > dst == "127.0.0.1"
|
|
|
|
* formatIPv4(&0x7f000001, dst, mask_tail_octets = 1, "xxx");
|
|
|
|
* > dst == "127.0.0.xxx"
|
|
|
|
* formatIPv4(&0x7f000001, dst, mask_tail_octets = 1, "0");
|
|
|
|
* > dst == "127.0.0.0"
|
|
|
|
*/
|
2020-02-22 05:46:35 +00:00
|
|
|
inline void formatIPv4(const unsigned char * src, char *& dst, uint8_t mask_tail_octets = 0, const char * mask_string = "xxx")
|
2018-12-13 13:41:47 +00:00
|
|
|
{
|
|
|
|
extern const char one_byte_to_string_lookup_table[256][4];
|
|
|
|
|
|
|
|
const size_t mask_length = mask_string ? strlen(mask_string) : 0;
|
|
|
|
const size_t limit = std::min(IPV4_BINARY_LENGTH, IPV4_BINARY_LENGTH - mask_tail_octets);
|
|
|
|
for (size_t octet = 0; octet < limit; ++octet)
|
|
|
|
{
|
2020-02-22 05:46:35 +00:00
|
|
|
const uint8_t value = static_cast<uint8_t>(src[IPV4_BINARY_LENGTH - octet - 1]);
|
2018-12-13 13:41:47 +00:00
|
|
|
auto rep = one_byte_to_string_lookup_table[value];
|
2020-02-22 05:46:35 +00:00
|
|
|
const uint8_t len = rep[0];
|
2018-12-13 13:41:47 +00:00
|
|
|
const char* str = rep + 1;
|
|
|
|
|
|
|
|
memcpy(dst, str, len);
|
|
|
|
dst += len;
|
|
|
|
*dst++ = '.';
|
|
|
|
}
|
|
|
|
|
|
|
|
for (size_t mask = 0; mask < mask_tail_octets; ++mask)
|
|
|
|
{
|
|
|
|
memcpy(dst, mask_string, mask_length);
|
|
|
|
dst += mask_length;
|
|
|
|
|
|
|
|
*dst++ = '.';
|
|
|
|
}
|
|
|
|
|
|
|
|
dst[-1] = '\0';
|
|
|
|
}
|
|
|
|
|
2017-06-13 05:14:24 +00:00
|
|
|
}
|