| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _flow_graph_tagged_buffer_impl.h | 62 size_t my_size; variable
68 size_t mask() { return my_size - 1; } in mask()
82 size_t my_size; member
85 my_pa(&pa), my_elements(&my_els), my_size(sz) { } in DoCleanup()
96 size_t new_size = my_size*2; in grow_array()
108 for(size_t i=0; i < my_size; ++i) { in grow_array()
123 my_size = new_size; in grow_array()
143 for(size_t i = 0; i < my_size; ++i) pointer_array[i] = nullptr; in internal_initialize_buffer()
145 set_up_free_list(&free_list, elements_array, my_size / 2); in internal_initialize_buffer()
209 if(nelements*2 > my_size) grow_array(); in insert_with_key()
[all …]
|
| H A D | _segment_table.h | 108 , my_size{}, my_segment_table_allocation_failed{}
238 size_type size = my_size.load(std::memory_order_relaxed); in reserve()
249 my_size.store(0, std::memory_order_relaxed); in clear()
349 my_size.store(other.my_size.load(std::memory_order_relaxed), std::memory_order_relaxed); in internal_transfer()
363 my_size = segment_base(i); in internal_transfer()
379 my_size.store(other.my_size.load(std::memory_order_relaxed), std::memory_order_relaxed); in internal_move()
393 other.my_size.store(0, std::memory_order_relaxed); in internal_move()
492 auto size = other.my_size.load(std::memory_order_relaxed); in internal_swap_fields()
493 other.my_size.store(my_size.load(std::memory_order_relaxed), std::memory_order_relaxed); in internal_swap_fields()
494 my_size.store(size, std::memory_order_relaxed); in internal_swap_fields()
[all …]
|
| H A D | _concurrent_unordered_base.h | 244 : my_size(0),
282 : my_size(other.my_size.load(std::memory_order_relaxed)), in concurrent_unordered_base()
297 : my_size(other.my_size.load(std::memory_order_relaxed)), in concurrent_unordered_base()
312 : my_size(other.my_size.load(std::memory_order_relaxed)), in concurrent_unordered_base()
323 : my_size(other.my_size.load(std::memory_order_relaxed)), in concurrent_unordered_base()
355 my_size.store(other.my_size.load(std::memory_order_relaxed), std::memory_order_relaxed);
368 my_size.store(other.my_size.load(std::memory_order_relaxed), std::memory_order_relaxed); in noexcept()
1012 auto sz = my_size.fetch_add(1); in internal_insert()
1187 … my_size.store(my_size.load(std::memory_order_relaxed) - 1, std::memory_order_relaxed); in internal_extract()
1424 my_size.store(other.my_size.load(std::memory_order_relaxed), std::memory_order_relaxed); in internal_swap_fields()
[all …]
|
| H A D | _concurrent_skip_list.h | 318 my_size(0), my_max_height(0) in concurrent_skip_list()
321 __TBB_ASSERT(my_size == other.my_size, "Wrong size of copy-constructed container"); in concurrent_skip_list()
326 my_size(0), my_max_height(0) in concurrent_skip_list()
329 __TBB_ASSERT(my_size == other.my_size, "Wrong size of copy-constructed container"); in concurrent_skip_list()
591 my_size.store(0, std::memory_order_relaxed); in clear()
620 return my_size.load(std::memory_order_relaxed); in size()
746 my_size.store(other.my_size.load(std::memory_order_relaxed), std::memory_order_relaxed); in internal_move()
763 my_size.store(0, std::memory_order_relaxed); in internal_move_construct_with_allocator()
1008 ++my_size; in internal_insert_node()
1184 swap_atomics_relaxed(my_size, other.my_size); in internal_swap_fields()
[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()
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()
131 my_size.store(other.my_size.load(std::memory_order_relaxed), std::memory_order_relaxed);
141 my_size.store(other.my_size.load(std::memory_order_relaxed), std::memory_order_relaxed);
220 my_size.store(other.my_size.load(std::memory_order_relaxed), std::memory_order_relaxed); in swap()
279 … my_size.store(my_size.load(std::memory_order_relaxed) - 1, std::memory_order_relaxed); in handle_operations()
299 … my_size.store(my_size.load(std::memory_order_relaxed) + 1, std::memory_order_relaxed); in handle_operations()
324 … my_size.store(my_size.load(std::memory_order_relaxed) - 1, std::memory_order_relaxed); in handle_operations()
329 … my_size.store(my_size.load(std::memory_order_relaxed) - 1, std::memory_order_relaxed); in handle_operations()
[all …]
|
| H A D | partitioner.h | 84 std::size_t my_size; variable
86 affinity_partitioner_base() : my_array(nullptr), my_size(0) {} in affinity_partitioner_base()
95 if (new_size != my_size) { in resize()
100 my_size = 0; in resize()
105 my_size = new_size; in resize()
194 depth_t my_size; variable
207 bool empty() const { return my_size == 0; } in empty()
208 depth_t size() const { return my_size; } in size()
219 my_size++; in split_to_fill()
225 my_size--; in pop_back()
[all …]
|
| H A D | parallel_for_each.h | 268 :my_size(0), my_wait_context(0), my_root_wait_context(root_wait_context),
283 __TBB_ASSERT( my_size > 0, "Negative size was passed to task");
284 for (std::size_t counter = 1; counter < my_size; ++counter) {
305 if (counter < my_size) {
313 std::size_t my_size;
332 : my_size(size), my_wait_context(0), my_root_wait_context(w_context),
348 __TBB_ASSERT( my_size > 0, "Negative size was passed to task");
349 for(std::size_t counter = 1; counter < my_size; ++counter) {
368 for(std::size_t counter = 0; counter < my_size; ++counter) {
374 std::size_t my_size;
[all …]
|
| H A D | memory_pool.h | 190 size_t my_size; variable
244 inline fixed_pool::fixed_pool(void *buf, size_t size) : my_buffer(buf), my_size(size) { in fixed_pool()
255 __TBBMALLOC_ASSERT(0 != self.my_size, "The buffer must not be used twice."); in allocate_request()
256 bytes = self.my_size; in allocate_request()
257 self.my_size = 0; // remember that buffer has been used in allocate_request()
|
| H A D | concurrent_vector.h | 488 return std::min(this->my_size.load(std::memory_order_acquire), capacity()); in size()
633 size_type curr_vector_size = this->my_size.load(std::memory_order_relaxed); in number_of_elements_in_segment()
751 if (index >= this->my_size.load(std::memory_order_acquire)) { in internal_subscript_with_exceptions()
775 size_type old_size = this->my_size++; in internal_emplace_back()
857 size_type start_idx = this->my_size.fetch_add(delta); in internal_grow_by_delta()
865 size_type old_size = this->my_size.load(std::memory_order_relaxed); in internal_grow_to_at_least()
907 size_type old_size = this->my_size.load(std::memory_order_acquire); in internal_resize()
929 this->my_size.store(n, std::memory_order_release); in internal_resize()
935 for (size_type i = 0; i < this->my_size.load(std::memory_order_relaxed); ++i) { in destroy_elements()
938 this->my_size.store(0, std::memory_order_relaxed); in destroy_elements()
[all …]
|
| H A D | concurrent_hash_map.h | 307 bool is_initial = !my_size.load(std::memory_order_relaxed); in reserve()
319 swap_atomics_relaxed(my_size, table.my_size); in internal_swap_content()
339 my_size.store(other.my_size.load(std::memory_order_relaxed), std::memory_order_relaxed); in internal_move()
340 other.my_size.store(0, std::memory_order_relaxed); in internal_move()
1011 this->my_size.store(0, std::memory_order_relaxed); in __TBB_requires()
1068 size_type size() const { return this->my_size.load(std::memory_order_acquire); } in __TBB_requires()
1411 this->my_size--; in __TBB_requires()
1456 this->my_size--; in __TBB_requires()
1489 this->reserve(source.my_size.load(std::memory_order_relaxed)); // TODO: load_factor? in __TBB_requires()
1503 this->my_size.fetch_add(1, std::memory_order_relaxed); in __TBB_requires()
[all …]
|
| /oneTBB/src/tbb/ |
| H A D | intrusive_list.h | 36 std::size_t my_size; variable
102 __TBB_ASSERT( (my_head.my_prev_node == &my_head && !my_size) || in assert_ok()
103 … (my_head.my_next_node != &my_head && my_size >0), "intrusive_list_base corrupted" ); in assert_ok()
108 __TBB_ASSERT( my_size == i, "Wrong size" ); in assert_ok()
116 intrusive_list_base () : my_size(0) { in intrusive_list_base()
123 std::size_t size () const { return my_size; } in size()
141 ++my_size; in push_front()
148 --my_size; in remove()
|
| H A D | dynamic_link.cpp | 191 atomic_incrementer my_size; member
195 const std::size_t ind = my_size++; in add()
201 const std::size_t size = my_size; in free()
|
| /oneTBB/test/common/ |
| H A D | custom_allocators.h | 29 const std::size_t my_size; member
35 my_size(sz * sizeof(T)) in ArenaData()
74 …REQUIRE_MESSAGE(my_data->my_allocated <= my_data->my_size, "Trying to allocate more than was reser… in allocate()
81 REQUIRE_MESSAGE((p >= my_data->my_buffer && p <= my_data->my_buffer + my_data->my_size), in deallocate()
83 REQUIRE_MESSAGE((p + n * sizeof(T) <= my_data->my_buffer + my_data->my_size), in deallocate()
89 return my_data->my_size / sizeof(T); in max_size()
|