Home
last modified time | relevance | path

Searched refs:end (Results 1 – 25 of 158) sorted by relevance

1234567

/oneTBB/test/conformance/
H A Dconformance_blocked_range3d.cpp112 … REQUIRE( GetValueOf(r2.pages().end())==GetValueOf(r.pages().end()) ); in SerialTest()
113 … REQUIRE( GetValueOf(r2.rows().end())==GetValueOf(r.rows().end()) ); in SerialTest()
114 … REQUIRE( GetValueOf(r2.cols().begin())==GetValueOf(r.cols().end()) ); in SerialTest()
117 … REQUIRE( GetValueOf(r2.pages().end())==GetValueOf(r.pages().end()) ); in SerialTest()
118 … REQUIRE( GetValueOf(r2.cols().end())==GetValueOf(r.cols().end()) ); in SerialTest()
121 … REQUIRE( GetValueOf(r2.rows().end())==GetValueOf(r.rows().end()) ); in SerialTest()
122 … REQUIRE( GetValueOf(r2.cols().end())==GetValueOf(r.cols().end()) ); in SerialTest()
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_parallel_sort.cpp44 oneapi::tbb::parallel_sort(test_vector.begin(), test_vector.end());
46 for(auto it = test_vector.begin(); it != test_vector.end() - 1; ++it)
58 oneapi::tbb::parallel_sort(test_vector.begin(), test_vector.end(), std::greater<int>());
60 for(auto it = test_vector.begin(); it != test_vector.end() - 1; ++it)
74 for(auto it = test_vector.begin(); it != test_vector.end() - 1; ++it)
88 for(auto it = test_vector.begin(); it != test_vector.end() - 1; ++it)
H A Dconformance_blocked_range2d.cpp95 … REQUIRE( GetValueOf(r2.rows().end())==GetValueOf(r.rows().end()) ); in SerialTest()
96 … REQUIRE( GetValueOf(r2.cols().begin())==GetValueOf(r.cols().end()) ); in SerialTest()
98 … REQUIRE( GetValueOf(r2.cols().end())==GetValueOf(r.cols().end()) ); in SerialTest()
99 … REQUIRE( GetValueOf(r2.rows().begin())==GetValueOf(r.rows().end()) ); in SerialTest()
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 ()()
162 …original.rows().begin() + ps.left() * (original.rows().end() - original.rows().begin()) / (ps.left…
181 oneapi::tbb::blocked_range2d r1(v.begin(), v.end(), 2, v2.begin(), v2.end(), 2);
H A Dconformance_blocked_rangeNd.cpp72 …std::for_each(data.begin(), data.end(), range_utils<range_t, N - 1>::template init_data<EntityType… in init_data()
79 auto end = begin + range.dim(N - 1).size(); in increment_data() local
80 for (auto i = begin; i != end; ++i) { in increment_data()
89 auto end = begin + range.dim(N - 1).size(); in check_data() local
90 for (auto i = begin; i != end; ++i) { in check_data()
121 REQUIRE(get(range_split.dim(N - 1).end()) == get(range_new.dim(N - 1).end())); in check_splitting()
124 …REQUIRE((get(range_split.dim(N - 1).end()) == get(range_new.dim(N - 1).begin()) && !split_checker)… in check_splitting()
266 …original.dim(0).begin() + ps.left() * (original.dim(0).end() - original.dim(0).begin()) / (ps.left…
/oneTBB/src/tbb/
H A Dconcurrent_monitor.h54 inline const base_node* end() const { return &head; } in end() function
286 const base_node* end = my_waitset.end(); in notify_one_relaxed() local
291 if (n != end) { in notify_one_relaxed()
307 if (n != end) { in notify_one_relaxed()
325 const base_node* end; in notify_all_relaxed() local
331 end = temp.end(); in notify_all_relaxed()
364 const base_node* end = my_waitset.end(); in notify_relaxed() local
379 end = temp.end(); in notify_relaxed()
399 const base_node* end = my_waitset.end(); in notify_one_relaxed() local
433 const base_node* end; in abort_all_relaxed() local
[all …]
H A Denvironment.h58 char* end = nullptr;
60 long value = std::strtol(s, &end, 10);
63 if ( errno == ERANGE || value < 0 || end==s ) {
66 for ( ; *end != '\0'; end++ ) {
67 if ( !std::isspace(*end) ) {
/oneTBB/include/oneapi/tbb/
H A Dparallel_sort.h149 RandomAccessIterator my_end = range.end(); in operator()
194 do_parallel_quick_sort(begin, end, comp); in parallel_quick_sort()
200 parallel_for(blocked_range<RandomAccessIterator>(k + 1, end), in parallel_quick_sort()
206 do_parallel_quick_sort(begin, end, comp); in parallel_quick_sort()
240 if( end > begin ) { in __TBB_requires()
241 if( end - begin < min_parallel_size ) { in __TBB_requires()
242 std::sort(begin, end, comp); in __TBB_requires()
244 parallel_quick_sort(begin, end, comp); in __TBB_requires()
255 void parallel_sort( RandomAccessIterator begin, RandomAccessIterator end ) { in __TBB_requires()
266 parallel_sort(std::begin(rng), std::end(rng), comp); in __TBB_requires()
[all …]
/oneTBB/examples/parallel_reduce/convex_hull/
H A Dconvex_hull_bench.cpp130 H.insert(H.end(), P_reduced.begin(), P_reduced.end()); in divide_and_conquer()
136 H.insert(H.end(), H1.begin(), H1.end()); in divide_and_conquer()
137 H.insert(H.end(), H2.begin(), H2.end()); in divide_and_conquer()
143 hull.insert(hull.end(), points.begin(), points.end()); in quickhull()
153 hull.insert(hull.end(), H.begin(), H.end()); in quickhull()
215 dest.insert(dest.end(), src.begin(), src.end()); in appendVector()
544 H.insert(H.end(), P_reduced.begin(), P_reduced.end()); in divide_and_conquer()
555 H.insert(H.end(), H1.begin(), H1.end()); in divide_and_conquer()
556 H.insert(H.end(), H2.begin(), H2.end()); in divide_and_conquer()
566 hull.insert(hull.end(), points.begin(), points.end()); in quickhull()
[all …]
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DDivide_and_Conquer.rst71 void SerialQuicksort( T* begin, T* end ) {
72 if( end-begin>1 ) {
77 SerialQuicksort( mid, end );
90 void ParallelQuicksort( T* begin, T* end ) {
91 if( end-begin>1 ) {
108 void ParallelQuicksort( T* begin, T* end ) {
109 if( end-begin>=500 ) {
116 SerialQuicksort( begin, end );
152 for( Node::const_iterator y=x.begin();y!=x.end(); ++y )
176 for( Node::const_iterator y=x.begin(); y!=x.end(); ++y )
[all …]
/oneTBB/test/common/
H A Dconcurrent_ordered_common.h93 l_bound_check = cont.end(); in test_ordered_methods()
94 u_bound_check = cont.end(); in test_ordered_methods()
170 new (ptr) OrderedType(begin, end); in construct_container()
218 c1.insert(lst.begin(), lst.end());
229 c2.insert(it, lst.end());
234 c2_alloc.insert(it, lst.end());
239 c2_comp_alloc.insert(it, lst.end());
252 c4.insert(lst.begin(), lst.end());
257 c5.insert(lst.begin(), lst.end());
262 c6.insert(lst.begin(), lst.end());
[all …]
H A Dconcurrent_unordered_common.h124 new (ptr) UnorderedType(begin, end); in construct_container()
174 for (auto it = lst.begin(); it != lst.end();) { in CustomExamine()
211 c1.insert(lst.begin(), lst.end()); in TypeTester()
221 c2.insert(it, lst.end()); in TypeTester()
227 c2_alloc.insert(it, lst.end()); in TypeTester()
233 c2_hash_alloc.insert(it, lst.end()); in TypeTester()
246 c4.insert(lst.begin(), lst.end()); in TypeTester()
251 c4_alloc.insert(lst.begin(), lst.end()); in TypeTester()
256 c4_hash_alloc.insert(lst.begin(), lst.end()); in TypeTester()
260 Table c5(c1.begin(), c1.end()); in TypeTester()
[all …]
H A Dconcurrent_priority_queue_common.h40 std::reverse(v.begin(), v.end()); in toVector()
108 q1.assign(vec.begin(), vec.end()); in type_tester()
134 queue_type q5(vec.begin(), vec.end()); in type_tester()
139 q6.assign(vec.begin(), vec.end()); in type_tester()
144 q7.assign(vec.begin(), vec.end()); in type_tester()
148 q8.assign(vec.begin(), vec.end()); in type_tester()
153 q9.assign(vec.begin(), vec.end()); in type_tester()
157 q10.assign(vec.begin(), vec.end()); in type_tester()
161 q11.assign(vec.begin(), vec.end()); in type_tester()
165 queue_type q12(vec.begin(), vec.end(), comp); in type_tester()
[all …]
H A Dconcurrent_associative_common.h577 cont.insert(newcont.begin(), newcont.end());
734 if (it != my_table.end()) { // found
1117 do_test_range(r.begin(), r.end());
1125 REQUIRE(it2 != my_lst.end());
1152 REQUIRE(std::find(marks.begin(), marks.end(), false) == marks.end());
1158 REQUIRE(std::find(marks.begin(), marks.end(), false) == marks.end());
1161 REQUIRE(std::find(marks.begin(), marks.end(), false) == marks.end());
1164 REQUIRE(std::find(marks.begin(), marks.end(), false) == marks.end());
1398 for (auto it = keys.begin(); it != keys.end(); ++it) {
1407 for (auto it = keys.begin(); it != keys.end(); ++it) {
[all …]
/oneTBB/examples/parallel_for/tachyon/src/
H A Dutil.cpp87 double ttime, start, end; in timertime() local
90 end = ((double)fn) / ((double)1000.00); in timertime()
91 ttime = end - start; in timertime()
108 double ttime, start, end; in timertime() local
111 end = (fn.tv_sec + 1.0 * fn.tv_usec / 1000000.0); in timertime()
112 ttime = end - start; in timertime()
H A Dtrace.tbb.cpp210 totaly - r.rows().end(), in operator ()()
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 ()()
225 totaly - r.rows().end(), 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/test/tbb/
H A Dtest_concurrent_hash_map.cpp113 CHECK(it2 != my_lst.end()); in do_test_range()
212 CHECK(std::find( marks.begin(), marks.end(), false ) == marks.end()); in Examine()
215 CHECK(std::find( marks.begin(), marks.end(), false ) == marks.end()); in Examine()
219 CHECK(std::find( marks.begin(), marks.end(), false ) == marks.end()); in Examine()
264 c1.insert( lst.begin(), lst.end() ); in TypeTester()
271 c2.insert( it, lst.end() ); in TypeTester()
276 c3.insert( it, lst.end() ); in TypeTester()
281 c4.insert( it, lst.end()); in TypeTester()
292 c6.insert( lst.begin(), lst.end() ); in TypeTester()
299 c8.insert( lst.begin(), lst.end() ); in TypeTester()
[all …]
H A Dtest_blocked_range.cpp63 std::size_t end = r1.end(); variable
73 std::size_t newRangeBegin = end - right_idx;
79 bool test_passed = (r1.begin() == begin && r1.end() == r2.begin() && is_split_correct &&
80 r2.end() == end);
83 …lu) and r2[%lu, %lu)\n", begin, end, r1.begin(), r1.end(), r2.begin(), r2.end(), begin, newRangeBe…
H A Dtest_concurrent_vector.cpp46 std::sort( array.begin(), array.end() ); in TestSort()
71 new (ptr) container_type(begin, end); in construct_container()
78 new (ptr) container_type(begin, end, a); in construct_container()
221 c1.grow_by(init_list.begin(), init_list.end()); in test_scoped_allocator()
292 c.grow_by( c2.begin(), c2.end() ); in Examine()
317 std::copy( my_vec.begin(), my_vec.end(), c7.begin() ); in operator ()()
320 std::copy( c7.begin(), c7.end(), c8.begin() ); in operator ()()
330 std::copy( vec.begin(), vec.end(), std::back_inserter(c1) ); in TypeTester()
341 std::copy( vec.begin(), vec.end(), std::back_inserter(c4) ); in TypeTester()
352 tbb::concurrent_vector<Type> c11(vec.begin(), vec.end()); in TypeTester()
[all …]
H A Dtest_enumerable_thread_specific.cpp170 REQUIRE( static_cast<int>(a[i].end() - a[i].begin()) == 0 ); in flog_key_creation_and_deletion()
202 for(my_si=my_vec.begin(), ii=0; my_si != my_vec.end(); ++my_si, ++ii) { in flog_segmented_interator()
210 for(my_si=my_vec.begin(); my_si != my_vec.end(); ++my_si) { in flog_segmented_interator()
219 for(my_si = my_vec.begin(); my_si != my_vec.end(); ++my_si) { in flog_segmented_interator()
233 for(my_si = my_vec.begin(), ii=0; my_si != my_vec.end(); ++my_si, ++ii) { in flog_segmented_interator()
240 for(my_csi=my_vec.begin(), ii=0; my_csi != my_vec.end(); ++my_csi, ++ii) { in flog_segmented_interator()
248 for(my_csi=my_vec.begin(); my_csi != my_vec.end(); ++my_csi) { in flog_segmented_interator()
257 for(my_csi = my_vec.begin(); my_csi != my_vec.end(); ++my_csi) { in flog_segmented_interator()
271 for(my_csi = my_vec.begin(), ii=0; my_csi != my_vec.end(); ++my_csi, ++ii) { in flog_segmented_interator()
302 for(my_si=my_vec.begin(), ii=0; my_si != my_vec.end(); ++my_si, ++ii) { in flog_segmented_iterator_map()
[all …]
H A Dtest_intrusive_list.cpp88 for ( i = value_step - 1; it != il.end(); ++it, i += value_step ) { in check_list_nodes()
94 it = il.end(); in check_list_nodes()
96 for ( i = NumElements - 1, it--; it != il.end(); --it, i -= value_step ) { in check_list_nodes()
115 for (;it != il.end(); ++it) { in test_list_operations()
122 for (it = il.begin(); it != il.end(); ++it) { in test_list_operations()
129 for (it = il.begin(); it != il.end();) { in test_list_operations()
H A Dtest_parallel_reduce.cpp451 size_t begin, end; member in MinimalRange
456 MinimalRange( MinimalRange& r, tbb::split ) : end(r.end) { in MinimalRange()
457 begin = r.end = (r.begin+r.end)/2; in MinimalRange()
460 bool empty() const {return begin==end;} in empty()
474 size_t begin, end; member in FooBody
501 end = ~size_t(0); in init()
508 REQUIRE( end==s.begin ); in join()
509 end = s.end; in join()
514 for( size_t k=r.begin; k<r.end; ++k ) in operator ()()
520 REQUIRE( end==r.begin ); in operator ()()
[all …]
/oneTBB/examples/parallel_for/game_of_life/
H A DGame_of_life.cpp83 char* end; in ParseCommandLine() local
98 high = strtol(s, &end, 0); in ParseCommandLine()
99 low = strtol(s, &end, 0); in ParseCommandLine()
100 switch (*end) { in ParseCommandLine()
101 case ':': high = strtol(end + 1, nullptr, 0); break; in ParseCommandLine()
111 execution_time = strtol(argv[argc - 1], &end, 0); in ParseCommandLine()
H A DEvolution.cpp150 int end = (int)r.end(); //! capture upper range number for this chunk in operator ()() local
151 UpdateState(m_source, m_dest, begin, end); in operator ()()
168 std::size_t end = m_matrix->height; //! ending cell position in Step() local
170 std::size_t end = m_size - 1; //! ending cell position in Step() local
177 parallel_for(oneapi::tbb::blocked_range<std::size_t>(begin, end, GRAIN_SIZE), in Step()
H A DUpdate_state.cpp97 void UpdateState(Matrix* m_matrix, char* dest, int begin, int end) { in UpdateState() argument
100 unsigned size_sse_ar = size_sse_row * (end - begin); in UpdateState()
127 unsigned height = end - begin; in UpdateState()
146 if (end == m_matrix->height) { in UpdateState()
150 src = &mas[end * width]; in UpdateState()
165 height = end - begin + 2; in UpdateState()
175 height = end - begin + 2; in UpdateState()
188 height = end - begin + 2; in UpdateState()
201 height = end - begin; in UpdateState()
361 void UpdateState(Matrix* m_matrix, char* dest, int begin, int end) { in UpdateState() argument
[all …]
/oneTBB/examples/parallel_pipeline/square/
H A Dsquare.cpp66 char* end() { in end() function in TextSlice
114 std::size_t n = fread(next_slice->end(), 1, m, input_file); in operator ()()
124 char* p = t->end() + n; in operator ()()
131 next_slice->append(p, t->end() + n); in operator ()()
146 *input->end() = '\0'; in operator ()()
151 while (p < input->end() && !isdigit(*p)) in operator ()()
153 if (p == input->end()) in operator ()()

1234567