forked from RcppCore/RcppParallel
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathconcurrent_vector_v2.cpp
More file actions
266 lines (243 loc) · 10.8 KB
/
concurrent_vector_v2.cpp
File metadata and controls
266 lines (243 loc) · 10.8 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
/*
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 "concurrent_vector_v2.h"
#include "tbb/tbb_machine.h"
#include "../tbb/itt_notify.h"
#include "tbb/task.h"
#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::length_error
#include <cstring>
#if !TBB_USE_EXCEPTIONS && _MSC_VER
#pragma warning (pop)
#endif
#if defined(_MSC_VER) && defined(_Wp64)
// Workaround for overzealous compiler warnings in /Wp64 mode
#pragma warning (disable: 4267)
#endif
namespace tbb {
namespace internal {
void concurrent_vector_base::internal_grow_to_at_least( size_type new_size, size_type element_size, internal_array_op1 init ) {
size_type e = my_early_size;
while( e<new_size ) {
size_type f = my_early_size.compare_and_swap(new_size,e);
if( f==e ) {
internal_grow( e, new_size, element_size, init );
return;
}
e = f;
}
}
class concurrent_vector_base::helper {
static void extend_segment( concurrent_vector_base& v );
public:
static segment_index_t find_segment_end( const concurrent_vector_base& v ) {
const size_t pointers_per_long_segment = sizeof(void*)==4 ? 32 : 64;
const size_t pointers_per_short_segment = 2;
//unsigned u = v.my_segment==v.my_storage ? pointers_per_short_segment : pointers_per_long_segment;
segment_index_t u = v.my_segment==(&(v.my_storage[0])) ? pointers_per_short_segment : pointers_per_long_segment;
segment_index_t k = 0;
while( k<u && v.my_segment[k].array )
++k;
return k;
}
static void extend_segment_if_necessary( concurrent_vector_base& v, size_t k ) {
const size_t pointers_per_short_segment = 2;
if( k>=pointers_per_short_segment && v.my_segment==v.my_storage ) {
extend_segment(v);
}
}
};
void concurrent_vector_base::helper::extend_segment( concurrent_vector_base& v ) {
const size_t pointers_per_long_segment = sizeof(void*)==4 ? 32 : 64;
segment_t* s = (segment_t*)NFS_Allocate( pointers_per_long_segment, sizeof(segment_t), NULL );
std::memset( s, 0, pointers_per_long_segment*sizeof(segment_t) );
// If other threads are trying to set pointers in the short segment, wait for them to finish their
// assignments before we copy the short segment to the long segment.
atomic_backoff backoff;
while( !v.my_storage[0].array || !v.my_storage[1].array ) backoff.pause();
s[0] = v.my_storage[0];
s[1] = v.my_storage[1];
if( v.my_segment.compare_and_swap( s, v.my_storage )!=v.my_storage )
NFS_Free(s);
}
concurrent_vector_base::size_type concurrent_vector_base::internal_capacity() const {
return segment_base( helper::find_segment_end(*this) );
}
void concurrent_vector_base::internal_reserve( size_type n, size_type element_size, size_type max_size ) {
if( n>max_size ) {
__TBB_THROW( std::length_error("argument to concurrent_vector::reserve exceeds concurrent_vector::max_size()") );
}
for( segment_index_t k = helper::find_segment_end(*this); segment_base(k)<n; ++k ) {
helper::extend_segment_if_necessary(*this,k);
size_t m = segment_size(k);
__TBB_ASSERT( !my_segment[k].array, "concurrent operation during reserve(...)?" );
my_segment[k].array = NFS_Allocate( m, element_size, NULL );
}
}
void concurrent_vector_base::internal_copy( const concurrent_vector_base& src, size_type element_size, internal_array_op2 copy ) {
size_type n = src.my_early_size;
my_early_size = n;
my_segment = my_storage;
if( n ) {
size_type b;
for( segment_index_t k=0; (b=segment_base(k))<n; ++k ) {
helper::extend_segment_if_necessary(*this,k);
size_t m = segment_size(k);
__TBB_ASSERT( !my_segment[k].array, "concurrent operation during copy construction?" );
my_segment[k].array = NFS_Allocate( m, element_size, NULL );
if( m>n-b ) m = n-b;
copy( my_segment[k].array, src.my_segment[k].array, m );
}
}
}
void concurrent_vector_base::internal_assign( const concurrent_vector_base& src, size_type element_size, internal_array_op1 destroy, internal_array_op2 assign, internal_array_op2 copy ) {
size_type n = src.my_early_size;
while( my_early_size>n ) {
segment_index_t k = segment_index_of( my_early_size-1 );
size_type b=segment_base(k);
size_type new_end = b>=n ? b : n;
__TBB_ASSERT( my_early_size>new_end, NULL );
destroy( (char*)my_segment[k].array+element_size*(new_end-b), my_early_size-new_end );
my_early_size = new_end;
}
size_type dst_initialized_size = my_early_size;
my_early_size = n;
size_type b;
for( segment_index_t k=0; (b=segment_base(k))<n; ++k ) {
helper::extend_segment_if_necessary(*this,k);
size_t m = segment_size(k);
if( !my_segment[k].array )
my_segment[k].array = NFS_Allocate( m, element_size, NULL );
if( m>n-b ) m = n-b;
size_type a = 0;
if( dst_initialized_size>b ) {
a = dst_initialized_size-b;
if( a>m ) a = m;
assign( my_segment[k].array, src.my_segment[k].array, a );
m -= a;
a *= element_size;
}
if( m>0 )
copy( (char*)my_segment[k].array+a, (char*)src.my_segment[k].array+a, m );
}
__TBB_ASSERT( src.my_early_size==n, "detected use of concurrent_vector::operator= with right side that was concurrently modified" );
}
void* concurrent_vector_base::internal_push_back( size_type element_size, size_type& index ) {
__TBB_ASSERT( sizeof(my_early_size)==sizeof(reference_count), NULL );
//size_t tmp = __TBB_FetchAndIncrementWacquire(*(tbb::internal::reference_count*)&my_early_size);
size_t tmp = __TBB_FetchAndIncrementWacquire((tbb::internal::reference_count*)&my_early_size);
index = tmp;
segment_index_t k_old = segment_index_of( tmp );
size_type base = segment_base(k_old);
helper::extend_segment_if_necessary(*this,k_old);
segment_t& s = my_segment[k_old];
void* array = s.array;
if( !array ) {
// FIXME - consider factoring this out and share with internal_grow_by
if( base==tmp ) {
__TBB_ASSERT( !s.array, NULL );
size_t n = segment_size(k_old);
array = NFS_Allocate( n, element_size, NULL );
ITT_NOTIFY( sync_releasing, &s.array );
s.array = array;
} else {
ITT_NOTIFY(sync_prepare, &s.array);
spin_wait_while_eq( s.array, (void*)0 );
ITT_NOTIFY(sync_acquired, &s.array);
array = s.array;
}
}
size_type j_begin = tmp-base;
return (void*)((char*)array+element_size*j_begin);
}
concurrent_vector_base::size_type concurrent_vector_base::internal_grow_by( size_type delta, size_type element_size, internal_array_op1 init ) {
size_type result = my_early_size.fetch_and_add(delta);
internal_grow( result, result+delta, element_size, init );
return result;
}
void concurrent_vector_base::internal_grow( const size_type start, size_type finish, size_type element_size, internal_array_op1 init ) {
__TBB_ASSERT( start<finish, "start must be less than finish" );
size_t tmp = start;
do {
segment_index_t k_old = segment_index_of( tmp );
size_type base = segment_base(k_old);
size_t n = segment_size(k_old);
helper::extend_segment_if_necessary(*this,k_old);
segment_t& s = my_segment[k_old];
void* array = s.array;
if( !array ) {
if( base==tmp ) {
__TBB_ASSERT( !s.array, NULL );
array = NFS_Allocate( n, element_size, NULL );
ITT_NOTIFY( sync_releasing, &s.array );
s.array = array;
} else {
ITT_NOTIFY(sync_prepare, &s.array);
spin_wait_while_eq( s.array, (void*)0 );
ITT_NOTIFY(sync_acquired, &s.array);
array = s.array;
}
}
size_type j_begin = tmp-base;
size_type j_end = n > finish-base ? finish-base : n;
(*init)( (void*)((char*)array+element_size*j_begin), j_end-j_begin );
tmp = base+j_end;
} while( tmp<finish );
}
void concurrent_vector_base::internal_clear( internal_array_op1 destroy, bool reclaim_storage ) {
// Set "my_early_size" early, so that subscripting errors can be caught.
// FIXME - doing so may be hurting exception safety
__TBB_ASSERT( my_segment, NULL );
size_type finish = my_early_size;
my_early_size = 0;
while( finish>0 ) {
segment_index_t k_old = segment_index_of(finish-1);
segment_t& s = my_segment[k_old];
__TBB_ASSERT( s.array, NULL );
size_type base = segment_base(k_old);
size_type j_end = finish-base;
__TBB_ASSERT( j_end, NULL );
(*destroy)( s.array, j_end );
finish = base;
}
// Free the arrays
if( reclaim_storage ) {
size_t k = helper::find_segment_end(*this);
while( k>0 ) {
--k;
segment_t& s = my_segment[k];
void* array = s.array;
s.array = NULL;
NFS_Free( array );
}
// Clear short segment.
my_storage[0].array = NULL;
my_storage[1].array = NULL;
segment_t* s = my_segment;
if( s!=my_storage ) {
my_segment = my_storage;
NFS_Free( s );
}
}
}
} // namespace internal
} // tbb