mirror of
https://github.com/monero-project/monero.git
synced 2024-12-15 00:54:24 -05:00
5ef0607da6
Update copyright year to 2020
202 lines
7.1 KiB
C++
202 lines
7.1 KiB
C++
// Copyright (c) 2019-2020, The Monero Project
|
|
//
|
|
// All rights reserved.
|
|
//
|
|
// Redistribution and use in source and binary forms, with or without modification, are
|
|
// permitted provided that the following conditions are met:
|
|
//
|
|
// 1. Redistributions of source code must retain the above copyright notice, this list of
|
|
// conditions and the following disclaimer.
|
|
//
|
|
// 2. Redistributions in binary form must reproduce the above copyright notice, this list
|
|
// of conditions and the following disclaimer in the documentation and/or other
|
|
// materials provided with the distribution.
|
|
//
|
|
// 3. Neither the name of the copyright holder nor the names of its contributors may be
|
|
// used to endorse or promote products derived from this software without specific
|
|
// prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
|
|
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
|
|
// THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
// STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
|
|
// THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
#include "i2p_address.h"
|
|
|
|
#include <algorithm>
|
|
#include <boost/spirit/include/karma_generate.hpp>
|
|
#include <boost/spirit/include/karma_uint.hpp>
|
|
#include <cassert>
|
|
#include <cstring>
|
|
#include <limits>
|
|
|
|
#include "net/error.h"
|
|
#include "serialization/keyvalue_serialization.h"
|
|
#include "storages/portable_storage.h"
|
|
#include "string_tools.h"
|
|
|
|
namespace net
|
|
{
|
|
namespace
|
|
{
|
|
// !TODO only b32 addresses right now
|
|
constexpr const char tld[] = u8".b32.i2p";
|
|
constexpr const char unknown_host[] = "<unknown i2p host>";
|
|
|
|
constexpr const unsigned b32_length = 52;
|
|
|
|
constexpr const char base32_alphabet[] =
|
|
u8"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz234567";
|
|
|
|
expect<void> host_check(boost::string_ref host) noexcept
|
|
{
|
|
if (!host.ends_with(tld))
|
|
return {net::error::expected_tld};
|
|
|
|
host.remove_suffix(sizeof(tld) - 1);
|
|
|
|
if (host.size() != b32_length)
|
|
return {net::error::invalid_i2p_address};
|
|
if (host.find_first_not_of(base32_alphabet) != boost::string_ref::npos)
|
|
return {net::error::invalid_i2p_address};
|
|
|
|
return success();
|
|
}
|
|
|
|
struct i2p_serialized
|
|
{
|
|
std::string host;
|
|
std::uint16_t port;
|
|
|
|
BEGIN_KV_SERIALIZE_MAP()
|
|
KV_SERIALIZE(host)
|
|
KV_SERIALIZE(port)
|
|
END_KV_SERIALIZE_MAP()
|
|
};
|
|
}
|
|
|
|
i2p_address::i2p_address(const boost::string_ref host, const std::uint16_t port) noexcept
|
|
: port_(port)
|
|
{
|
|
// this is a private constructor, throw if moved to public
|
|
assert(host.size() < sizeof(host_));
|
|
|
|
const std::size_t length = std::min(sizeof(host_) - 1, host.size());
|
|
std::memcpy(host_, host.data(), length);
|
|
std::memset(host_ + length, 0, sizeof(host_) - length);
|
|
}
|
|
|
|
const char* i2p_address::unknown_str() noexcept
|
|
{
|
|
return unknown_host;
|
|
}
|
|
|
|
i2p_address::i2p_address() noexcept
|
|
: port_(0)
|
|
{
|
|
static_assert(sizeof(unknown_host) <= sizeof(host_), "bad buffer size");
|
|
std::memcpy(host_, unknown_host, sizeof(unknown_host));
|
|
std::memset(host_ + sizeof(unknown_host), 0, sizeof(host_) - sizeof(unknown_host));
|
|
}
|
|
|
|
expect<i2p_address> i2p_address::make(const boost::string_ref address, const std::uint16_t default_port)
|
|
{
|
|
boost::string_ref host = address.substr(0, address.rfind(':'));
|
|
const boost::string_ref port =
|
|
address.substr(host.size() + (host.size() == address.size() ? 0 : 1));
|
|
|
|
MONERO_CHECK(host_check(host));
|
|
|
|
std::uint16_t porti = default_port;
|
|
if (!port.empty() && !epee::string_tools::get_xtype_from_string(porti, std::string{port}))
|
|
return {net::error::invalid_port};
|
|
|
|
static_assert(b32_length + sizeof(tld) == sizeof(i2p_address::host_), "bad internal host size");
|
|
return i2p_address{host, porti};
|
|
}
|
|
|
|
bool i2p_address::_load(epee::serialization::portable_storage& src, epee::serialization::section* hparent)
|
|
{
|
|
i2p_serialized in{};
|
|
if (in._load(src, hparent) && in.host.size() < sizeof(host_) && (in.host == unknown_host || !host_check(in.host).has_error()))
|
|
{
|
|
std::memcpy(host_, in.host.data(), in.host.size());
|
|
std::memset(host_ + in.host.size(), 0, sizeof(host_) - in.host.size());
|
|
port_ = in.port;
|
|
return true;
|
|
}
|
|
static_assert(sizeof(unknown_host) <= sizeof(host_), "bad buffer size");
|
|
std::memcpy(host_, unknown_host, sizeof(unknown_host)); // include null terminator
|
|
port_ = 0;
|
|
return false;
|
|
}
|
|
|
|
bool i2p_address::store(epee::serialization::portable_storage& dest, epee::serialization::section* hparent) const
|
|
{
|
|
const i2p_serialized out{std::string{host_}, port_};
|
|
return out.store(dest, hparent);
|
|
}
|
|
|
|
i2p_address::i2p_address(const i2p_address& rhs) noexcept
|
|
: port_(rhs.port_)
|
|
{
|
|
std::memcpy(host_, rhs.host_, sizeof(host_));
|
|
}
|
|
|
|
i2p_address& i2p_address::operator=(const i2p_address& rhs) noexcept
|
|
{
|
|
if (this != std::addressof(rhs))
|
|
{
|
|
port_ = rhs.port_;
|
|
std::memcpy(host_, rhs.host_, sizeof(host_));
|
|
}
|
|
return *this;
|
|
}
|
|
|
|
bool i2p_address::is_unknown() const noexcept
|
|
{
|
|
static_assert(1 <= sizeof(host_), "host size too small");
|
|
return host_[0] == '<'; // character is not allowed otherwise
|
|
}
|
|
|
|
bool i2p_address::equal(const i2p_address& rhs) const noexcept
|
|
{
|
|
return port_ == rhs.port_ && is_same_host(rhs);
|
|
}
|
|
|
|
bool i2p_address::less(const i2p_address& rhs) const noexcept
|
|
{
|
|
int res = std::strcmp(host_str(), rhs.host_str());
|
|
return res < 0 || (res == 0 && port() < rhs.port());
|
|
}
|
|
|
|
bool i2p_address::is_same_host(const i2p_address& rhs) const noexcept
|
|
{
|
|
return std::strcmp(host_str(), rhs.host_str()) == 0;
|
|
}
|
|
|
|
std::string i2p_address::str() const
|
|
{
|
|
const std::size_t host_length = std::strlen(host_str());
|
|
const std::size_t port_length =
|
|
port_ == 0 ? 0 : std::numeric_limits<std::uint16_t>::digits10 + 2;
|
|
|
|
std::string out{};
|
|
out.reserve(host_length + port_length);
|
|
out.assign(host_str(), host_length);
|
|
|
|
if (port_ != 0)
|
|
{
|
|
out.push_back(':');
|
|
namespace karma = boost::spirit::karma;
|
|
karma::generate(std::back_inserter(out), karma::ushort_, port());
|
|
}
|
|
return out;
|
|
}
|
|
}
|