fixed adding file problem
[c11concurrency-benchmarks.git] / gdax-orderbook-hpp / demo / dependencies / libcds-2.3.2 / test / unit / tree / ellen_bintree_map_dhp.cpp
diff --git a/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/test/unit/tree/ellen_bintree_map_dhp.cpp b/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/test/unit/tree/ellen_bintree_map_dhp.cpp
new file mode 100644 (file)
index 0000000..0d1a715
--- /dev/null
@@ -0,0 +1,202 @@
+/*
+    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 "test_tree_map_hp.h"
+
+#include <cds/container/ellen_bintree_map_dhp.h>
+#include "test_ellen_bintree_update_desc_pool.h"
+
+namespace {
+    namespace cc = cds::container;
+    typedef cds::gc::DHP gc_type;
+
+    class EllenBinTreeMap_DHP : public cds_test::container_tree_map_hp
+    {
+    protected:
+        typedef cds_test::container_tree_map_hp base_class;
+
+        void SetUp()
+        {
+            typedef cc::EllenBinTreeMap< gc_type, key_type, value_type > map_type;
+
+            cds::gc::dhp::smr::construct( map_type::c_nHazardPtrCount );
+            cds::threading::Manager::attachThread();
+        }
+
+        void TearDown()
+        {
+            cds::threading::Manager::detachThread();
+            cds::gc::dhp::smr::destruct();
+        }
+    };
+
+
+    TEST_F( EllenBinTreeMap_DHP, compare )
+    {
+        typedef cc::EllenBinTreeMap< gc_type, key_type, value_type,
+            typename cc::ellen_bintree::make_map_traits<
+                cds::opt::compare< cmp >
+            >::type
+        > map_type;
+
+        map_type m;
+        test( m );
+    }
+
+    TEST_F( EllenBinTreeMap_DHP, less )
+    {
+        typedef cc::EllenBinTreeMap< gc_type, key_type, value_type,
+            typename cc::ellen_bintree::make_map_traits<
+                cds::opt::less< base_class::less >
+            >::type
+        > map_type;
+
+        map_type m;
+        test( m );
+    }
+
+    TEST_F( EllenBinTreeMap_DHP, cmpmix )
+    {
+        typedef cc::EllenBinTreeMap< gc_type, key_type, value_type,
+            typename cc::ellen_bintree::make_map_traits<
+                cds::opt::less< base_class::less >
+                ,cds::opt::compare< cmp >
+            >::type
+        > map_type;
+
+        map_type m;
+        test( m );
+    }
+
+    TEST_F( EllenBinTreeMap_DHP, update_desc_pool )
+    {
+        struct map_traits: public cc::ellen_bintree::traits
+        {
+            typedef cmp compare;
+            typedef cds::memory::pool_allocator<cds_test::update_desc, cds_test::pool_accessor> update_desc_allocator;
+        };
+        typedef cc::EllenBinTreeMap< gc_type, key_type, value_type, map_traits > map_type;
+
+        map_type m;
+        test( m );
+    }
+
+    TEST_F( EllenBinTreeMap_DHP, update_desc_lazy_pool )
+    {
+        struct map_traits: public cc::ellen_bintree::traits
+        {
+            typedef cmp compare;
+            typedef cds::memory::pool_allocator< cds_test::update_desc, cds_test::lazy_pool_accessor> update_desc_allocator;
+        };
+        typedef cc::EllenBinTreeMap< gc_type, key_type, value_type, map_traits > map_type;
+
+        map_type m;
+        test( m );
+    }
+
+    TEST_F( EllenBinTreeMap_DHP, item_counting )
+    {
+        struct map_traits: public cc::ellen_bintree::traits
+        {
+            typedef cmp compare;
+            typedef base_class::less less;
+            typedef cds::atomicity::item_counter item_counter;
+            typedef cds::memory::pool_allocator<cds_test::update_desc, cds_test::pool_accessor> update_desc_allocator;
+        };
+        typedef cc::EllenBinTreeMap< gc_type, key_type, value_type, map_traits > map_type;
+
+        map_type m;
+        test( m );
+    }
+
+    TEST_F( EllenBinTreeMap_DHP, backoff )
+    {
+        struct map_traits: public cc::ellen_bintree::traits
+        {
+            typedef cmp compare;
+            typedef base_class::less less;
+            typedef cds::atomicity::item_counter item_counter;
+            typedef cds::backoff::yield back_off;
+            typedef cds::memory::pool_allocator<cds_test::update_desc, cds_test::lazy_pool_accessor> update_desc_allocator;
+        };
+        typedef cc::EllenBinTreeMap< gc_type, key_type, value_type, map_traits > map_type;
+
+        map_type m;
+        test( m );
+    }
+
+    TEST_F( EllenBinTreeMap_DHP, stat )
+    {
+        struct map_traits: public cc::ellen_bintree::traits
+        {
+            typedef base_class::less less;
+            typedef cds::atomicity::item_counter item_counter;
+            typedef cds::backoff::yield back_off;
+            typedef cc::ellen_bintree::stat<> stat;
+            typedef cds::memory::pool_allocator<cds_test::update_desc, cds_test::pool_accessor> update_desc_allocator;
+        };
+        typedef cc::EllenBinTreeMap< gc_type, key_type, value_type, map_traits > map_type;
+
+        map_type m;
+        test( m );
+    }
+
+    TEST_F( EllenBinTreeMap_DHP, copy_policy )
+    {
+        struct map_traits: public cc::ellen_bintree::traits
+        {
+            typedef base_class::less less;
+            typedef cds::atomicity::item_counter item_counter;
+            typedef cds::memory::pool_allocator<cds_test::update_desc, cds_test::pool_accessor> update_desc_allocator;
+            typedef copy_key copy_policy;
+        };
+        typedef cc::EllenBinTreeMap< gc_type, key_type, value_type, map_traits > map_type;
+
+        map_type m;
+        test( m );
+    }
+
+    TEST_F( EllenBinTreeMap_DHP, seq_cst )
+    {
+        struct map_traits: public cc::ellen_bintree::traits
+        {
+            typedef cmp compare;
+            typedef cds::atomicity::item_counter item_counter;
+            typedef cds::backoff::yield back_off;
+            typedef cds::memory::pool_allocator<cds_test::update_desc, cds_test::lazy_pool_accessor> update_desc_allocator;
+            typedef cds::opt::v::sequential_consistent memory_model;
+        };
+        typedef cc::EllenBinTreeMap< gc_type, key_type, value_type, map_traits > map_type;
+
+        map_type m;
+        test( m );
+    }
+
+} // namespace