| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _flow_graph_item_buffer_impl.h | 159 size_type new_size = my_array_size ? 2*my_array_size : initial_buffer_size; in grow_my_array() local
160 while( new_size<minimum_size ) in grow_my_array()
161 new_size*=2; in grow_my_array()
163 buffer_item_type* new_array = allocator_type().allocate(new_size); in grow_my_array()
166 for( size_type i=0; i<new_size; ++i ) { new_array[i].begin()->second = no_item; } in grow_my_array()
171 char *new_space = (char *)&(new_array[i&(new_size-1)].begin()->first); in grow_my_array()
173 new_array[i&(new_size-1)].begin()->second = item(i).second; in grow_my_array()
180 my_array_size = new_size; in grow_my_array()
|
| H A D | _flow_graph_tagged_buffer_impl.h | 96 size_t new_size = my_size*2; in grow_array() local
102 DoCleanup my_cleanup(new_pointer_array, new_elements_array, new_size); in grow_array()
104 new_pointer_array = pointer_array_allocator_type().allocate(new_size); in grow_array()
105 for(size_t i=0; i < new_size; ++i) new_pointer_array[i] = nullptr; in grow_array()
112 internal_insert_with_key(new_pointer_array, new_size, new_free_list, *ov); in grow_array()
123 my_size = new_size; in grow_array()
|
| /oneTBB/src/tbb/ |
| H A D | arena_slot.h | 219 std::size_t new_size = num_tasks; in prepare_task_pool() local
223 if ( num_tasks < min_task_pool_size ) new_size = min_task_pool_size; in prepare_task_pool()
224 allocate_task_pool( new_size ); in prepare_task_pool()
233 if ( new_task_pool[i] ) ++new_size; in prepare_task_pool()
237 bool allocate = new_size > my_task_pool_size - min_task_pool_size/4; in prepare_task_pool()
241 if ( new_size < 2 * my_task_pool_size ) in prepare_task_pool()
242 new_size = 2 * my_task_pool_size; in prepare_task_pool()
243 allocate_task_pool( new_size ); // updates my_task_pool_size in prepare_task_pool()
|
| H A D | parallel_pipeline.cpp | 252 size_type new_size = old_size ? 2*old_size : initial_buffer_size; in grow() local
253 while( new_size<minimum_size ) in grow()
254 new_size*=2; in grow()
255 task_info* new_array = cache_aligned_allocator<task_info>().allocate(new_size); in grow()
257 for( size_type i=0; i<new_size; ++i ) in grow()
261 new_array[t&(new_size-1)] = old_array[t&(old_size-1)]; in grow()
263 array_size = new_size; in grow()
|
| /oneTBB/test/conformance/ |
| H A D | conformance_concurrent_vector.cpp | 246 for( int new_size=0; new_size<=8; NextSize( new_size ) ) { in TestResizeAndCopy() local
258 v.resize(new_size, move_support_tests::Foo(33) ); in TestResizeAndCopy()
260 for( int j=0; j<new_size; ++j ) { in TestResizeAndCopy()
264 REQUIRE( v.size()==std::size_t(new_size) ); in TestResizeAndCopy()
265 for( int j=0; j<new_size; ++j ) { in TestResizeAndCopy()
272 CheckVector(cv,new_size,old_size); in TestResizeAndCopy()
280 CheckVector(v,new_size,old_size); in TestResizeAndCopy()
337 … for( std::size_t new_size=0; new_size<=11000; new_size=(new_size<5 ? new_size+1 : 3*new_size) ) { in TestCapacity() local
342 v.reserve( new_size ); in TestCapacity()
344 REQUIRE( v.capacity()>=new_size ); in TestCapacity()
[all …]
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | partitioner.h | 94 std::size_t new_size = factor ? factor * max_threads_in_arena : 0; in resize() local
95 if (new_size != my_size) { in resize()
102 if (new_size) { in resize()
103 … my_array = static_cast<slot_id*>(r1::cache_aligned_allocate(new_size * sizeof(slot_id))); in resize()
104 std::fill_n(my_array, new_size, no_slot); in resize()
105 my_size = new_size; in resize()
|
| H A D | concurrent_vector.h | 864 iterator internal_grow_to_at_least( size_type new_size, const Args&... args ) { in internal_grow_to_at_least() argument
866 if (new_size == size_type(0)) return iterator(*this, 0); in internal_grow_to_at_least()
867 while (old_size < new_size && !this->my_size.compare_exchange_weak(old_size, new_size)) in internal_grow_to_at_least()
870 int delta = static_cast<int>(new_size) - static_cast<int>(old_size); in internal_grow_to_at_least()
872 return internal_grow(old_size, new_size, args...); in internal_grow_to_at_least()
875 size_type end_segment = this->segment_index_of(new_size - 1); in internal_grow_to_at_least()
895 __TBB_ASSERT( cap >= new_size, nullptr); in internal_grow_to_at_least()
|
| /oneTBB/src/tbb/tools_api/ |
| H A D | ittnotify_static.h | 184 …t_heap_function h, void* addr, size_t new_size, int initialized), (ITT_FORMAT h,…
185 …on h, void* addr, void** new_addr, size_t new_size, int initialized), (ITT_FORMAT h, addr, new_ad…
|
| H A D | ittnotify.h | 1626 void ITTAPI __itt_heap_reallocate_begin(__itt_heap_function h, void* addr, size_t new_size, int ini…
1631 ITT_STUBV(ITTAPI, void, heap_reallocate_begin, (__itt_heap_function h, void* addr, size_t new_size,…
1635 #define __itt_heap_reallocate_begin(h, addr, new_size, initialized)
1646 …allocate_end(__itt_heap_function h, void* addr, void** new_addr, size_t new_size, int initialized);
1651 …locate_end, (__itt_heap_function h, void* addr, void** new_addr, size_t new_size, int initialized))
1655 #define __itt_heap_reallocate_end(h, addr, new_addr, new_size, initialized)
|
| /oneTBB/test/common/ |
| H A D | custom_allocators.h | 73 std::size_t new_size = (my_data->my_allocated += n * sizeof(T)); in allocate() local
75 char* result = &(my_data->my_buffer[new_size - n * sizeof(T)]); in allocate()
|