-//$$CDS-header$$
+/*
+ This file is a part of libcds - Concurrent Data Structures library
-#ifndef __CDS_CONTAINER_FCSTACK_H
-#define __CDS_CONTAINER_FCSTACK_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_FCSTACK_H
+#define CDSLIB_CONTAINER_FCSTACK_H
#include <cds/algo/flat_combining.h>
#include <cds/algo/elimination_opt.h>
};
/// FCStack type traits
- struct traits: public cds::algo::flat_combining::type_traits
+ struct traits: public cds::algo::flat_combining::traits
{
typedef empty_stat stat; ///< Internal statistics
static CDS_CONSTEXPR const bool enable_elimination = false; ///< Enable \ref cds_elimination_description "elimination"
/// Metafunction converting option list to traits
/**
\p Options are:
- - \p opt::lock_type - mutex type, default is \p cds::lock::Spin
- - \p opt::back_off - back-off strategy, defalt is \p cds::backoff::Default
- - \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: \p fcstack::stat, \p fcstack::empty_stat (the default)
- - \p opt::memory_model - C++ memory ordering model.
- List of all available memory ordering see \p opt::memory_model.
- Default is \p cds::opt::v:relaxed_ordering
- \p opt::enable_elimination - enable/disable operation \ref cds_elimination_description "elimination"
By default, the elimination is disabled.
*/
typedef Traits traits; ///< Stack traits
typedef typename traits::stat stat; ///< Internal statistics type
- static CDS_CONSTEXPR_CONST bool c_bEliminationEnabled = traits::enable_elimination; ///< \p true if elimination is enabled
+ static CDS_CONSTEXPR const bool c_bEliminationEnabled = traits::enable_elimination; ///< \p true if elimination is enabled
protected:
//@cond
op_push = cds::algo::flat_combining::req_Operation, ///< Push
op_push_move, ///< Push (move semantics)
op_pop, ///< Pop
- op_clear ///< Clear
+ op_clear, ///< Clear
+ op_empty ///< Empty
};
/// Flat combining publication list record
protected:
//@cond
- fc_kernel m_FlatCombining;
- stack_type m_Stack;
+ mutable fc_kernel m_FlatCombining;
+ stack_type m_Stack;
//@endcond
public:
*/
bool push( value_type const& val )
{
- 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, pRec, *this );
- assert( pRec->is_done() );
+ assert( pRec->is_done());
m_FlatCombining.release_record( pRec );
m_FlatCombining.internal_statistics().onPush();
return true;
*/
bool push( value_type&& val )
{
- 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_move, pRec, *this );
- assert( pRec->is_done() );
+ assert( pRec->is_done());
m_FlatCombining.release_record( pRec );
m_FlatCombining.internal_statistics().onPushMove();
*/
bool pop( value_type& val )
{
- 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, pRec, *this );
- assert( pRec->is_done() );
+ assert( pRec->is_done());
m_FlatCombining.release_record( pRec );
m_FlatCombining.internal_statistics().onPop( pRec->bEmpty );
/// Clears the stack
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() const
+ bool empty()
{
- m_FlatCombining.wait_while_combining();
- return m_Stack.empty();
+ auto 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;
}
/// Internal statistics
{
assert( pRec );
- switch ( pRec->op() ) {
+ // this function is called under FC mutex, so switch TSan off
+ CDS_TSAN_ANNOTATE_IGNORE_RW_BEGIN;
+ switch ( pRec->op()) {
case op_push:
assert( pRec->pValPush );
- m_Stack.push( *(pRec->pValPush ) );
+ m_Stack.push( *(pRec->pValPush ));
break;
case op_push_move:
assert( pRec->pValPush );
- m_Stack.push( std::move( *(pRec->pValPush )) );
+ m_Stack.push( std::move( *(pRec->pValPush )));
break;
case op_pop:
assert( pRec->pValPop );
pRec->bEmpty = m_Stack.empty();
if ( !pRec->bEmpty ) {
- *(pRec->pValPop) = m_Stack.top();
+ *(pRec->pValPop) = std::move( m_Stack.top());
m_Stack.pop();
}
break;
case op_clear:
- while ( !m_Stack.empty() )
+ while ( !m_Stack.empty())
m_Stack.pop();
break;
+ case op_empty:
+ pRec->bEmpty = m_Stack.empty();
+ break;
default:
assert(false);
break;
}
+ CDS_TSAN_ANNOTATE_IGNORE_RW_END;
}
/// Batch-processing flat combining
void fc_process( typename fc_kernel::iterator itBegin, typename fc_kernel::iterator itEnd )
{
+ // this function is called under FC mutex, so switch TSan off
+ CDS_TSAN_ANNOTATE_IGNORE_RW_BEGIN;
+
typedef typename fc_kernel::iterator fc_iterator;
for ( fc_iterator it = itBegin, itPrev = itEnd; it != itEnd; ++it ) {
- switch ( it->op() ) {
+ switch ( it->op()) {
case op_push:
case op_push_move:
case op_pop:
break;
}
}
+ CDS_TSAN_ANNOTATE_IGNORE_RW_END;
}
//@endcond
//@cond
bool collide( fc_record& rec1, fc_record& rec2 )
{
- switch ( rec1.op() ) {
+ switch ( rec1.op()) {
case op_push:
if ( rec2.op() == op_pop ) {
assert(rec1.pValPush);
}
break;
case op_pop:
- switch ( rec2.op() ) {
+ switch ( rec2.op()) {
case op_push:
case op_push_move:
return collide( rec2, rec1 );
};
}} // namespace cds::container
-#endif // #ifndef __CDS_CONTAINER_FCSTACK_H
+#endif // #ifndef CDSLIB_CONTAINER_FCSTACK_H
projects / libcds.git / blobdiff