forked from RcppCore/RcppParallel
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_parallel_for.cpp
More file actions
602 lines (528 loc) · 21.9 KB
/
test_parallel_for.cpp
File metadata and controls
602 lines (528 loc) · 21.9 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
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
/*
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.
*/
// Test for function template parallel_for.h
// Enable testing of serial subset.
#define TBB_PREVIEW_SERIAL_SUBSET 1
#include "harness_defs.h"
#if _MSC_VER
#pragma warning (push)
#if __TBB_MSVC_UNREACHABLE_CODE_IGNORED
// Suppress pointless "unreachable code" warning.
#pragma warning (disable: 4702)
#endif
#if defined(_Wp64)
// Workaround for overzealous compiler warnings in /Wp64 mode
#pragma warning (disable: 4267)
#endif
#define _SCL_SECURE_NO_WARNINGS
#endif //#if _MSC_VER
#include "harness_defs.h"
#include "tbb/parallel_for.h"
#include "tbb/atomic.h"
#include "harness_assert.h"
#include "harness.h"
static tbb::atomic<int> FooBodyCount;
//! A range object whose only public members are those required by the Range concept.
template<size_t Pad>
class FooRange {
//! Start of range
int start;
//! Size of range
int size;
FooRange( int start_, int size_ ) : start(start_), size(size_) {
zero_fill<char>(pad, Pad);
pad[Pad-1] = 'x';
}
template<typename Flavor_, size_t Pad_> friend void Flog( int nthread );
template<size_t Pad_> friend class FooBody;
void operator&();
char pad[Pad];
public:
bool empty() const {return size==0;}
bool is_divisible() const {return size>1;}
FooRange( FooRange& original, tbb::split ) : size(original.size/2) {
original.size -= size;
start = original.start+original.size;
ASSERT( original.pad[Pad-1]=='x', NULL );
pad[Pad-1] = 'x';
}
};
//! A range object whose only public members are those required by the parallel_for.h body concept.
template<size_t Pad>
class FooBody {
static const int LIVE = 0x1234;
tbb::atomic<int>* array;
int state;
friend class FooRange<Pad>;
template<typename Flavor_, size_t Pad_> friend void Flog( int nthread );
FooBody( tbb::atomic<int>* array_ ) : array(array_), state(LIVE) {}
public:
~FooBody() {
--FooBodyCount;
for( size_t i=0; i<sizeof(*this); ++i )
reinterpret_cast<char*>(this)[i] = -1;
}
//! Copy constructor
FooBody( const FooBody& other ) : array(other.array), state(other.state) {
++FooBodyCount;
ASSERT( state==LIVE, NULL );
}
void operator()( FooRange<Pad>& r ) const {
for( int k=0; k<r.size; ++k ) {
const int i = array[r.start+k]++;
ASSERT( i==0, NULL );
}
}
};
#include "tbb/tick_count.h"
static const int N = 500;
static tbb::atomic<int> Array[N];
struct serial_tag {};
struct parallel_tag {};
struct empty_partitioner_tag {};
template <typename Flavor, typename Partitioner, typename Range, typename Body>
struct Invoker;
template <typename Range, typename Body>
struct Invoker<serial_tag, empty_partitioner_tag, Range, Body> {
void operator()( const Range& r, const Body& body, empty_partitioner_tag& ) {
tbb::serial:: parallel_for( r, body );
}
};
template <typename Partitioner, typename Range, typename Body>
struct Invoker<serial_tag, Partitioner, Range, Body> {
void operator()( const Range& r, const Body& body, Partitioner& p ) {
tbb::serial:: parallel_for( r, body, p );
}
};
template <typename Range, typename Body>
struct Invoker<parallel_tag, empty_partitioner_tag, Range, Body> {
void operator()( const Range& r, const Body& body, empty_partitioner_tag& ) {
tbb:: parallel_for( r, body );
}
};
template <typename Partitioner, typename Range, typename Body>
struct Invoker<parallel_tag, Partitioner, Range, Body> {
void operator()( const Range& r, const Body& body, Partitioner& p ) {
tbb:: parallel_for( r, body, p );
}
};
template <typename Flavor, typename Partitioner, typename T, typename Body>
struct InvokerStep;
template <typename T, typename Body>
struct InvokerStep<serial_tag, empty_partitioner_tag, T, Body> {
void operator()( const T& first, const T& last, const Body& f, empty_partitioner_tag& ) {
tbb::serial:: parallel_for( first, last, f );
}
void operator()( const T& first, const T& last, const T& step, const Body& f, empty_partitioner_tag& ) {
tbb::serial:: parallel_for( first, last, step, f );
}
};
template <typename Partitioner, typename T, typename Body>
struct InvokerStep<serial_tag, Partitioner, T, Body> {
void operator()( const T& first, const T& last, const Body& f, Partitioner& p ) {
tbb::serial:: parallel_for( first, last, f, p);
}
void operator()( const T& first, const T& last, const T& step, const Body& f, Partitioner& p ) {
tbb::serial:: parallel_for( first, last, step, f, p );
}
};
template <typename T, typename Body>
struct InvokerStep<parallel_tag, empty_partitioner_tag, T, Body> {
void operator()( const T& first, const T& last, const Body& f, empty_partitioner_tag& ) {
tbb:: parallel_for( first, last, f );
}
void operator()( const T& first, const T& last, const T& step, const Body& f, empty_partitioner_tag& ) {
tbb:: parallel_for( first, last, step, f );
}
};
template <typename Partitioner, typename T, typename Body>
struct InvokerStep<parallel_tag, Partitioner, T, Body> {
void operator()( const T& first, const T& last, const Body& f, Partitioner& p ) {
tbb:: parallel_for( first, last, f, p );
}
void operator()( const T& first, const T& last, const T& step, const Body& f, Partitioner& p ) {
tbb:: parallel_for( first, last, step, f, p );
}
};
template<typename Flavor, size_t Pad>
void Flog( int nthread ) {
tbb::tick_count T0 = tbb::tick_count::now();
for( int i=0; i<N; ++i ) {
for ( int mode = 0; mode < 4; ++mode) {
FooRange<Pad> r( 0, i );
const FooRange<Pad> rc = r;
FooBody<Pad> f( Array );
const FooBody<Pad> fc = f;
memset( Array, 0, sizeof(Array) );
FooBodyCount = 1;
switch (mode) {
case 0: {
empty_partitioner_tag p;
Invoker< Flavor, empty_partitioner_tag, FooRange<Pad>, FooBody<Pad> > invoke_for;
invoke_for( rc, fc, p );
}
break;
case 1: {
Invoker< Flavor, const tbb::simple_partitioner, FooRange<Pad>, FooBody<Pad> > invoke_for;
invoke_for( rc, fc, tbb::simple_partitioner() );
}
break;
case 2: {
Invoker< Flavor, const tbb::auto_partitioner, FooRange<Pad>, FooBody<Pad> > invoke_for;
invoke_for( rc, fc, tbb::auto_partitioner() );
}
break;
case 3: {
static tbb::affinity_partitioner affinity;
Invoker< Flavor, tbb::affinity_partitioner, FooRange<Pad>, FooBody<Pad> > invoke_for;
invoke_for( rc, fc, affinity );
}
break;
}
for( int j=0; j<i; ++j )
ASSERT( Array[j]==1, NULL );
for( int j=i; j<N; ++j )
ASSERT( Array[j]==0, NULL );
ASSERT( FooBodyCount==1, NULL );
}
}
tbb::tick_count T1 = tbb::tick_count::now();
REMARK("time=%g\tnthread=%d\tpad=%d\n",(T1-T0).seconds(),nthread,int(Pad));
}
// Testing parallel_for with step support
const size_t PFOR_BUFFER_TEST_SIZE = 1024;
// test_buffer has some extra items beyond its right bound
const size_t PFOR_BUFFER_ACTUAL_SIZE = PFOR_BUFFER_TEST_SIZE + 1024;
size_t pfor_buffer[PFOR_BUFFER_ACTUAL_SIZE];
template<typename T>
class TestFunctor{
public:
void operator ()(T index) const {
pfor_buffer[index]++;
}
};
#if !TBB_USE_EXCEPTIONS && _MSC_VER
// Suppress "C++ exception handler used, but unwind semantics are not enabled" warning in STL headers
#pragma warning (push)
#pragma warning (disable: 4530)
#endif
#include <stdexcept> // std::invalid_argument
#if !TBB_USE_EXCEPTIONS && _MSC_VER
#pragma warning (pop)
#endif
template <typename Flavor, typename T, typename Partitioner>
void TestParallelForWithStepSupportHelper(Partitioner& p)
{
const T pfor_buffer_test_size = static_cast<T>(PFOR_BUFFER_TEST_SIZE);
const T pfor_buffer_actual_size = static_cast<T>(PFOR_BUFFER_ACTUAL_SIZE);
// Testing parallel_for with different step values
InvokerStep< Flavor, Partitioner, T, TestFunctor<T> > invoke_for;
for (T begin = 0; begin < pfor_buffer_test_size - 1; begin += pfor_buffer_test_size / 10 + 1) {
T step;
for (step = 1; step < pfor_buffer_test_size; step++) {
memset(pfor_buffer, 0, pfor_buffer_actual_size * sizeof(size_t));
if (step == 1){
invoke_for(begin, pfor_buffer_test_size, TestFunctor<T>(), p);
} else {
invoke_for(begin, pfor_buffer_test_size, step, TestFunctor<T>(), p);
}
// Verifying that parallel_for processed all items it should
for (T i = begin; i < pfor_buffer_test_size; i = i + step) {
ASSERT(pfor_buffer[i] == 1, "parallel_for didn't process all required elements");
pfor_buffer[i] = 0;
}
// Verifying that no extra items were processed and right bound of array wasn't crossed
for (T i = 0; i < pfor_buffer_actual_size; i++) {
ASSERT(pfor_buffer[i] == 0, "parallel_for processed an extra element");
}
}
}
}
template <typename Flavor, typename T>
void TestParallelForWithStepSupport()
{
static tbb::affinity_partitioner affinity_p;
tbb::auto_partitioner auto_p;
tbb::simple_partitioner simple_p;
empty_partitioner_tag p;
// Try out all partitioner combinations
TestParallelForWithStepSupportHelper< Flavor,T,empty_partitioner_tag >(p);
TestParallelForWithStepSupportHelper< Flavor,T,const tbb::auto_partitioner >(auto_p);
TestParallelForWithStepSupportHelper< Flavor,T,const tbb::simple_partitioner >(simple_p);
TestParallelForWithStepSupportHelper< Flavor,T,tbb::affinity_partitioner >(affinity_p);
// Testing some corner cases
tbb::parallel_for(static_cast<T>(2), static_cast<T>(1), static_cast<T>(1), TestFunctor<T>());
#if TBB_USE_EXCEPTIONS && !__TBB_THROW_ACROSS_MODULE_BOUNDARY_BROKEN
try{
tbb::parallel_for(static_cast<T>(1), static_cast<T>(100), static_cast<T>(0), TestFunctor<T>()); // should cause std::invalid_argument
}catch(std::invalid_argument){
return;
}
catch ( ... ) {
ASSERT ( __TBB_EXCEPTION_TYPE_INFO_BROKEN, "Unrecognized exception. std::invalid_argument is expected" );
}
#endif /* TBB_USE_EXCEPTIONS && !__TBB_THROW_ACROSS_MODULE_BOUNDARY_BROKEN */
}
#if __TBB_TASK_GROUP_CONTEXT
// Exception support test
#define HARNESS_EH_SIMPLE_MODE 1
#include "tbb/tbb_exception.h"
#include "harness_eh.h"
#if TBB_USE_EXCEPTIONS
class test_functor_with_exception {
public:
void operator ()(size_t) const { ThrowTestException(); }
};
void TestExceptionsSupport() {
REMARK (__FUNCTION__);
{ // Tests version with a step provided
ResetEhGlobals();
TRY();
tbb::parallel_for((size_t)0, (size_t)PFOR_BUFFER_TEST_SIZE, (size_t)1, test_functor_with_exception());
CATCH_AND_ASSERT();
}
{ // Tests version without a step
ResetEhGlobals();
TRY();
tbb::parallel_for((size_t)0, (size_t)PFOR_BUFFER_TEST_SIZE, test_functor_with_exception());
CATCH_AND_ASSERT();
}
}
#endif /* TBB_USE_EXCEPTIONS */
// Cancellation support test
class functor_to_cancel {
public:
void operator()(size_t) const {
++g_CurExecuted;
CancellatorTask::WaitUntilReady();
}
};
size_t g_worker_task_step = 0;
class my_worker_pfor_step_task : public tbb::task
{
tbb::task_group_context &my_ctx;
tbb::task* execute () {
if (g_worker_task_step == 0){
tbb::parallel_for((size_t)0, (size_t)PFOR_BUFFER_TEST_SIZE, functor_to_cancel(), my_ctx);
}else{
tbb::parallel_for((size_t)0, (size_t)PFOR_BUFFER_TEST_SIZE, g_worker_task_step, functor_to_cancel(), my_ctx);
}
return NULL;
}
public:
my_worker_pfor_step_task ( tbb::task_group_context &context_) : my_ctx(context_) { }
};
void TestCancellation()
{
// tests version without a step
g_worker_task_step = 0;
ResetEhGlobals();
RunCancellationTest<my_worker_pfor_step_task, CancellatorTask>();
// tests version with step
g_worker_task_step = 1;
ResetEhGlobals();
RunCancellationTest<my_worker_pfor_step_task, CancellatorTask>();
}
#endif /* __TBB_TASK_GROUP_CONTEXT */
#include "harness_m128.h"
#if (HAVE_m128 || HAVE_m256) && !__TBB_SSE_STACK_ALIGNMENT_BROKEN
template<typename ClassWithVectorType>
struct SSE_Functor {
ClassWithVectorType* Src, * Dst;
SSE_Functor( ClassWithVectorType* src, ClassWithVectorType* dst ) : Src(src), Dst(dst) {}
void operator()( tbb::blocked_range<int>& r ) const {
for( int i=r.begin(); i!=r.end(); ++i )
Dst[i] = Src[i];
}
};
//! Test that parallel_for works with stack-allocated __m128
template<typename ClassWithVectorType>
void TestVectorTypes() {
ClassWithVectorType Array1[N], Array2[N];
for( int i=0; i<N; ++i ) {
// VC8 does not properly align a temporary value; to work around, use explicit variable
ClassWithVectorType foo(i);
Array1[i] = foo;
}
tbb::parallel_for( tbb::blocked_range<int>(0,N), SSE_Functor<ClassWithVectorType>(Array1, Array2) );
for( int i=0; i<N; ++i ) {
ClassWithVectorType foo(i);
ASSERT( Array2[i]==foo, NULL ) ;
}
}
#endif /* HAVE_m128 || HAVE_m256 */
#include <vector>
#include <tbb/blocked_range.h>
#include <sstream>
struct TestSimplePartitionerStabilityFunctor:NoAssign{
std::vector<int> & ranges;
TestSimplePartitionerStabilityFunctor(std::vector<int> & theRanges):ranges(theRanges){}
void operator()(tbb::blocked_range<size_t>& r)const{
ranges.at(r.begin())=true;
}
};
void TestSimplePartitionerStability(){
const std::size_t repeat_count= 10;
const std::size_t rangeToSplitSize=1000000;
const std::size_t grainsizeStep=rangeToSplitSize/repeat_count;
typedef TestSimplePartitionerStabilityFunctor FunctorType;
for (std::size_t i=0 , grainsize=grainsizeStep; i<repeat_count;i++, grainsize+=grainsizeStep){
std::vector<int> firstSeries(rangeToSplitSize,0);
std::vector<int> secondSeries(rangeToSplitSize,0);
tbb::parallel_for(tbb::blocked_range<size_t>(0,rangeToSplitSize,grainsize),FunctorType(firstSeries),tbb::simple_partitioner());
tbb::parallel_for(tbb::blocked_range<size_t>(0,rangeToSplitSize,grainsize),FunctorType(secondSeries),tbb::simple_partitioner());
std::stringstream str; str<<i;
ASSERT(firstSeries==secondSeries,("splitting range with tbb::simple_partitioner must be reproducible; i=" +str.str()).c_str() );
}
}
#include <cstdio>
#include "tbb/task_scheduler_init.h"
#include "harness_cpu.h"
#include "harness_barrier.h"
#include "test_partitioner.h"
namespace interaction_with_range_and_partitioner {
// Test checks compatibility of parallel_for algorithm with various range implementations
void test() {
using namespace test_partitioner_utils::interaction_with_range_and_partitioner;
test_partitioner_utils::SimpleBody b;
tbb::affinity_partitioner ap;
parallel_for(Range1(true, false), b, ap);
parallel_for(Range2(true, false), b, ap);
parallel_for(Range3(true, false), b, ap);
parallel_for(Range4(false, true), b, ap);
parallel_for(Range5(false, true), b, ap);
parallel_for(Range6(false, true), b, ap);
parallel_for(Range1(false, true), b, tbb::simple_partitioner());
parallel_for(Range2(false, true), b, tbb::simple_partitioner());
parallel_for(Range3(false, true), b, tbb::simple_partitioner());
parallel_for(Range4(false, true), b, tbb::simple_partitioner());
parallel_for(Range5(false, true), b, tbb::simple_partitioner());
parallel_for(Range6(false, true), b, tbb::simple_partitioner());
parallel_for(Range1(false, true), b, tbb::auto_partitioner());
parallel_for(Range2(false, true), b, tbb::auto_partitioner());
parallel_for(Range3(false, true), b, tbb::auto_partitioner());
parallel_for(Range4(false, true), b, tbb::auto_partitioner());
parallel_for(Range5(false, true), b, tbb::auto_partitioner());
parallel_for(Range6(false, true), b, tbb::auto_partitioner());
}
} // namespace interaction_with_range_and_partitioner
namespace uniform_work_distribution {
/*
* Test checks that initial work distribution is done uniformly
* through affinity mechanism and not through work stealing
*/
class Body {
Harness::SpinBarrier &m_sb;
public:
Body(Harness::SpinBarrier& sb) : m_sb(sb) { }
Body(Body& b, tbb::split) : m_sb(b.m_sb) { }
Body& operator =(const Body&) { return *this; }
template <typename Range>
void operator()(Range& r) const {
REMARK("Executing range [%lu, %lu)\n", r.begin(), r.end());
m_sb.timed_wait(10); // waiting for all threads
}
};
template <typename RangeType>
void test_uniform_work_distribution() {
int thread_num = tbb::task_scheduler_init::default_num_threads();
Harness::SpinBarrier sb(thread_num);
tbb::affinity_partitioner ap;
tbb::parallel_for(RangeType(0, thread_num), Body(sb), ap);
}
void test() {
using namespace test_partitioner_utils::TestRanges;
test_uniform_work_distribution<RoundedDownRange>();
test_uniform_work_distribution<RoundedUpRange>();
test_uniform_work_distribution< tbb::blocked_range<size_t> >();
test_uniform_work_distribution<Range1_2>();
test_uniform_work_distribution<Range1_999>();
test_uniform_work_distribution<Range999_1>();
}
} // namespace uniform_work_distribution
int TestMain () {
if( MinThread<1 ) {
REPORT("number of threads must be positive\n");
exit(1);
}
for( int p=MinThread; p<=MaxThread; ++p ) {
if( p>0 ) {
tbb::task_scheduler_init init( p );
Flog<parallel_tag,1>(p);
Flog<parallel_tag,10>(p);
Flog<parallel_tag,100>(p);
Flog<parallel_tag,1000>(p);
Flog<parallel_tag,10000>(p);
// Testing with different integer types
TestParallelForWithStepSupport<parallel_tag,short>();
TestParallelForWithStepSupport<parallel_tag,unsigned short>();
TestParallelForWithStepSupport<parallel_tag,int>();
TestParallelForWithStepSupport<parallel_tag,unsigned int>();
TestParallelForWithStepSupport<parallel_tag,long>();
TestParallelForWithStepSupport<parallel_tag,unsigned long>();
TestParallelForWithStepSupport<parallel_tag,long long>();
TestParallelForWithStepSupport<parallel_tag,unsigned long long>();
TestParallelForWithStepSupport<parallel_tag,size_t>();
// This is for testing serial implementation.
if( p == MaxThread ) {
Flog<serial_tag,1>(p);
Flog<serial_tag,10>(p);
Flog<serial_tag,100>(p);
TestParallelForWithStepSupport<serial_tag,short>();
TestParallelForWithStepSupport<serial_tag,unsigned short>();
TestParallelForWithStepSupport<serial_tag,int>();
TestParallelForWithStepSupport<serial_tag,unsigned int>();
TestParallelForWithStepSupport<serial_tag,long>();
TestParallelForWithStepSupport<serial_tag,unsigned long>();
TestParallelForWithStepSupport<serial_tag,long long>();
TestParallelForWithStepSupport<serial_tag,unsigned long long>();
TestParallelForWithStepSupport<serial_tag,size_t>();
}
#if TBB_USE_EXCEPTIONS && !__TBB_THROW_ACROSS_MODULE_BOUNDARY_BROKEN
TestExceptionsSupport();
#endif /* TBB_USE_EXCEPTIONS && !__TBB_THROW_ACROSS_MODULE_BOUNDARY_BROKEN */
#if __TBB_TASK_GROUP_CONTEXT
if ( p > 1 )
TestCancellation();
#endif /* __TBB_TASK_GROUP_CONTEXT */
#if !__TBB_SSE_STACK_ALIGNMENT_BROKEN
#if HAVE_m128
TestVectorTypes<ClassWithSSE>();
#endif
#if HAVE_m256
if (have_AVX()) TestVectorTypes<ClassWithAVX>();
#endif
#endif /*!__TBB_SSE_STACK_ALIGNMENT_BROKEN*/
// Test that all workers sleep when no work
TestCPUUserTime(p);
TestSimplePartitionerStability();
}
}
#if __TBB_THROW_ACROSS_MODULE_BOUNDARY_BROKEN
REPORT("Known issue: exception handling tests are skipped.\n");
#endif
#if (HAVE_m128 || HAVE_m256) && __TBB_SSE_STACK_ALIGNMENT_BROKEN
REPORT("Known issue: stack alignment for SIMD instructions not tested.\n");
#endif
uniform_work_distribution::test();
interaction_with_range_and_partitioner::test();
return Harness::Done;
}
#if _MSC_VER
#pragma warning (pop)
#endif