-//$$CDS-header$$
+/*
+ This file is a part of libcds - Concurrent Data Structures library
-#ifndef __CDS_CONTAINER_DETAILS_SKIP_LIST_BASE_H
-#define __CDS_CONTAINER_DETAILS_SKIP_LIST_BASE_H
+ (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_CONTAINER_DETAILS_SKIP_LIST_BASE_H
+#define CDSLIB_CONTAINER_DETAILS_SKIP_LIST_BASE_H
#include <cds/intrusive/details/skip_list_base.h>
#include <cds/container/details/base.h>
/** @ingroup cds_nonintrusive_helper
*/
namespace skip_list {
-
/// Option specifying random level generator
template <typename Type>
using random_level_generator = cds::intrusive::skip_list::random_level_generator<Type>;
/// Xor-shift random level generator
- typedef cds::intrusive::skip_list::xorshift xorshift;
+ template <unsigned MaxHeight>
+ using xor_shift = cds::intrusive::skip_list::xor_shift<MaxHeight >;
+
+ /// Xor-shift random level generator, max height 32
+ typedef cds::intrusive::skip_list::xorshift32 xorshift32;
+
+ /// Xor-shift random level generator, max height 24
+ typedef cds::intrusive::skip_list::xorshift24 xorshift24;
+
+ /// Xor-shift random level generator, max height 16
+ typedef cds::intrusive::skip_list::xorshift16 xorshift16;
+
+ //@cond
+ // for backward compatibility
+ using cds::intrusive::skip_list::xorshift;
+ //@endcond
/// Turbo-pascal random level generator
- typedef cds::intrusive::skip_list::turbo_pascal turbo_pascal;
+ template <unsigned MaxHeight>
+ using turbo = cds::intrusive::skip_list::turbo<MaxHeight >;
+
+ /// Turbo-pascal random level generator, max height 32
+ typedef cds::intrusive::skip_list::turbo32 turbo32;
+
+ /// Turbo-pascal random level generator, max height 24
+ typedef cds::intrusive::skip_list::turbo24 turbo24;
+
+ /// Turbo-pascal random level generator, max height 16
+ typedef cds::intrusive::skip_list::turbo16 turbo16;
+
+ //@cond
+ // for backward compatibility
+ using cds::intrusive::skip_list::turbo_pascal;
+ //@endcond
/// Skip list internal statistics
template <typename EventCounter = cds::atomicity::event_counter>
- using stat = cds::intrusive::skip_list::stat < EventCounter > ;
+ using stat = cds::intrusive::skip_list::stat < EventCounter >;
/// Skip list empty internal statistics
typedef cds::intrusive::skip_list::empty_stat empty_stat;
See \p skip_list::random_level_generator option setter.
*/
- typedef turbo_pascal random_level_generator;
+ typedef turbo32 random_level_generator;
/// Allocator for skip-list nodes, \p std::allocator interface
typedef CDS_DEFAULT_ALLOCATOR allocator;
- \p opt::item_counter - the type of item counting feature. Default is \p atomicity::empty_item_counter that is no item counting.
- \p opt::memory_model - C++ memory ordering model. Can be \p opt::v::relaxed_ordering (relaxed memory model, the default)
or \p opt::v::sequential_consistent (sequentially consisnent memory model).
- - \p skip_list::random_level_generator - random level generator. Can be \p skip_list::xorshift, \p skip_list::turbo_pascal or
- user-provided one.
- Default is \p %skip_list::turbo_pascal.
+ - \p skip_list::random_level_generator - random level generator. Can be \p skip_list::xor_shift, \p skip_list::turbo or
+ user-provided one. Default is \p %skip_list::turbo32.
- \p opt::allocator - allocator for skip-list node. Default is \ref CDS_DEFAULT_ALLOCATOR.
- \p opt::back_off - back-off strategy used. If the option is not specified, the \p cds::backoff::Default is used.
- \p opt::stat - internal statistics. Available types: \p skip_list::stat, \p skip_list::empty_stat (the default)
- - \p opt::rcu_check_deadlock - a deadlock checking policy for RCU-based skip-list.
+ - \p opt::rcu_check_deadlock - a deadlock checking policy for RCU-based skip-list.
Default is \p opt::v::rcu_throw_deadlock
*/
{
return c_nNodeSize + (nHeight - 1) * c_nTowerItemSize;
}
+
static unsigned char * alloc_space( unsigned int nHeight )
{
+ unsigned char * pMem;
+ size_t const sz = node_size( nHeight );
+
if ( nHeight > 1 ) {
- unsigned char * pMem = tower_allocator_type().allocate( node_size(nHeight) );
+ pMem = tower_allocator_type().allocate( sz );
// check proper alignments
assert( (((uintptr_t) pMem) & (alignof(node_type) - 1)) == 0 );
assert( (((uintptr_t) (pMem + c_nNodeSize)) & (alignof(node_tower_item) - 1)) == 0 );
return pMem;
}
+ else
+ pMem = reinterpret_cast<unsigned char *>( node_allocator_type().allocate( 1 ));
- return reinterpret_cast<unsigned char *>( node_allocator_type().allocate(1));
+ return pMem;
}
static void free_space( unsigned char * p, unsigned int nHeight )
{
assert( p != nullptr );
+
if ( nHeight == 1 )
node_allocator_type().deallocate( reinterpret_cast<node_type *>(p), 1 );
else
node_type * New( unsigned int nHeight, Q const& v )
{
unsigned char * pMem = alloc_space( nHeight );
- return new( pMem )
+ node_type * p = new( pMem )
node_type( nHeight, nHeight > 1 ? reinterpret_cast<node_tower_item *>(pMem + c_nNodeSize) : nullptr, v );
+ return p;
}
template <typename... Args>
node_type * New( unsigned int nHeight, Args&&... args )
{
unsigned char * pMem = alloc_space( nHeight );
- return new( pMem )
+ node_type * p = new( pMem )
node_type( nHeight, nHeight > 1 ? reinterpret_cast<node_tower_item *>(pMem + c_nNodeSize) : nullptr,
std::forward<Args>(args)... );
+ return p;
}
void Delete( node_type * p )
}} // namespace cds::container
-#endif // #ifndef __CDS_CONTAINER_DETAILS_SKIP_LIST_BASE_H
+#endif // #ifndef CDSLIB_CONTAINER_DETAILS_SKIP_LIST_BASE_H
projects / libcds.git / blobdiff