aboutsummaryrefslogtreecommitdiff
path: root/tests/unit_tests
diff options
context:
space:
mode:
Diffstat (limited to 'tests/unit_tests')
-rw-r--r--tests/unit_tests/CMakeLists.txt3
-rw-r--r--tests/unit_tests/apply_permutation.cpp74
-rw-r--r--tests/unit_tests/ban.cpp2
-rw-r--r--tests/unit_tests/thread_group.cpp177
4 files changed, 77 insertions, 179 deletions
diff --git a/tests/unit_tests/CMakeLists.txt b/tests/unit_tests/CMakeLists.txt
index 2f62dc2aa..63abe928d 100644
--- a/tests/unit_tests/CMakeLists.txt
+++ b/tests/unit_tests/CMakeLists.txt
@@ -27,6 +27,7 @@
# THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
set(unit_tests_sources
+ apply_permutation.cpp
address_from_url.cpp
ban.cpp
base58.cpp
@@ -55,7 +56,6 @@ set(unit_tests_sources
test_tx_utils.cpp
test_peerlist.cpp
test_protocol_pack.cpp
- thread_group.cpp
hardfork.cpp
unbound.cpp
uri.cpp
@@ -79,6 +79,7 @@ target_link_libraries(unit_tests
rpc
wallet
p2p
+ version
epee
${Boost_CHRONO_LIBRARY}
${Boost_THREAD_LIBRARY}
diff --git a/tests/unit_tests/apply_permutation.cpp b/tests/unit_tests/apply_permutation.cpp
new file mode 100644
index 000000000..a008b74ee
--- /dev/null
+++ b/tests/unit_tests/apply_permutation.cpp
@@ -0,0 +1,74 @@
+// Copyright (c) 2017, 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 "common/apply_permutation.h"
+
+TEST(apply_permutation, empty)
+{
+ std::vector<int> v = {};
+ tools::apply_permutation({}, v);
+ ASSERT_EQ(v, std::vector<int>({}));
+}
+
+TEST(apply_permutation, reorder)
+{
+ // 0 1 2 3 4 5 6
+ std::vector<int> v = {8, 4, 6, 1, 7, 2, 4};
+ tools::apply_permutation({3, 5, 6, 1, 2, 4, 0}, v);
+ ASSERT_EQ(v, std::vector<int>({1, 2, 4, 4, 6, 7, 8}));
+}
+
+TEST(apply_permutation, bad_size)
+{
+ std::vector<int> v_large = {8, 4, 6, 1, 7, 2, 4, 9};
+ std::vector<int> v_small = {8, 4, 6, 1, 7, 2};
+ try
+ {
+ tools::apply_permutation({3, 5, 6, 1, 2, 4, 0}, v_large);
+ ASSERT_FALSE(true);
+ }
+ catch (const std::exception &e) {}
+ try
+ {
+ tools::apply_permutation({3, 5, 6, 1, 2, 4, 0}, v_small);
+ ASSERT_FALSE(true);
+ }
+ catch (const std::exception &e) {}
+}
+
+TEST(apply_permutation, bad_permutation)
+{
+ std::vector<int> v = {8, 4, 6, 1, 7, 2, 4};
+ try
+ {
+ tools::apply_permutation({3, 5, 6, 1, 2, 4, 1}, v);
+ ASSERT_FALSE(true);
+ }
+ catch (const std::exception &e) {}
+}
diff --git a/tests/unit_tests/ban.cpp b/tests/unit_tests/ban.cpp
index 82ff058b1..7d4daafb3 100644
--- a/tests/unit_tests/ban.cpp
+++ b/tests/unit_tests/ban.cpp
@@ -51,7 +51,7 @@ public:
bool get_short_chain_history(std::list<crypto::hash>& ids) const { return true; }
bool get_stat_info(cryptonote::core_stat_info& st_inf) const {return true;}
bool have_block(const crypto::hash& id) const {return true;}
- bool get_blockchain_top(uint64_t& height, crypto::hash& top_id)const{height=0;top_id=cryptonote::null_hash;return true;}
+ void get_blockchain_top(uint64_t& height, crypto::hash& top_id)const{height=0;top_id=cryptonote::null_hash;}
bool handle_incoming_tx(const cryptonote::blobdata& tx_blob, cryptonote::tx_verification_context& tvc, bool keeped_by_block, bool relayed, bool do_not_relay) { return true; }
bool handle_incoming_txs(const std::list<cryptonote::blobdata>& tx_blob, std::vector<cryptonote::tx_verification_context>& tvc, bool keeped_by_block, bool relayed, bool do_not_relay) { return true; }
bool handle_incoming_block(const cryptonote::blobdata& block_blob, cryptonote::block_verification_context& bvc, bool update_miner_blocktemplate = true) { return true; }
diff --git a/tests/unit_tests/thread_group.cpp b/tests/unit_tests/thread_group.cpp
deleted file mode 100644
index c0ba3d38b..000000000
--- a/tests/unit_tests/thread_group.cpp
+++ /dev/null
@@ -1,177 +0,0 @@
-// Copyright (c) 2014-2017, 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 <atomic>
-#include "common/task_region.h"
-#include "common/thread_group.h"
-
-TEST(ThreadGroup, NoThreads)
-{
- tools::task_region(tools::thread_group(0), [] (tools::task_region_handle& region) {
- std::atomic<bool> completed{false};
- region.run([&] { completed = true; });
- EXPECT_TRUE(completed);
- });
- {
- tools::thread_group group(0);
- std::atomic<bool> completed{false};
- group.dispatch([&] { completed = true; });
- EXPECT_TRUE(completed);
- }
-}
-
-TEST(ThreadGroup, OneThread)
-{
- tools::thread_group group(1);
-
- for (unsigned i = 0; i < 3; ++i) {
- std::atomic<bool> completed{false};
- tools::task_region(group, [&] (tools::task_region_handle& region) {
- region.run([&] { completed = true; });
- });
- EXPECT_TRUE(completed);
- }
-}
-
-
-TEST(ThreadGroup, UseActiveThreadOnSync)
-{
- tools::thread_group group(1);
-
- for (unsigned i = 0; i < 3; ++i) {
- std::atomic<bool> completed{false};
- tools::task_region(group, [&] (tools::task_region_handle& region) {
- region.run([&] { while (!completed); });
- region.run([&] { completed = true; });
- });
- EXPECT_TRUE(completed);
- }
-}
-
-TEST(ThreadGroup, InOrder)
-{
- tools::thread_group group(1);
-
- for (unsigned i = 0; i < 3; ++i) {
- std::atomic<unsigned> count{0};
- std::atomic<bool> completed{false};
- tools::task_region(group, [&] (tools::task_region_handle& region) {
- region.run([&] { while (!completed); });
- region.run([&] { if (count == 0) completed = true; });
- region.run([&] { ++count; });
- });
- EXPECT_TRUE(completed);
- EXPECT_EQ(1u, count);
- }
-}
-
-TEST(ThreadGroup, TwoThreads)
-{
- tools::thread_group group(2);
-
- for (unsigned i = 0; i < 3; ++i) {
- std::atomic<bool> completed{false};
- tools::task_region(group, [&] (tools::task_region_handle& region) {
- region.run([&] { while (!completed); });
- region.run([&] { while (!completed); });
- region.run([&] { completed = true; });
- });
- EXPECT_TRUE(completed);
- }
-}
-
-TEST(ThreadGroup, Nested) {
- struct fib {
- unsigned operator()(tools::thread_group& group, unsigned value) const {
- if (value == 0 || value == 1) {
- return value;
- }
- unsigned left = 0;
- unsigned right = 0;
- tools::task_region(group, [&, value] (tools::task_region_handle& region) {
- region.run([&, value] { left = fib{}(group, value - 1); });
- region.run([&, value] { right = fib{}(group, value - 2); } );
- });
- return left + right;
- }
-
- unsigned operator()(tools::thread_group&& group, unsigned value) const {
- return (*this)(group, value);
- }
- };
- // be careful of depth on asynchronous version
- EXPECT_EQ(6765, fib{}(tools::thread_group(0), 20));
- EXPECT_EQ(377, fib{}(tools::thread_group(1), 14));
-}
-
-TEST(ThreadGroup, Many)
-{
- tools::thread_group group(1);
-
- for (unsigned i = 0; i < 3; ++i) {
- std::atomic<unsigned> count{0};
- tools::task_region(group, [&] (tools::task_region_handle& region) {
- for (unsigned tasks = 0; tasks < 1000; ++tasks) {
- region.run([&] { ++count; });
- }
- });
- EXPECT_EQ(1000u, count);
- }
-}
-
-TEST(ThreadGroup, ThrowInTaskRegion)
-{
- class test_exception final : std::exception {
- public:
- explicit test_exception() : std::exception() {}
-
- virtual const char* what() const noexcept override {
- return "test_exception";
- }
- };
-
- tools::thread_group group(1);
-
- for (unsigned i = 0; i < 3; ++i) {
- std::atomic<unsigned> count{0};
- EXPECT_THROW(
- [&] {
- tools::task_region(group, [&] (tools::task_region_handle& region) {
- for (unsigned tasks = 0; tasks < 1000; ++tasks) {
- region.run([&] { ++count; });
- }
- throw test_exception();
- });
- }(),
- test_exception
- );
- EXPECT_GE(1000u, count);
- }
-}