Home
last modified time | relevance | path

Searched refs:r (Results 1 – 25 of 128) sorted by relevance

123456

/oneTBB/test/tbb/
H A Dtest_partitioner.h110 RangeBase(RangeBase& r, tbb::split) : RangeStatisticCollector(r, r.size()) { in RangeBase() argument
111 *this = r; in RangeBase()
112 size_t middle = r.my_begin + (r.my_end - r.my_begin) / 2u; in RangeBase()
116 RangeBase(RangeBase& r, proportional_split& p) : RangeStatisticCollector(r, p) { in RangeBase() argument
117 *this = r; in RangeBase()
125 r.my_end = my_begin = r.my_end - right_part; in RangeBase()
189 Range1_2(Range1_2& r, tbb::split) : RangeBase<Range1_2, float>(r, tbb::split()) { } in Range1_2() argument
230 : RangeStatisticCollector(r, r.size()), blocked_range<size_t>(r, split()) { } in BlockedRange()
232 : RangeStatisticCollector(r, p), blocked_range<size_t>(r, p) { } in BlockedRange()
461 *this = r; in SplitConstructorAssertedRange()
[all …]
H A Dtest_function_node.cpp90 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels() local
107 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels() local
122 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels() local
126 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels() local
131 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels() local
179 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels_with_copy() local
208 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels_with_copy() local
213 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels_with_copy() local
273 for (size_t r = 0; r < num_receivers; ++r ) { in concurrency_levels() local
318 for (size_t r = 0; r < num_receivers; ++r ) { in concurrency_levels() local
[all …]
H A Dtest_multifunction_node.cpp82 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels() local
118 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels() local
123 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels() local
170 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels_with_copy() local
199 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels_with_copy() local
204 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels_with_copy() local
260 for (size_t r = 0; r < num_receivers; ++r ) { in concurrency_levels() local
304 for (size_t r = 0; r < num_receivers; ++r ) { in concurrency_levels() local
309 for (size_t r = 0; r < num_receivers; ++r ) { in concurrency_levels() local
372 for (size_t r = 0; r < num_receivers; ++r ) { in unlimited_concurrency() local
[all …]
H A Dtest_partitioner.cpp66 [&](const tbb::blocked_range<std::size_t>& r) { in test() argument
68 trace[thread_id].emplace_back(r.begin(), r.end()); in test()
70 const bool is_uniform_split = r.size() == per_thread_iters; in test()
162 results[i].push_back(r.size()); in test_custom_range()
181 custom_range(int l, int r, int g) : base_type(l, r, g) {} in custom_range() argument
182 custom_range(const custom_range& r) : base_type(r) {} in custom_range() argument
184 custom_range(custom_range& r, tbb::split) : base_type(r, tbb::split()) {} in custom_range() argument
192 custom_range_with_psplit(int l, int r, int g) : base_type(l, r, g) {} in custom_range_with_psplit() argument
193 custom_range_with_psplit(const custom_range_with_psplit& r) : base_type(r) {} in custom_range_with_psplit() argument
195 … custom_range_with_psplit(custom_range_with_psplit& r, tbb::split) : base_type(r, tbb::split()) {} in custom_range_with_psplit() argument
[all …]
H A Dtest_broadcast_node.cpp92 for ( int r = 0; r < num_receivers; ++r ) { in test_serial_broadcasts() local
93 tbb::flow::make_edge( b, *receivers[r] ); in test_serial_broadcasts()
100 for ( int r = 0; r < num_receivers; ++r ) { in test_serial_broadcasts() local
102 CHECK_MESSAGE( (*receivers[r])[n] == 1, "" ); in test_serial_broadcasts()
104 tbb::flow::remove_edge( b, *receivers[r] ); in test_serial_broadcasts()
107 for ( int r = 0; r < num_receivers; ++r ) in test_serial_broadcasts() local
137 for ( int r = 0; r < num_receivers; ++r ) { in run_parallel_broadcasts() local
138 tbb::flow::make_edge( b, *receivers[r] ); in run_parallel_broadcasts()
143 for ( int r = 0; r < num_receivers; ++r ) { in run_parallel_broadcasts() local
147 tbb::flow::remove_edge( b, *receivers[r] ); in run_parallel_broadcasts()
[all …]
H A Dtest_continue_node.cpp76 for (size_t r = 0; r < num_receivers; ++r ) { in run_continue_nodes() local
77 tbb::flow::make_edge( n, *receivers[r] ); in run_continue_nodes()
86 for (size_t r = 0; r < num_receivers; ++r ) { in run_continue_nodes() local
87 size_t c = receivers[r]->my_count; in run_continue_nodes()
92 for (size_t r = 0; r < num_receivers; ++r ) { in run_continue_nodes() local
93 tbb::flow::remove_edge( n, *receivers[r] ); in run_continue_nodes()
150 for (size_t r = 0; r < num_receivers; ++r ) { in continue_nodes_with_copy() local
151 tbb::flow::make_edge( exe_node, *receivers[r] ); in continue_nodes_with_copy()
158 for (size_t r = 0; r < num_receivers; ++r ) { in continue_nodes_with_copy() local
159 size_t c = receivers[r]->my_count; in continue_nodes_with_copy()
[all …]
H A Dtest_write_once_node.cpp44 std::vector< std::shared_ptr<harness_counting_receiver<R>> > r; in simple_read_write_tests() local
46 r.push_back( std::make_shared<harness_counting_receiver<R>>(g) ); in simple_read_write_tests()
61 tbb::flow::make_edge( n, *r[i] ); in simple_read_write_tests()
66 size_t c = r[i]->my_count; in simple_read_write_tests()
92 size_t c = r[i]->my_count; in simple_read_write_tests()
96 tbb::flow::remove_edge( n, *r[i] ); in simple_read_write_tests()
100 size_t c = r[i]->my_count; in simple_read_write_tests()
142 tbb::flow::make_edge( wo_vec[node_idx], *r[i] ); in parallel_read_write_tests()
157 size_t c = r[i]->my_count; in parallel_read_write_tests()
161 tbb::flow::remove_edge( wo_vec[node_idx], *r[i] ); in parallel_read_write_tests()
[all …]
H A Dtest_overwrite_node.cpp43 std::vector< std::shared_ptr<harness_counting_receiver<R>> > r; in simple_read_write_tests() local
45 r.push_back( std::make_shared<harness_counting_receiver<R>>(g) ); in simple_read_write_tests()
58 tbb::flow::make_edge( n, *r[i] ); in simple_read_write_tests()
72 size_t c = r[i]->my_count; in simple_read_write_tests()
76 tbb::flow::remove_edge( n, *r[i] ); in simple_read_write_tests()
80 size_t c = r[i]->my_count; in simple_read_write_tests()
113 std::vector< std::shared_ptr<harness_counting_receiver<R>> > r; in parallel_read_write_tests() local
119 tbb::flow::make_edge( ow_vec[node_idx], *r[i] ); in parallel_read_write_tests()
133 size_t c = r[i]->my_count; in parallel_read_write_tests()
137 tbb::flow::remove_edge( ow_vec[node_idx], *r[i] ); in parallel_read_write_tests()
[all …]
/oneTBB/examples/parallel_for/tachyon/src/
H A Dring.cpp66 ring *r; in newring() local
73 r->ctr = ctr; in newring()
74 r->norm = norm; in newring()
75 r->inrad = inrad; in newring()
76 r->outrad = outrad; in newring()
84 min->x = r->ctr.x - r->outrad; in ring_bbox()
85 min->y = r->ctr.y - r->outrad; in ring_bbox()
86 min->z = r->ctr.z - r->outrad; in ring_bbox()
87 max->x = r->ctr.x + r->outrad; in ring_bbox()
88 max->y = r->ctr.y + r->outrad; in ring_bbox()
[all …]
H A Dtrace.tbb.cpp155 col.r += avcol.r; in render_one_pixel()
166 R = (int)(col.r * 255); in render_one_pixel()
211 r.cols().end() - r.cols().begin(), in operator ()()
212 r.rows().end() - r.rows().begin()); in operator ()()
213 for (int i = 1, y = r.rows().begin(); y != r.rows().end(); ++y, i++) { in operator ()()
215 for (int x = r.cols().begin(); x != r.cols().end(); x++) { in operator ()()
226 r.cols().end() - r.cols().begin(), in operator ()()
227 r.rows().end() - r.rows().begin()); in operator ()()
228 for (int i = 1, y = r.rows().begin(); y != r.rows().end(); ++y, i++) { in operator ()()
230 for (int x = r.cols().begin(); x != r.cols().end(); x++) { in operator ()()
[all …]
/oneTBB/include/oneapi/tbb/
H A Dblocked_range.h92 my_end(r.my_end), in __TBB_requires()
93 my_begin(do_split(r, split())), in __TBB_requires()
94 my_grainsize(r.my_grainsize) in __TBB_requires()
97 …__TBB_ASSERT( !(my_begin < r.my_end) && !(r.my_end < my_begin), "blocked_range has been split inco… in __TBB_requires()
104 my_end(r.my_end), in __TBB_requires()
105 my_begin(do_split(r, proportion)), in __TBB_requires()
106 my_grainsize(r.my_grainsize) in __TBB_requires()
109 …__TBB_ASSERT( !(my_begin < r.my_end) && !(r.my_end < my_begin), "blocked_range has been split inco… in __TBB_requires()
122 Value middle = r.my_begin + (r.my_end - r.my_begin) / 2u; in __TBB_requires()
123 r.my_end = middle; in __TBB_requires()
[all …]
H A Dblocked_range3d.h78 blocked_range3d( blocked_range3d& r, split split_obj ) : in __TBB_requires()
79 my_pages(r.my_pages), in __TBB_requires()
80 my_rows(r.my_rows), in __TBB_requires()
81 my_cols(r.my_cols) in __TBB_requires()
83 do_split(r, split_obj); in __TBB_requires()
86 blocked_range3d( blocked_range3d& r, proportional_split& proportion ) : in __TBB_requires()
87 my_pages(r.my_pages), in __TBB_requires()
88 my_rows(r.my_rows), in __TBB_requires()
89 my_cols(r.my_cols) in __TBB_requires()
91 do_split(r, proportion); in __TBB_requires()
[all …]
H A Dblocked_range2d.h71 blocked_range2d( blocked_range2d& r, split ) : in __TBB_requires()
72 my_rows(r.my_rows), in __TBB_requires()
73 my_cols(r.my_cols) in __TBB_requires()
76 do_split(r, split_obj); in __TBB_requires()
79 blocked_range2d( blocked_range2d& r, proportional_split& proportion ) : in __TBB_requires()
80 my_rows(r.my_rows), in __TBB_requires()
81 my_cols(r.my_cols) in __TBB_requires()
83 do_split(r, proportion); in __TBB_requires()
94 void do_split( blocked_range2d& r, Split& split_obj ) { in __TBB_requires()
96 my_cols.my_begin = col_range_type::do_split(r.my_cols, split_obj); in __TBB_requires()
[all …]
H A Dblocked_rangeNd.h101 …blocked_rangeNd_impl(blocked_rangeNd_impl& r, proportional_split proportion) : my_dims(r.my_dims) { in __TBB_requires()
102 do_split(r, proportion); in __TBB_requires()
105 blocked_rangeNd_impl(blocked_rangeNd_impl& r, split proportion) : my_dims(r.my_dims) { in __TBB_requires()
106 do_split(r, proportion); in __TBB_requires()
116 void do_split(blocked_rangeNd_impl& r, split_type proportion) { in __TBB_requires()
118 __TBB_ASSERT(r.is_divisible(), "can't split not divisible range"); in __TBB_requires()
124 auto r_it = r.my_dims.begin() + (my_it - my_dims.begin()); in __TBB_requires()
/oneTBB/test/common/
H A Diterator.h124 ForwardIterator ( const ForwardIterator& r ) : my_ptr(r.my_ptr){} in ForwardIterator() argument
133 bool operator== ( const ForwardIterator& r ) const { return my_ptr == r.my_ptr; }
150 RandomIterator ( const RandomIterator& r ) : my_ptr(r.my_ptr){} in RandomIterator() argument
165 bool operator== ( const RandomIterator& r ) const { return my_ptr == r.my_ptr; }
166 bool operator!= ( const RandomIterator& r ) const { return my_ptr != r.my_ptr; }
169 bool operator< (const RandomIterator &r) const {return my_ptr < r.my_ptr;}
170 bool operator> (const RandomIterator &r) const {return my_ptr > r.my_ptr;}
171 bool operator<=(const RandomIterator &r) const {return my_ptr <= r.my_ptr;}
172 bool operator>=(const RandomIterator &r) const {return my_ptr >= r.my_ptr;}
208 ConstRandomIterator ( const ConstRandomIterator& r ) : my_ptr(r.my_ptr){} in ConstRandomIterator() argument
[all …]
/oneTBB/test/conformance/
H A Dconformance_blocked_range3d.cpp93 utils::AssertSameType( r.is_divisible(), true ); in SerialTest()
95 utils::AssertSameType( r.empty(), true ); in SerialTest()
109 if( r.is_divisible() ) { in SerialTest()
110 range_type r2(r,oneapi::tbb::split()); in SerialTest()
111 …GetValueOf(r2.pages().begin())==GetValueOf(r.pages().begin())) && (GetValueOf(r2.rows().begin())==… in SerialTest()
116 …GetValueOf(r2.pages().begin())==GetValueOf(r.pages().begin())) && (GetValueOf(r2.cols().begin())==… in SerialTest()
144 void operator()( const oneapi::tbb::blocked_range3d<int>& r ) const { in operator ()()
145 …for( oneapi::tbb::blocked_range<int>::const_iterator i=r.pages().begin(); i!=r.pages().end(); ++i ) in operator ()()
146 … for( oneapi::tbb::blocked_range<int>::const_iterator j=r.rows().begin(); j!=r.rows().end(); ++j ) in operator ()()
147 … for( oneapi::tbb::blocked_range<int>::const_iterator k=r.cols().begin(); k!=r.cols().end(); ++k ) in operator ()()
[all …]
H A Dconformance_blocked_range.cpp64 range_type r( i, j, k ); in SerialTest() local
65 utils::AssertSameType( r.empty(), true ); in SerialTest()
70 CHECK( r.empty()==(y<=x)); in SerialTest()
71 CHECK( r.grainsize()==k); in SerialTest()
75 CHECK( r.size()==std::size_t(y-x) ); in SerialTest()
76 if( r.is_divisible() ) { in SerialTest()
78 CHECK( GetValueOf(r.begin())==x ); in SerialTest()
81 CHECK( r.grainsize()==k ); in SerialTest()
95 for( oneapi::tbb::blocked_range<int>::const_iterator i=r.begin(); i!=r.end(); ++i ) in operator ()()
102 const oneapi::tbb::blocked_range<int> r( 0, i, 10 ); in ParallelTest() local
[all …]
H A Dconformance_blocked_range2d.cpp83 range_type r( row_i, row_j, row_grain, col_i, col_j, col_grain ); in SerialTest() local
84 utils::AssertSameType( r.is_divisible(), true ); in SerialTest()
85 utils::AssertSameType( r.empty(), true ); in SerialTest()
90 REQUIRE( r.empty()==(row_x==row_y||col_x==col_y) ); in SerialTest()
92 if( r.is_divisible() ) { in SerialTest()
93 range_type r2(r,oneapi::tbb::split()); in SerialTest()
116 void operator()( const oneapi::tbb::blocked_range2d<int>& r ) const { in operator ()()
117 … for( oneapi::tbb::blocked_range<int>::const_iterator i=r.rows().begin(); i!=r.rows().end(); ++i ) in operator ()()
118 … for( oneapi::tbb::blocked_range<int>::const_iterator j=r.cols().begin(); j!=r.cols().end(); ++j ) in operator ()()
126 const oneapi::tbb::blocked_range2d<int> r( 0, i, 7, 0, j, 5 ); in ParallelTest() local
[all …]
H A Dconformance_blocked_rangeNd.cpp172 utils::AssertSameType(r.is_divisible(), bool()); in SerialTest()
173 utils::AssertSameType(r.empty(), bool()); in SerialTest()
176 REQUIRE((r.empty() == utils_t::is_empty(r) && r.empty())); in SerialTest()
177 REQUIRE(r.is_divisible() == utils_t::is_divisible(r)); in SerialTest()
180 …r = utils_t::make_range(1, true, &MakeAbstractValue, oneapi::tbb::detail::make_index_sequence<DimA… in SerialTest()
181 REQUIRE((r.empty() == utils_t::is_empty(r) && !r.empty())); in SerialTest()
182 REQUIRE((r.is_divisible() == utils_t::is_divisible(r) && r.is_divisible())); in SerialTest()
184 range_t r_new(r, oneapi::tbb::split()); in SerialTest()
185 utils_t::check_splitting(r, r_new, &GetValueOf); in SerialTest()
203 oneapi::tbb::parallel_for(r, [&data](const range_t& range) { in ParallelTest()
[all …]
/oneTBB/examples/parallel_reduce/primes/
H A Dprimes.cpp204 : my_stride(r.my_stride), in SieveRange()
206 my_end(r.my_end) { in SieveRange()
207 assert(r.is_divisible()); in SieveRange()
208 assert(r.assert_okay()); in SieveRange()
209 NumberType middle = r.my_begin + (r.my_end - r.my_begin + r.my_stride - 1) / 2; in SieveRange()
212 r.my_end = middle; in SieveRange()
214 assert(r.assert_okay()); in SieveRange()
251 void operator()(const SieveRange& r) { in operator ()() argument
264 for (NumberType j = r.begin(); j < r.end(); j += window_size) { in operator ()()
266 if (j + window_size > r.end()) in operator ()()
[all …]
/oneTBB/examples/parallel_for/seismic/
H A Duniverse.cpp83 ValueType r = t > 0 ? t : 0; in InitializeUniverse() local
87 c[2] = colorcomp_t(r * (255 - c[2]) + c[2]); in InitializeUniverse()
142 void Universe::UpdateStress(Rectangle const& r) { in UpdateStress() argument
143 drawing_area drawing(r.StartX(), r.StartY(), r.Width(), r.Height(), drawingMemory); in UpdateStress()
144 for (int i = r.StartY(); i < r.EndY(); ++i) { in UpdateStress()
145 drawing.set_pos(1, i - r.StartY()); in UpdateStress()
147 for (int j = r.StartX(); j < r.EndX(); ++j) { in UpdateStress()
182 void Universe::UpdateVelocity(Rectangle const& r) { in UpdateVelocity() argument
183 for (int i = r.StartY(); i < r.EndY(); ++i) in UpdateVelocity()
185 for (int j = r.StartX(); j < r.EndX(); ++j) in UpdateVelocity()
/oneTBB/doc/main/tbb_userguide/
H A DAdvanced_Topic_Other_Kinds_of_Iteration_Spaces.rst24 // Splits r into subranges r and *this
25 R( R& r, split );
26 // (optional) Splits r into subranges r and *this in proportion p
27 R( R& r, proportional_split p );
48 constructor should attempt to split ``r`` roughly into two halves, and
49 update ``r`` to be the first half, and set the constructed object as the
57 split ``r`` accordingly, so that the updated ``r`` corresponds to the
62 Both splitting constructors should guarantee that the updated ``r`` part
64 templates call the splitting constructors on ``r`` only if
65 ``r.is_divisible`` is true.
/oneTBB/src/tbb/
H A Dsemaphore.h101 int r = ::syscall(SYS_futex, futex, __TBB_FUTEX_WAIT, comparand, nullptr, nullptr, 0); in futex_wait() local
104 …__TBB_ASSERT(r == 0 || r == EWOULDBLOCK || (r == -1 && (e == EAGAIN || e == EINTR)), "futex_wait f… in futex_wait()
106 return r; in futex_wait()
110 int r = ::syscall(SYS_futex, futex, __TBB_FUTEX_WAKE, 1, nullptr, nullptr, 0); in futex_wakeup_one() local
111 __TBB_ASSERT(r == 0 || r == 1, "futex_wakeup_one: more than one thread woken up?"); in futex_wakeup_one()
112 return r; in futex_wakeup_one()
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_cache_impl.h244 if( r.priority() != no_priority ) in register_successor()
245 my_successors.push_front( &r ); in register_successor()
247 my_successors.push_back( &r ); in register_successor()
250 void remove_successor( successor_type& r ) { in remove_successor() argument
254 if ( *i == & r ) { in remove_successor()
297 if( r.priority() != no_priority ) in register_successor()
298 my_successors.push_front( &r ); in register_successor()
300 my_successors.push_back( &r ); in register_successor()
302 if ( r.is_continue_receiver() ) { in register_successor()
303 r.register_predecessor( *my_owner ); in register_successor()
[all …]
/oneTBB/examples/graph/som/
H A Dsom.cpp122 double SOMap::BMU_range(const SOM_element &s, int &xval, int &yval, subsquare_type &r) { in BMU_range() argument
126 for (int x = r.rows().begin(); x != r.rows().end(); ++x) { in BMU_range()
127 for (int y = r.cols().begin(); y != r.cols().end(); ++y) { in BMU_range()
135 xval = r.rows().begin(); in BMU_range()
136 yval = r.cols().begin(); in BMU_range()
152 oneapi::tbb::blocked_range<int> &r) { in epoch_update_range() argument
159 for (int xx = r.begin(); xx <= r.end(); ++xx) { in epoch_update_range()

123456