2019-03-05 16:05:34 -05:00
|
|
|
// Copyright (c) 2017-2019, The Monero Project
|
2017-07-02 17:41:15 -04:00
|
|
|
//
|
|
|
|
// 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>
|
2018-04-15 19:16:02 -04:00
|
|
|
#include <vector>
|
2017-07-02 17:41:15 -04:00
|
|
|
#include <set>
|
2018-07-19 10:36:07 -04:00
|
|
|
#include <unordered_set>
|
2017-07-02 17:41:15 -04:00
|
|
|
#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;
|
2018-04-15 19:16:02 -04:00
|
|
|
std::vector<crypto::hash> hashes;
|
|
|
|
std::vector<cryptonote::block_complete_entry> blocks;
|
2017-07-02 17:41:15 -04:00
|
|
|
boost::uuids::uuid connection_id;
|
|
|
|
uint64_t nblocks;
|
|
|
|
float rate;
|
|
|
|
size_t size;
|
|
|
|
boost::posix_time::ptime time;
|
|
|
|
|
2018-04-15 19:16:02 -04:00
|
|
|
span(uint64_t start_block_height, std::vector<cryptonote::block_complete_entry> blocks, const boost::uuids::uuid &connection_id, float rate, size_t size):
|
2017-07-02 17:41:15 -04:00
|
|
|
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:
|
2018-04-15 19:16:02 -04:00
|
|
|
void add_blocks(uint64_t height, std::vector<cryptonote::block_complete_entry> bcel, const boost::uuids::uuid &connection_id, float rate, size_t size);
|
2017-07-02 17:41:15 -04:00
|
|
|
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);
|
2017-07-11 16:48:54 -04:00
|
|
|
void flush_stale_spans(const std::set<boost::uuids::uuid> &live_connections);
|
2018-04-15 19:16:02 -04:00
|
|
|
bool remove_span(uint64_t start_block_height, std::vector<crypto::hash> *hashes = NULL);
|
2017-07-02 17:41:15 -04:00
|
|
|
void remove_spans(const boost::uuids::uuid &connection_id, uint64_t start_block_height);
|
|
|
|
uint64_t get_max_block_height() const;
|
|
|
|
void print() const;
|
Pruning
The blockchain prunes seven eighths of prunable tx data.
This saves about two thirds of the blockchain size, while
keeping the node useful as a sync source for an eighth
of the blockchain.
No other data is currently pruned.
There are three ways to prune a blockchain:
- run monerod with --prune-blockchain
- run "prune_blockchain" in the monerod console
- run the monero-blockchain-prune utility
The first two will prune in place. Due to how LMDB works, this
will not reduce the blockchain size on disk. Instead, it will
mark parts of the file as free, so that future data will use
that free space, causing the file to not grow until free space
grows scarce.
The third way will create a second database, a pruned copy of
the original one. Since this is a new file, this one will be
smaller than the original one.
Once the database is pruned, it will stay pruned as it syncs.
That is, there is no need to use --prune-blockchain again, etc.
2018-04-29 18:30:51 -04:00
|
|
|
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, uint32_t pruning_seed, uint64_t blockchain_height, const std::vector<crypto::hash> &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;
|
2018-04-15 19:16:02 -04:00
|
|
|
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;
|
Pruning
The blockchain prunes seven eighths of prunable tx data.
This saves about two thirds of the blockchain size, while
keeping the node useful as a sync source for an eighth
of the blockchain.
No other data is currently pruned.
There are three ways to prune a blockchain:
- run monerod with --prune-blockchain
- run "prune_blockchain" in the monerod console
- run the monero-blockchain-prune utility
The first two will prune in place. Due to how LMDB works, this
will not reduce the blockchain size on disk. Instead, it will
mark parts of the file as free, so that future data will use
that free space, causing the file to not grow until free space
grows scarce.
The third way will create a second database, a pruned copy of
the original one. Since this is a new file, this one will be
smaller than the original one.
Once the database is pruned, it will stay pruned as it syncs.
That is, there is no need to use --prune-blockchain again, etc.
2018-04-29 18:30:51 -04:00
|
|
|
void reset_next_span_time(boost::posix_time::ptime t = boost::posix_time::microsec_clock::universal_time());
|
2018-04-15 19:16:02 -04:00
|
|
|
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;
|
Pruning
The blockchain prunes seven eighths of prunable tx data.
This saves about two thirds of the blockchain size, while
keeping the node useful as a sync source for an eighth
of the blockchain.
No other data is currently pruned.
There are three ways to prune a blockchain:
- run monerod with --prune-blockchain
- run "prune_blockchain" in the monerod console
- run the monero-blockchain-prune utility
The first two will prune in place. Due to how LMDB works, this
will not reduce the blockchain size on disk. Instead, it will
mark parts of the file as free, so that future data will use
that free space, causing the file to not grow until free space
grows scarce.
The third way will create a second database, a pruned copy of
the original one. Since this is a new file, this one will be
smaller than the original one.
Once the database is pruned, it will stay pruned as it syncs.
That is, there is no need to use --prune-blockchain again, etc.
2018-04-29 18:30:51 -04:00
|
|
|
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;
|
2017-07-02 17:41:15 -04:00
|
|
|
size_t get_data_size() const;
|
|
|
|
size_t get_num_filled_spans_prefix() const;
|
|
|
|
size_t get_num_filled_spans() const;
|
2017-08-12 05:59:27 -04:00
|
|
|
crypto::hash get_last_known_hash(const boost::uuids::uuid &connection_id) const;
|
2017-08-16 14:27:16 -04:00
|
|
|
bool has_spans(const boost::uuids::uuid &connection_id) const;
|
2017-07-02 17:41:15 -04:00
|
|
|
float get_speed(const boost::uuids::uuid &connection_id) const;
|
Pruning
The blockchain prunes seven eighths of prunable tx data.
This saves about two thirds of the blockchain size, while
keeping the node useful as a sync source for an eighth
of the blockchain.
No other data is currently pruned.
There are three ways to prune a blockchain:
- run monerod with --prune-blockchain
- run "prune_blockchain" in the monerod console
- run the monero-blockchain-prune utility
The first two will prune in place. Due to how LMDB works, this
will not reduce the blockchain size on disk. Instead, it will
mark parts of the file as free, so that future data will use
that free space, causing the file to not grow until free space
grows scarce.
The third way will create a second database, a pruned copy of
the original one. Since this is a new file, this one will be
smaller than the original one.
Once the database is pruned, it will stay pruned as it syncs.
That is, there is no need to use --prune-blockchain again, etc.
2018-04-29 18:30:51 -04:00
|
|
|
float get_download_rate(const boost::uuids::uuid &connection_id) const;
|
|
|
|
bool foreach(std::function<bool(const span&)> f) const;
|
2017-08-12 05:59:27 -04:00
|
|
|
bool requested(const crypto::hash &hash) const;
|
Pruning
The blockchain prunes seven eighths of prunable tx data.
This saves about two thirds of the blockchain size, while
keeping the node useful as a sync source for an eighth
of the blockchain.
No other data is currently pruned.
There are three ways to prune a blockchain:
- run monerod with --prune-blockchain
- run "prune_blockchain" in the monerod console
- run the monero-blockchain-prune utility
The first two will prune in place. Due to how LMDB works, this
will not reduce the blockchain size on disk. Instead, it will
mark parts of the file as free, so that future data will use
that free space, causing the file to not grow until free space
grows scarce.
The third way will create a second database, a pruned copy of
the original one. Since this is a new file, this one will be
smaller than the original one.
Once the database is pruned, it will stay pruned as it syncs.
That is, there is no need to use --prune-blockchain again, etc.
2018-04-29 18:30:51 -04:00
|
|
|
bool have(const crypto::hash &hash) const;
|
2017-07-02 17:41:15 -04:00
|
|
|
|
2018-07-19 10:36:07 -04:00
|
|
|
private:
|
|
|
|
void erase_block(block_map::iterator j);
|
|
|
|
inline bool requested_internal(const crypto::hash &hash) const;
|
|
|
|
|
2017-07-02 17:41:15 -04:00
|
|
|
private:
|
|
|
|
block_map blocks;
|
|
|
|
mutable boost::recursive_mutex mutex;
|
2018-07-19 10:36:07 -04:00
|
|
|
std::unordered_set<crypto::hash> requested_hashes;
|
Pruning
The blockchain prunes seven eighths of prunable tx data.
This saves about two thirds of the blockchain size, while
keeping the node useful as a sync source for an eighth
of the blockchain.
No other data is currently pruned.
There are three ways to prune a blockchain:
- run monerod with --prune-blockchain
- run "prune_blockchain" in the monerod console
- run the monero-blockchain-prune utility
The first two will prune in place. Due to how LMDB works, this
will not reduce the blockchain size on disk. Instead, it will
mark parts of the file as free, so that future data will use
that free space, causing the file to not grow until free space
grows scarce.
The third way will create a second database, a pruned copy of
the original one. Since this is a new file, this one will be
smaller than the original one.
Once the database is pruned, it will stay pruned as it syncs.
That is, there is no need to use --prune-blockchain again, etc.
2018-04-29 18:30:51 -04:00
|
|
|
std::unordered_set<crypto::hash> have_blocks;
|
2017-07-02 17:41:15 -04:00
|
|
|
};
|
|
|
|
}
|