aboutsummaryrefslogtreecommitdiff
path: root/tests/unit_tests
diff options
context:
space:
mode:
Diffstat (limited to 'tests/unit_tests')
-rw-r--r--tests/unit_tests/CMakeLists.txt1
-rw-r--r--tests/unit_tests/ban.cpp1
-rw-r--r--tests/unit_tests/hardfork.cpp127
-rw-r--r--tests/unit_tests/threadpool.cpp101
4 files changed, 230 insertions, 0 deletions
diff --git a/tests/unit_tests/CMakeLists.txt b/tests/unit_tests/CMakeLists.txt
index 8cc074bb2..6d79ba74b 100644
--- a/tests/unit_tests/CMakeLists.txt
+++ b/tests/unit_tests/CMakeLists.txt
@@ -62,6 +62,7 @@ set(unit_tests_sources
test_tx_utils.cpp
test_peerlist.cpp
test_protocol_pack.cpp
+ threadpool.cpp
hardfork.cpp
unbound.cpp
uri.cpp
diff --git a/tests/unit_tests/ban.cpp b/tests/unit_tests/ban.cpp
index e56a89971..15bc0bce3 100644
--- a/tests/unit_tests/ban.cpp
+++ b/tests/unit_tests/ban.cpp
@@ -79,6 +79,7 @@ public:
uint8_t get_ideal_hard_fork_version() const { return 0; }
uint8_t get_ideal_hard_fork_version(uint64_t height) const { return 0; }
uint8_t get_hard_fork_version(uint64_t height) const { return 0; }
+ uint64_t get_earliest_ideal_height_for_version(uint8_t version) const { return 0; }
cryptonote::difficulty_type get_block_cumulative_difficulty(uint64_t height) const { return 0; }
bool fluffy_blocks_enabled() const { return false; }
uint64_t prevalidate_block_hashes(uint64_t height, const std::list<crypto::hash> &hashes) { return 0; }
diff --git a/tests/unit_tests/hardfork.cpp b/tests/unit_tests/hardfork.cpp
index 7c27b9c5d..913ebe84a 100644
--- a/tests/unit_tests/hardfork.cpp
+++ b/tests/unit_tests/hardfork.cpp
@@ -232,6 +232,59 @@ TEST(ordering, Success)
ASSERT_FALSE(hf.add_fork(5, 5, 4));
}
+TEST(check_for_height, Success)
+{
+ TestDB db;
+ HardFork hf(db, 1, 0, 0, 0, 1, 0); // no voting
+
+ ASSERT_TRUE(hf.add_fork(1, 0, 0));
+ ASSERT_TRUE(hf.add_fork(2, 5, 1));
+ hf.init();
+
+ for (uint64_t h = 0; h <= 4; ++h) {
+ ASSERT_TRUE(hf.check_for_height(mkblock(1, 1), h));
+ ASSERT_FALSE(hf.check_for_height(mkblock(2, 2), h)); // block version is too high
+ db.add_block(mkblock(hf, h, 1), 0, 0, 0, crypto::hash());
+ ASSERT_TRUE(hf.add(db.get_block_from_height(h), h));
+ }
+
+ for (uint64_t h = 5; h <= 10; ++h) {
+ ASSERT_FALSE(hf.check_for_height(mkblock(1, 1), h)); // block version is too low
+ ASSERT_TRUE(hf.check_for_height(mkblock(2, 2), h));
+ db.add_block(mkblock(hf, h, 2), 0, 0, 0, crypto::hash());
+ ASSERT_TRUE(hf.add(db.get_block_from_height(h), h));
+ }
+}
+
+TEST(get, next_version)
+{
+ TestDB db;
+ HardFork hf(db);
+
+ ASSERT_TRUE(hf.add_fork(1, 0, 0));
+ ASSERT_TRUE(hf.add_fork(2, 5, 1));
+ ASSERT_TRUE(hf.add_fork(4, 10, 2));
+ hf.init();
+
+ for (uint64_t h = 0; h <= 4; ++h) {
+ ASSERT_EQ(2, hf.get_next_version());
+ db.add_block(mkblock(hf, h, 1), 0, 0, 0, crypto::hash());
+ ASSERT_TRUE(hf.add(db.get_block_from_height(h), h));
+ }
+
+ for (uint64_t h = 5; h <= 9; ++h) {
+ ASSERT_EQ(4, hf.get_next_version());
+ db.add_block(mkblock(hf, h, 2), 0, 0, 0, crypto::hash());
+ ASSERT_TRUE(hf.add(db.get_block_from_height(h), h));
+ }
+
+ for (uint64_t h = 10; h <= 15; ++h) {
+ ASSERT_EQ(4, hf.get_next_version());
+ db.add_block(mkblock(hf, h, 4), 0, 0, 0, crypto::hash());
+ ASSERT_TRUE(hf.add(db.get_block_from_height(h), h));
+ }
+}
+
TEST(states, Success)
{
TestDB db;
@@ -439,6 +492,55 @@ TEST(voting, different_thresholds)
}
}
+TEST(voting, info)
+{
+ TestDB db;
+ HardFork hf(db, 1, 0, 1, 1, 4, 50); // window size 4, default threshold 50%
+
+ // v h ts
+ ASSERT_TRUE(hf.add_fork(1, 0, 0));
+ // v h thr ts
+ ASSERT_TRUE(hf.add_fork(2, 5, 0, 1)); // asap
+ ASSERT_TRUE(hf.add_fork(3, 10, 100, 2)); // all votes
+ // v h ts
+ ASSERT_TRUE(hf.add_fork(4, 15, 3)); // default 50% votes
+ hf.init();
+
+ // 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9
+ static const uint8_t block_versions[] = { 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4 };
+ static const uint8_t expected_versions[] = { 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4 };
+ static const uint8_t expected_thresholds[] = { 0, 1, 1, 2, 2, 0, 0, 0, 0, 0, 0, 0, 4, 4, 4, 4, 2, 2, 2, 2 };
+
+ for (uint64_t h = 0; h < sizeof(block_versions) / sizeof(block_versions[0]); ++h) {
+ uint32_t window, votes, threshold;
+ uint64_t earliest_height;
+ uint8_t voting;
+
+ ASSERT_TRUE(hf.get_voting_info(1, window, votes, threshold, earliest_height, voting));
+ ASSERT_EQ(std::min<uint64_t>(h, 4), votes);
+ ASSERT_EQ(0, earliest_height);
+
+ ASSERT_EQ(hf.get_current_version() >= 2, hf.get_voting_info(2, window, votes, threshold, earliest_height, voting));
+ ASSERT_EQ(std::min<uint64_t>(h <= 3 ? 0 : h - 3, 4), votes);
+ ASSERT_EQ(5, earliest_height);
+
+ ASSERT_EQ(hf.get_current_version() >= 3, hf.get_voting_info(3, window, votes, threshold, earliest_height, voting));
+ ASSERT_EQ(std::min<uint64_t>(h <= 8 ? 0 : h - 8, 4), votes);
+ ASSERT_EQ(10, earliest_height);
+
+ ASSERT_EQ(hf.get_current_version() == 4, hf.get_voting_info(4, window, votes, threshold, earliest_height, voting));
+ ASSERT_EQ(std::min<uint64_t>(h <= 14 ? 0 : h - 14, 4), votes);
+ ASSERT_EQ(15, earliest_height);
+
+ ASSERT_EQ(std::min<uint64_t>(h, 4), window);
+ ASSERT_EQ(expected_thresholds[h], threshold);
+ ASSERT_EQ(4, voting);
+
+ db.add_block(mkblock(hf, h, block_versions[h]), 0, 0, 0, crypto::hash());
+ ASSERT_TRUE(hf.add(db.get_block_from_height(h), h));
+ }
+}
+
TEST(new_blocks, denied)
{
TestDB db;
@@ -554,3 +656,28 @@ TEST(get, higher)
ASSERT_EQ(hf.get_ideal_version(7), 3);
}
+TEST(get, earliest_ideal_height)
+{
+ TestDB db;
+ HardFork hf(db, 1, 0, 1, 1, 4, 50);
+
+ // v h t
+ ASSERT_TRUE(hf.add_fork(1, 0, 0));
+ ASSERT_TRUE(hf.add_fork(2, 2, 1));
+ ASSERT_TRUE(hf.add_fork(5, 5, 2));
+ ASSERT_TRUE(hf.add_fork(6, 10, 3));
+ ASSERT_TRUE(hf.add_fork(9, 15, 4));
+ hf.init();
+
+ ASSERT_EQ(hf.get_earliest_ideal_height_for_version(1), 0);
+ ASSERT_EQ(hf.get_earliest_ideal_height_for_version(2), 2);
+ ASSERT_EQ(hf.get_earliest_ideal_height_for_version(3), 5);
+ ASSERT_EQ(hf.get_earliest_ideal_height_for_version(4), 5);
+ ASSERT_EQ(hf.get_earliest_ideal_height_for_version(5), 5);
+ ASSERT_EQ(hf.get_earliest_ideal_height_for_version(6), 10);
+ ASSERT_EQ(hf.get_earliest_ideal_height_for_version(7), 15);
+ ASSERT_EQ(hf.get_earliest_ideal_height_for_version(8), 15);
+ ASSERT_EQ(hf.get_earliest_ideal_height_for_version(9), 15);
+ ASSERT_EQ(hf.get_earliest_ideal_height_for_version(10), std::numeric_limits<uint64_t>::max());
+}
+
diff --git a/tests/unit_tests/threadpool.cpp b/tests/unit_tests/threadpool.cpp
new file mode 100644
index 000000000..34be1417a
--- /dev/null
+++ b/tests/unit_tests/threadpool.cpp
@@ -0,0 +1,101 @@
+// Copyright (c) 2018, 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 <atomic>
+#include "gtest/gtest.h"
+#include "misc_language.h"
+#include "common/threadpool.h"
+
+TEST(threadpool, wait_nothing)
+{
+ std::shared_ptr<tools::threadpool> tpool(tools::threadpool::getNewForUnitTests());
+ tools::threadpool::waiter waiter;
+ waiter.wait();
+}
+
+TEST(threadpool, wait_waits)
+{
+ std::shared_ptr<tools::threadpool> tpool(tools::threadpool::getNewForUnitTests());
+ tools::threadpool::waiter waiter;
+ std::atomic<bool> b(false);
+ tpool->submit(&waiter, [&b](){ epee::misc_utils::sleep_no_w(1000); b = true; });
+ ASSERT_FALSE(b);
+ waiter.wait();
+ ASSERT_TRUE(b);
+}
+
+TEST(threadpool, one_thread)
+{
+ std::shared_ptr<tools::threadpool> tpool(tools::threadpool::getNewForUnitTests(1));
+ tools::threadpool::waiter waiter;
+
+ std::atomic<unsigned int> counter(0);
+ for (size_t n = 0; n < 4096; ++n)
+ {
+ tpool->submit(&waiter, [&counter](){++counter;});
+ }
+ waiter.wait();
+ ASSERT_EQ(counter, 4096);
+}
+
+TEST(threadpool, many_threads)
+{
+ std::shared_ptr<tools::threadpool> tpool(tools::threadpool::getNewForUnitTests(256));
+ tools::threadpool::waiter waiter;
+
+ std::atomic<unsigned int> counter(0);
+ for (size_t n = 0; n < 4096; ++n)
+ {
+ tpool->submit(&waiter, [&counter](){++counter;});
+ }
+ waiter.wait();
+ ASSERT_EQ(counter, 4096);
+}
+
+static uint64_t fibonacci(std::shared_ptr<tools::threadpool> tpool, uint64_t n)
+{
+ if (n <= 1)
+ return n;
+ uint64_t f1, f2;
+ tools::threadpool::waiter waiter;
+ tpool->submit(&waiter, [&tpool, &f1, n](){ f1 = fibonacci(tpool, n-1); });
+ tpool->submit(&waiter, [&tpool, &f2, n](){ f2 = fibonacci(tpool, n-2); });
+ waiter.wait();
+ return f1 + f2;
+}
+
+TEST(threadpool, reentrency)
+{
+ std::shared_ptr<tools::threadpool> tpool(tools::threadpool::getNewForUnitTests(4));
+ tools::threadpool::waiter waiter;
+
+ uint64_t f = fibonacci(tpool, 13);
+ waiter.wait();
+ ASSERT_EQ(f, 233);
+}
+
generated by cgit v1.2.3 (git 2.25.1) at 2024-12-29 12:07:31 +0000