Home
last modified time | relevance | path

Searched refs:my_begin (Results 1 – 11 of 11) sorted by relevance

/oneTBB/include/oneapi/tbb/
H A Dblocked_range.h56 my_end(end_), my_begin(begin_), my_grainsize(grainsize_) in __TBB_requires()
62 const_iterator begin() const { return my_begin; } in __TBB_requires()
71 return size_type(my_end-my_begin); in __TBB_requires()
82 bool empty() const { return !(my_begin<my_end); } in __TBB_requires()
93 my_begin(do_split(r, split())), 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()
105 my_begin(do_split(r, proportion)), 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()
115 Value my_begin; in __TBB_requires() local
122 Value middle = r.my_begin + (r.my_end - r.my_begin) / 2u; in __TBB_requires()
H A Dblocked_range3d.h108 my_cols.my_begin = col_range_type::do_split(r.my_cols, split_obj); in __TBB_requires()
110 my_rows.my_begin = row_range_type::do_split(r.my_rows, split_obj); in __TBB_requires()
114 my_cols.my_begin = col_range_type::do_split(r.my_cols, split_obj); in __TBB_requires()
116 my_pages.my_begin = page_range_type::do_split(r.my_pages, split_obj); in __TBB_requires()
H A Dblocked_rangeNd.h126 my_it->my_begin = tbb::blocked_range<value_type>::do_split(*r_it, proportion); in __TBB_requires()
130 __TBB_ASSERT(!(my_it->my_begin < r_it->my_end) && !(r_it->my_end < my_it->my_begin), in __TBB_requires()
H A Dblocked_range2d.h96 my_cols.my_begin = col_range_type::do_split(r.my_cols, split_obj); in __TBB_requires()
98 my_rows.my_begin = row_range_type::do_split(r.my_rows, split_obj); in __TBB_requires()
H A Dconcurrent_hash_map.h509 bool empty() const { return my_begin == my_end; } in empty()
521 r.my_end = my_begin = r.my_midpoint; in hash_map_range()
530 …my_begin( Iterator( map, 0, map.my_embedded_segment, map.my_embedded_segment->node_list.load(std::…
538 Iterator begin() const { return my_begin; } in begin()
544 Iterator my_begin;
556 size_t m = my_end.my_index-my_begin.my_index; in set_midpoint()
558 m = my_begin.my_index + m/2u; in set_midpoint()
559 auto b = my_begin.my_map->get_bucket(m); in set_midpoint()
560 my_midpoint = Iterator(*my_begin.my_map,m,b,b->node_list.load(std::memory_order_relaxed)); in set_midpoint()
564 __TBB_ASSERT( my_begin.my_index <= my_midpoint.my_index, in set_midpoint()
[all …]
H A Denumerable_thread_specific.h1068 my_container(const_cast<Container*>(&c)), my_begin(b), my_end(e) { }
1071 my_container(const_cast<Container*>(&c)), my_begin(c.begin()), my_end(c.end()) { }
1073 iterator begin() { return iterator(*my_container) = my_begin; }
1075 const_iterator begin() const { return const_iterator(*my_container) = my_begin; }
1080 for(typename Container::const_iterator i = my_begin; i != my_end; ++i) {
1088 typename Container::const_iterator my_begin;
H A Dparallel_for.h186 const Index my_begin; variable
190 : my_func(_func), my_begin(_begin), my_step(_step) {} in parallel_for_body_wrapper()
197 Index k = my_begin + b*ms; in operator()
/oneTBB/examples/parallel_reduce/primes/
H A Dprimes.cpp178 NumberType my_begin; member in SieveRange
187 assert(my_begin % my_stride == 0); in assert_okay()
188 assert(my_begin <= my_end); in assert_okay()
198 return my_end - my_begin > my_grainsize; in is_divisible()
201 return my_end <= my_begin; in empty()
209 NumberType middle = r.my_begin + (r.my_end - r.my_begin + r.my_stride - 1) / 2; in SieveRange()
211 my_begin = middle; in SieveRange()
220 return my_begin; in begin()
226 : my_begin(begin), in SieveRange()
/oneTBB/test/tbb/
H A Dtest_partitioner.h99 size_t my_begin, my_end;
106 , my_begin(_begin), my_end(_end) in RangeBase()
112 size_t middle = r.my_begin + (r.my_end - r.my_begin) / 2u; in RangeBase()
113 r.my_end = my_begin = middle; in RangeBase()
125 r.my_end = my_begin = r.my_end - right_part; in RangeBase()
127 CHECK_MESSAGE((r.my_end != r.my_begin && my_end != my_begin), "Incorrect range split"); in RangeBase()
130 size_t begin() const { return my_begin; } in begin()
132 bool is_divisible() const { return (my_end - my_begin) > 1; } in is_divisible()
133 bool empty() const { return my_end == my_begin; } in empty()
134 size_t size() const { return my_end - my_begin; } in size()
/oneTBB/include/oneapi/tbb/detail/
H A D_concurrent_skip_list.h674 return my_begin.my_node_ptr ? (my_begin.my_node_ptr->next(0) == my_end.my_node_ptr) in empty()
679 return my_begin.my_node_ptr && my_level != 0 in is_divisible()
684 size_type size() const { return std::distance(my_begin, my_end); } in size()
690 my_begin = my_end; in const_range_type()
693 my_begin = iterator(r.my_begin.my_node_ptr->next(r.my_level - 1)); in const_range_type()
694 my_level = my_begin.my_node_ptr->height(); in const_range_type()
696 r.my_end = my_begin; in const_range_type()
700 : my_end(l.end()), my_begin(l.begin()), in const_range_type()
701 my_level(my_begin.my_node_ptr ? my_begin.my_node_ptr->height() : 0) {} in const_range_type()
703 iterator begin() const { return my_begin; } in begin()
[all …]
/oneTBB/test/common/
H A Dparallel_for_each_common.h295 iterator_type my_begin, my_end; member
299 my_begin {my_vec.data()}, in generic_iterator_container()
303 iterator_type begin() const { return my_begin; } in begin()