forked from RcppCore/RcppParallel
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_flow_graph.cpp
More file actions
223 lines (194 loc) · 7.24 KB
/
test_flow_graph.cpp
File metadata and controls
223 lines (194 loc) · 7.24 KB
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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
/*
Copyright 2005-2014 Intel Corporation. All Rights Reserved.
This file is part of Threading Building Blocks. Threading Building Blocks is free software;
you can redistribute it and/or modify it under the terms of the GNU General Public License
version 2 as published by the Free Software Foundation. Threading Building Blocks 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 Threading Building Blocks; if not, write to the
Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
As a special exception, you may use this file as part of a free software library without
restriction. Specifically, if other files instantiate templates or use macros or inline
functions from this file, or you compile this file and link it with other files to produce
an executable, this file does not by itself cause the resulting executable to be covered
by the GNU General Public License. This exception does not however invalidate any other
reasons why the executable file might be covered by the GNU General Public License.
*/
#include "harness_graph.h"
#include "harness_barrier.h"
#include "tbb/task_scheduler_init.h"
const int T = 4;
const int W = 4;
struct decrement_wait : NoAssign {
tbb::flow::graph * const my_graph;
bool * const my_done_flag;
decrement_wait( tbb::flow::graph &h, bool *done_flag ) : my_graph(&h), my_done_flag(done_flag) {}
void operator()(int i) const {
Harness::Sleep(10*i);
my_done_flag[i] = true;
my_graph->decrement_wait_count();
}
};
static void test_wait_count() {
tbb::flow::graph h;
for (int i = 0; i < T; ++i ) {
bool done_flag[W];
for (int j = 0; j < W; ++j ) {
for ( int w = 0; w < W; ++w ) done_flag[w] = false;
for ( int w = 0; w < j; ++w ) h.increment_wait_count();
NativeParallelFor( j, decrement_wait(h, done_flag) );
h.wait_for_all();
for ( int w = 0; w < W; ++w ) {
if ( w < j ) ASSERT( done_flag[w] == true, NULL );
else ASSERT( done_flag[w] == false, NULL );
}
}
}
}
const int F = 100;
#if __TBB_LAMBDAS_PRESENT
bool lambda_flag[F];
#endif
bool functor_flag[F];
struct set_functor {
int my_i;
set_functor( int i ) : my_i(i) {}
void operator()() { functor_flag[my_i] = true; }
};
struct return_functor {
int my_i;
return_functor( int i ) : my_i(i) {}
int operator()() { return my_i; }
};
static void test_run() {
tbb::flow::graph h;
for (int i = 0; i < T; ++i ) {
// Create receivers and flag arrays
#if __TBB_LAMBDAS_PRESENT
harness_mapped_receiver<int> lambda_r;
lambda_r.initialize_map( F, 1 );
#endif
harness_mapped_receiver<int> functor_r;
functor_r.initialize_map( F, 1 );
// Initialize flag arrays
for (int j = 0; j < F; ++j ) {
#if __TBB_LAMBDAS_PRESENT
lambda_flag[j] = false;
#endif
functor_flag[j] = false;
}
for ( int j = 0; j < F; ++j ) {
#if __TBB_LAMBDAS_PRESENT
h.run( [=]() { lambda_flag[j] = true; } );
h.run( lambda_r, [=]() { return j; } );
#endif
h.run( set_functor(j) );
h.run( functor_r, return_functor(j) );
}
h.wait_for_all();
for ( int j = 0; j < F; ++j ) {
#if __TBB_LAMBDAS_PRESENT
ASSERT( lambda_flag[i] == true, NULL );
#endif
ASSERT( functor_flag[i] == true, NULL );
}
#if __TBB_LAMBDAS_PRESENT
lambda_r.validate();
#endif
functor_r.validate();
}
}
// Encapsulate object we want to store in vector (because contained type must have
// copy constructor and assignment operator
class my_int_buffer {
tbb::flow::buffer_node<int> *b;
tbb::flow::graph& my_graph;
public:
my_int_buffer(tbb::flow::graph &g) : my_graph(g) { b = new tbb::flow::buffer_node<int>(my_graph); }
my_int_buffer(const my_int_buffer& other) : my_graph(other.my_graph) {
b = new tbb::flow::buffer_node<int>(my_graph);
}
~my_int_buffer() { delete b; }
my_int_buffer& operator=(const my_int_buffer& /*other*/) {
return *this;
}
};
// test the graph iterator, delete nodes from graph, test again
void test_iterator() {
tbb::flow::graph g;
my_int_buffer a_buffer(g);
my_int_buffer b_buffer(g);
my_int_buffer c_buffer(g);
my_int_buffer *d_buffer = new my_int_buffer(g);
my_int_buffer e_buffer(g);
std::vector< my_int_buffer > my_buffer_vector(10, c_buffer);
int count = 0;
for (tbb::flow::graph::iterator it = g.begin(); it != g.end(); ++it) {
count++;
}
ASSERT(count==15, "error in iterator count");
delete d_buffer;
count = 0;
for (tbb::flow::graph::iterator it = g.begin(); it != g.end(); ++it) {
count++;
}
ASSERT(count==14, "error in iterator count");
my_buffer_vector.clear();
count = 0;
for (tbb::flow::graph::iterator it = g.begin(); it != g.end(); ++it) {
count++;
}
ASSERT(count==4, "error in iterator count");
}
class AddRemoveBody : NoAssign {
tbb::flow::graph& g;
int nThreads;
Harness::SpinBarrier &barrier;
public:
AddRemoveBody(int nthr, Harness::SpinBarrier &barrier_, tbb::flow::graph& _g) :
g(_g), nThreads(nthr), barrier(barrier_)
{}
void operator()(const int /*threadID*/) const {
my_int_buffer b(g);
{
std::vector<my_int_buffer> my_buffer_vector(100, b);
barrier.wait(); // wait until all nodes are created
// now test that the proper number of nodes were created
int count = 0;
for (tbb::flow::graph::iterator it = g.begin(); it != g.end(); ++it) {
count++;
}
ASSERT(count==101*nThreads, "error in iterator count");
barrier.wait(); // wait until all threads are done counting
} // all nodes but for the initial node on this thread are deleted
barrier.wait(); // wait until all threads have deleted all nodes in their vectors
// now test that all the nodes were deleted except for the initial node
int count = 0;
for (tbb::flow::graph::iterator it = g.begin(); it != g.end(); ++it) {
count++;
}
ASSERT(count==nThreads, "error in iterator count");
barrier.wait(); // wait until all threads are done counting
} // initial node gets deleted
};
void test_parallel(int nThreads) {
tbb::flow::graph g;
Harness::SpinBarrier barrier(nThreads);
AddRemoveBody body(nThreads, barrier, g);
NativeParallelFor(nThreads, body);
}
int TestMain() {
if( MinThread<1 ) {
REPORT("number of threads must be positive\n");
exit(1);
}
for( int p=MinThread; p<=MaxThread; ++p ) {
tbb::task_scheduler_init init(p);
test_wait_count();
test_run();
test_iterator();
test_parallel(p);
}
return Harness::Done;
}