-//$$CDS-header$$
+/*
+ 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_CONTAINER_DETAILS_SKIP_LIST_BASE_H
#define CDSLIB_CONTAINER_DETAILS_SKIP_LIST_BASE_H
/** @ingroup cds_nonintrusive_helper
*/
namespace skip_list {
- using cds::intrusive::skip_list::implementation_tag;
-
/// Option specifying random level generator
template <typename Type>
using random_level_generator = cds::intrusive::skip_list::random_level_generator<Type>;
{
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 )