1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
// -----------------------------------------------------------------------------------------------------
// Copyright (c) 2006-2020, Knut Reinert & Freie Universität Berlin
// Copyright (c) 2016-2020, Knut Reinert & MPI für molekulare Genetik
// This file may be used, modified and/or redistributed under the terms of the 3-clause BSD-License
// shipped with this file and also available at: https://github.com/seqan/seqan3/blob/master/LICENSE.md
// -----------------------------------------------------------------------------------------------------
#include <gtest/gtest.h>
#include <vector>
#include <seqan3/core/parallel/detail/latch.hpp>
TEST(latch, arrive_wait)
{
auto threads = std::thread::hardware_concurrency();
if (threads > 4)
threads = 4;
seqan3::detail::latch completion_latch{threads};
std::atomic<uint32_t> counter{0};
auto work = [&] ()
{
for (unsigned i = 0; i < 1000000; ++i)
++counter;
completion_latch.arrive();
};
std::vector<std::thread> pool;
for (unsigned i = 0; i < threads; ++i)
pool.emplace_back(work);
completion_latch.wait();
EXPECT_EQ(counter.load(), 1000000 * threads);
// All threads finished so we can join the threads.
for (auto & t : pool)
t.join();
}
TEST(latch, arrive_and_wait)
{
auto threads = std::thread::hardware_concurrency();
if (threads > 4)
threads = 4;
seqan3::detail::latch completion_latch{threads};
std::atomic<uint32_t> counter{0};
auto work = [&] ()
{
for (unsigned i = 0; i < 1000000; ++i)
++counter;
completion_latch.arrive_and_wait();
EXPECT_EQ(counter.load(), 1000000 * threads);
};
std::vector<std::thread> pool;
for (unsigned i = 0; i < threads; ++i)
pool.emplace_back(work);
completion_latch.wait();
EXPECT_EQ(counter.load(), 1000000 * threads);
// All threads finished so we can join the threads.
for (auto & t : pool)
t.join();
}
|
