fixed adding file problem

[c11concurrency-benchmarks.git] / gdax-orderbook-hpp / demo / dependencies / libcds-2.3.2 / test / stress / queue / bounded_queue_fulness.cpp

diff --git a/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/test/stress/queue/bounded_queue_fulness.cpp b/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/test/stress/queue/bounded_queue_fulness.cpp
new file mode 100644 (file)
index 0000000..002d4db
--- /dev/null
+++ b/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/test/stress/queue/bounded_queue_fulness.cpp
@@ -0,0 +1,161 @@
+/*
+    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.
+*/
+
+#include "queue_type.h"
+
+
+/*
+    Bounded queue test.
+    The test checks the behaviour of bounded queue when it is almost full.
+    Many algorithms says the queue is full when it is not, and vice versa.
+*/
+namespace {
+
+    static size_t s_nThreadCount = 8;
+    static size_t s_nQueueSize = 1024;
+    static size_t s_nPassCount = 1000000;
+
+    class bounded_queue_fulness: public cds_test::stress_fixture
+    {
+        typedef cds_test::stress_fixture base_class;
+
+    protected:
+        template <class Queue>
+        class Strain: public cds_test::thread
+        {
+            typedef cds_test::thread base_class;
+
+        public:
+            Queue&              m_Queue;
+            size_t              m_nPushError = 0;
+            size_t              m_nPopError  = 0;
+
+        public:
+            Strain( cds_test::thread_pool& pool, Queue& q )
+                : base_class( pool )
+                , m_Queue( q )
+            {}
+
+            Strain( Strain& src )
+                : base_class( src )
+                , m_Queue( src.m_Queue )
+            {}
+
+            virtual thread * clone()
+            {
+                return new Strain( *this );
+            }
+
+            virtual void test()
+            {
+                for ( size_t i = 0; i < s_nPassCount; ++i ) {
+                    if ( !m_Queue.push( i ))
+                        ++m_nPushError;
+                    size_t item;
+                    if ( !m_Queue.pop( item ))
+                        ++m_nPopError;
+                }
+            }
+        };
+
+    public:
+        static void SetUpTestCase()
+        {
+            cds_test::config const& cfg = get_config( "bounded_queue_fulness" );
+
+            s_nThreadCount = cfg.get_size_t( "ThreadCount", s_nThreadCount );
+            s_nQueueSize = cfg.get_size_t( "QueueSize", s_nQueueSize );
+            s_nPassCount = cfg.get_size_t( "PassCount", s_nPassCount );
+
+            if ( s_nThreadCount == 0u )
+                s_nThreadCount = 1;
+            if ( s_nQueueSize == 0u )
+                s_nQueueSize = 1024;
+            if ( s_nPassCount == 0u )
+                s_nPassCount = 1;
+        }
+
+        //static void TearDownTestCase();
+
+    protected:
+        template <class Queue>
+        void analyze( Queue& q )
+        {
+            cds_test::thread_pool& pool = get_pool();
+
+            size_t nPushError = 0;
+            size_t nPopError = 0;
+            for ( size_t i = 0; i < pool.size(); ++i ) {
+                Strain<Queue>& strain = static_cast<Strain<Queue> &>(pool.get( i ));
+                nPushError += strain.m_nPushError;
+                nPopError  += strain.m_nPopError;
+            }
+            EXPECT_TRUE( !q.empty());
+            EXPECT_EQ( nPushError, 0u );
+            EXPECT_EQ( nPopError, 0u );
+        }
+
+        template <class Queue>
+        void test( Queue& q )
+        {
+            cds_test::thread_pool& pool = get_pool();
+            pool.add( new Strain<Queue>( pool, q ), s_nThreadCount );
+
+            size_t nSize = q.capacity() - s_nThreadCount;
+            for ( size_t i = 0; i < nSize; ++i )
+                q.push( i );
+
+            propout() << std::make_pair( "thread_count", s_nThreadCount )
+                << std::make_pair( "push_count", s_nQueueSize )
+                << std::make_pair( "pass_count", s_nPassCount );
+
+            std::chrono::milliseconds duration = pool.run();
+            propout() << std::make_pair( "duration", duration );
+
+            analyze( q );
+
+            propout() << q.statistics();
+        }
+    };
+
+#undef CDSSTRESS_Queue_F
+#define CDSSTRESS_Queue_F( test_fixture, type_name ) \
+    TEST_F( test_fixture, type_name ) \
+    { \
+        typedef queue::Types< size_t >::type_name queue_type; \
+        queue_type queue( s_nQueueSize ); \
+        test( queue ); \
+    }
+
+    CDSSTRESS_VyukovQueue( bounded_queue_fulness )
+
+#undef CDSSTRESS_Queue_F
+
+} // namespace queue