| /oneTBB/test/tbb/ |
| H A D | test_parallel_scan.cpp | 102 …CHECK((!is_final || (storage.my_range.begin() == 0 && storage.my_range.end() == r.begin()) || (sto… in Scan() 104 storage.my_total += addend[i]; in Scan() 116 if (storage.my_range.empty()) in Scan() 117 storage.my_range = r; in Scan() 119 storage.my_range = Range(storage.my_range.begin(), r.end(), 1); in Scan() 125 storage.my_total = init; in ScanWithInit() 127 return storage; in ScanWithInit() 134 Storage<T> storage; member in Accumulator 205 storage.my_total = other.storage.my_total; in assign() 206 storage.my_range = other.storage.my_range; in assign() [all …]
|
| H A D | test_multifunction_node.cpp | 509 int storage; in test_precedes() local 510 …CHECK_MESSAGE((b1.try_get(storage) && !b1.try_get(storage) && b2.try_get(storage) && !b2.try_get(s… in test_precedes() 580 int storage; variable 581 …CHECK_MESSAGE((b1.try_get(storage) && !b1.try_get(storage) && b2.try_get(storage) && !b2.try_get(s…
|
| H A D | test_async_node.cpp | 746 output_t storage; in test_follows() local 747 …CHECK_MESSAGE((buf.try_get(storage) && buf.try_get(storage) && buf.try_get(storage) && !buf.try_ge… in test_follows() 778 output_t storage; in test_precedes() local 779 CHECK_MESSAGE((successor.try_get(storage) && !successor.try_get(storage)), in test_precedes()
|
| H A D | test_input_node.cpp | 284 bool storage; in test_follows_and_precedes_api() local 286 CHECK_MESSAGE((successor.try_get(storage) && !successor.try_get(storage)), in test_follows_and_precedes_api()
|
| H A D | test_continue_node.cpp | 352 continue_msg storage; in test_successor_cache_specialization() local 353 CHECK_MESSAGE((buf.try_get(storage) && !buf.try_get(storage)), in test_successor_cache_specialization()
|
| H A D | test_concurrent_vector.cpp | 69 …t_container(typename std::aligned_storage<sizeof(container_type)>::type& storage, iterator_type be… in construct_container() 70 container_type* ptr = reinterpret_cast<container_type*>(&storage); in construct_container() 76 …t_container(typename std::aligned_storage<sizeof(container_type)>::type& storage, iterator_type be… in construct_container() 77 container_type* ptr = reinterpret_cast<container_type*>(&storage); in construct_container()
|
| H A D | test_concurrent_hash_map.cpp | 474 …t_container(typename std::aligned_storage<sizeof(container_type)>::type& storage, iterator_type be… in construct_container() 475 container_type* ptr = reinterpret_cast<container_type*>(&storage); in construct_container() 481 …t_container(typename std::aligned_storage<sizeof(container_type)>::type& storage, iterator_type be… in construct_container() 482 container_type* ptr = reinterpret_cast<container_type*>(&storage); in construct_container()
|
| /oneTBB/test/common/ |
| H A D | test_follows_and_precedes_api.h | 70 typename NodeType::output_type storage; 71 …CHECK_MESSAGE((buffer.try_get(storage) && !buffer.try_get(storage)), "Not exact edge quantity was … 88 typename NodeType::output_type storage; 89 …CHECK_MESSAGE((buffer.try_get(storage) && !buffer.try_get(storage)), "Not exact edge quantity was … 102 typename NodeType::output_type storage; 120 …CHECK_MESSAGE((buf.try_get(storage) && ! buf.try_get(storage)), "Not exact edge quantity was made"… 165 SuccessorOutputType storage; 167 CHECK_MESSAGE((successor.try_get(storage) && !successor.try_get(storage)), 187 SuccessorOutputType storage; 218 typename NodeType::output_type storage; [all …]
|
| H A D | concurrent_unordered_common.h | 120 …eredType& construct_container( typename std::aligned_storage<sizeof(UnorderedType)>::type& storage, in construct_container() 123 UnorderedType* ptr = reinterpret_cast<UnorderedType*>(&storage); in construct_container() 129 …eredType& construct_container( typename std::aligned_storage<sizeof(UnorderedType)>::type& storage, in construct_container() 132 UnorderedType* ptr = reinterpret_cast<UnorderedType*>(&storage); in construct_container()
|
| H A D | container_move_support.h | 362 std::vector<typename std::aligned_storage<sizeof(T)>::type> storage; member 367 : storage(size_to_allocate), in ArenaAllocatorFixture() 368 arena_data(reinterpret_cast<T*>(&storage.front()), storage.size()), in ArenaAllocatorFixture() 391 … REQUIRE_MESSAGE(&(*source_arena_fixture.storage.begin()) != &(*dst_arena_fixture.storage.begin()), in TwoMemoryArenasFixture()
|
| H A D | concurrent_ordered_common.h | 166 …rderedType& construct_container( typename std::aligned_storage<sizeof(OrderedType)>::type& storage, in construct_container() 169 OrderedType* ptr = reinterpret_cast<OrderedType*>(&storage); in construct_container() 175 …rderedType& construct_container( typename std::aligned_storage<sizeof(OrderedType)>::type& storage, in construct_container() 178 OrderedType* ptr = reinterpret_cast<OrderedType*>(&storage); in construct_container()
|
| /oneTBB/src/tbb/ |
| H A D | arena.cpp | 293 unsigned char* storage = (unsigned char*)cache_aligned_allocate(n); in allocate_arena() local 295 std::memset( storage, 0, n ); in allocate_arena() 297 return *new( storage + num_arena_slots(num_slots, num_reserved_slots) * sizeof(mail_outbox) ) in allocate_arena() 334 void* storage = &mailbox(my_num_slots-1); in free_arena() local 338 std::memset( storage, 0, allocation_size(my_num_slots) ); in free_arena() 340 cache_aligned_deallocate( storage ); in free_arena()
|
| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _node_handle.h | 90 allocator_traits_type::destroy(my_allocator, my_node->storage()); in internal_destroy()
|
| H A D | _concurrent_skip_list.h | 121 pointer storage() { in storage() function 126 return *storage(); in value() 207 pointer operator->() const { return my_node_ptr->storage(); } 1112 … node_allocator_traits::construct(my_node_allocator, node->storage(), std::forward<Args>(args)...); in create_value_node() 1135 node_allocator_traits::destroy(my_node_allocator, node->storage()); in delete_value_node()
|
| H A D | _concurrent_unordered_base.h | 89 return my_node_ptr->storage(); 173 value_type* storage() { in storage() function 178 return *storage(); in value() 930 value_node_allocator_traits::destroy(value_node_allocator, val_node->storage()); in destroy_node() 1142 …value_node_allocator_traits::construct(value_node_allocator, new_node->storage(), std::forward<Arg… in create_node()
|
| /oneTBB/doc/main/reference/ |
| H A D | concurrent_lru_cache_cls.rst | 99 deallocates the used storage.
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | concurrent_hash_map.h | 646 pointer storage() { return &my_value; } in __TBB_requires() 647 value_type& value() { return *storage(); } in __TBB_requires() 656 node_allocator_traits::destroy(node_allocator, static_cast<node*>(n)->storage()); in __TBB_requires() 671 …node_allocator_traits::construct(node_allocator, node_ptr->storage(), std::forward<Args>(args)...); in __TBB_requires() 1593 return n->storage(); in __TBB_requires()
|
| /oneTBB/test/conformance/ |
| H A D | conformance_concurrent_hash_map.cpp | 551 …t_container(typename std::aligned_storage<sizeof(container_type)>::type& storage, iterator_type be… in construct_container() 552 container_type* ptr = reinterpret_cast<container_type*>(&storage); in construct_container() 558 …t_container(typename std::aligned_storage<sizeof(container_type)>::type& storage, iterator_type be… in construct_container() 559 container_type* ptr = reinterpret_cast<container_type*>(&storage); in construct_container()
|
| H A D | conformance_concurrent_vector.cpp | 651 …t_container(typename std::aligned_storage<sizeof(container_type)>::type& storage, iterator_type be… in construct_container() 652 container_type* ptr = reinterpret_cast<container_type*>(&storage); in construct_container() 658 …t_container(typename std::aligned_storage<sizeof(container_type)>::type& storage, iterator_type be… in construct_container() 659 container_type* ptr = reinterpret_cast<container_type*>(&storage); in construct_container()
|
| /oneTBB/ |
| H A D | third-party-programs.txt | 215 …ombined with it such as to form a larger program, in or on a volume of a storage or distribution m…
|