X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=gdax-orderbook-hpp%2Fdemo%2Fdependencies%2Flibcds-2.3.2%2Ftest%2Funit%2Fqueue%2Fintrusive_basket_queue_dhp.cpp;fp=gdax-orderbook-hpp%2Fdemo%2Fdependencies%2Flibcds-2.3.2%2Ftest%2Funit%2Fqueue%2Fintrusive_basket_queue_dhp.cpp;h=522ecc9e0c2868a4d347b7f4f504817628fac54e;hb=4223430d9168223029c7639149025c79e69b4f37;hp=0000000000000000000000000000000000000000;hpb=7ea7751a31c0388bf888052517be181a2989b113;p=c11concurrency-benchmarks.git diff --git a/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/test/unit/queue/intrusive_basket_queue_dhp.cpp b/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/test/unit/queue/intrusive_basket_queue_dhp.cpp new file mode 100644 index 0000000..522ecc9 --- /dev/null +++ b/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/test/unit/queue/intrusive_basket_queue_dhp.cpp @@ -0,0 +1,187 @@ +/* + 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_intrusive_msqueue.h" + +#include +#include +#include + +namespace { + namespace ci = cds::intrusive; + typedef cds::gc::DHP gc_type; + + + class IntrusiveBasketQueue_DHP : public cds_test::intrusive_msqueue + { + typedef cds_test::intrusive_msqueue base_class; + + protected: + typedef typename base_class::base_hook_item< ci::basket_queue::node> base_item_type; + typedef typename base_class::member_hook_item< ci::basket_queue::node> member_item_type; + + void SetUp() + { + typedef ci::BasketQueue< gc_type, base_item_type, + typename ci::basket_queue::make_traits< + ci::opt::hook< ci::basket_queue::base_hook< ci::opt::gc>> + >::type + > queue_type; + + cds::gc::dhp::GarbageCollector::Construct( queue_type::c_nHazardPtrCount ); + cds::threading::Manager::attachThread(); + } + + void TearDown() + { + cds::threading::Manager::detachThread(); + cds::gc::dhp::GarbageCollector::Destruct(); + } + + template + void check_array( V& arr ) + { + for ( size_t i = 0; i < arr.size() - 1; ++i ) { + ASSERT_EQ( arr[i].nDisposeCount, 2 ); + } + ASSERT_EQ( arr.back().nDisposeCount, 1 ); + } + }; + + TEST_F( IntrusiveBasketQueue_DHP, base_hook ) + { + typedef cds::intrusive::BasketQueue< gc_type, base_item_type, + typename ci::basket_queue::make_traits< + ci::opt::disposer< mock_disposer > + ,ci::opt::hook< ci::basket_queue::base_hook< ci::opt::gc>> + >::type + > test_queue; + + std::vector arr; + arr.resize(100); + { + test_queue q; + test(q, arr); + } + gc_type::scan(); + check_array( arr ); + } + + TEST_F( IntrusiveBasketQueue_DHP, base_item_counting ) + { + typedef cds::intrusive::BasketQueue< gc_type, base_item_type, + typename ci::basket_queue::make_traits< + ci::opt::disposer< mock_disposer > + , cds::opt::item_counter< cds::atomicity::item_counter > + , ci::opt::hook< ci::basket_queue::base_hook< ci::opt::gc>> + >::type + > test_queue; + + std::vector arr; + arr.resize(100); + { + test_queue q; + test(q, arr); + } + gc_type::scan(); + check_array( arr ); + } + + TEST_F( IntrusiveBasketQueue_DHP, base_stat ) + { + struct traits : public ci::basket_queue::traits + { + typedef ci::basket_queue::base_hook< ci::opt::gc> hook; + typedef mock_disposer disposer; + typedef cds::atomicity::item_counter item_counter; + typedef ci::basket_queue::stat<> stat; + typedef cds::opt::v::sequential_consistent memory_model; + }; + typedef cds::intrusive::BasketQueue< gc_type, base_item_type, traits > test_queue; + + std::vector arr; + arr.resize(100); + { + test_queue q; + test(q, arr); + } + gc_type::scan(); + check_array( arr ); + } + + TEST_F( IntrusiveBasketQueue_DHP, member_hook ) + { + typedef cds::intrusive::BasketQueue< gc_type, member_item_type, + typename ci::basket_queue::make_traits< + ci::opt::disposer< mock_disposer > + ,ci::opt::hook< ci::basket_queue::member_hook< + offsetof( member_item_type, hMember ), + ci::opt::gc + >> + >::type + > test_queue; + + std::vector arr; + arr.resize( 100 ); + { + test_queue q; + test( q, arr ); + } + gc_type::scan(); + check_array( arr ); + } + + TEST_F( IntrusiveBasketQueue_DHP, member_hook_stat ) + { + struct traits : public ci::basket_queue::traits + { + typedef ci::basket_queue::member_hook< + offsetof( member_item_type, hMember ), + ci::opt::gc + > hook; + typedef mock_disposer disposer; + typedef cds::atomicity::item_counter item_counter; + typedef ci::basket_queue::stat<> stat; + typedef cds::opt::v::sequential_consistent memory_model; + }; + typedef cds::intrusive::BasketQueue< gc_type, member_item_type, traits > test_queue; + + std::vector arr; + arr.resize( 100 ); + { + test_queue q; + test( q, arr ); + } + gc_type::scan(); + check_array( arr ); + } + +} // namespace +