Home
last modified time | relevance | path

Searched refs:size_type (Results 1 – 25 of 49) sorted by relevance

12

/oneTBB/include/oneapi/tbb/
H A Dconcurrent_vector.h46 using size_type = typename vector_type::size_type; variable
172 size_type my_index;
265 using size_type = std::size_t; variable
428 reference at( size_type index ) { in at()
499 void reserve( size_type n ) { in reserve()
510 void resize( size_type n ) { in resize()
688 size_type i = 0; in copy_segment()
711 size_type i = 0; in move_segment()
828 iterator internal_grow( size_type start_idx, size_type end_idx, const Args&... args ) { in internal_grow()
894 size_type cap = capacity(); in internal_grow_to_at_least()
[all …]
H A Dblocked_range.h52 using size_type = std::size_t; in __TBB_requires() local
55 blocked_range( Value begin_, Value end_, size_type grainsize_=1 ) : in __TBB_requires()
69 size_type size() const { in __TBB_requires()
71 return size_type(my_end-my_begin); in __TBB_requires()
75 size_type grainsize() const { return my_grainsize; } in __TBB_requires()
116 size_type my_grainsize; in __TBB_requires()
137 size_type right_part = size_type(float(r.size()) * float(proportion.right()) in __TBB_requires()
H A Dconcurrent_priority_queue.h47 using size_type = std::size_t; variable
170 size_type size() const { return my_size.load(std::memory_order_relaxed); } in size()
219 size_type sz = my_size.load(std::memory_order_relaxed); in swap()
235 size_type sz;
348 size_type cur_pos = mark; in heapify()
351 size_type parent = (cur_pos - 1) >> 1; in heapify()
364 size_type cur_pos = 0, child = 1; in reheap()
367 size_type target = child; in reheap()
401 size_type mark;
402 std::atomic<size_type> my_size;
[all …]
H A Dconcurrent_hash_map.h82 using size_type = std::size_t;
151 for (size_type i = 0; i < sz; ++i) { in init_buckets_impl()
183 size_type sz;
221 size_type deallocate_size = 0; in delete_segment()
305 void reserve(size_type buckets) { in reserve()
380 using size_type = typename Container::size_type; variable
502 using size_type = std::size_t;
611 using size_type = typename base_type::size_type; in __TBB_requires() local
962 void rehash(size_type sz = 0) { in __TBB_requires()
1074 size_type max_size() const { in __TBB_requires()
[all …]
H A Dtbb_allocator.h79 using size_type = std::size_t; variable
84 size_type max_size() const noexcept { in max_size()
85 size_type max = ~(std::size_t(0)) / sizeof(value_type); in max_size()
H A Dmemory_pool.h94 typedef size_t size_type; typedef
109 pointer allocate( size_type n, const void* /*hint*/ = nullptr) {
116 void deallocate( pointer p, size_type ) { in deallocate() argument
120 size_type max_size() const throw() { in max_size()
121 size_type max = static_cast<size_type>(-1) / sizeof (value_type); in max_size()
H A Dblocked_range3d.h59 …blocked_range3d( PageValue page_begin, PageValue page_end, typename page_range_type::size_type pag… in __TBB_requires()
60 … RowValue row_begin, RowValue row_end, typename row_range_type::size_type row_grainsize, in __TBB_requires()
61 … ColValue col_begin, ColValue col_end, typename col_range_type::size_type col_grainsize ) : in __TBB_requires()
H A Dscalable_allocator.h243 using size_type = std::size_t; variable
248 size_type max_size() const noexcept { in max_size()
249 size_type absolutemax = static_cast<size_type>(-1) / sizeof (value_type); in max_size()
H A Dblocked_range2d.h48 …blocked_range2d( RowValue row_begin, RowValue row_end, typename row_range_type::size_type row_grai… in __TBB_requires()
49 … ColValue col_begin, ColValue col_end, typename col_range_type::size_type col_grainsize ) : in __TBB_requires()
H A Denumerable_thread_specific.h349 typename Container::size_type my_index;
375 …enumerable_thread_specific_iterator( const Container &container, typename Container::size_type ind…
524 using size_type = typename SegmentedContainer::size_type;
832 using size_type = typename internal_collection_type::size_type;
898 size_type size() const { return my_locals.size(); }
1055 using size_type = typename conval_type::size_type;
1078 size_type size() const {
1079 size_type tot_size = 0;
H A Dconcurrent_queue.h59 using size_type = std::size_t;
208 size_type unsafe_size() const { in unsafe_size()
210 return size < 0 ? 0 : size_type(size); in unsafe_size()
334 using size_type = std::ptrdiff_t;
515 void set_capacity( size_type new_capacity ) { in set_capacity()
520 size_type capacity() const { in capacity()
554 static constexpr std::ptrdiff_t infinite_capacity = std::ptrdiff_t(~size_type(0) / 2);
/oneTBB/include/oneapi/tbb/detail/
H A D_segment_table.h48 using size_type = std::size_t; variable
60 static constexpr size_type pointers_per_long_table = sizeof(size_type) * 8;
209 size_type capacity() const noexcept { in capacity()
222 size_type end = 0; in find_last_allocated_segment()
233 void reserve( size_type n ) { in reserve()
277 …void extend_table_if_necessary(segment_table_type& table, size_type start_index, size_type end_ind… in extend_table_if_necessary()
314 static constexpr size_type segment_base( size_type index ) { in segment_base()
315 return size_type(1) << index & ~size_type(1); in segment_base()
319 static constexpr size_type segment_size( size_type index ) { in segment_size()
531 size_type zero = 0; in assign_first_block_if_necessary()
[all …]
H A D_flow_graph_item_buffer_impl.h40 typedef size_t size_type; typedef
45 size_type my_array_size;
46 static const size_type initial_buffer_size = 4;
47 size_type my_head;
48 size_type my_tail;
52 aligned_space_item &item(size_type i) { in item()
58 const aligned_space_item &item(size_type i) const { in item()
120 void destroy_item(size_type i) { in destroy_item()
150 size_type capacity() { return my_array_size; } in capacity()
168 for( size_type i=my_head; i<my_tail; ++i) { in grow_my_array()
[all …]
H A D_concurrent_unordered_base.h205 using size_type = std::size_t;
233 static constexpr size_type round_up_to_power_of_two( size_type bucket_count ) { in round_up_to_power_of_two()
234 …return size_type(1) << size_type(tbb::detail::log2(uintptr_t(bucket_count == 0 ? 1 : bucket_count)… in round_up_to_power_of_two()
646 size_type unsafe_bucket_size( size_type n ) const { in unsafe_bucket_size()
704 using size_type = typename concurrent_unordered_base::size_type;
787 static constexpr size_type pointers_per_embedded_table = sizeof(size_type) * 8 - 1;
1039 void adjust_table_size( size_type total_elements, size_type current_size ) { in adjust_table_size()
1168 size_type erased_count = 0; in internal_erase_by_key()
1453 size_type get_parent( size_type bucket ) const { in get_parent()
1460 size_type get_next_bucket_index( size_type bucket ) const { in get_next_bucket_index()
[all …]
H A D_concurrent_skip_list.h60 using size_type = std::size_t; variable
149 size_type height() const { in height()
157 size_type index_number() const { in index_number()
162 static size_type calc_node_size( size_type height ) { in calc_node_size()
180 size_type my_height;
181 size_type my_index_number;
258 using size_type = std::size_t; variable
619 size_type size() const { in size()
623 size_type max_size() const { in max_size()
667 using size_type = typename concurrent_skip_list::size_type;
[all …]
H A D_concurrent_queue_base.h63 using size_type = std::size_t;
72 static constexpr size_type item_size = sizeof(T);
149 size_type index = prepare_page(k, base, page_allocator, p); in push()
327 void copy_item( padded_page& dst, size_type dindex, const padded_page& src, size_type sindex, in copy_item()
410 using size_type = std::size_t; member
423 static constexpr size_type n_queue = 8;
425 static constexpr size_type phi = 3;
435 for (size_type index = 0; index < n_queue; ++index) { in clear()
449 size_type queue_idx = 0; in assign()
455 for (size_type i = 0; i < queue_idx + 1; ++i) { in assign()
[all …]
H A D_flow_graph_cache_impl.h31 typedef size_t size_type; typedef
69 inline size_type internal_size( ) { in internal_size()
399 typedef size_t size_type; typedef
409 size_type size() { in size()
/oneTBB/examples/graph/binpack/
H A Dbinpack.cpp57 size_type desired_bin_capacity = 42;
58 size_type elements_num = 1000; // number of elements to generate
63 size_type optimality =
80 size_type
82 size_type relax,
108 size_type remaining = active_bins--; in operator ()()
128 for (size_type i = 0; i < my_bin.size(); ++i) in operator ()()
171 size_type remaining = active_bins--; in operator ()()
203 size_type counter;
222 size_type item_count;
[all …]
/oneTBB/test/common/
H A Dspin_barrier.h90 using size_type = std::size_t;
92 size_type myNumThreads;
93 std::atomic<size_type> myNumThreadsFinished; // reached the barrier in this epoch
95 std::atomic<size_type> myEpoch;
96 std::atomic<size_type> myLifeTimeGuard;
114 SpinBarrier( size_type nthreads = 0, bool throwaway = false ) {
118 void initialize( size_type nthreads, bool throwaway = false ) {
135 size_type epoch = myEpoch.load(std::memory_order_relaxed); in customWait()
H A Dconcurrent_unordered_common.h87 typename T::size_type buck = cont.unsafe_bucket(i); in test_unordered_methods()
93 typename T::size_type bucketSizeSum = 0; in test_unordered_methods()
94 typename T::size_type iteratorSizeSum = 0; in test_unordered_methods()
154 using size_type = typename Table::size_type; in CustomExamine() local
157 const size_type bucket_count = c.unsafe_bucket_count(); in CustomExamine()
160 size_type counter = 0; in CustomExamine()
161 for (size_type i = 0; i < bucket_count; ++i) { in CustomExamine()
162 const size_type size = c.unsafe_bucket_size(i); in CustomExamine()
175 const size_type index = c.unsafe_bucket(Value<Table>::key(*it)); in CustomExamine()
184 c.reserve(size_type(count)); in CustomExamine()
[all …]
/oneTBB/src/tbb/
H A Dparallel_pipeline.cpp116 using size_type = Token; typedef in tbb::detail::r1::input_buffer
123 size_type array_size;
134 void grow( size_type minimum_size );
138 static const size_type initial_buffer_size = 4;
250 void input_buffer::grow( size_type minimum_size ) { in grow()
251 size_type old_size = array_size; in grow()
252 size_type new_size = old_size ? 2*old_size : initial_buffer_size; in grow()
257 for( size_type i=0; i<new_size; ++i ) in grow()
260 for( size_type i=0; i<old_size; ++i, ++t ) in grow()
H A Drml_base.h67 typedef unsigned size_type; typedef
71 virtual size_type max_job_count() const RML_PURE(size_type)
/oneTBB/doc/main/reference/scalable_memory_pools/
H A Dmemory_pool_allocator_cls.rst48 using size_type = size_t;
60 pointer allocate(size_type n, const void* hint=0);
61 void deallocate(pointer p, size_type);
62 size_type max_size() const throw();
/oneTBB/test/conformance/
H A Dconformance_concurrent_queue.cpp422 using size_type = typename CQ::size_type; in TestConstructors() typedef
425 for (size_type i = 0; i < size; ++i) in TestConstructors()
441 for (size_type i=0; i < size; ++i) { in TestConstructors()
468 for (size_type i = 0; i < 1001; ++i) { in TestConstructors()
494 for (size_type i=0; i<100; ++i) { in TestConstructors()
515 typename CQ_EX::size_type n_elements = 0; in TestConstructors()
554 for (size_type i = 0; i < size; ++i) { in TestConstructors()
574 for (size_type i = 0; i < size; ++i) { in TestConstructors()
1277 typedef typename oneapi::tbb::concurrent_bounded_queue<T, A>::size_type size_type; in bounded_queue_specific_test() typedef
1284 q2.set_capacity(size_type(vec.size())); in bounded_queue_specific_test()
[all …]
H A Dconformance_allocators.cpp37 AssertSameType(allocator.max_size(), typename std::allocator_traits<Allocator>::size_type(0));
40 …REQUIRE_MESSAGE((allocator.max_size() * typename std::allocator_traits<Allocator>::size_type(sizeo…

12