Home
last modified time | relevance | path

Searched refs:first_block (Results 1 – 3 of 3) sorted by relevance

/oneTBB/include/oneapi/tbb/
H A Dconcurrent_vector.h572 if (seg_index < first_block) { in create_segment()
581 size_type first_block_size = this->segment_size(first_block); in create_segment()
597 for (size_type i = 1; i < first_block; ++i) { in create_segment()
665 if (seg_index >= first_block) { in deallocate_segment()
669 …size_type elements_to_deallocate = first_block > 0 ? this->segment_size(first_block) : this->segme… in deallocate_segment()
954 segment_index_type k = first_block; in internal_compact()
955 if (k_stop < first_block) { in internal_compact()
962 if (k_stop == k_end && k == first_block) { in internal_compact()
967 if (k != first_block && k) { in internal_compact()
968 size_type max_block = std::max(first_block, k); in internal_compact()
[all …]
H A Dconcurrent_hash_map.h108 …static constexpr size_type first_block = 8; //including embedded_block. perfect with bucket size 1… variable
126 …__TBB_ASSERT( embedded_block <= first_block, "The first block number must include embedded blocks"… in hash_map_base()
185 if (k >= first_block) {
200 sz = segment_size(first_block);
211 for(segment_index_type i = embedded_block; i < first_block; i++) // calc the offsets
223 if (s >= first_block) { // the first segment or the next in delete_segment()
225 } else if (s == embedded_block && embedded_block != first_block) { in delete_segment()
226 deallocate_size = segment_size(first_block) - embedded_buckets; in delete_segment()
/oneTBB/include/oneapi/tbb/detail/
H A D_segment_table.h488 auto first_block = other.my_first_block.load(std::memory_order_relaxed); in internal_swap_fields() local
490 my_first_block.store(first_block, std::memory_order_relaxed); in internal_swap_fields()