boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2025-07-30 19:37:14 +02:00
Code Issues Packages Projects Releases Wiki Activity

drafted bulk_visit

Browse Source
This commit is contained in:
joaquintides
2023-06-20 18:34:18 +02:00
parent 6b65c8f230
commit ddc77ebdc9
2 changed files with 104 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
include/boost/unordered/concurrent_flat_map.hpp
View File

@ -244,6 +244,14 @@ namespace boost {
return table_.visit(k, f);
}
template<std::size_t M,typename F>
BOOST_FORCEINLINE
std::size_t bulk_visit(const std::array<key_type,M>& keys,F f)const
{
BOOST_UNORDERED_STATIC_ASSERT_CONST_INVOCABLE(F)
return table_.bulk_visit(keys, f);
}
template <class K, class F>
BOOST_FORCEINLINE typename std::enable_if<
detail::are_transparent<K, hasher, key_equal>::value, size_type>::type

96
include/boost/unordered/detail/foa/concurrent_table.hpp
View File

@ -12,6 +12,7 @@
#define BOOST_UNORDERED_DETAIL_FOA_CONCURRENT_TABLE_HPP
#include <atomic>
#include <array>
#include <boost/assert.hpp>
#include <boost/config.hpp>
#include <boost/core/ignore_unused.hpp>
@ -564,6 +565,101 @@ public:
return visit(x,std::forward<F>(f));
}
#if 1
template<typename Key,std::size_t M,typename F>
BOOST_FORCEINLINE
std::size_t bulk_visit(const std::array<Key,M>& keys,F&& f)const
{
auto lck=shared_access();
std::size_t res=0,
hashes[M];
int masks[M];
for(std::size_t i=0;i<M;++i){
hashes[i]=this->hash_for(keys[i]);
auto pos=this->position_for(hashes[i]);
BOOST_UNORDERED_PREFETCH(this->arrays.groups+pos);
}
for(std::size_t i=0;i<M;++i){
auto hash=hashes[i];
auto pos=this->position_for(hash);
masks[i]=(this->arrays.groups+pos)->match(hash);
if(masks[i]){
BOOST_UNORDERED_PREFETCH(this->arrays.group_accesses+pos);
BOOST_UNORDERED_PREFETCH_ELEMENTS(this->arrays.elements+pos*N,N);
}
}
for(std::size_t i=0;i<M;++i){
prober pb(this->position_for(hashes[i]));
auto pos=pb.get();
auto pg=this->arrays.groups+pos;
auto mask=masks[i];
element_type *p;
if(mask){
p=this->arrays.elements+pos*N;
goto post_prefetch;
}
else{
goto post_mask;
}
do{
pos=pb.get();
pg=this->arrays.groups+pos;
mask=pg->match(hashes[i]);
if(mask){
p=this->arrays.elements+pos*N;
BOOST_UNORDERED_PREFETCH_ELEMENTS(p,N);
post_prefetch:
auto lck=access(group_shared{},pos);
do{
auto n=unchecked_countr_zero(mask);
if(BOOST_LIKELY(
pg->is_occupied(n)&&
bool(this->pred()(keys[i],this->key_from(p[n]))))){
f(p+n);
++res;
goto next_key;
}
mask&=mask-1;
}while(mask);
}
post_mask:
if(BOOST_LIKELY(pg->is_not_overflowed(hashes[i]))){
goto next_key;
}
}
while(BOOST_LIKELY(pb.next(this->arrays.groups_size_mask)));
next_key:;
}
return res;
}
#else
template<typename Key,std::size_t M,typename F>
BOOST_FORCEINLINE
std::size_t bulk_visit(const std::array<Key,M>& keys,F&& f)const
{
auto lck=shared_access();
std::size_t res=0,
hashes[M];
for(std::size_t i=0;i<M;++i){
hashes[i]=this->hash_for(keys[i]);
auto pos=this->position_for(hashes[i]);
BOOST_UNORDERED_PREFETCH(this->arrays.groups+pos);
BOOST_UNORDERED_PREFETCH(this->arrays.group_accesses+pos);
BOOST_UNORDERED_PREFETCH_ELEMENTS(this->arrays.elements+pos*N,N);
}
for(std::size_t i=0;i<M;++i){
res+=unprotected_visit(
group_shared{},keys[i],this->position_for(hashes[i]),hashes[i],
std::forward<F>(f));
}
return res;
}
#endif
template<typename F> std::size_t visit_all(F&& f)
{
return visit_all_impl(group_exclusive{},std::forward<F>(f));