Revert prev change

diff --git a/cds/intrusive/mspriority_queue.h b/cds/intrusive/mspriority_queue.h
index 6c7827283cbb589402ce6772bb5f1c901004ac51..41fd568908005e13dcc2e44ba3e3070d3d4f513c 100644 (file)
--- a/cds/intrusive/mspriority_queue.h
+++ b/cds/intrusive/mspriority_queue.h
@@ -323,7 +323,8 @@ namespace cds { namespace intrusive {
                 m_Stat.onPopFailed();
                 return nullptr;
             }
-            counter_type nBottom = m_ItemCounter.dec();
+            counter_type nBottom = m_ItemCounter.reversed_value();
+            m_ItemCounter.dec();
             assert( nBottom < m_Heap.capacity() );
             assert( nBottom > 0 );
 

diff --git a/test/stress/pqueue/pop.cpp b/test/stress/pqueue/pop.cpp
index 75704ed70d1922037b5ffd220030e828162344a9..a5253195478e717d740cd53b926584db2f6dc279 100644 (file)
--- a/test/stress/pqueue/pop.cpp
+++ b/test/stress/pqueue/pop.cpp
@@ -70,25 +70,6 @@ namespace {
                     ++m_nPopSuccess;
                     nPrevKey = val.key;
 
-                    /*
-                    while ( !m_Queue.empty() ) {
-                        if ( m_Queue.pop( val )) {
-                            ++m_nPopSuccess;
-                            if ( val.key > nPrevKey ) {
-                                ++m_nPopError;
-                                m_arrFailedPops.emplace_back( failed_pops{ nPrevKey, val.key } );
-                            }
-                            else if ( val.key == nPrevKey ) {
-                                ++m_nPopErrorEq;
-                                m_arrFailedPops.emplace_back( failed_pops{ nPrevKey, val.key } );
-                            }
-                            nPrevKey = val.key;
-                        }
-                        else
-                            ++m_nPopFailed;
-                    }
-                    */
-
                     while ( m_Queue.pop( val )) {
                         ++m_nPopSuccess;
                         if ( val.key > nPrevKey ) {