/dports/security/suricata/suricata-6.0.4/src/ |
H A D | tmqh-packetpool.c | 91 SCCondWait(&my_pool->return_stack.cond, &my_pool->return_stack.mutex); in PacketPoolWait() 139 my_pool->head = my_pool->return_stack.head; in PacketPoolWaitForN() 149 SCCondWait(&my_pool->return_stack.cond, &my_pool->return_stack.mutex); in PacketPoolWaitForN() 243 if (pool == my_pool) { in PacketPoolReturnPacket() 246 my_pool->head = p; in PacketPoolReturnPacket() 293 my_pool->initialized = 1; in PacketPoolInitEmpty() 294 my_pool->destroyed = 0; in PacketPoolInitEmpty() 310 my_pool->initialized = 1; in PacketPoolInit() 311 my_pool->destroyed = 0; in PacketPoolInit() 344 if (my_pool && my_pool->pending_pool != NULL) { in PacketPoolDestroy() [all …]
|
/dports/math/stanmath/math-4.2.0/lib/tbb_2020.3/include/tbb/ |
H A D | memory_pool.h | 51 void recycle() { rml::pool_reset(my_pool); } in recycle() 67 void destroy() { rml::pool_destroy(my_pool); } in destroy() 69 rml::MemoryPool *my_pool; variable 87 pool_type *my_pool; variable 107 memory_pool_allocator(const memory_pool_allocator& src) throw() : my_pool(src.my_pool) {} in throw() 109 memory_pool_allocator(const memory_pool_allocator<U,P>& src) throw() : my_pool(src.my_pool) {} in memory_pool_allocator() 123 my_pool->free(p); in deallocate() 165 memory_pool_allocator( const memory_pool_allocator& src) throw() : my_pool(src.my_pool) {} in throw() 167 memory_pool_allocator(const memory_pool_allocator<U,P>& src) throw() : my_pool(src.my_pool) {} in memory_pool_allocator() 170 pool_type *my_pool; [all …]
|
H A D | partitioner.h | 159 tbb::aligned_space<T, MaxCapacity> my_pool; variable 165 new( static_cast<void *>(my_pool.begin()) ) T(elem);//TODO: std::move? in range_vector() 178 new(my_pool.begin()+my_head) T(my_pool.begin()[prev]); // copy TODO: std::move? in split_to_fill() 179 my_pool.begin()[prev].~T(); // instead of assignment in split_to_fill() 180 new(my_pool.begin()+prev) T(my_pool.begin()[my_head], split()); // do 'inverse' split in split_to_fill() 187 my_pool.begin()[my_head].~T(); in pop_back() 193 my_pool.begin()[my_tail].~T(); in pop_front() 199 return my_pool.begin()[my_head]; in back() 203 return my_pool.begin()[my_tail]; in front()
|
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/tbb-2018_U2/include/tbb/ |
H A D | memory_pool.h | 55 void recycle() { rml::pool_reset(my_pool); } in recycle() 71 void destroy() { rml::pool_destroy(my_pool); } in destroy() 73 rml::MemoryPool *my_pool; variable 91 pool_type *my_pool; variable 111 memory_pool_allocator(const memory_pool_allocator& src) throw() : my_pool(src.my_pool) {} in throw() 113 memory_pool_allocator(const memory_pool_allocator<U,P>& src) throw() : my_pool(src.my_pool) {} in memory_pool_allocator() 127 my_pool->free(p); in deallocate() 169 memory_pool_allocator( const memory_pool_allocator& src) throw() : my_pool(src.my_pool) {} in throw() 171 memory_pool_allocator(const memory_pool_allocator<U,P>& src) throw() : my_pool(src.my_pool) {} in memory_pool_allocator() 174 pool_type *my_pool; [all …]
|
H A D | partitioner.h | 160 tbb::aligned_space<T, MaxCapacity> my_pool; variable 166 new( static_cast<void *>(my_pool.begin()) ) T(elem);//TODO: std::move? in range_vector() 179 new(my_pool.begin()+my_head) T(my_pool.begin()[prev]); // copy TODO: std::move? in split_to_fill() 180 my_pool.begin()[prev].~T(); // instead of assignment in split_to_fill() 181 new(my_pool.begin()+prev) T(my_pool.begin()[my_head], split()); // do 'inverse' split in split_to_fill() 188 my_pool.begin()[my_head].~T(); in pop_back() 194 my_pool.begin()[my_tail].~T(); in pop_front() 200 return my_pool.begin()[my_head]; in back() 204 return my_pool.begin()[my_tail]; in front()
|
/dports/devel/concurrentqueue/concurrentqueue-1.0.3-15-g0753496/benchmarks/tbb/ |
H A D | memory_pool.h | 52 void recycle() { rml::pool_reset(my_pool); } in recycle() 68 void destroy() { rml::pool_destroy(my_pool); } in destroy() 70 rml::MemoryPool *my_pool; variable 88 pool_type *my_pool; variable 108 memory_pool_allocator(const memory_pool_allocator& src) throw() : my_pool(src.my_pool) {} in throw() 110 memory_pool_allocator(const memory_pool_allocator<U,P>& src) throw() : my_pool(src.my_pool) {} in memory_pool_allocator() 121 my_pool->free(p); in deallocate() 163 memory_pool_allocator( const memory_pool_allocator& src) throw() : my_pool(src.my_pool) {} in throw() 165 memory_pool_allocator(const memory_pool_allocator<U,P>& src) throw() : my_pool(src.my_pool) {} in memory_pool_allocator() 168 pool_type *my_pool; [all …]
|
H A D | partitioner.h | 155 tbb::aligned_space<T, MaxCapacity> my_pool; variable 161 new( static_cast<void *>(my_pool.begin()) ) T(elem);//TODO: std::move? in range_vector() 174 new(my_pool.begin()+my_head) T(my_pool.begin()[prev]); // copy TODO: std::move? in split_to_fill() 175 my_pool.begin()[prev].~T(); // instead of assignment in split_to_fill() 176 new(my_pool.begin()+prev) T(my_pool.begin()[my_head], split()); // do 'inverse' split in split_to_fill() 183 my_pool.begin()[my_head].~T(); in pop_back() 189 my_pool.begin()[my_tail].~T(); in pop_front() 195 return my_pool.begin()[my_head]; in back() 199 return my_pool.begin()[my_tail]; in front()
|
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/include/tbb/ |
H A D | memory_pool.h | 51 void recycle() { rml::pool_reset(my_pool); } in recycle() 67 void destroy() { rml::pool_destroy(my_pool); } in destroy() 69 rml::MemoryPool *my_pool; variable 87 pool_type *my_pool; variable 107 memory_pool_allocator(const memory_pool_allocator& src) throw() : my_pool(src.my_pool) {} in throw() 109 memory_pool_allocator(const memory_pool_allocator<U,P>& src) throw() : my_pool(src.my_pool) {} in memory_pool_allocator() 123 my_pool->free(p); in deallocate() 165 memory_pool_allocator( const memory_pool_allocator& src) throw() : my_pool(src.my_pool) {} in throw() 167 memory_pool_allocator(const memory_pool_allocator<U,P>& src) throw() : my_pool(src.my_pool) {} in memory_pool_allocator() 170 pool_type *my_pool; [all …]
|
H A D | partitioner.h | 159 tbb::aligned_space<T, MaxCapacity> my_pool; variable 165 new( static_cast<void *>(my_pool.begin()) ) T(elem);//TODO: std::move? in range_vector() 178 new(my_pool.begin()+my_head) T(my_pool.begin()[prev]); // copy TODO: std::move? in split_to_fill() 179 my_pool.begin()[prev].~T(); // instead of assignment in split_to_fill() 180 new(my_pool.begin()+prev) T(my_pool.begin()[my_head], split()); // do 'inverse' split in split_to_fill() 187 my_pool.begin()[my_head].~T(); in pop_back() 193 my_pool.begin()[my_tail].~T(); in pop_front() 199 return my_pool.begin()[my_head]; in back() 203 return my_pool.begin()[my_tail]; in front()
|
/dports/devel/tbb/oneTBB-2020.3/include/tbb/ |
H A D | memory_pool.h | 51 void recycle() { rml::pool_reset(my_pool); } in recycle() 67 void destroy() { rml::pool_destroy(my_pool); } in destroy() 69 rml::MemoryPool *my_pool; variable 87 pool_type *my_pool; variable 107 memory_pool_allocator(const memory_pool_allocator& src) throw() : my_pool(src.my_pool) {} in throw() 109 memory_pool_allocator(const memory_pool_allocator<U,P>& src) throw() : my_pool(src.my_pool) {} in memory_pool_allocator() 123 my_pool->free(p); in deallocate() 165 memory_pool_allocator( const memory_pool_allocator& src) throw() : my_pool(src.my_pool) {} in throw() 167 memory_pool_allocator(const memory_pool_allocator<U,P>& src) throw() : my_pool(src.my_pool) {} in memory_pool_allocator() 170 pool_type *my_pool; [all …]
|
H A D | partitioner.h | 159 tbb::aligned_space<T, MaxCapacity> my_pool; variable 165 new( static_cast<void *>(my_pool.begin()) ) T(elem);//TODO: std::move? in range_vector() 178 new(my_pool.begin()+my_head) T(my_pool.begin()[prev]); // copy TODO: std::move? in split_to_fill() 179 my_pool.begin()[prev].~T(); // instead of assignment in split_to_fill() 180 new(my_pool.begin()+prev) T(my_pool.begin()[my_head], split()); // do 'inverse' split in split_to_fill() 187 my_pool.begin()[my_head].~T(); in pop_back() 193 my_pool.begin()[my_tail].~T(); in pop_front() 199 return my_pool.begin()[my_head]; in back() 203 return my_pool.begin()[my_tail]; in front()
|
/dports/devel/onetbb/oneTBB-2021.4.0/include/oneapi/tbb/ |
H A D | memory_pool.h | 48 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 D | partitioner.h | 195 tbb::detail::aligned_space<T, MaxCapacity> my_pool; variable 201 new( static_cast<void *>(my_pool.begin()) ) T(elem);//TODO: std::move? in range_vector() 214 new(my_pool.begin()+my_head) T(my_pool.begin()[prev]); // copy TODO: std::move? in split_to_fill() 215 my_pool.begin()[prev].~T(); // instead of assignment in split_to_fill() 216 … new(my_pool.begin()+prev) T(my_pool.begin()[my_head], detail::split()); // do 'inverse' split in split_to_fill() 223 my_pool.begin()[my_head].~T(); in pop_back() 229 my_pool.begin()[my_tail].~T(); in pop_front() 235 return my_pool.begin()[my_head]; in back() 239 return my_pool.begin()[my_tail]; in front()
|
/dports/sysutils/ansible2/ansible-2.9.27/test/units/modules/cloud/amazon/ |
H A D | test_aws_netapp_cvs_pool.py | 144 my_pool = { 153 get_aws_api.return_value = my_pool 154 get_put_api.return_value = my_pool, None 165 my_pool = { 175 get_aws_api.return_value = my_pool 186 my_pool = { 207 my_pool = { 228 my_pool = { 237 get_aws_api.return_value = my_pool 249 my_pool = { [all …]
|
/dports/sysutils/ansible/ansible-4.7.0/ansible_collections/netapp/aws/tests/unit/plugins/modules/ |
H A D | test_aws_netapp_cvs_pool.py | 141 my_pool = { 150 get_aws_api.return_value = my_pool 151 get_put_api.return_value = my_pool, None 162 my_pool = { 171 get_put_api.return_value = my_pool, "Error" 172 get_aws_api.return_value = my_pool 195 my_pool = { 216 my_pool = { 225 get_aws_api.return_value = my_pool 237 my_pool = { [all …]
|
/dports/net/bird2/bird-2.0.8/lib/ |
H A D | hash_test.c | 31 struct pool *my_pool; variable 65 my_pool = rp_new(&root_pool, "Test pool"); in init_hash_() 67 HASH_INIT(hash, my_pool, order); in init_hash_() 165 HASH_INSERT2(hash, TEST, my_pool, node); in t_insert2_find() 239 HASH_DELETE2(hash, TEST, my_pool, n->key); in t_walk_delsafe_delete2() 256 HASH_REMOVE2(hash, TEST, my_pool, n); in t_walk_delsafe_remove2()
|
/dports/devel/onetbb/oneTBB-2021.4.0/doc/main/reference/scalable_memory_pools/ |
H A D | fixed_pool_cls.rst | 73 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 D | memory_pool_cls.rst | 78 oneapi::tbb::memory_pool<std::allocator<char> > my_pool; 79 void* my_ptr = my_pool.malloc(10); 80 my_pool.free(my_ptr);
|
/dports/benchmarks/netperf/netperf-d566775bf/doc/examples/ |
H A D | netperf_by_quantum.py | 275 my_pool = sorted(self.vm_pool,key=lambda vm: vm.hostId) 280 if (my_pool[0].hostId != my_pool[1].hostId): 283 lonely_uuid = my_pool[0].id 287 while (still_looking and i < (len(my_pool)-1)) : 288 if ((my_pool[i].hostId == my_pool[i-1].hostId) or 289 (my_pool[i].hostId == my_pool[i+1].hostId)) : 295 lonely_uuid = my_pool[i].id 299 if (still_looking and (my_pool[i].hostId != 300 my_pool[i+1].hostId)): 301 lonely_uuid = my_pool[i+1].id
|
/dports/lang/perl5.34/perl-5.34.0/dist/threads/ |
H A D | threads.xs | 739 my_pool_t *my_pool, argument 746 PERL_TSA_RELEASE(my_pool->create_destruct_mutex) 765 PERL_SET_CONTEXT(my_pool->main_thread.interp); 772 MUTEX_UNLOCK(&my_pool->create_destruct_mutex); 785 thread->next = &my_pool->main_thread; 786 thread->prev = my_pool->main_thread.prev; 787 my_pool->main_thread.prev = thread; 789 my_pool->total_threads++; 805 thread->tid = my_pool->tid_counter++; 1033 my_pool->running_threads++; [all …]
|
/dports/lang/perl5.30/perl-5.30.3/dist/threads/ |
H A D | threads.xs | 739 my_pool_t *my_pool, argument 746 PERL_TSA_RELEASE(my_pool->create_destruct_mutex) 765 PERL_SET_CONTEXT(my_pool->main_thread.interp); 772 MUTEX_UNLOCK(&my_pool->create_destruct_mutex); 785 thread->next = &my_pool->main_thread; 786 thread->prev = my_pool->main_thread.prev; 787 my_pool->main_thread.prev = thread; 789 my_pool->total_threads++; 805 thread->tid = my_pool->tid_counter++; 1033 my_pool->running_threads++; [all …]
|
/dports/lang/perl5.32/perl-5.32.1/dist/threads/ |
H A D | threads.xs | 739 my_pool_t *my_pool, argument 746 PERL_TSA_RELEASE(my_pool->create_destruct_mutex) 765 PERL_SET_CONTEXT(my_pool->main_thread.interp); 772 MUTEX_UNLOCK(&my_pool->create_destruct_mutex); 785 thread->next = &my_pool->main_thread; 786 thread->prev = my_pool->main_thread.prev; 787 my_pool->main_thread.prev = thread; 789 my_pool->total_threads++; 805 thread->tid = my_pool->tid_counter++; 1033 my_pool->running_threads++; [all …]
|
/dports/devel/p5-threads/threads-2.21/ |
H A D | threads.xs | 735 my_pool_t *my_pool, argument 742 PERL_TSA_RELEASE(my_pool->create_destruct_mutex) 761 PERL_SET_CONTEXT(my_pool->main_thread.interp); 768 MUTEX_UNLOCK(&my_pool->create_destruct_mutex); 781 thread->next = &my_pool->main_thread; 782 thread->prev = my_pool->main_thread.prev; 783 my_pool->main_thread.prev = thread; 785 my_pool->total_threads++; 801 thread->tid = my_pool->tid_counter++; 1029 my_pool->running_threads++; [all …]
|
/dports/lang/perl5-devel/perl5-5.35.4-102-ge43d289c7c/dist/threads/ |
H A D | threads.xs | 739 my_pool_t *my_pool, argument 746 PERL_TSA_RELEASE(my_pool->create_destruct_mutex) 765 PERL_SET_CONTEXT(my_pool->main_thread.interp); 772 MUTEX_UNLOCK(&my_pool->create_destruct_mutex); 785 thread->next = &my_pool->main_thread; 786 thread->prev = my_pool->main_thread.prev; 787 my_pool->main_thread.prev = thread; 789 my_pool->total_threads++; 805 thread->tid = my_pool->tid_counter++; 1033 my_pool->running_threads++; [all …]
|
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/PRM/inference/ |
H A D | structuredInference_tpl.h | 459 *my_pool, in _eliminateObservedNodesInSource_() 463 return my_pool; in _eliminateObservedNodesInSource_() 472 Set< Potential< GUM_SCALAR >* >* my_pool = _translatePotSet_(data, pool, match); in _eliminateObservedNodes_() local 479 *my_pool, in _eliminateObservedNodes_() 483 return my_pool; in _eliminateObservedNodes_() 541 delete my_pool; in _translatePotSet_() local 545 delete my_pool; in _translatePotSet_() local 562 my_pool->insert(copyPotential(bij, *p)); in _translatePotSet_() 564 for (const auto pot: *my_pool) in _translatePotSet_() 567 delete my_pool; in _translatePotSet_() local [all …]
|