-//$$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_FCDEQUE_H
#define CDSLIB_CONTAINER_FCDEQUE_H
/// Metafunction converting option list to traits
/**
\p Options are:
- - \p opt::lock_type - mutex type, default is \p cds::sync::spin
- - \p opt::back_off - back-off strategy, defalt is \p cds::backoff::delay_of<2>
- - \p opt::allocator - allocator type, default is \ref CDS_DEFAULT_ALLOCATOR
+ - any \p cds::algo::flat_combining::make_traits options
- \p opt::stat - internal statistics, possible type: \ref stat, \ref empty_stat (the default)
- - \p opt::memory_model - C++ memory ordering model.
- List of all available memory ordering see opt::memory_model.
- Default if cds::opt::v:relaxed_ordering
- \p opt::enable_elimination - enable/disable operation \ref cds_elimination_description "elimination"
By default, the elimination is disabled. For queue, the elimination is possible if the queue
is empty.
op_push_back_move, ///< Push back (move semantics)
op_pop_front, ///< Pop front
op_pop_back, ///< Pop back
- op_clear, ///< Clear
- op_empty ///< Empty
+ op_clear ///< Clear
};
/// Flat combining publication list record
protected:
//@cond
- fc_kernel m_FlatCombining;
- deque_type m_Deque;
+ mutable fc_kernel m_FlatCombining;
+ deque_type m_Deque;
//@endcond
public:
value_type const& val ///< Value to be copied to inserted element
)
{
- fc_record * pRec = m_FlatCombining.acquire_record();
+ auto pRec = m_FlatCombining.acquire_record();
pRec->pValPush = &val;
if ( c_bEliminationEnabled )
else
m_FlatCombining.combine( op_push_front, pRec, *this );
- assert( pRec->is_done() );
+ assert( pRec->is_done());
m_FlatCombining.release_record( pRec );
m_FlatCombining.internal_statistics().onPushFront();
return true;
value_type&& val ///< Value to be moved to inserted element
)
{
- fc_record * pRec = m_FlatCombining.acquire_record();
+ auto pRec = m_FlatCombining.acquire_record();
pRec->pValPush = &val;
if ( c_bEliminationEnabled )
else
m_FlatCombining.combine( op_push_front_move, pRec, *this );
- assert( pRec->is_done() );
+ assert( pRec->is_done());
m_FlatCombining.release_record( pRec );
m_FlatCombining.internal_statistics().onPushFrontMove();
return true;
value_type const& val ///< Value to be copied to inserted element
)
{
- fc_record * pRec = m_FlatCombining.acquire_record();
+ auto pRec = m_FlatCombining.acquire_record();
pRec->pValPush = &val;
if ( c_bEliminationEnabled )
else
m_FlatCombining.combine( op_push_back, pRec, *this );
- assert( pRec->is_done() );
+ assert( pRec->is_done());
m_FlatCombining.release_record( pRec );
m_FlatCombining.internal_statistics().onPushBack();
return true;
value_type&& val ///< Value to be moved to inserted element
)
{
- fc_record * pRec = m_FlatCombining.acquire_record();
+ auto pRec = m_FlatCombining.acquire_record();
pRec->pValPush = &val;
if ( c_bEliminationEnabled )
else
m_FlatCombining.combine( op_push_back_move, pRec, *this );
- assert( pRec->is_done() );
+ assert( pRec->is_done());
m_FlatCombining.release_record( pRec );
m_FlatCombining.internal_statistics().onPushBackMove();
return true;
value_type& val ///< Target to be received the copy of removed element
)
{
- fc_record * pRec = m_FlatCombining.acquire_record();
+ auto pRec = m_FlatCombining.acquire_record();
pRec->pValPop = &val;
if ( c_bEliminationEnabled )
else
m_FlatCombining.combine( op_pop_front, pRec, *this );
- assert( pRec->is_done() );
+ assert( pRec->is_done());
m_FlatCombining.release_record( pRec );
m_FlatCombining.internal_statistics().onPopFront( pRec->bEmpty );
return !pRec->bEmpty;
value_type& val ///< Target to be received the copy of removed element
)
{
- fc_record * pRec = m_FlatCombining.acquire_record();
+ auto pRec = m_FlatCombining.acquire_record();
pRec->pValPop = &val;
if ( c_bEliminationEnabled )
else
m_FlatCombining.combine( op_pop_back, pRec, *this );
- assert( pRec->is_done() );
+ assert( pRec->is_done());
m_FlatCombining.release_record( pRec );
m_FlatCombining.internal_statistics().onPopBack( pRec->bEmpty );
return !pRec->bEmpty;
/// Clears the deque
void clear()
{
- fc_record * pRec = m_FlatCombining.acquire_record();
+ auto pRec = m_FlatCombining.acquire_record();
if ( c_bEliminationEnabled )
m_FlatCombining.batch_combine( op_clear, pRec, *this );
else
m_FlatCombining.combine( op_clear, pRec, *this );
- assert( pRec->is_done() );
+ assert( pRec->is_done());
m_FlatCombining.release_record( pRec );
}
/**
If the combining is in process the function waits while combining done.
*/
- bool empty()
+ bool empty() const
{
- fc_record * pRec = m_FlatCombining.acquire_record();
-
- if ( c_bEliminationEnabled )
- m_FlatCombining.batch_combine( op_empty, pRec, *this );
- else
- m_FlatCombining.combine( op_empty, pRec, *this );
-
- assert( pRec->is_done() );
- m_FlatCombining.release_record( pRec );
- return pRec->bEmpty;
+ bool bRet = false;
+ auto const& deq = m_Deque;
+ m_FlatCombining.invoke_exclusive( [&deq, &bRet]() { bRet = deq.empty(); } );
+ return bRet;
}
/// Internal statistics
// this function is called under FC mutex, so switch TSan off
CDS_TSAN_ANNOTATE_IGNORE_RW_BEGIN;
- switch ( pRec->op() ) {
+ switch ( pRec->op()) {
case op_push_front:
assert( pRec->pValPush );
- m_Deque.push_front( *(pRec->pValPush) );
+ m_Deque.push_front( *(pRec->pValPush));
break;
case op_push_front_move:
assert( pRec->pValPush );
- m_Deque.push_front( std::move( *(pRec->pValPush )) );
+ m_Deque.push_front( std::move( *(pRec->pValPush )));
break;
case op_push_back:
assert( pRec->pValPush );
- m_Deque.push_back( *(pRec->pValPush) );
+ m_Deque.push_back( *(pRec->pValPush));
break;
case op_push_back_move:
assert( pRec->pValPush );
- m_Deque.push_back( std::move( *(pRec->pValPush )) );
+ m_Deque.push_back( std::move( *(pRec->pValPush )));
break;
case op_pop_front:
assert( pRec->pValPop );
pRec->bEmpty = m_Deque.empty();
if ( !pRec->bEmpty ) {
- *(pRec->pValPop) = m_Deque.front();
+ *(pRec->pValPop) = std::move( m_Deque.front());
m_Deque.pop_front();
}
break;
assert( pRec->pValPop );
pRec->bEmpty = m_Deque.empty();
if ( !pRec->bEmpty ) {
- *(pRec->pValPop) = m_Deque.back();
+ *(pRec->pValPop) = std::move( m_Deque.back());
m_Deque.pop_back();
}
break;
case op_clear:
- while ( !m_Deque.empty() )
+ while ( !m_Deque.empty())
m_Deque.pop_front();
break;
- case op_empty:
- pRec->bEmpty = m_Deque.empty();
- break;
default:
assert(false);
break;
CDS_TSAN_ANNOTATE_IGNORE_RW_BEGIN;
for ( fc_iterator it = itBegin, itPrev = itEnd; it != itEnd; ++it ) {
- switch ( it->op() ) {
+ switch ( it->op()) {
case op_push_front:
+ if ( itPrev != itEnd
+ && (itPrev->op() == op_pop_front || (m_Deque.empty() && itPrev->op() == op_pop_back)))
+ {
+ collide( *it, *itPrev );
+ itPrev = itEnd;
+ }
+ else
+ itPrev = it;
+ break;
case op_push_front_move:
if ( itPrev != itEnd
&& (itPrev->op() == op_pop_front || ( m_Deque.empty() && itPrev->op() == op_pop_back )))
{
- collide( *it, *itPrev );
+ collide_move( *it, *itPrev );
itPrev = itEnd;
}
else
itPrev = it;
break;
case op_push_back:
- case op_push_back_move:
if ( itPrev != itEnd
- && (itPrev->op() == op_pop_back || ( m_Deque.empty() && itPrev->op() == op_pop_front )))
+ && (itPrev->op() == op_pop_back || (m_Deque.empty() && itPrev->op() == op_pop_front)))
{
collide( *it, *itPrev );
itPrev = itEnd;
else
itPrev = it;
break;
- case op_pop_front:
+ case op_push_back_move:
if ( itPrev != itEnd
- && ( itPrev->op() == op_push_front || itPrev->op() == op_push_front_move
- || ( m_Deque.empty() && ( itPrev->op() == op_push_back || itPrev->op() == op_push_back_move ))))
+ && (itPrev->op() == op_pop_back || ( m_Deque.empty() && itPrev->op() == op_pop_front )))
{
- collide( *itPrev, *it );
+ collide_move( *it, *itPrev );
itPrev = itEnd;
}
else
itPrev = it;
break;
+ case op_pop_front:
+ if ( itPrev != itEnd ) {
+ if ( m_Deque.empty()) {
+ switch ( itPrev->op()) {
+ case op_push_back:
+ collide( *itPrev, *it );
+ itPrev = itEnd;
+ break;
+ case op_push_back_move:
+ collide_move( *itPrev, *it );
+ itPrev = itEnd;
+ break;
+ default:
+ itPrev = it;
+ break;
+ }
+ }
+ else {
+ switch ( itPrev->op()) {
+ case op_push_front:
+ collide( *itPrev, *it );
+ itPrev = itEnd;
+ break;
+ case op_push_front_move:
+ collide_move( *itPrev, *it );
+ itPrev = itEnd;
+ break;
+ default:
+ itPrev = it;
+ break;
+ }
+ }
+ }
+ else
+ itPrev = it;
+ break;
case op_pop_back:
- if ( itPrev != itEnd
- && ( itPrev->op() == op_push_back || itPrev->op() == op_push_back_move
- || ( m_Deque.empty() && ( itPrev->op() == op_push_front || itPrev->op() == op_push_front_move ))))
- {
- collide( *itPrev, *it );
- itPrev = itEnd;
+ if ( itPrev != itEnd ) {
+ if ( m_Deque.empty()) {
+ switch ( itPrev->op()) {
+ case op_push_front:
+ collide( *itPrev, *it );
+ itPrev = itEnd;
+ break;
+ case op_push_front_move:
+ collide_move( *itPrev, *it );
+ itPrev = itEnd;
+ break;
+ default:
+ itPrev = it;
+ break;
+ }
+ }
+ else {
+ switch ( itPrev->op()) {
+ case op_push_back:
+ collide( *itPrev, *it );
+ itPrev = itEnd;
+ break;
+ case op_push_back_move:
+ collide_move( *itPrev, *it );
+ itPrev = itEnd;
+ break;
+ default:
+ itPrev = it;
+ break;
+ }
+ }
}
else
itPrev = it;
m_FlatCombining.operation_done( recPop );
m_FlatCombining.internal_statistics().onCollide();
}
+
+ void collide_move( fc_record& recPush, fc_record& recPop )
+ {
+ *(recPop.pValPop) = std::move( *(recPush.pValPush));
+ recPop.bEmpty = false;
+ m_FlatCombining.operation_done( recPush );
+ m_FlatCombining.operation_done( recPop );
+ m_FlatCombining.internal_statistics().onCollide();
+ }
//@endcond
};
projects / libcds.git / blobdiff