mirror of
https://github.com/monero-project/monero.git
synced 2024-12-16 03:54:24 -05:00
8330e772f1
If the peer (whether pruned or not itself) supports sending pruned blocks to syncing nodes, the pruned version will be sent along with the hash of the pruned data and the block weight. The original tx hashes can be reconstructed from the pruned txes and theur prunable data hash. Those hashes and the block weights are hashes and checked against the set of precompiled hashes, ensuring the data we received is the original data. It is currently not possible to use this system when not using the set of precompiled hashes, since block weights can not otherwise be checked for validity. This is off by default for now, and is enabled by --sync-pruned-blocks
111 lines
6.0 KiB
C++
111 lines
6.0 KiB
C++
// Copyright (c) 2017-2019, 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.
|
|
//
|
|
// Parts of this file are originally copyright (c) 2012-2013 The Cryptonote developers
|
|
|
|
#pragma once
|
|
|
|
#include <string>
|
|
#include <vector>
|
|
#include <set>
|
|
#include <unordered_set>
|
|
#include <boost/thread/recursive_mutex.hpp>
|
|
#include <boost/uuid/uuid.hpp>
|
|
|
|
#undef MONERO_DEFAULT_LOG_CATEGORY
|
|
#define MONERO_DEFAULT_LOG_CATEGORY "cn.block_queue"
|
|
|
|
namespace cryptonote
|
|
{
|
|
struct block_complete_entry;
|
|
|
|
class block_queue
|
|
{
|
|
public:
|
|
struct span
|
|
{
|
|
uint64_t start_block_height;
|
|
std::vector<crypto::hash> hashes;
|
|
std::vector<cryptonote::block_complete_entry> blocks;
|
|
boost::uuids::uuid connection_id;
|
|
uint64_t nblocks;
|
|
float rate;
|
|
size_t size;
|
|
boost::posix_time::ptime time;
|
|
|
|
span(uint64_t start_block_height, std::vector<cryptonote::block_complete_entry> blocks, const boost::uuids::uuid &connection_id, float rate, size_t size):
|
|
start_block_height(start_block_height), blocks(std::move(blocks)), connection_id(connection_id), nblocks(this->blocks.size()), rate(rate), size(size), time() {}
|
|
span(uint64_t start_block_height, uint64_t nblocks, const boost::uuids::uuid &connection_id, boost::posix_time::ptime time):
|
|
start_block_height(start_block_height), connection_id(connection_id), nblocks(nblocks), rate(0.0f), size(0), time(time) {}
|
|
|
|
bool operator<(const span &s) const { return start_block_height < s.start_block_height; }
|
|
};
|
|
typedef std::set<span> block_map;
|
|
|
|
public:
|
|
void add_blocks(uint64_t height, std::vector<cryptonote::block_complete_entry> bcel, const boost::uuids::uuid &connection_id, float rate, size_t size);
|
|
void add_blocks(uint64_t height, uint64_t nblocks, const boost::uuids::uuid &connection_id, boost::posix_time::ptime time = boost::date_time::min_date_time);
|
|
void flush_spans(const boost::uuids::uuid &connection_id, bool all = false);
|
|
void flush_stale_spans(const std::set<boost::uuids::uuid> &live_connections);
|
|
bool remove_span(uint64_t start_block_height, std::vector<crypto::hash> *hashes = NULL);
|
|
void remove_spans(const boost::uuids::uuid &connection_id, uint64_t start_block_height);
|
|
uint64_t get_max_block_height() const;
|
|
void print() const;
|
|
std::string get_overview(uint64_t blockchain_height) const;
|
|
bool has_unpruned_height(uint64_t block_height, uint64_t blockchain_height, uint32_t pruning_seed) const;
|
|
std::pair<uint64_t, uint64_t> reserve_span(uint64_t first_block_height, uint64_t last_block_height, uint64_t max_blocks, const boost::uuids::uuid &connection_id, bool sync_pruned_blocks, uint32_t local_pruning_seed, uint32_t pruning_seed, uint64_t blockchain_height, const std::vector<std::pair<crypto::hash, uint64_t>> &block_hashes, boost::posix_time::ptime time = boost::posix_time::microsec_clock::universal_time());
|
|
uint64_t get_next_needed_height(uint64_t blockchain_height) const;
|
|
std::pair<uint64_t, uint64_t> get_next_span_if_scheduled(std::vector<crypto::hash> &hashes, boost::uuids::uuid &connection_id, boost::posix_time::ptime &time) const;
|
|
void reset_next_span_time(boost::posix_time::ptime t = boost::posix_time::microsec_clock::universal_time());
|
|
void set_span_hashes(uint64_t start_height, const boost::uuids::uuid &connection_id, std::vector<crypto::hash> hashes);
|
|
bool get_next_span(uint64_t &height, std::vector<cryptonote::block_complete_entry> &bcel, boost::uuids::uuid &connection_id, bool filled = true) const;
|
|
bool has_next_span(const boost::uuids::uuid &connection_id, bool &filled, boost::posix_time::ptime &time) const;
|
|
bool has_next_span(uint64_t height, bool &filled, boost::posix_time::ptime &time, boost::uuids::uuid &connection_id) const;
|
|
size_t get_data_size() const;
|
|
size_t get_num_filled_spans_prefix() const;
|
|
size_t get_num_filled_spans() const;
|
|
crypto::hash get_last_known_hash(const boost::uuids::uuid &connection_id) const;
|
|
bool has_spans(const boost::uuids::uuid &connection_id) const;
|
|
float get_speed(const boost::uuids::uuid &connection_id) const;
|
|
float get_download_rate(const boost::uuids::uuid &connection_id) const;
|
|
bool foreach(std::function<bool(const span&)> f) const;
|
|
bool requested(const crypto::hash &hash) const;
|
|
bool have(const crypto::hash &hash) const;
|
|
|
|
private:
|
|
void erase_block(block_map::iterator j);
|
|
inline bool requested_internal(const crypto::hash &hash) const;
|
|
|
|
private:
|
|
block_map blocks;
|
|
mutable boost::recursive_mutex mutex;
|
|
std::unordered_set<crypto::hash> requested_hashes;
|
|
std::unordered_set<crypto::hash> have_blocks;
|
|
};
|
|
}
|