--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
+
+ Source code repo: http://github.com/khizmax/libcds/
+ Download: http://sourceforge.net/projects/libcds/files/
+
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice, this
+ list of conditions and the following disclaimer.
+
+ * Redistributions in binary form must reproduce the above copyright notice,
+ this list of conditions and the following disclaimer in the documentation
+ and/or other materials provided with the distribution.
+
+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+ OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+#ifndef CDSLIB_ALGO_BIT_REVERSAL_H
+#define CDSLIB_ALGO_BIT_REVERSAL_H
+
+#include <cds/algo/base.h>
+
+ // Source: http://stackoverflow.com/questions/746171/best-algorithm-for-bit-reversal-from-msb-lsb-to-lsb-msb-in-c
+namespace cds { namespace algo {
+
+ /// Bit reversal algorithms
+ namespace bit_reversal {
+
+ /// SWAR algorithm (source: http://aggregate.org/MAGIC/#Bit%20Reversal)
+ struct swar {
+ /// 32bit
+ uint32_t operator()( uint32_t x ) const
+ {
+ x = ( ( ( x & 0xaaaaaaaa ) >> 1 ) | ( ( x & 0x55555555 ) << 1 ) );
+ x = ( ( ( x & 0xcccccccc ) >> 2 ) | ( ( x & 0x33333333 ) << 2 ) );
+ x = ( ( ( x & 0xf0f0f0f0 ) >> 4 ) | ( ( x & 0x0f0f0f0f ) << 4 ) );
+ x = ( ( ( x & 0xff00ff00 ) >> 8 ) | ( ( x & 0x00ff00ff ) << 8 ) );
+ return( ( x >> 16 ) | ( x << 16 ) );
+ }
+
+ /// 64bit
+ uint64_t operator()( uint64_t x ) const
+ {
+ return ( static_cast<uint64_t>( operator()( static_cast<uint32_t>( x ) ) ) << 32 ) // low 32bit
+ | ( static_cast<uint64_t>( operator()( static_cast<uint32_t>( x >> 32 ) ) ) ); // high 32bit
+ }
+ };
+
+ /// Lookup table algorithm
+ struct lookup {
+ /// 32bit
+ uint32_t operator()( uint32_t x ) const
+ {
+ static uint8_t const table[] = {
+ 0x00, 0x80, 0x40, 0xC0, 0x20, 0xA0, 0x60, 0xE0, 0x10, 0x90, 0x50, 0xD0, 0x30, 0xB0, 0x70, 0xF0,
+ 0x08, 0x88, 0x48, 0xC8, 0x28, 0xA8, 0x68, 0xE8, 0x18, 0x98, 0x58, 0xD8, 0x38, 0xB8, 0x78, 0xF8,
+ 0x04, 0x84, 0x44, 0xC4, 0x24, 0xA4, 0x64, 0xE4, 0x14, 0x94, 0x54, 0xD4, 0x34, 0xB4, 0x74, 0xF4,
+ 0x0C, 0x8C, 0x4C, 0xCC, 0x2C, 0xAC, 0x6C, 0xEC, 0x1C, 0x9C, 0x5C, 0xDC, 0x3C, 0xBC, 0x7C, 0xFC,
+ 0x02, 0x82, 0x42, 0xC2, 0x22, 0xA2, 0x62, 0xE2, 0x12, 0x92, 0x52, 0xD2, 0x32, 0xB2, 0x72, 0xF2,
+ 0x0A, 0x8A, 0x4A, 0xCA, 0x2A, 0xAA, 0x6A, 0xEA, 0x1A, 0x9A, 0x5A, 0xDA, 0x3A, 0xBA, 0x7A, 0xFA,
+ 0x06, 0x86, 0x46, 0xC6, 0x26, 0xA6, 0x66, 0xE6, 0x16, 0x96, 0x56, 0xD6, 0x36, 0xB6, 0x76, 0xF6,
+ 0x0E, 0x8E, 0x4E, 0xCE, 0x2E, 0xAE, 0x6E, 0xEE, 0x1E, 0x9E, 0x5E, 0xDE, 0x3E, 0xBE, 0x7E, 0xFE,
+ 0x01, 0x81, 0x41, 0xC1, 0x21, 0xA1, 0x61, 0xE1, 0x11, 0x91, 0x51, 0xD1, 0x31, 0xB1, 0x71, 0xF1,
+ 0x09, 0x89, 0x49, 0xC9, 0x29, 0xA9, 0x69, 0xE9, 0x19, 0x99, 0x59, 0xD9, 0x39, 0xB9, 0x79, 0xF9,
+ 0x05, 0x85, 0x45, 0xC5, 0x25, 0xA5, 0x65, 0xE5, 0x15, 0x95, 0x55, 0xD5, 0x35, 0xB5, 0x75, 0xF5,
+ 0x0D, 0x8D, 0x4D, 0xCD, 0x2D, 0xAD, 0x6D, 0xED, 0x1D, 0x9D, 0x5D, 0xDD, 0x3D, 0xBD, 0x7D, 0xFD,
+ 0x03, 0x83, 0x43, 0xC3, 0x23, 0xA3, 0x63, 0xE3, 0x13, 0x93, 0x53, 0xD3, 0x33, 0xB3, 0x73, 0xF3,
+ 0x0B, 0x8B, 0x4B, 0xCB, 0x2B, 0xAB, 0x6B, 0xEB, 0x1B, 0x9B, 0x5B, 0xDB, 0x3B, 0xBB, 0x7B, 0xFB,
+ 0x07, 0x87, 0x47, 0xC7, 0x27, 0xA7, 0x67, 0xE7, 0x17, 0x97, 0x57, 0xD7, 0x37, 0xB7, 0x77, 0xF7,
+ 0x0F, 0x8F, 0x4F, 0xCF, 0x2F, 0xAF, 0x6F, 0xEF, 0x1F, 0x9F, 0x5F, 0xDF, 0x3F, 0xBF, 0x7F, 0xFF
+ };
+ static_assert( sizeof( table ) / sizeof( table[0] ) == 256, "Table size mismatch" );
+
+ return ( static_cast<uint32_t>( table[x & 0xff] ) << 24 ) |
+ ( static_cast<uint32_t>( table[( x >> 8 ) & 0xff] ) << 16 ) |
+ ( static_cast<uint32_t>( table[( x >> 16 ) & 0xff] ) << 8 ) |
+ ( static_cast<uint32_t>( table[( x >> 24 ) & 0xff] ) );
+ }
+
+ /// 64bit
+ uint64_t operator()( uint64_t x ) const
+ {
+ return ( static_cast<uint64_t>( operator()( static_cast<uint32_t>( x ) ) ) << 32 ) |
+ static_cast<uint64_t>( operator()( static_cast<uint32_t>( x >> 32 ) ) );
+ }
+ };
+
+
+ /// Mul-Div algorithm for 32bit architectire
+
+ /// Mul-Div algorithm
+ struct muldiv {
+ //@cond
+ static uint8_t muldiv32_byte( uint8_t b )
+ {
+ return static_cast<uint8_t>( ( ( b * 0x0802LU & 0x22110LU ) | ( b * 0x8020LU & 0x88440LU ) ) * 0x10101LU >> 16 );
+ }
+
+ static uint8_t muldiv64_byte( uint8_t b )
+ {
+ return static_cast<uint8_t>( ( b * 0x0202020202ULL & 0x010884422010ULL ) % 1023 );
+ }
+
+ // for 32bit architecture
+ static uint32_t muldiv32( uint32_t x )
+ {
+ return static_cast<uint32_t>( muldiv32_byte( static_cast<uint8_t>( x >> 24 ) ) )
+ | ( static_cast<uint32_t>( muldiv32_byte( static_cast<uint8_t>( x >> 16 ) ) ) << 8 )
+ | ( static_cast<uint32_t>( muldiv32_byte( static_cast<uint8_t>( x >> 8 ) ) ) << 16 )
+ | ( static_cast<uint32_t>( muldiv32_byte( static_cast<uint8_t>( x ) ) ) << 24 );
+ }
+
+ static uint64_t muldiv32( uint64_t x )
+ {
+ return static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 56 ) ) )
+ | ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 48 ) ) ) << 8 )
+ | ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 40 ) ) ) << 16 )
+ | ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 32 ) ) ) << 24 )
+ | ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 24 ) ) ) << 32 )
+ | ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 16 ) ) ) << 40 )
+ | ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 8 ) ) ) << 48 )
+ | ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x ) ) ) << 56 );
+ }
+
+ /// for 64bit architectire
+ static uint32_t muldiv64( uint32_t x )
+ {
+ return static_cast<uint32_t>( muldiv64_byte( static_cast<uint8_t>( x >> 24 ) ) )
+ | ( static_cast<uint32_t>( muldiv64_byte( static_cast<uint8_t>( x >> 16 ) ) ) << 8 )
+ | ( static_cast<uint32_t>( muldiv64_byte( static_cast<uint8_t>( x >> 8 ) ) ) << 16 )
+ | ( static_cast<uint32_t>( muldiv64_byte( static_cast<uint8_t>( x ) ) ) << 24 );
+ }
+
+ static uint64_t muldiv64( uint64_t x )
+ {
+ return static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 56 ) ) )
+ | ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 48 ) ) ) << 8 )
+ | ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 40 ) ) ) << 16 )
+ | ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 32 ) ) ) << 24 )
+ | ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 24 ) ) ) << 32 )
+ | ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 16 ) ) ) << 40 )
+ | ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 8 ) ) ) << 48 )
+ | ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x ) ) ) << 56 );
+ }
+ //@endcond
+
+ /// 32bit
+ uint32_t operator()( uint32_t x ) const
+ {
+# if CDS_BUILD_BITS == 32
+ return muldiv32( x );
+# else
+ return muldiv64( x );
+# endif
+ }
+
+ /// 64bit
+ uint64_t operator()( uint64_t x ) const
+ {
+# if CDS_BUILD_BITS == 32
+ return muldiv32( x );
+# else
+ return muldiv64( x );
+# endif
+ }
+ };
+
+ } // namespace bit_reversal
+}} // namespace cds::algo
+
+#endif // #ifndef CDSLIB_ALGO_BIT_REVERSAL_H
template <bool Value>
using dynamic_bucket_table = cds::intrusive::split_list::dynamic_bucket_table<Value>;
+ /// @copydoc cds::intrusive::split_list::bit_reversal
+ template <typename Type>
+ using bit_reversal = cds::intrusive::split_list::bit_reversal<Type>;
+
using cds::intrusive::split_list::static_bucket_table;
using cds::intrusive::split_list::expandable_bucket_table;
//@endcond
- /// SplitListSet traits
+ /// \p SplitListSet traits
struct traits: public intrusive::split_list::traits
{
// Ordered list implementation
#include <cds/intrusive/details/base.h>
#include <cds/algo/atomic.h>
+#include <cds/algo/bit_reversal.h>
#include <cds/details/allocator.h>
#include <cds/algo/int_algo.h>
#include <cds/algo/bitop.h>
//@endcond
};
+ /// Option to control bit reversal algorithm
+ /**
+ Bit reversal is a significant part of split-list.
+ \p Type can be one of predefined algorithm in \p cds::algo::bit_reversal namespace.
+ */
+ template <typename Type>
+ struct bit_reversal {
+ //@cond
+ template <typename Base>
+ struct pack: public Base
+ {
+ typedef Type bit_reversal;
+ };
+ //@endcond
+ };
+
/// SplitListSet traits
struct traits
{
*/
typedef opt::none hash;
+ /// Bit reversal algorithm
+ /**
+ Bit reversal is a significant part of split-list.
+ There are several predefined algorithm in \p cds::algo::bit_reversal namespace,
+ \p cds::algo::bit_reversal::lookup is the best general purpose one.
+
+ There are more efficient bit reversal algoritm for particular processor architecture,
+ for example, based on x86 SIMD/AVX instruction set, see <a href="http://stackoverflow.com/questions/746171/best-algorithm-for-bit-reversal-from-msb-lsb-to-lsb-msb-in-c">here</a>
+ */
+ typedef cds::algo::bit_reversal::lookup bit_reversal;
+
/// Item counter
/**
The item counting is an important part of \p SplitListSet algorithm:
/**
Available \p Options:
- \p opt::hash - mandatory option, specifies hash functor.
+ - \p split_list::bit_reversal - bit reversal algorithm, see \p traits::bit_reversal for explanation
+ default is \p cds::algo::bit_reversal::lookup
- \p opt::item_counter - optional, specifies item counting policy. See \p traits::item_counter
for default type.
- \p opt::memory_model - C++ memory model for atomic operations.
//@cond
// Helper functions
-
- /// Reverses bit order in \p nHash
- static inline size_t reverse_bits( size_t nHash )
- {
- return bitop::RBO( nHash );
- }
-
+ template <typename BitReversalAlgo>
static inline size_t regular_hash( size_t nHash )
{
- return reverse_bits( nHash ) | size_t(1);
+ return BitReversalAlgo()( nHash ) | size_t(1);
}
+ template <typename BitReversalAlgo>
static inline size_t dummy_hash( size_t nHash )
{
- return reverse_bits( nHash ) & ~size_t(1);
+ return BitReversalAlgo()( nHash ) & ~size_t(1);
}
//@endcond
/// Hash functor for \p %value_type and all its derivatives you use
typedef typename cds::opt::v::hash_selector< typename traits::hash >::type hash;
+ typedef typename traits::bit_reversal bit_reversal; ///< Bit reversal algorithm, see \p split_list::traits::bit_reversal
typedef typename traits::item_counter item_counter; ///< Item counter type
typedef typename traits::back_off back_off; ///< back-off strategy for spinning
typedef typename traits::memory_model memory_model; ///< Memory ordering. See \p cds::opt::memory_model option
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
- node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash( nHash );
+ node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash<bit_reversal>( nHash );
if ( m_List.insert_at( pHead, val )) {
inc_item_count();
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
- node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash( nHash );
+ node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash<bit_reversal>( nHash );
if ( m_List.insert_at( pHead, val, f )) {
inc_item_count();
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
- node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash( nHash );
+ node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash<bit_reversal>( nHash );
std::pair<bool, bool> bRet = m_List.update_at( pHead, val, func, bAllowInsert );
if ( bRet.first && bRet.second ) {
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
- node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash( nHash );
+ node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash<bit_reversal>( nHash );
std::pair<bool, bool> bRet = m_List.upsert_at( pHead, val, bAllowInsert );
if ( bRet.first && bRet.second ) {
if ( pBucket )
return pBucket;
- pBucket = alloc_aux_node( split_list::dummy_hash( nBucket ));
+ pBucket = alloc_aux_node( split_list::dummy_hash<bit_reversal>( nBucket ));
if ( pBucket ) {
if ( m_List.insert_aux_node( pParentBucket, pBucket )) {
m_Buckets.bucket( nBucket, pBucket );
"cds::atomicity::empty_item_counter is not allowed as a item counter");
// Initialize bucket 0
- aux_node_type * pNode = alloc_aux_node( 0 /*split_list::dummy_hash(0)*/ );
+ aux_node_type * pNode = alloc_aux_node( 0 /*split_list::dummy_hash<bit_reversal>(0)*/ );
assert( pNode != nullptr );
// insert_aux_node cannot return false for empty list
bool find_( Q& val, Compare cmp, Func f )
{
size_t nHash = hash_value( val );
- split_list::details::search_value_type<Q> sv( val, split_list::regular_hash( nHash ));
+ split_list::details::search_value_type<Q> sv( val, split_list::regular_hash<bit_reversal>( nHash ));
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
bool find_( Q const& val, Compare cmp )
{
size_t nHash = hash_value( val );
- split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash( nHash ));
+ split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash<bit_reversal>( nHash ));
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
iterator find_iterator_( Q const& val, Compare cmp )
{
size_t nHash = hash_value( val );
- split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash( nHash ));
+ split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash<bit_reversal>( nHash ));
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
guarded_ptr get_( Q const& val, Compare cmp )
{
size_t nHash = hash_value( val );
- split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash( nHash ));
+ split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash<bit_reversal>( nHash ));
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
bool erase_( Q const& val, Compare cmp, Func f )
{
size_t nHash = hash_value( val );
- split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash( nHash ));
+ split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash<bit_reversal>( nHash ));
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
bool erase_( Q const& val, Compare cmp )
{
size_t nHash = hash_value( val );
- split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash( nHash ));
+ split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash<bit_reversal>( nHash ));
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
guarded_ptr extract_( Q const& val, Compare cmp )
{
size_t nHash = hash_value( val );
- split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash( nHash ));
+ split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash<bit_reversal>( nHash ));
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
typedef typename ordered_list::key_comparator key_comparator; ///< key comparison functor
typedef typename ordered_list::disposer disposer; ///< Node disposer functor
+ typedef typename traits::bit_reversal bit_reversal; ///< Bit reversal algorithm, see \p split_list::traits::bit_reversal
typedef typename traits::item_counter item_counter; ///< Item counter type
typedef typename traits::back_off back_off; ///< back-off strategy
typedef typename traits::memory_model memory_model; ///< Memory ordering. See cds::opt::memory_model option
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
- node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash( nHash );
+ node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash<bit_reversal>( nHash );
list_iterator it = m_List.insert_at_( pHead, val );
if ( it != m_List.end()) {
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
- node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash( nHash );
+ node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash<bit_reversal>( nHash );
std::pair<list_iterator, bool> ret = m_List.update_at_( pHead, val, func, bAllowInsert );
if ( ret.first != m_List.end()) {
{
CDS_UNUSED( pred );
size_t nHash = hash_value( val );
- split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash( nHash ));
+ split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash<bit_reversal>( nHash ));
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
iterator find_( Q const& val )
{
size_t nHash = hash_value( val );
- split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash( nHash ));
+ split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash<bit_reversal>( nHash ));
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
bool find_( Q& val, Compare cmp, Func f )
{
size_t nHash = hash_value( val );
- split_list::details::search_value_type<Q> sv( val, split_list::regular_hash( nHash ));
+ split_list::details::search_value_type<Q> sv( val, split_list::regular_hash<bit_reversal>( nHash ));
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
return m_Stat.onFind( m_List.find_at( pHead, sv, cmp,
if ( pBucket )
return pBucket;
- pBucket = alloc_aux_node( split_list::dummy_hash( nBucket ));
+ pBucket = alloc_aux_node( split_list::dummy_hash<bit_reversal>( nBucket ));
if ( pBucket ) {
if ( m_List.insert_aux_node( pParentBucket, pBucket )) {
m_Buckets.bucket( nBucket, pBucket );
void init()
{
// Initialize bucket 0
- aux_node_type * pNode = alloc_aux_node( 0 /*split_list::dummy_hash(0)*/ );
+ aux_node_type * pNode = alloc_aux_node( 0 /*split_list::dummy_hash<bit_reversal>(0)*/ );
// insert_aux_node cannot return false for empty list
CDS_VERIFY( m_List.insert_aux_node( pNode ));
/// Group of \p extract_xxx functions require external locking if underlying ordered list requires that
static CDS_CONSTEXPR const bool c_bExtractLockExternal = ordered_list::c_bExtractLockExternal;
+ typedef typename traits::bit_reversal bit_reversal; ///< Bit reversal algorithm, see \p split_list::traits::bit_reversal
typedef typename traits::item_counter item_counter; ///< Item counter type
typedef typename traits::back_off back_off; ///< back-off strategy for spinning
typedef typename traits::memory_model memory_model; ///< Memory ordering. See cds::opt::memory_model option
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
- node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash( nHash );
+ node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash<bit_reversal>( nHash );
if ( m_List.insert_at( pHead, val )) {
inc_item_count();
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
- node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash( nHash );
+ node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash<bit_reversal>( nHash );
if ( m_List.insert_at( pHead, val, f )) {
inc_item_count();
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
- node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash( nHash );
+ node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash<bit_reversal>( nHash );
std::pair<bool, bool> bRet = m_List.update_at( pHead, val, func, bAllowInsert );
if ( bRet.first && bRet.second ) {
if ( pBucket )
return pBucket;
- pBucket = alloc_aux_node( split_list::dummy_hash( nBucket ));
+ pBucket = alloc_aux_node( split_list::dummy_hash<bit_reversal>( nBucket ));
if ( pBucket ) {
if ( m_List.insert_aux_node( pParentBucket, pBucket )) {
m_Buckets.bucket( nBucket, pBucket );
void init()
{
// Initialize bucket 0
- aux_node_type * pNode = alloc_aux_node( 0 /*split_list::dummy_hash(0)*/ );
+ aux_node_type * pNode = alloc_aux_node( 0 /*split_list::dummy_hash<bit_reversal>(0)*/ );
// insert_aux_node cannot return false for empty list
CDS_VERIFY( m_List.insert_aux_node( pNode ));
bool find_( Q& val, Compare cmp, Func f )
{
size_t nHash = hash_value( val );
- split_list::details::search_value_type<Q> sv( val, split_list::regular_hash( nHash ));
+ split_list::details::search_value_type<Q> sv( val, split_list::regular_hash<bit_reversal>( nHash ));
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
bool find_value( Q const& val, Compare cmp )
{
size_t nHash = hash_value( val );
- split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash( nHash ));
+ split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash<bit_reversal>( nHash ));
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
raw_ptr get_( Q const& val, Compare cmp )
{
size_t nHash = hash_value( val );
- split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash( nHash ));
+ split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash<bit_reversal>( nHash ));
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
value_type * extract_( Q const& val, Compare cmp )
{
size_t nHash = hash_value( val );
- split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash( nHash ));
+ split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash<bit_reversal>( nHash ));
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
bool erase_( const Q& val, Compare cmp )
{
size_t nHash = hash_value( val );
- split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash( nHash ));
+ split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash<bit_reversal>( nHash ));
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
bool erase_( Q const& val, Compare cmp, Func f )
{
size_t nHash = hash_value( val );
- split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash( nHash ));
+ split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash<bit_reversal>( nHash ));
aux_node_type * pHead = get_bucket( nHash );
assert( pHead != nullptr );
<ClInclude Include="..\..\..\cds\algo\backoff_strategy.h" />
<ClInclude Include="..\..\..\cds\algo\base.h" />
<ClInclude Include="..\..\..\cds\algo\bitop.h" />
+ <ClInclude Include="..\..\..\cds\algo\bit_reversal.h" />
<ClInclude Include="..\..\..\cds\algo\flat_combining\defs.h" />
<ClInclude Include="..\..\..\cds\algo\flat_combining\kernel.h" />
<ClInclude Include="..\..\..\cds\algo\flat_combining\wait_strategy.h" />
<ClInclude Include="..\..\..\cds\compiler\gcc\arm7\backoff.h">
<Filter>Header Files\cds\compiler\gcc\arm7</Filter>
</ClInclude>
+ <ClInclude Include="..\..\..\cds\algo\bit_reversal.h">
+ <Filter>Header Files\cds\algo</Filter>
+ </ClInclude>
</ItemGroup>
</Project>
\ No newline at end of file
<ExcludedFromBuild Condition="'$(Configuration)|$(Platform)'=='Release|x64'">true</ExcludedFromBuild>
</ClCompile>
<ClCompile Include="..\..\..\test\unit\misc\bitop.cpp" />
+ <ClCompile Include="..\..\..\test\unit\misc\bit_reversal.cpp" />
<ClCompile Include="..\..\..\test\unit\misc\cxx11_atomic_class.cpp" />
<ClCompile Include="..\..\..\test\unit\misc\cxx11_atomic_func.cpp" />
<ClCompile Include="..\..\..\test\unit\misc\find_option.cpp" />
<ClCompile Include="..\..\..\test\unit\misc\asan_errors.cpp">
<Filter>Source Files</Filter>
</ClCompile>
+ <ClCompile Include="..\..\..\test\unit\misc\bit_reversal.cpp">
+ <Filter>Source Files</Filter>
+ </ClCompile>
</ItemGroup>
<ItemGroup>
<ClInclude Include="..\..\..\test\unit\misc\cxx11_convert_memory_order.h">
test( s );
}
+ TEST_F( IntrusiveSplitListSet_DHP, base_bit_reversal_swar )
+ {
+ struct list_traits: public ci::michael_list::traits
+ {
+ typedef ci::michael_list::base_hook< ci::opt::gc<gc_type>> hook;
+ typedef cmp<base_item_type> compare;
+ typedef mock_disposer disposer;
+ };
+ typedef ci::MichaelList< gc_type, base_item_type, list_traits > bucket_type;
+
+ struct set_traits: public ci::split_list::traits
+ {
+ typedef hash_int hash;
+ typedef simple_item_counter item_counter;
+ typedef ci::split_list::stat<> stat;
+ typedef cds::algo::bit_reversal::swar bit_reversal;
+ };
+ typedef ci::SplitListSet< gc_type, bucket_type, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+ TEST_F( IntrusiveSplitListSet_DHP, base_bit_reversal_lookup )
+ {
+ struct list_traits: public ci::michael_list::traits
+ {
+ typedef ci::michael_list::base_hook< ci::opt::gc<gc_type>> hook;
+ typedef cmp<base_item_type> compare;
+ typedef mock_disposer disposer;
+ };
+ typedef ci::MichaelList< gc_type, base_item_type, list_traits > bucket_type;
+
+ struct set_traits: public ci::split_list::traits
+ {
+ typedef hash_int hash;
+ typedef simple_item_counter item_counter;
+ typedef ci::split_list::stat<> stat;
+ typedef cds::algo::bit_reversal::lookup bit_reversal;
+ };
+ typedef ci::SplitListSet< gc_type, bucket_type, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+ TEST_F( IntrusiveSplitListSet_DHP, base_bit_reversal_muldiv )
+ {
+ struct list_traits: public ci::michael_list::traits
+ {
+ typedef ci::michael_list::base_hook< ci::opt::gc<gc_type>> hook;
+ typedef cmp<base_item_type> compare;
+ typedef mock_disposer disposer;
+ };
+ typedef ci::MichaelList< gc_type, base_item_type, list_traits > bucket_type;
+
+ struct set_traits: public ci::split_list::traits
+ {
+ typedef hash_int hash;
+ typedef simple_item_counter item_counter;
+ typedef ci::split_list::stat<> stat;
+ typedef cds::algo::bit_reversal::muldiv bit_reversal;
+ };
+ typedef ci::SplitListSet< gc_type, bucket_type, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
TEST_F( IntrusiveSplitListSet_DHP, member_cmp )
{
typedef ci::MichaelList< gc_type
test( s );
}
+ TEST_F( IntrusiveSplitListSet_HP, base_bit_reversal_swar )
+ {
+ struct list_traits: public ci::michael_list::traits
+ {
+ typedef ci::michael_list::base_hook< ci::opt::gc<gc_type>> hook;
+ typedef cmp<base_item_type> compare;
+ typedef mock_disposer disposer;
+ };
+ typedef ci::MichaelList< gc_type, base_item_type, list_traits > bucket_type;
+
+ struct set_traits: public ci::split_list::traits
+ {
+ typedef hash_int hash;
+ typedef simple_item_counter item_counter;
+ typedef ci::split_list::stat<> stat;
+ typedef cds::algo::bit_reversal::swar bit_reversal;
+ };
+ typedef ci::SplitListSet< gc_type, bucket_type, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+ TEST_F( IntrusiveSplitListSet_HP, base_bit_reversal_lookup )
+ {
+ struct list_traits: public ci::michael_list::traits
+ {
+ typedef ci::michael_list::base_hook< ci::opt::gc<gc_type>> hook;
+ typedef cmp<base_item_type> compare;
+ typedef mock_disposer disposer;
+ };
+ typedef ci::MichaelList< gc_type, base_item_type, list_traits > bucket_type;
+
+ struct set_traits: public ci::split_list::traits
+ {
+ typedef hash_int hash;
+ typedef simple_item_counter item_counter;
+ typedef ci::split_list::stat<> stat;
+ typedef cds::algo::bit_reversal::lookup bit_reversal;
+ };
+ typedef ci::SplitListSet< gc_type, bucket_type, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+ TEST_F( IntrusiveSplitListSet_HP, base_bit_reversal_muldiv )
+ {
+ struct list_traits: public ci::michael_list::traits
+ {
+ typedef ci::michael_list::base_hook< ci::opt::gc<gc_type>> hook;
+ typedef cmp<base_item_type> compare;
+ typedef mock_disposer disposer;
+ };
+ typedef ci::MichaelList< gc_type, base_item_type, list_traits > bucket_type;
+
+ struct set_traits: public ci::split_list::traits
+ {
+ typedef hash_int hash;
+ typedef simple_item_counter item_counter;
+ typedef ci::split_list::stat<> stat;
+ typedef cds::algo::bit_reversal::muldiv bit_reversal;
+ };
+ typedef ci::SplitListSet< gc_type, bucket_type, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
TEST_F( IntrusiveSplitListSet_HP, member_cmp )
{
test( s );
}
+ TEST_F( IntrusiveSplitListSet_NoGC, base_bit_reversal_swar )
+ {
+ struct list_traits: public ci::michael_list::traits
+ {
+ typedef ci::michael_list::base_hook< ci::opt::gc<gc_type>> hook;
+ typedef cmp<base_item_type> compare;
+ typedef mock_disposer disposer;
+ };
+ typedef ci::MichaelList< gc_type, base_item_type, list_traits > bucket_type;
+
+ struct set_traits: public ci::split_list::traits
+ {
+ typedef hash_int hash;
+ typedef simple_item_counter item_counter;
+ typedef ci::split_list::stat<> stat;
+ typedef cds::algo::bit_reversal::swar bit_reversal;
+ };
+ typedef ci::SplitListSet< gc_type, bucket_type, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+ TEST_F( IntrusiveSplitListSet_NoGC, base_bit_reversal_lookup )
+ {
+ struct list_traits: public ci::michael_list::traits
+ {
+ typedef ci::michael_list::base_hook< ci::opt::gc<gc_type>> hook;
+ typedef cmp<base_item_type> compare;
+ typedef mock_disposer disposer;
+ };
+ typedef ci::MichaelList< gc_type, base_item_type, list_traits > bucket_type;
+
+ struct set_traits: public ci::split_list::traits
+ {
+ typedef hash_int hash;
+ typedef simple_item_counter item_counter;
+ typedef ci::split_list::stat<> stat;
+ typedef cds::algo::bit_reversal::lookup bit_reversal;
+ };
+ typedef ci::SplitListSet< gc_type, bucket_type, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+ TEST_F( IntrusiveSplitListSet_NoGC, base_bit_reversal_muldiv )
+ {
+ struct list_traits: public ci::michael_list::traits
+ {
+ typedef ci::michael_list::base_hook< ci::opt::gc<gc_type>> hook;
+ typedef cmp<base_item_type> compare;
+ typedef mock_disposer disposer;
+ };
+ typedef ci::MichaelList< gc_type, base_item_type, list_traits > bucket_type;
+
+ struct set_traits: public ci::split_list::traits
+ {
+ typedef hash_int hash;
+ typedef simple_item_counter item_counter;
+ typedef ci::split_list::stat<> stat;
+ typedef cds::algo::bit_reversal::muldiv bit_reversal;
+ };
+ typedef ci::SplitListSet< gc_type, bucket_type, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+
TEST_F( IntrusiveSplitListSet_NoGC, member_cmp )
{
typedef ci::MichaelList< gc_type
this->test( s );
}
+TYPED_TEST_P( IntrusiveSplitMichaelSet, base_bit_reverse_swar )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::base_item_type base_item_type;
+ typedef typename TestFixture::mock_disposer mock_disposer;
+ typedef typename TestFixture::hash_int hash_int;
+
+ struct list_traits: public ci::michael_list::traits
+ {
+ typedef ci::michael_list::base_hook< ci::opt::gc<rcu_type>> hook;
+ typedef typename TestFixture::template less<base_item_type> less;
+ typedef mock_disposer disposer;
+ };
+ typedef ci::MichaelList< rcu_type, base_item_type, list_traits > bucket_type;
+
+ struct set_traits: public ci::split_list::traits
+ {
+ typedef hash_int hash;
+ typedef typename TestFixture::simple_item_counter item_counter;
+ typedef ci::split_list::stat<> stat;
+ typedef cds::algo::bit_reversal::swar bit_reversal;
+ };
+ typedef ci::SplitListSet< rcu_type, bucket_type, set_traits > set_type;
+
+ set_type s( TestFixture::kSize, 2 );
+ this->test( s );
+}
+
+TYPED_TEST_P( IntrusiveSplitMichaelSet, base_bit_reverse_lookup )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::base_item_type base_item_type;
+ typedef typename TestFixture::mock_disposer mock_disposer;
+ typedef typename TestFixture::hash_int hash_int;
+
+ struct list_traits: public ci::michael_list::traits
+ {
+ typedef ci::michael_list::base_hook< ci::opt::gc<rcu_type>> hook;
+ typedef typename TestFixture::template less<base_item_type> less;
+ typedef mock_disposer disposer;
+ };
+ typedef ci::MichaelList< rcu_type, base_item_type, list_traits > bucket_type;
+
+ struct set_traits: public ci::split_list::traits
+ {
+ typedef hash_int hash;
+ typedef typename TestFixture::simple_item_counter item_counter;
+ typedef ci::split_list::stat<> stat;
+ typedef cds::algo::bit_reversal::lookup bit_reversal;
+ };
+ typedef ci::SplitListSet< rcu_type, bucket_type, set_traits > set_type;
+
+ set_type s( TestFixture::kSize, 2 );
+ this->test( s );
+}
+
+TYPED_TEST_P( IntrusiveSplitMichaelSet, base_bit_reverse_muldiv )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::base_item_type base_item_type;
+ typedef typename TestFixture::mock_disposer mock_disposer;
+ typedef typename TestFixture::hash_int hash_int;
+
+ struct list_traits: public ci::michael_list::traits
+ {
+ typedef ci::michael_list::base_hook< ci::opt::gc<rcu_type>> hook;
+ typedef typename TestFixture::template less<base_item_type> less;
+ typedef mock_disposer disposer;
+ };
+ typedef ci::MichaelList< rcu_type, base_item_type, list_traits > bucket_type;
+
+ struct set_traits: public ci::split_list::traits
+ {
+ typedef hash_int hash;
+ typedef typename TestFixture::simple_item_counter item_counter;
+ typedef ci::split_list::stat<> stat;
+ typedef cds::algo::bit_reversal::muldiv bit_reversal;
+ };
+ typedef ci::SplitListSet< rcu_type, bucket_type, set_traits > set_type;
+
+ set_type s( TestFixture::kSize, 2 );
+ this->test( s );
+}
+
+
TYPED_TEST_P( IntrusiveSplitMichaelSet, member_cmp )
{
typedef typename TestFixture::rcu_type rcu_type;
// GCC 5: All test names should be written on single line, otherwise a runtime error will be encountered like as
// "No test named <test_name> can be found in this test case"
REGISTER_TYPED_TEST_CASE_P( IntrusiveSplitMichaelSet,
- base_cmp, base_less, base_cmpmix, base_static_bucket_table, base_static_bucket_table_free_list, base_free_list, member_cmp, member_less, member_cmpmix, member_static_bucket_table, member_static_bucket_table_free_list, member_free_list
+ base_cmp, base_less, base_cmpmix, base_static_bucket_table, base_static_bucket_table_free_list, base_free_list, base_bit_reverse_swar, base_bit_reverse_lookup, base_bit_reverse_muldiv, member_cmp, member_less, member_cmpmix, member_static_bucket_table, member_static_bucket_table_free_list, member_free_list
);
test( m );
}
+ TEST_F( SplitListMichaelMap_DHP, bit_reversal_swar )
+ {
+ typedef cc::SplitListMap< gc_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::michael_list_tag >
+ ,cc::split_list::bit_reversal< cds::algo::bit_reversal::swar >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::michael_list::make_traits<
+ cds::opt::compare< cmp >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( SplitListMichaelMap_DHP, bit_reversal_lookup )
+ {
+ typedef cc::SplitListMap< gc_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::michael_list_tag >
+ ,cc::split_list::bit_reversal< cds::algo::bit_reversal::lookup >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::michael_list::make_traits<
+ cds::opt::compare< cmp >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( SplitListMichaelMap_DHP, bit_reversal_muldiv )
+ {
+ typedef cc::SplitListMap< gc_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::michael_list_tag >
+ ,cc::split_list::bit_reversal< cds::algo::bit_reversal::muldiv >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::michael_list::make_traits<
+ cds::opt::compare< cmp >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
} // namespace
test( m );
}
+ TEST_F( SplitListMichaelMap_HP, bit_reversal_swar )
+ {
+ typedef cc::SplitListMap< gc_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::michael_list_tag >
+ ,cc::split_list::bit_reversal< cds::algo::bit_reversal::swar >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::michael_list::make_traits<
+ cds::opt::compare< cmp >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( SplitListMichaelMap_HP, bit_reversal_lookup )
+ {
+ typedef cc::SplitListMap< gc_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::michael_list_tag >
+ ,cc::split_list::bit_reversal< cds::algo::bit_reversal::lookup >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::michael_list::make_traits<
+ cds::opt::compare< cmp >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( SplitListMichaelMap_HP, bit_reversal_muldiv )
+ {
+ typedef cc::SplitListMap< gc_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::michael_list_tag >
+ ,cc::split_list::bit_reversal< cds::algo::bit_reversal::muldiv >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::michael_list::make_traits<
+ cds::opt::compare< cmp >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
} // namespace
this->test( m );
}
+TYPED_TEST_P( SplitListMichaelMap, bit_reversal_swar )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::key_type key_type;
+ typedef typename TestFixture::value_type value_type;
+ typedef typename TestFixture::hash1 hash1;
+
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::algo::bit_reversal::swar bit_reversal;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef typename TestFixture::cmp compare;
+ };
+ };
+ typedef cc::SplitListMap< rcu_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( TestFixture::kSize, 2 );
+ this->test( m );
+}
+
+TYPED_TEST_P( SplitListMichaelMap, bit_reversal_lookup )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::key_type key_type;
+ typedef typename TestFixture::value_type value_type;
+ typedef typename TestFixture::hash1 hash1;
+
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::algo::bit_reversal::lookup bit_reversal;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef typename TestFixture::cmp compare;
+ };
+ };
+ typedef cc::SplitListMap< rcu_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( TestFixture::kSize, 2 );
+ this->test( m );
+}
+
+TYPED_TEST_P( SplitListMichaelMap, bit_reversal_muldiv )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::key_type key_type;
+ typedef typename TestFixture::value_type value_type;
+ typedef typename TestFixture::hash1 hash1;
+
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::algo::bit_reversal::muldiv bit_reversal;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef typename TestFixture::cmp compare;
+ };
+ };
+ typedef cc::SplitListMap< rcu_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( TestFixture::kSize, 2 );
+ this->test( m );
+}
+
+
REGISTER_TYPED_TEST_CASE_P( SplitListMichaelMap,
- compare, less, cmpmix, item_counting, stat, back_off, free_list, static_bucket_table, static_bucket_table_free_list
+ compare, less, cmpmix, item_counting, stat, back_off, free_list, static_bucket_table, static_bucket_table_free_list, bit_reversal_swar, bit_reversal_lookup, bit_reversal_muldiv
);
--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
+
+ Source code repo: http://github.com/khizmax/libcds/
+ Download: http://sourceforge.net/projects/libcds/files/
+
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice, this
+ list of conditions and the following disclaimer.
+
+ * Redistributions in binary form must reproduce the above copyright notice,
+ this list of conditions and the following disclaimer in the documentation
+ and/or other materials provided with the distribution.
+
+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+ OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+#include <gtest/gtest.h>
+#include <cds/algo/bit_reversal.h>
+
+namespace {
+
+ template <typename UInt>
+ class bit_reversal: public ::testing::Test
+ {
+ typedef UInt uint_type;
+ static std::vector<uint_type> arr_;
+ static size_t const c_size = 100'000'000;
+
+ public:
+ static void SetUpTestCase()
+ {
+ arr_.resize( c_size );
+ for ( size_t i = 0; i < c_size; ++i )
+ arr_[i] = static_cast<uint_type>((i << 32) + (~i));
+ }
+
+ static void TearDownTestCase()
+ {
+ arr_.resize( 0 );
+ }
+
+ template <typename Algo>
+ void test()
+ {
+ Algo f;
+ for ( auto i : arr_ ) {
+ EXPECT_EQ( i, f( f( i )));
+ }
+ }
+
+ template <typename Algo>
+ void test_eq()
+ {
+ Algo f;
+ for ( auto i : arr_ ) {
+ EXPECT_EQ( cds::algo::bit_reversal::swar()( i ), f( i ) ) << "i=" << i;
+ }
+ }
+ };
+
+ template <typename UInt> std::vector<UInt> bit_reversal<UInt>::arr_;
+
+ typedef bit_reversal<uint32_t> bit_reversal32;
+ typedef bit_reversal<uint64_t> bit_reversal64;
+
+#define TEST_32BIT( x ) \
+ TEST_F( bit_reversal32, x ) { test<cds::algo::bit_reversal::x>(); } \
+ TEST_F( bit_reversal32, x##_eq ) { test_eq<cds::algo::bit_reversal::x>(); }
+
+#define TEST_64BIT( x ) \
+ TEST_F( bit_reversal64, x ) { test<cds::algo::bit_reversal::x>(); } \
+ TEST_F( bit_reversal64, x##_eq ) { test_eq<cds::algo::bit_reversal::x>(); }
+
+ TEST_32BIT( swar )
+ TEST_32BIT( lookup )
+ TEST_32BIT( muldiv )
+
+ TEST_64BIT( swar )
+ TEST_64BIT( lookup )
+ TEST_64BIT( muldiv )
+
+} // namespace
test( s );
}
+ TEST_F( SplitListMichaelSet_DHP, bit_reversal_swar )
+ {
+ struct set_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::algo::bit_reversal::swar bit_reversal;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef cmp compare;
+ typedef base_class::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+ TEST_F( SplitListMichaelSet_DHP, bit_reversal_lookup )
+ {
+ struct set_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::algo::bit_reversal::lookup bit_reversal;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef cmp compare;
+ typedef base_class::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+ TEST_F( SplitListMichaelSet_DHP, bit_reversal_muldiv )
+ {
+ struct set_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::algo::bit_reversal::muldiv bit_reversal;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef cmp compare;
+ typedef base_class::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
} // namespace
test( s );
}
+ TEST_F( SplitListMichaelSet_HP, bit_reversal_swar )
+ {
+ struct set_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::algo::bit_reversal::swar bit_reversal;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef cmp compare;
+ typedef base_class::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+ TEST_F( SplitListMichaelSet_HP, bit_reversal_lookup )
+ {
+ struct set_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::algo::bit_reversal::lookup bit_reversal;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef cmp compare;
+ typedef base_class::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+ TEST_F( SplitListMichaelSet_HP, bit_reversal_muldiv )
+ {
+ struct set_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::algo::bit_reversal::muldiv bit_reversal;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef cmp compare;
+ typedef base_class::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
} // namespace
+
test( s );
}
+ TEST_F( SplitListMichaelSet_NoGC, bit_reversal_swar )
+ {
+ struct set_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::algo::bit_reversal::swar bit_reversal;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef cmp compare;
+ typedef base_class::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+ TEST_F( SplitListMichaelSet_NoGC, bit_reversal_lookup )
+ {
+ struct set_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::algo::bit_reversal::lookup bit_reversal;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef cmp compare;
+ typedef base_class::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+ TEST_F( SplitListMichaelSet_NoGC, bit_reversal_muldiv )
+ {
+ struct set_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::algo::bit_reversal::muldiv bit_reversal;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef cmp compare;
+ typedef base_class::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
} // namespace
this->test( s );
}
+TYPED_TEST_P( SplitListMichaelSet, bit_reversal_swar )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::int_item int_item;
+ typedef typename TestFixture::hash_int hash_int;
+
+ typedef cc::SplitListSet< rcu_type, int_item,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::michael_list_tag >
+ , cds::opt::hash< hash_int >
+ , cc::split_list::bit_reversal< cds::algo::bit_reversal::swar >
+ , cc::split_list::ordered_list_traits<
+ typename cc::michael_list::make_traits<
+ cds::opt::less< typename TestFixture::less >
+ , cds::opt::compare< typename TestFixture::cmp >
+ >::type
+ >
+ >::type
+ > set_type;
+
+ set_type s( TestFixture::kSize, 2 );
+ this->test( s );
+}
+
+TYPED_TEST_P( SplitListMichaelSet, bit_reversal_lookup )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::int_item int_item;
+ typedef typename TestFixture::hash_int hash_int;
+
+ struct set_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::algo::bit_reversal::lookup bit_reversal;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef typename TestFixture::cmp compare;
+ typedef typename TestFixture::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListSet< rcu_type, int_item, set_traits > set_type;
+
+ set_type s( TestFixture::kSize, 8 );
+ this->test( s );
+}
+
+TYPED_TEST_P( SplitListMichaelSet, bit_reversal_muldiv )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::int_item int_item;
+ typedef typename TestFixture::hash_int hash_int;
+
+ struct set_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::algo::bit_reversal::muldiv bit_reversal;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef typename TestFixture::cmp compare;
+ typedef typename TestFixture::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListSet< rcu_type, int_item, set_traits > set_type;
+
+ set_type s( TestFixture::kSize, 8 );
+ this->test( s );
+}
// GCC 5: All this->test names should be written on single line, otherwise a runtime error will be encountered like as
// "No this->test named <test_name> can be found in this this->test case"
REGISTER_TYPED_TEST_CASE_P( SplitListMichaelSet,
- compare, less, cmpmix, item_counting, stat, back_off, static_bucket_table, free_list, static_bucket_table_free_list
+ compare, less, cmpmix, item_counting, stat, back_off, static_bucket_table, free_list, static_bucket_table_free_list, bit_reversal_swar, bit_reversal_lookup, bit_reversal_muldiv
);
projects / libcds.git / commitdiff