forked from RcppCore/RcppParallel
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_blocked_range.cpp
More file actions
188 lines (158 loc) · 7.19 KB
/
test_blocked_range.cpp
File metadata and controls
188 lines (158 loc) · 7.19 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
/*
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 "tbb/blocked_range.h"
#include "harness_assert.h"
// First test as much as we can without including other headers.
// Doing so should catch problems arising from failing to include headers.
class AbstractValueType {
AbstractValueType() {}
int value;
public:
friend AbstractValueType MakeAbstractValueType( int i );
friend int GetValueOf( const AbstractValueType& v ) {return v.value;}
};
AbstractValueType MakeAbstractValueType( int i ) {
AbstractValueType x;
x.value = i;
return x;
}
std::size_t operator-( const AbstractValueType& u, const AbstractValueType& v ) {
return GetValueOf(u) - GetValueOf(v);
}
bool operator<( const AbstractValueType& u, const AbstractValueType& v ) {
return GetValueOf(u) < GetValueOf(v);
}
AbstractValueType operator+( const AbstractValueType& u, std::size_t offset ) {
return MakeAbstractValueType(GetValueOf(u) + int(offset));
}
static void SerialTest() {
for( int x=-10; x<10; ++x )
for( int y=-10; y<10; ++y ) {
AbstractValueType i = MakeAbstractValueType(x);
AbstractValueType j = MakeAbstractValueType(y);
for( std::size_t k=1; k<10; ++k ) {
typedef tbb::blocked_range<AbstractValueType> range_type;
range_type r( i, j, k );
AssertSameType( r.empty(), true );
AssertSameType( range_type::size_type(), std::size_t() );
AssertSameType( static_cast<range_type::const_iterator*>(0), static_cast<AbstractValueType*>(0) );
AssertSameType( r.begin(), MakeAbstractValueType(0) );
AssertSameType( r.end(), MakeAbstractValueType(0) );
ASSERT( r.empty()==(y<=x), NULL );
ASSERT( r.grainsize()==k, NULL );
if( x<=y ) {
AssertSameType( r.is_divisible(), true );
ASSERT( r.is_divisible()==(std::size_t(y-x)>k), NULL );
ASSERT( r.size()==std::size_t(y-x), NULL );
if( r.is_divisible() ) {
tbb::blocked_range<AbstractValueType> r2(r,tbb::split());
ASSERT( GetValueOf(r.begin())==x, NULL );
ASSERT( GetValueOf(r.end())==GetValueOf(r2.begin()), NULL );
ASSERT( GetValueOf(r2.end())==y, NULL );
ASSERT( r.grainsize()==k, NULL );
ASSERT( r2.grainsize()==k, NULL );
}
}
}
}
}
#include "tbb/parallel_for.h"
#include "harness.h"
const int N = 1<<22;
unsigned char Array[N];
struct Striker {
// Note: we use <int> here instead of <long> in order to test for Quad 407676
void operator()( const tbb::blocked_range<int>& r ) const {
for( tbb::blocked_range<int>::const_iterator i=r.begin(); i!=r.end(); ++i )
++Array[i];
}
};
void ParallelTest() {
for( int i=0; i<N; i=i<3 ? i+1 : i*3 ) {
const tbb::blocked_range<int> r( 0, i, 10 );
tbb::parallel_for( r, Striker() );
for( int k=0; k<N; ++k ) {
ASSERT( Array[k]==(k<i), NULL );
Array[k] = 0;
}
}
}
#if __TBB_RANGE_BASED_FOR_PRESENT
#include "test_range_based_for.h"
#include <functional>
void TestRangeBasedFor() {
using namespace range_based_for_support_tests;
REMARK("testing range based for loop compatibility \n");
size_t int_array[100] = {0};
const size_t sequence_length = Harness::array_length(int_array);
for (size_t i = 0; i < sequence_length; ++i) {
int_array[i] = i + 1;
}
const tbb::blocked_range<size_t*> r(int_array, Harness::end(int_array), 1);
ASSERT(range_based_for_accumulate<size_t>(r, std::plus<size_t>(), size_t(0)) == gauss_summ_of_int_sequence(sequence_length), "incorrect accumulated value generated via range based for ?");
}
#endif //if __TBB_RANGE_BASED_FOR_PRESENT
#if __TBB_USE_PROPORTIONAL_SPLIT_IN_BLOCKED_RANGES
void TestProportionalSplitOverflow()
{
REMARK("Testing overflow during proportional split - ");
using tbb::blocked_range;
using tbb::proportional_split;
blocked_range<size_t> r1(0, size_t(-1) / 2);
size_t size = r1.size();
size_t begin = r1.begin();
size_t end = r1.end();
proportional_split p(1, 3);
blocked_range<size_t> r2(r1, p);
// overflow-free computation
size_t parts = p.left() + p.right();
size_t int_part = size / parts;
size_t fraction = size - int_part * parts; // fraction < parts
size_t right_idx = int_part * p.right() + fraction * p.right() / parts + 1;
size_t newRangeBegin = end - right_idx;
// Division in 'right_idx' very likely is inexact also.
size_t tolerance = 1;
size_t diff = (r2.begin() < newRangeBegin) ? (newRangeBegin - r2.begin()) : (r2.begin() - newRangeBegin);
bool is_split_correct = diff <= tolerance;
bool test_passed = (r1.begin() == begin && r1.end() == r2.begin() && is_split_correct &&
r2.end() == end);
if (!test_passed) {
REPORT("Incorrect split of blocked range[%lu, %lu) into r1[%lu, %lu) and r2[%lu, %lu), "
"must be r1[%lu, %lu) and r2[%lu, %lu)\n", begin, end, r1.begin(), r1.end(), r2.begin(), r2.end(), begin, newRangeBegin, newRangeBegin, end);
ASSERT(test_passed, NULL);
}
REMARK("OK\n");
}
#endif /* __TBB_USE_PROPORTIONAL_SPLIT_IN_BLOCKED_RANGES */
//------------------------------------------------------------------------
// Test driver
#include "tbb/task_scheduler_init.h"
int TestMain () {
SerialTest();
for( int p=MinThread; p<=MaxThread; ++p ) {
tbb::task_scheduler_init init(p);
ParallelTest();
}
#if __TBB_RANGE_BASED_FOR_PRESENT
TestRangeBasedFor();
#endif //if __TBB_RANGE_BASED_FOR_PRESENT
#if __TBB_USE_PROPORTIONAL_SPLIT_IN_BLOCKED_RANGES
TestProportionalSplitOverflow();
#endif
return Harness::Done;
}