| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _segment_table.h | 103 internal_move(std::move(other));
121 if (this != &other) {
134 if (this != &other) { in noexcept()
141 void swap( segment_table& other ) in swap() argument
147 if (this != &other) { in swap()
381 if (other.get_table() == other.my_embedded_table) { in internal_move()
390 other.my_segment_table.store(other.my_embedded_table, std::memory_order_relaxed); in internal_move()
441 internal_swap_fields(other); in internal_swap()
451 internal_swap_fields(other); in internal_swap()
457 other.get_table() == other.my_embedded_table) { in internal_swap_fields()
[all …]
|
| H A D | _concurrent_unordered_base.h | 80 my_node_ptr = other.my_node_ptr;
287 my_segments(other.my_segments) in concurrent_unordered_base()
290 internal_copy(other); in concurrent_unordered_base()
305 internal_copy(other); in concurrent_unordered_base()
319 move_content(std::move(other)); in concurrent_unordered_base()
353 if (this != &other) {
366 if (this != &other) { in noexcept()
388 if (this != &other) { in swap()
1409 internal_swap_fields(other); in internal_swap()
1415 internal_swap_fields(other); in internal_swap()
[all …]
|
| H A D | _concurrent_skip_list.h | 317 my_compare(other.my_compare), my_rng(other.my_rng), my_head_ptr(nullptr), in concurrent_skip_list()
320 internal_copy(other); in concurrent_skip_list()
328 internal_copy(other); in concurrent_skip_list()
333 : my_node_allocator(std::move(other.my_node_allocator)), my_compare(other.my_compare), in concurrent_skip_list()
353 if (this != &other) {
357 my_rng = other.my_rng;
358 internal_copy(other);
364 if (this != &other) {
636 if (this != &other) { in swap()
1082 internal_copy(other.begin(), other.end()); in internal_copy()
[all …]
|
| H A D | _flow_graph_impl.h | 56 graph_iterator(const graph_iterator& other) : in graph_iterator() argument
57 my_graph(other.my_graph), current_node(other.current_node) in graph_iterator()
61 graph_iterator& operator=(const graph_iterator& other) {
62 if (this != &other) {
63 my_graph = other.my_graph;
64 current_node = other.current_node;
76 bool operator==(const graph_iterator& other) const {
77 return ((my_graph == other.my_graph) && (current_node == other.current_node));
82 bool operator!=(const graph_iterator& other) const { return !(operator==(other)); }
|
| /oneTBB/test/common/ |
| H A D | custom_allocators.h | 62 : my_data(other.my_data) {} in ArenaAllocator()
148 : base_type(other), max_items{other.max_items} { set_counters(other); } in LocalCountingAllocator()
152 : base_type(other), max_items{other.max_items} { set_counters(other); } in LocalCountingAllocator()
155 base_type::operator=(other);
156 max_items = other.max_items;
157 set_counters(other);
267 StaticCountingAllocator( const StaticCountingAllocator<U>& other ) : base_type(other) {} in StaticCountingAllocator() argument
468 my_value = other.my_value;
534 : Allocator(other),
542 : Allocator(other),
[all …]
|
| H A D | checktype.h | 64 CheckType( const CheckType& other ) : DestroyedTracker(other) { in CheckType() argument
66 CHECK_FAST(other.is_alive()); in CheckType()
67 my_id = other.my_id; in CheckType()
68 am_ready = other.am_ready; in CheckType()
78 CheckType& operator=( const CheckType& other ) {
80 CHECK_FAST(other.is_alive());
81 my_id = other.my_id;
82 am_ready = other.am_ready;
|
| H A D | test_invoke.h | 42 SmartRange(SmartRange& other, oneapi::tbb::split) in SmartRange() argument
43 : base_range(other, oneapi::tbb::split{}), change_vector(other.change_vector) {} in SmartRange()
119 SmartValue operator+(const SmartValue& other) const {
120 return SmartValue{real_value + other.real_value};
122 std::size_t operator-(const SmartValue& other) const {
123 return real_value - other.real_value;
128 bool operator<(const SmartValue& other) const {
129 return real_value < other.real_value;
|
| H A D | utils.h | 323 Movable(Movable&& other) {
324 CHECK_MESSAGE(other.alive, "Moving from a dead object");
326 other.alive = false;
328 Movable& operator=(Movable&& other) {
330 CHECK_MESSAGE(other.alive, "Assignment of a dead object");
331 other.alive = false;
334 Movable& operator=(const Movable& other) {
336 CHECK_MESSAGE(other.alive, "Assignment of a dead object");
339 Movable(const Movable& other) {
340 CHECK_MESSAGE(other.alive, "Const reference to a dead object");
[all …]
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | concurrent_priority_queue.h | 100 …: mark(other.mark), my_size(other.my_size.load(std::memory_order_relaxed)), my_compare(other.my_co… in concurrent_priority_queue()
101 data(other.data) in concurrent_priority_queue()
107 …: mark(other.mark), my_size(other.my_size.load(std::memory_order_relaxed)), my_compare(other.my_co… in concurrent_priority_queue()
114 …: mark(other.mark), my_size(other.my_size.load(std::memory_order_relaxed)), my_compare(other.my_co… in concurrent_priority_queue()
121 …: mark(other.mark), my_size(other.my_size.load(std::memory_order_relaxed)), my_compare(other.my_co… in concurrent_priority_queue()
128 if (this != &other) {
129 data = other.data;
130 mark = other.mark;
137 if (this != &other) {
140 mark = other.mark;
[all …]
|
| H A D | enumerable_thread_specific.h | 337 swap(my_key, other.my_key);
338 super::table_swap(other);
383 …my_container( other.my_container ), my_index( other.my_index), my_value( const_cast<Value *>(other…
963 internal_copy(other);
969 internal_copy(other);
975 internal_swap(other);
986 if( this != &other ) {
989 internal_copy( other );
1000 internal_copy(other);
1006 if( this != &other ) {
[all …]
|
| H A D | concurrent_lru_cache.h | 240 handle_object(handle_object&& other)
241 : my_lru_cache_ptr(other.my_lru_cache_ptr), my_map_record_ptr(other.my_map_record_ptr) {
244 (other.my_lru_cache_ptr != nullptr && other.my_map_record_ptr != nullptr) ||
245 (other.my_lru_cache_ptr == nullptr && other.my_map_record_ptr == nullptr),
248 other.my_lru_cache_ptr = nullptr;
249 other.my_map_record_ptr = nullptr;
254 (other.my_lru_cache_ptr != nullptr && other.my_map_record_ptr != nullptr) ||
255 (other.my_lru_cache_ptr == nullptr && other.my_map_record_ptr == nullptr),
261 my_lru_cache_ptr = other.my_lru_cache_ptr;
263 other.my_lru_cache_ptr = nullptr;
[all …]
|
| H A D | concurrent_queue.h | 143 my_allocator = other.my_allocator;
154 internal_swap(other);
156 …my_queue_representation->assign(*other.my_queue_representation, other.my_allocator, move_construct…
157 other.clear();
180 void swap ( concurrent_queue& other ) { in swap() argument
183 internal_swap(other); in swap()
422 my_allocator = other.my_allocator;
433 internal_swap(other);
435 …my_queue_representation->assign(*other.my_queue_representation, other.my_allocator, move_construct…
436 other.clear();
[all …]
|
| H A D | global_control.h | 127 task_scheduler_handle(const task_scheduler_handle& other) = delete;
128 task_scheduler_handle& operator=(const task_scheduler_handle& other) = delete;
131 task_scheduler_handle(task_scheduler_handle&& other) noexcept { in task_scheduler_handle() argument
132 std::swap(m_ctl, other.m_ctl); in task_scheduler_handle()
134 task_scheduler_handle& operator=(task_scheduler_handle&& other) noexcept {
135 std::swap(m_ctl, other.m_ctl);
|
| H A D | concurrent_hash_map.h | 389 my_map(other.my_map), in hash_map_iterator()
390 my_index(other.my_index), in hash_map_iterator()
391 my_bucket(other.my_bucket), in hash_map_iterator()
392 my_node(other.my_node) in hash_map_iterator()
396 my_map = other.my_map;
397 my_index = other.my_index;
398 my_bucket = other.my_bucket;
399 my_node = other.my_node;
1538 other.size()); in __TBB_requires()
1556 … internal_copy(std::make_move_iterator(other.begin()), std::make_move_iterator(other.end()), in __TBB_requires()
[all …]
|
| H A D | cache_aligned_allocator.h | 75 using other = cache_aligned_allocator<U>; member
94 using other = cache_aligned_allocator<U>; member
146 bool do_is_equal(const std::pmr::memory_resource& other) const noexcept override { in do_is_equal() argument
147 if (this == &other) { return true; } in do_is_equal()
149 … const cache_aligned_resource* other_res = dynamic_cast<const cache_aligned_resource*>(&other); in do_is_equal()
|
| H A D | concurrent_vector.h | 80 : my_vector(other.my_vector), my_index(other.my_index), my_item(other.my_item) in vector_iterator()
84 my_vector = other.my_vector;
85 my_index = other.my_index;
86 my_item = other.my_item;
323 grow_by(other.begin(), other.end()); in concurrent_vector()
330 : base_type(other, alloc) {} in concurrent_vector()
333 : base_type(std::move(other)) in concurrent_vector()
337 : base_type(std::move(other), alloc) in concurrent_vector()
349 base_type::operator=(other);
354 base_type::operator=(std::move(other)); in noexcept()
[all …]
|
| H A D | concurrent_set.h | 82 …concurrent_set( const concurrent_set& other, const allocator_type& alloc ) : base_type(other, allo… in concurrent_set() argument
84 …concurrent_set( concurrent_set&& other, const allocator_type& alloc ) : base_type(std::move(other)… in concurrent_set() argument
183 …concurrent_multiset( const concurrent_multiset& other, const allocator_type& alloc ) : base_type(o… in concurrent_multiset() argument
185 …concurrent_multiset( concurrent_multiset&& other, const allocator_type& alloc ) : base_type(std::m… in concurrent_multiset() argument
|
| /oneTBB/test/conformance/ |
| H A D | conformance_parallel_for.cpp | 93 FooBody( const FooBody& other ) : array(other.array), state(other.state) { in FooBody() argument
254 SmartIndex(const SmartIndex& other) : real_index(other.real_index), in SmartIndex() argument
258 SmartIndex& operator=(const SmartIndex& other) { in operator =() argument
259 real_index = other.real_index; in operator =()
260 change_vector = other.change_vector; in operator =()
264 bool operator<(const SmartIndex& other) const { in operator <()
265 return real_index < other.real_index; in operator <()
268 bool operator<=(const SmartIndex& other) const { in operator <=()
269 return real_index <= other.real_index; in operator <=()
285 real_index += other.real_index; in operator +=()
[all …]
|
| H A D | conformance_concurrent_priority_queue.cpp | 92 MoveOperationTrackerBase( const MoveOperationTrackerBase& other ) : value(other.value) { in MoveOperationTrackerBase()
93 REQUIRE_MESSAGE(other.value, "The object has been moved or destroyed"); in MoveOperationTrackerBase()
97 MoveOperationTrackerBase( MoveOperationTrackerBase&& other ) noexcept : value(other.value) { in MoveOperationTrackerBase()
99 other.value = 0; in MoveOperationTrackerBase()
105 value = other.value; in operator =()
112 value = other.value; in operator =()
113 other.value = 0; in operator =()
118 bool operator<( const MoveOperationTrackerBase& other ) const { in operator <()
121 return value < other.value; in operator <()
288 bool operator<(const NoDefaultCtorType& other) const { in operator <()
[all …]
|
| /oneTBB/examples/graph/som/ |
| H A D | som.hpp | 89 bool operator==(SOM_element const &other) const { in operator ==()
91 if (w[i] != other.w[i]) { in operator ==()
97 bool operator!=(SOM_element const &other) const { in operator !=()
98 return !operator==(other); in operator !=()
100 void elementwise_max(SOM_element const &other) { in elementwise_max() argument
102 if (w[i] < other.w[i]) in elementwise_max()
103 w[i] = other.w[i]; in elementwise_max()
105 void elementwise_min(SOM_element const &other) { in elementwise_min() argument
107 if (w[i] > other.w[i]) in elementwise_min()
108 w[i] = other.w[i]; in elementwise_min()
|
| /oneTBB/examples/parallel_for_each/parallel_preorder/ |
| H A D | Graph.cpp | 23 Cell::Cell(const Cell& other) : op(other.op), value(other.value), successor(other.successor) { in Cell() argument
24 ref_count = other.ref_count.load(); in Cell()
26 input[0] = other.input[0]; in Cell()
27 input[1] = other.input[1]; in Cell()
|
| /oneTBB/examples/parallel_reduce/primes/ |
| H A D | primes.cpp | 136 void move(Multiples& other) { in move() argument
139 std::swap(my_striker, other.my_striker); in move()
140 std::swap(my_is_composite, other.my_is_composite); in move()
143 assert(my_factor == other.my_factor); in move()
144 other.my_factor = nullptr; in move()
271 void join(Sieve& other) { in join() argument
272 count += other.count; in join()
275 multiples.move(other.multiples); in join()
277 Sieve(Sieve& other, oneapi::tbb::split) in Sieve() argument
278 : multiples(other.multiples, oneapi::tbb::split()), in Sieve()
|
| /oneTBB/test/tbb/ |
| H A D | test_concurrent_priority_queue.cpp | 57 const MyDataType operator+( const MyDataType& other ) const { in operator +()
58 return MyDataType(int(priority + other.priority)); in operator +()
61 bool operator==(const MyDataType& other) const { in operator ==()
62 return this->priority == other.priority; in operator ==()
95 MyThrowingType& operator=( const MyThrowingType& other ) { in operator =()
96 priority = other.priority; in operator =()
|
| /oneTBB/doc/main/reference/ |
| H A D | concurrent_lru_cache_cls.rst | 68 handle( handle&& other );
72 handle& operator=( handle&& other );
127 .. cpp:function:: handle( handle&& other );
130 from ``other`` to the newly constructed object. Upon completion,
131 ``other`` no longer refers to any value.
143 .. cpp:function:: handle& operator=( handle&& other );
145 … **Effects**: Transfers the reference to a value stored in ``concurrent_lru_cache`` from ``other``
147 completion ``other`` no longer refers to any value.
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | work_isolation.rst | 11 group of tasks to complete might execute other available tasks. In
34 might be simultaneously assigned to the same thread. In other words,
60 In other scenarios, the described behavior might lead to deadlocks
61 and other issues. In these cases, a stronger guarantee of execution
64 not interfere with other simultaneously running tasks.
98 within the region and their child tasks spawned by other threads. The
100 belonging to other isolated regions.
|