Home
last modified time | relevance | path

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

/oneTBB/include/oneapi/tbb/
H A Dmemory_pool.h48 void recycle() { rml::pool_reset(my_pool); } in recycle()
64 void destroy() { rml::pool_destroy(my_pool); } in destroy()
66 rml::MemoryPool *my_pool; variable
81 pool_type *my_pool; variable
101 memory_pool_allocator(const memory_pool_allocator& src) throw() : my_pool(src.my_pool) {} in throw()
103 memory_pool_allocator(const memory_pool_allocator<U,P>& src) throw() : my_pool(src.my_pool) {} in memory_pool_allocator()
117 my_pool->free(p); in deallocate()
153 memory_pool_allocator( const memory_pool_allocator& src) throw() : my_pool(src.my_pool) {} in throw()
155 memory_pool_allocator(const memory_pool_allocator<U,P>& src) throw() : my_pool(src.my_pool) {} in memory_pool_allocator()
158 pool_type *my_pool;
[all …]
H A Dpartitioner.h196 tbb::detail::aligned_space<T, MaxCapacity> my_pool; variable
202 new( static_cast<void *>(my_pool.begin()) ) T(elem);//TODO: std::move? in range_vector()
215 new(my_pool.begin()+my_head) T(my_pool.begin()[prev]); // copy TODO: std::move? in split_to_fill()
216 my_pool.begin()[prev].~T(); // instead of assignment in split_to_fill()
217 … new(my_pool.begin()+prev) T(my_pool.begin()[my_head], detail::split()); // do 'inverse' split in split_to_fill()
224 my_pool.begin()[my_head].~T(); in pop_back()
230 my_pool.begin()[my_tail].~T(); in pop_front()
236 return my_pool.begin()[my_head]; in back()
240 return my_pool.begin()[my_tail]; in front()
/oneTBB/doc/main/reference/scalable_memory_pools/
H A Dfixed_pool_cls.rst73 oneapi::tbb::fixed_pool my_pool(buf, 1024*1024);
74 void* my_ptr = my_pool.malloc(10);
75 my_pool.free(my_ptr);}
H A Dmemory_pool_cls.rst78 oneapi::tbb::memory_pool<std::allocator<char> > my_pool;
79 void* my_ptr = my_pool.malloc(10);
80 my_pool.free(my_ptr);
H A Dmemory_pool_allocator_cls.rst117 std::list<int, pool_allocator_t> my_list(pool_allocator_t( my_pool ));