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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
|
//===--- Concurrent.cpp - Concurrent data structure tests -----------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2020 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
//
//===----------------------------------------------------------------------===//
#ifndef THREADING_HELPERS_H
#define THREADING_HELPERS_H
#include <thread>
// When true many of the threaded tests log activity to help triage issues.
static bool trace = false;
template <typename ThreadBody, typename AfterSpinRelease>
void threadedExecute(int threadCount, ThreadBody threadBody,
AfterSpinRelease afterSpinRelease) {
std::vector<std::thread> threads;
// Block the threads we are about to create.
std::atomic<bool> spinWait(true);
std::atomic<int> readyCount(0);
std::atomic<int> activeCount(0);
for (int i = 0; i < threadCount; ++i) {
threads.push_back(std::thread([&, i] {
readyCount++;
while (spinWait) {
std::this_thread::sleep_for(std::chrono::microseconds(10));
}
std::this_thread::sleep_for(std::chrono::milliseconds(1));
activeCount++;
threadBody(i);
}));
}
while (readyCount < threadCount) {
std::this_thread::sleep_for(std::chrono::milliseconds(1));
}
// Allow our threads to fight for the lock.
spinWait = false;
while (activeCount < threadCount) {
std::this_thread::sleep_for(std::chrono::milliseconds(1));
}
afterSpinRelease();
// Wait until all of our threads have finished.
for (auto &thread : threads) {
thread.join();
}
}
template <typename ThreadBody>
void threadedExecute(int threadCount, ThreadBody threadBody) {
threadedExecute(threadCount, threadBody, [] {});
}
template <typename M, typename C, typename ConsumerBody, typename ProducerBody>
void threadedExecute(M &mutex, C &condition, bool &doneCondition,
ConsumerBody consumerBody, ProducerBody producerBody) {
std::vector<std::thread> producers;
std::vector<std::thread> consumers;
// Block the threads we are about to create.
std::atomic<bool> spinWait(true);
for (int i = 1; i <= 8; ++i) {
consumers.push_back(std::thread([&, i] {
while (spinWait) {
std::this_thread::sleep_for(std::chrono::microseconds(10));
}
std::this_thread::sleep_for(std::chrono::milliseconds(1));
consumerBody(i);
if (trace)
printf("### Consumer[%d] thread exiting.\n", i);
}));
}
for (int i = 1; i <= 5; ++i) {
producers.push_back(std::thread([&, i] {
while (spinWait) {
std::this_thread::sleep_for(std::chrono::microseconds(10));
}
std::this_thread::sleep_for(std::chrono::milliseconds(1));
producerBody(i);
if (trace)
printf("### Producer[%d] thread exiting.\n", i);
}));
}
// Poor mans attempt to get as many threads ready as possible before
// dropping spinWait, it doesn't have to be perfect.
std::this_thread::sleep_for(std::chrono::milliseconds(100));
// Allow our threads to fight for the lock.
spinWait = false;
// Wait until all of our producer threads have finished.
for (auto &thread : producers) {
thread.join();
}
// Inform consumers that producers are done.
mutex.withLockThenNotifyAll(condition, [&] {
if (trace)
printf("### Informing consumers we are done.\n");
doneCondition = true;
});
// Wait for consumers to finish.
for (auto &thread : consumers) {
thread.join();
}
}
#endif
|
