boostorg/intrusive
1
0
Fork 1
mirror of https://github.com/boostorg/intrusive.git synced 2025-08-02 14:04:36 +02:00
Code Issues Packages Projects Releases Wiki Activity

Avoid using external reference in loop to avoid aliasing pesimization.

Browse Source
This commit is contained in:
Ion Gaztañaga
2017-11-07 00:39:33 +01:00
parent a276abd510
commit 33dc4890b7
1 changed files with 5 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
include/boost/intrusive/hashtable.hpp
View File

@@ -3370,7 +3370,7 @@ class hashtable_impl
, size_type &found_bucket , size_type &found_bucket
, size_type &cnt) const , size_type &cnt) const
{ {
cnt = 0; size_type internal_cnt = 0;
//Let's see if the element is present //Let's see if the element is present
siterator prev; siterator prev;
@@ -3386,20 +3386,21 @@ class hashtable_impl
//the same bucket //the same bucket
bucket_type &b = this->priv_bucket_pointer()[n_bucket]; bucket_type &b = this->priv_bucket_pointer()[n_bucket];
siterator it = to_return.first; siterator it = to_return.first;
++cnt; //At least one is found ++internal_cnt; //At least one is found
if(optimize_multikey){ if(optimize_multikey){
to_return.second = ++(priv_last_in_group)(it); to_return.second = ++(priv_last_in_group)(it);
cnt += boost::intrusive::iterator_distance(++it, to_return.second); internal_cnt += boost::intrusive::iterator_distance(++it, to_return.second);
} }
else{ else{
siterator const bend = b.end(); siterator const bend = b.end();
while(++it != bend && while(++it != bend &&
this->priv_is_value_equal_to_key(this->priv_value_from_slist_node(it.pointed_node()), h, key, equal_func)){ this->priv_is_value_equal_to_key(this->priv_value_from_slist_node(it.pointed_node()), h, key, equal_func)){
++cnt; ++internal_cnt;
} }
to_return.second = it; to_return.second = it;
} }
} }
cnt = internal_cnt;
return to_return; return to_return;
} }