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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
|
/* Self tests for parallel_for_each
Copyright (C) 2021-2023 Free Software Foundation, Inc.
This file is part of GDB.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
/* This file is divided in two parts:
- FOR_EACH-undefined, and
- FOR_EACH-defined.
The former includes the latter, more than once, with different values for
FOR_EACH. The FOR_EACH-defined part reads like a regular function. */
#ifndef FOR_EACH
#include "defs.h"
#include "gdbsupport/selftest.h"
#include "gdbsupport/parallel-for.h"
#if CXX_STD_THREAD
#include "gdbsupport/thread-pool.h"
namespace selftests {
namespace parallel_for {
struct save_restore_n_threads
{
save_restore_n_threads ()
: n_threads (gdb::thread_pool::g_thread_pool->thread_count ())
{
}
~save_restore_n_threads ()
{
gdb::thread_pool::g_thread_pool->set_thread_count (n_threads);
}
int n_threads;
};
/* Define test_par using TEST in the FOR_EACH-defined part. */
#define TEST test_par
#define FOR_EACH gdb::parallel_for_each
#include "parallel-for-selftests.c"
#undef FOR_EACH
#undef TEST
/* Define test_seq using TEST in the FOR_EACH-defined part. */
#define TEST test_seq
#define FOR_EACH gdb::sequential_for_each
#include "parallel-for-selftests.c"
#undef FOR_EACH
#undef TEST
static void
test (int n_threads)
{
test_par (n_threads);
test_seq (n_threads);
}
static void
test_n_threads ()
{
test (0);
test (1);
test (3);
}
}
}
#endif /* CXX_STD_THREAD */
void _initialize_parallel_for_selftests ();
void
_initialize_parallel_for_selftests ()
{
#ifdef CXX_STD_THREAD
selftests::register_test ("parallel_for",
selftests::parallel_for::test_n_threads);
#endif /* CXX_STD_THREAD */
}
#else /* FOR_EACH */
static void
TEST (int n_threads)
{
save_restore_n_threads saver;
gdb::thread_pool::g_thread_pool->set_thread_count (n_threads);
#define NUMBER 10000
std::atomic<int> counter (0);
FOR_EACH (1, 0, NUMBER,
[&] (int start, int end)
{
counter += end - start;
});
SELF_CHECK (counter == NUMBER);
counter = 0;
FOR_EACH (1, 0, 0,
[&] (int start, int end)
{
counter += end - start;
});
SELF_CHECK (counter == 0);
auto task_size_max_ = [] (int iter)
{
return (size_t)SIZE_MAX;
};
auto task_size_max = gdb::make_function_view (task_size_max_);
counter = 0;
FOR_EACH (1, 0, NUMBER,
[&] (int start, int end)
{
counter += end - start;
}, task_size_max);
SELF_CHECK (counter == NUMBER);
auto task_size_one_ = [] (int iter)
{
return (size_t)1;
};
auto task_size_one = gdb::make_function_view (task_size_one_);
counter = 0;
FOR_EACH (1, 0, NUMBER,
[&] (int start, int end)
{
counter += end - start;
}, task_size_one);
SELF_CHECK (counter == NUMBER);
#undef NUMBER
/* Check that if there are fewer tasks than threads, then we won't
end up with a null result. */
std::vector<std::unique_ptr<int>> intresults;
std::atomic<bool> any_empty_tasks (false);
FOR_EACH (1, 0, 1,
[&] (int start, int end)
{
if (start == end)
any_empty_tasks = true;
return std::unique_ptr<int> (new int (end - start));
});
SELF_CHECK (!any_empty_tasks);
SELF_CHECK (std::all_of (intresults.begin (),
intresults.end (),
[] (const std::unique_ptr<int> &entry)
{
return entry != nullptr;
}));
/* The same but using the task size parameter. */
intresults.clear ();
any_empty_tasks = false;
FOR_EACH (1, 0, 1,
[&] (int start, int end)
{
if (start == end)
any_empty_tasks = true;
return std::unique_ptr<int> (new int (end - start));
},
task_size_one);
SELF_CHECK (!any_empty_tasks);
SELF_CHECK (std::all_of (intresults.begin (),
intresults.end (),
[] (const std::unique_ptr<int> &entry)
{
return entry != nullptr;
}));
}
#endif /* FOR_EACH */
|
