2015-09-01 08:40:33 +00:00
|
|
|
// Copyright (c) 2015, 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 <algorithm>
|
|
|
|
#include <cstdio>
|
|
|
|
|
|
|
|
#include "cryptonote_core/cryptonote_basic.h"
|
|
|
|
#include "blockchain_db/blockchain_db.h"
|
|
|
|
#include "hardfork.h"
|
|
|
|
|
|
|
|
using namespace cryptonote;
|
|
|
|
|
2015-09-20 17:41:38 +00:00
|
|
|
HardFork::HardFork(cryptonote::BlockchainDB &db, uint8_t original_version, time_t forked_time, time_t update_time, uint64_t window_size, int threshold_percent):
|
|
|
|
db(db),
|
2015-09-01 08:40:33 +00:00
|
|
|
original_version(original_version),
|
|
|
|
forked_time(forked_time),
|
|
|
|
update_time(update_time),
|
2015-09-20 17:41:38 +00:00
|
|
|
window_size(window_size),
|
|
|
|
threshold_percent(threshold_percent)
|
2015-09-01 08:40:33 +00:00
|
|
|
{
|
2015-09-26 12:25:22 +00:00
|
|
|
if (window_size == 0)
|
|
|
|
throw "window_size needs to be strictly positive";
|
|
|
|
if (threshold_percent > 100)
|
|
|
|
throw "threshold_percent needs to be between 0 and 100";
|
2015-09-01 08:40:33 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
bool HardFork::add(uint8_t version, uint64_t height, time_t time)
|
|
|
|
{
|
|
|
|
CRITICAL_REGION_LOCAL(lock);
|
|
|
|
|
|
|
|
// add in order
|
|
|
|
if (version == 0)
|
|
|
|
return false;
|
|
|
|
if (!heights.empty()) {
|
|
|
|
if (version <= heights.back().version)
|
|
|
|
return false;
|
|
|
|
if (height <= heights.back().height)
|
|
|
|
return false;
|
|
|
|
if (time <= heights.back().time)
|
|
|
|
return false;
|
|
|
|
}
|
2015-09-26 13:06:00 +00:00
|
|
|
heights.push_back(Params(version, height, time));
|
2015-09-01 08:40:33 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint8_t HardFork::get_effective_version(const cryptonote::block &block) const
|
|
|
|
{
|
|
|
|
uint8_t version = block.major_version;
|
|
|
|
if (!heights.empty()) {
|
|
|
|
uint8_t max_version = heights.back().version;
|
|
|
|
if (version > max_version)
|
|
|
|
version = max_version;
|
|
|
|
}
|
|
|
|
return version;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool HardFork::do_check(const cryptonote::block &block) const
|
|
|
|
{
|
|
|
|
return block.major_version >= heights[current_fork_index].version;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool HardFork::check(const cryptonote::block &block) const
|
|
|
|
{
|
|
|
|
CRITICAL_REGION_LOCAL(lock);
|
|
|
|
return do_check(block);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool HardFork::add(const cryptonote::block &block, uint64_t height)
|
|
|
|
{
|
|
|
|
CRITICAL_REGION_LOCAL(lock);
|
|
|
|
|
|
|
|
if (!do_check(block))
|
|
|
|
return false;
|
|
|
|
|
2015-09-26 12:25:22 +00:00
|
|
|
db.set_hard_fork_version(height, heights[current_fork_index].version);
|
|
|
|
|
2015-09-01 08:40:33 +00:00
|
|
|
const uint8_t version = get_effective_version(block);
|
|
|
|
|
2015-09-20 17:41:38 +00:00
|
|
|
while (versions.size() >= window_size) {
|
2015-09-01 08:40:33 +00:00
|
|
|
const uint8_t old_version = versions.front();
|
|
|
|
last_versions[old_version]--;
|
|
|
|
assert(last_versions[old_version] >= 0);
|
|
|
|
versions.pop_front();
|
|
|
|
}
|
|
|
|
|
|
|
|
last_versions[version]++;
|
|
|
|
versions.push_back(version);
|
|
|
|
|
2015-09-26 12:25:22 +00:00
|
|
|
uint8_t voted = get_voted_fork_index(height + 1);
|
2015-09-01 08:40:33 +00:00
|
|
|
if (voted > current_fork_index) {
|
|
|
|
for (int v = heights[current_fork_index].version + 1; v <= heights[voted].version; ++v) {
|
2015-09-26 12:25:22 +00:00
|
|
|
// we reached the vote threshold with this block, next one will be forked
|
|
|
|
db.set_hard_fork_starting_height(v, height + 1);
|
2015-09-01 08:40:33 +00:00
|
|
|
}
|
|
|
|
current_fork_index = voted;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void HardFork::init()
|
|
|
|
{
|
|
|
|
CRITICAL_REGION_LOCAL(lock);
|
|
|
|
versions.clear();
|
|
|
|
for (size_t n = 0; n < 256; ++n)
|
|
|
|
last_versions[n] = 0;
|
|
|
|
current_fork_index = 0;
|
2015-09-20 17:41:38 +00:00
|
|
|
vote_threshold = (uint32_t)ceilf(window_size * threshold_percent / 100.0f);
|
|
|
|
|
|
|
|
// restore state from DB
|
|
|
|
uint64_t height = db.height();
|
|
|
|
if (height > window_size)
|
|
|
|
height -= window_size;
|
|
|
|
else
|
|
|
|
height = 1;
|
|
|
|
|
|
|
|
bool populate = db.get_hard_fork_starting_height(original_version) == std::numeric_limits<uint64_t>::max();
|
|
|
|
if (populate) {
|
|
|
|
LOG_PRINT_L0("The DB has no hard fork info, reparsing from start");
|
|
|
|
height = 1;
|
|
|
|
}
|
|
|
|
LOG_PRINT_L1("reorganizing from " << height);
|
|
|
|
reorganize_from_chain_height(height);
|
|
|
|
if (populate) {
|
|
|
|
// reorg will not touch the genesis block, use this as a flag for populating done
|
|
|
|
db.set_hard_fork_version(0, original_version);
|
|
|
|
db.set_hard_fork_starting_height(original_version, 0);
|
|
|
|
}
|
|
|
|
LOG_PRINT_L1("reorganization done");
|
2015-09-01 08:40:33 +00:00
|
|
|
}
|
|
|
|
|
2015-09-20 17:41:38 +00:00
|
|
|
bool HardFork::reorganize_from_block_height(uint64_t height)
|
2015-09-01 08:40:33 +00:00
|
|
|
{
|
|
|
|
CRITICAL_REGION_LOCAL(lock);
|
2015-09-20 17:41:38 +00:00
|
|
|
if (height >= db.height())
|
2015-09-01 08:40:33 +00:00
|
|
|
return false;
|
2015-09-20 17:41:38 +00:00
|
|
|
|
2015-09-01 08:40:33 +00:00
|
|
|
versions.clear();
|
|
|
|
|
|
|
|
for (size_t n = 0; n < 256; ++n)
|
|
|
|
last_versions[n] = 0;
|
2015-09-26 12:25:22 +00:00
|
|
|
const uint64_t rescan_height = height >= (window_size - 1) ? height - (window_size -1) : 0;
|
2015-09-20 17:41:38 +00:00
|
|
|
const uint8_t start_version = height == 0 ? original_version : db.get_hard_fork_version(height);
|
|
|
|
while (heights[current_fork_index].version > start_version) {
|
|
|
|
db.set_hard_fork_starting_height(heights[current_fork_index].version, std::numeric_limits<uint64_t>::max());
|
|
|
|
--current_fork_index;
|
|
|
|
}
|
2015-09-01 08:40:33 +00:00
|
|
|
for (uint64_t h = rescan_height; h <= height; ++h) {
|
2015-09-20 17:41:38 +00:00
|
|
|
cryptonote::block b = db.get_block_from_height(h);
|
2015-09-01 08:40:33 +00:00
|
|
|
const uint8_t v = get_effective_version(b);
|
|
|
|
last_versions[v]++;
|
|
|
|
versions.push_back(v);
|
|
|
|
}
|
2015-09-26 12:25:22 +00:00
|
|
|
|
|
|
|
uint8_t voted = get_voted_fork_index(height + 1);
|
|
|
|
if (voted > current_fork_index) {
|
|
|
|
for (int v = heights[current_fork_index].version + 1; v <= heights[voted].version; ++v) {
|
|
|
|
// we reached the vote threshold with this block, next one will be forked
|
|
|
|
db.set_hard_fork_starting_height(v, height + 1);
|
|
|
|
}
|
|
|
|
current_fork_index = voted;
|
|
|
|
}
|
|
|
|
|
2015-09-20 17:41:38 +00:00
|
|
|
const uint64_t bc_height = db.height();
|
2015-09-01 08:40:33 +00:00
|
|
|
for (uint64_t h = height + 1; h < bc_height; ++h) {
|
2015-09-20 17:41:38 +00:00
|
|
|
add(db.get_block_from_height(h), h);
|
2015-09-01 08:40:33 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2015-09-20 17:41:38 +00:00
|
|
|
bool HardFork::reorganize_from_chain_height(uint64_t height)
|
2015-09-01 08:40:33 +00:00
|
|
|
{
|
|
|
|
if (height == 0)
|
|
|
|
return false;
|
2015-09-20 17:41:38 +00:00
|
|
|
return reorganize_from_block_height(height - 1);
|
2015-09-01 08:40:33 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int HardFork::get_voted_fork_index(uint64_t height) const
|
|
|
|
{
|
|
|
|
CRITICAL_REGION_LOCAL(lock);
|
2015-09-19 15:34:29 +00:00
|
|
|
uint32_t accumulated_votes = 0;
|
2015-09-01 08:40:33 +00:00
|
|
|
for (unsigned int n = heights.size() - 1; n > current_fork_index; --n) {
|
|
|
|
uint8_t v = heights[n].version;
|
|
|
|
accumulated_votes += last_versions[v];
|
|
|
|
if (height >= heights[n].height && accumulated_votes >= vote_threshold) {
|
|
|
|
return n;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return current_fork_index;
|
|
|
|
}
|
|
|
|
|
|
|
|
HardFork::State HardFork::get_state(time_t t) const
|
|
|
|
{
|
|
|
|
CRITICAL_REGION_LOCAL(lock);
|
|
|
|
|
|
|
|
// no hard forks setup yet
|
|
|
|
if (heights.size() <= 1)
|
|
|
|
return Ready;
|
|
|
|
|
|
|
|
time_t t_last_fork = heights.back().time;
|
|
|
|
if (t >= t_last_fork + forked_time)
|
|
|
|
return LikelyForked;
|
|
|
|
if (t >= t_last_fork + update_time)
|
|
|
|
return UpdateNeeded;
|
|
|
|
return Ready;
|
|
|
|
}
|
|
|
|
|
|
|
|
HardFork::State HardFork::get_state() const
|
|
|
|
{
|
|
|
|
return get_state(time(NULL));
|
|
|
|
}
|
|
|
|
|
|
|
|
uint8_t HardFork::get(uint64_t height) const
|
|
|
|
{
|
|
|
|
CRITICAL_REGION_LOCAL(lock);
|
2015-09-26 13:06:00 +00:00
|
|
|
if (height >= db.height()) {
|
2015-09-20 17:41:38 +00:00
|
|
|
assert(false);
|
|
|
|
return 255;
|
2015-09-01 08:40:33 +00:00
|
|
|
}
|
2015-09-20 17:41:38 +00:00
|
|
|
return db.get_hard_fork_version(height);
|
2015-09-01 08:40:33 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t HardFork::get_start_height(uint8_t version) const
|
|
|
|
{
|
|
|
|
CRITICAL_REGION_LOCAL(lock);
|
2015-09-20 17:41:38 +00:00
|
|
|
return db.get_hard_fork_starting_height(version);
|
2015-09-01 08:40:33 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
uint8_t HardFork::get_current_version() const
|
|
|
|
{
|
|
|
|
CRITICAL_REGION_LOCAL(lock);
|
|
|
|
return heights[current_fork_index].version;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint8_t HardFork::get_ideal_version() const
|
|
|
|
{
|
|
|
|
CRITICAL_REGION_LOCAL(lock);
|
|
|
|
return heights.back().version;
|
|
|
|
}
|
|
|
|
|
2015-09-19 15:34:29 +00:00
|
|
|
bool HardFork::get_voting_info(uint8_t version, uint32_t &window, uint32_t &votes, uint32_t &threshold, uint8_t &voting) const
|
|
|
|
{
|
|
|
|
CRITICAL_REGION_LOCAL(lock);
|
|
|
|
|
|
|
|
const uint8_t current_version = heights[current_fork_index].version;
|
|
|
|
const bool enabled = current_version >= version;
|
|
|
|
window = versions.size();
|
|
|
|
votes = 0;
|
|
|
|
for (size_t n = version; n < 256; ++n)
|
|
|
|
votes += last_versions[n];
|
|
|
|
threshold = vote_threshold;
|
|
|
|
assert((votes >= threshold) == enabled);
|
|
|
|
voting = heights.back().version;
|
|
|
|
return enabled;
|
|
|
|
}
|
|
|
|
|