xiphon
4 years ago
parent
6b2b1d6368
commit
42a7a4dd32
@ -0,0 +1,117 @@
|
||||
// Copyright (c) 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 "bootstrap_node_selector.h"
|
||||
|
||||
#include "crypto/crypto.h"
|
||||
|
||||
namespace cryptonote
|
||||
{
|
||||
namespace bootstrap_node
|
||||
{
|
||||
|
||||
void selector_auto::node::handle_result(bool success)
|
||||
{
|
||||
if (!success)
|
||||
{
|
||||
fails = std::min(std::numeric_limits<size_t>::max() - 2, fails) + 2;
|
||||
}
|
||||
else
|
||||
{
|
||||
fails = std::max(std::numeric_limits<size_t>::min() + 2, fails) - 2;
|
||||
}
|
||||
}
|
||||
|
||||
void selector_auto::handle_result(const std::string &address, bool success)
|
||||
{
|
||||
auto &nodes_by_address = m_nodes.get<by_address>();
|
||||
const auto it = nodes_by_address.find(address);
|
||||
if (it != nodes_by_address.end())
|
||||
{
|
||||
nodes_by_address.modify(it, [success](node &entry) {
|
||||
entry.handle_result(success);
|
||||
});
|
||||
}
|
||||
}
|
||||
|
||||
boost::optional<node_info> selector_auto::next_node()
|
||||
{
|
||||
if (!has_at_least_one_good_node())
|
||||
{
|
||||
append_new_nodes();
|
||||
}
|
||||
|
||||
if (m_nodes.empty())
|
||||
{
|
||||
return {};
|
||||
}
|
||||
|
||||
auto node = m_nodes.get<by_fails>().begin();
|
||||
const size_t count = std::distance(node, m_nodes.get<by_fails>().upper_bound(node->fails));
|
||||
std::advance(node, crypto::rand_idx(count));
|
||||
|
||||
return {{node->address, {}}};
|
||||
}
|
||||
|
||||
bool selector_auto::has_at_least_one_good_node() const
|
||||
{
|
||||
return !m_nodes.empty() && m_nodes.get<by_fails>().begin()->fails == 0;
|
||||
}
|
||||
|
||||
void selector_auto::append_new_nodes()
|
||||
{
|
||||
bool updated = false;
|
||||
|
||||
for (const auto &node : m_get_nodes())
|
||||
{
|
||||
const auto &address = node.first;
|
||||
const auto &white = node.second;
|
||||
const size_t initial_score = white ? 0 : 1;
|
||||
updated |= m_nodes.get<by_address>().insert({address, initial_score}).second;
|
||||
}
|
||||
|
||||
if (updated)
|
||||
{
|
||||
truncate();
|
||||
}
|
||||
}
|
||||
|
||||
void selector_auto::truncate()
|
||||
{
|
||||
const size_t total = m_nodes.size();
|
||||
if (total > m_max_nodes)
|
||||
{
|
||||
auto &nodes_by_fails = m_nodes.get<by_fails>();
|
||||
auto from = nodes_by_fails.rbegin();
|
||||
std::advance(from, total - m_max_nodes);
|
||||
nodes_by_fails.erase(from.base(), nodes_by_fails.end());
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
}
|
||||
@ -0,0 +1,103 @@
|
||||
// Copyright (c) 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.
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <functional>
|
||||
#include <limits>
|
||||
#include <map>
|
||||
#include <string>
|
||||
#include <utility>
|
||||
|
||||
#include <boost/multi_index_container.hpp>
|
||||
#include <boost/multi_index/member.hpp>
|
||||
#include <boost/multi_index/ordered_index.hpp>
|
||||
#include <boost/optional/optional.hpp>
|
||||
|
||||
#include "net/http_client.h"
|
||||
|
||||
namespace cryptonote
|
||||
{
|
||||
namespace bootstrap_node
|
||||
{
|
||||
|
||||
struct node_info
|
||||
{
|
||||
std::string address;
|
||||
boost::optional<epee::net_utils::http::login> credentials;
|
||||
};
|
||||
|
||||
struct selector
|
||||
{
|
||||
virtual void handle_result(const std::string &address, bool success) = 0;
|
||||
virtual boost::optional<node_info> next_node() = 0;
|
||||
};
|
||||
|
||||
class selector_auto : public selector
|
||||
{
|
||||
public:
|
||||
selector_auto(std::function<std::map<std::string, bool>()> get_nodes, size_t max_nodes = 1000)
|
||||
: m_get_nodes(std::move(get_nodes))
|
||||
, m_max_nodes(max_nodes)
|
||||
{}
|
||||
|
||||
void handle_result(const std::string &address, bool success) final;
|
||||
boost::optional<node_info> next_node() final;
|
||||
|
||||
private:
|
||||
bool has_at_least_one_good_node() const;
|
||||
void append_new_nodes();
|
||||
void truncate();
|
||||
|
||||
private:
|
||||
struct node
|
||||
{
|
||||
std::string address;
|
||||
size_t fails;
|
||||
|
||||
void handle_result(bool success);
|
||||
};
|
||||
|
||||
struct by_address {};
|
||||
struct by_fails {};
|
||||
|
||||
typedef boost::multi_index_container<
|
||||
node,
|
||||
boost::multi_index::indexed_by<
|
||||
boost::multi_index::ordered_unique<boost::multi_index::tag<by_address>, boost::multi_index::member<node, std::string, &node::address>>,
|
||||
boost::multi_index::ordered_non_unique<boost::multi_index::tag<by_fails>, boost::multi_index::member<node, size_t, &node::fails>>
|
||||
>
|
||||
> nodes_list;
|
||||
|
||||
const std::function<std::map<std::string, bool>()> m_get_nodes;
|
||||
const size_t m_max_nodes;
|
||||
nodes_list m_nodes;
|
||||
};
|
||||
|
||||
}
|
||||
}
|
||||
@ -0,0 +1,172 @@
|
||||
// Copyright (c) 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 <gtest/gtest.h>
|
||||
|
||||
#include "rpc/bootstrap_node_selector.h"
|
||||
|
||||
class bootstrap_node_selector : public ::testing::Test
|
||||
{
|
||||
protected:
|
||||
void SetUp() override
|
||||
{
|
||||
nodes.insert(white_nodes.begin(), white_nodes.end());
|
||||
nodes.insert(gray_nodes.begin(), gray_nodes.end());
|
||||
}
|
||||
|
||||
const std::map<std::string, bool> white_nodes = {
|
||||
{
|
||||
"white_node_1:18089", true
|
||||
},
|
||||
{
|
||||
"white_node_2:18081", true
|
||||
}
|
||||
};
|
||||
const std::map<std::string, bool> gray_nodes = {
|
||||
{
|
||||
"gray_node_1:18081", false
|
||||
},
|
||||
{
|
||||
"gray_node_2:18089", false
|
||||
}
|
||||
};
|
||||
|
||||
std::map<std::string, bool> nodes;
|
||||
};
|
||||
|
||||
TEST_F(bootstrap_node_selector, selector_auto_empty)
|
||||
{
|
||||
cryptonote::bootstrap_node::selector_auto selector([]() {
|
||||
return std::map<std::string, bool>();
|
||||
});
|
||||
|
||||
EXPECT_FALSE(selector.next_node());
|
||||
}
|
||||
|
||||
TEST_F(bootstrap_node_selector, selector_auto_no_credentials)
|
||||
{
|
||||
cryptonote::bootstrap_node::selector_auto selector([this]() {
|
||||
return nodes;
|
||||
});
|
||||
|
||||
for (size_t fails = 0; fails < nodes.size(); ++fails)
|
||||
{
|
||||
const auto current = selector.next_node();
|
||||
EXPECT_FALSE(current->credentials);
|
||||
|
||||
selector.handle_result(current->address, false);
|
||||
}
|
||||
}
|
||||
|
||||
TEST_F(bootstrap_node_selector, selector_auto_success)
|
||||
{
|
||||
cryptonote::bootstrap_node::selector_auto selector([this]() {
|
||||
return nodes;
|
||||
});
|
||||
|
||||
auto current = selector.next_node();
|
||||
for (size_t fails = 0; fails < nodes.size(); ++fails)
|
||||
{
|
||||
selector.handle_result(current->address, true);
|
||||
|
||||
current = selector.next_node();
|
||||
EXPECT_TRUE(white_nodes.count(current->address) > 0);
|
||||
}
|
||||
}
|
||||
|
||||
TEST_F(bootstrap_node_selector, selector_auto_failure)
|
||||
{
|
||||
cryptonote::bootstrap_node::selector_auto selector([this]() {
|
||||
return nodes;
|
||||
});
|
||||
|
||||
auto current = selector.next_node();
|
||||
for (size_t fails = 0; fails < nodes.size(); ++fails)
|
||||
{
|
||||
const auto previous = current;
|
||||
|
||||
selector.handle_result(current->address, false);
|
||||
|
||||
current = selector.next_node();
|
||||
EXPECT_NE(current->address, previous->address);
|
||||
}
|
||||
}
|
||||
|
||||
TEST_F(bootstrap_node_selector, selector_auto_white_nodes_first)
|
||||
{
|
||||
cryptonote::bootstrap_node::selector_auto selector([this]() {
|
||||
return nodes;
|
||||
});
|
||||
|
||||
for (size_t iterations = 0; iterations < 2; ++iterations)
|
||||
{
|
||||
for (size_t fails = 0; fails < white_nodes.size(); ++fails)
|
||||
{
|
||||
const auto current = selector.next_node();
|
||||
EXPECT_TRUE(white_nodes.count(current->address) > 0);
|
||||
|
||||
selector.handle_result(current->address, false);
|
||||
}
|
||||
|
||||
for (size_t fails = 0; fails < gray_nodes.size(); ++fails)
|
||||
{
|
||||
const auto current = selector.next_node();
|
||||
EXPECT_TRUE(gray_nodes.count(current->address) > 0);
|
||||
|
||||
selector.handle_result(current->address, false);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
TEST_F(bootstrap_node_selector, selector_auto_max_nodes)
|
||||
{
|
||||
const size_t max_nodes = nodes.size() / 2;
|
||||
|
||||
bool populated_once = false;
|
||||
cryptonote::bootstrap_node::selector_auto selector([this, &populated_once]() {
|
||||
if (!populated_once)
|
||||
{
|
||||
populated_once = true;
|
||||
return nodes;
|
||||
}
|
||||
|
||||
return std::map<std::string, bool>();
|
||||
}, max_nodes);
|
||||
|
||||
std::set<std::string> unique_nodes;
|
||||
|
||||
for (size_t fails = 0; fails < nodes.size(); ++fails)
|
||||
{
|
||||
const auto current = selector.next_node();
|
||||
unique_nodes.insert(current->address);
|
||||
|
||||
selector.handle_result(current->address, false);
|
||||
}
|
||||
|
||||
EXPECT_EQ(unique_nodes.size(), max_nodes);
|
||||
}
|
||||
Loading…
Reference in new issue