Home
last modified time | relevance | path

Searched refs:my_array (Results 1 – 5 of 5) sorted by relevance

/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_item_buffer_impl.h44 buffer_item_type *my_array; variable
53 …__TBB_ASSERT(!(size_type(&(my_array[i&(my_array_size-1)].begin()->second))%alignment_of<buffer_ite… in item()
54 …__TBB_ASSERT(!(size_type(&(my_array[i&(my_array_size-1)].begin()->first))%alignment_of<item_type>:… in item()
55 return *my_array[i & (my_array_size - 1) ].begin(); in item()
60 …__TBB_ASSERT(!(size_type(&(my_array[i&(my_array_size-1)].begin()->first))%alignment_of<item_type>:… in item()
61 return *my_array[i & (my_array_size-1)].begin(); in item()
179 my_array = new_array; in grow_my_array()
213 if (my_array) { in clean_up_buffer()
218 allocator_type().deallocate(my_array,my_array_size); in clean_up_buffer()
220 my_array = nullptr; in clean_up_buffer()
[all …]
H A D_concurrent_queue_base.h524 my_array[i] = my_queue_rep->array[i].get_head_page(); in concurrent_queue_iterator_base()
538 my_array[i] = other.my_array[i]; in assign()
553 padded_page*& root = my_array[queue_rep_type::index(k)]; in advance()
571 padded_page* p = my_array[queue_rep_type::index(k)]; in get_item()
582 padded_page* my_array[queue_rep_type::n_queue]{};
/oneTBB/include/oneapi/tbb/
H A Dpartitioner.h82 slot_id* my_array; variable
96 if (my_array) { in resize()
97 r1::cache_aligned_deallocate(my_array); in resize()
99 my_array = nullptr; in resize()
530 slot_id* my_array; variable
537 my_array = ap.my_array; in affinity_partition_type()
543 , my_array(p.my_array) {} in affinity_partition_type()
546 , my_array(p.my_array) {} in affinity_partition_type()
549 my_array[my_head] = id; in note_affinity()
553 if (!my_array[my_head]) { in spawn_task()
[all …]
/oneTBB/test/tbb/
H A Dtest_parallel_scan.cpp132 const std::vector<T> &my_array; member in Accumulator
162 my_array(array), my_sum(sum), storage(init), my_state(full) in Accumulator()
172 my_array(a.my_array), my_sum(a.my_sum), storage(0), my_state(partial) in Accumulator()
188 Scan(r, Tag::is_final_scan(), storage, my_sum, my_array); in operator ()()
H A Dtest_eh_algorithms.cpp775 std::vector<std::size_t> my_array; member
777 adaptive_range(std::size_t size) : my_array(size + 1) {} in adaptive_range()
781 return iterator{&my_array.front()}; in begin()
784 return iterator{&my_array.front()}; in begin()
787 return iterator{&my_array.back()}; in end()
790 return iterator{&my_array.back()}; in end()