2 This file is a part of libcds - Concurrent Data Structures library
4 (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
6 Source code repo: http://github.com/khizmax/libcds/
7 Download: http://sourceforge.net/projects/libcds/files/
9 Redistribution and use in source and binary forms, with or without
10 modification, are permitted provided that the following conditions are met:
12 * Redistributions of source code must retain the above copyright notice, this
13 list of conditions and the following disclaimer.
15 * Redistributions in binary form must reproduce the above copyright notice,
16 this list of conditions and the following disclaimer in the documentation
17 and/or other materials provided with the distribution.
19 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
20 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
23 FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
25 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
26 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
27 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 #include "test_generic_queue.h"
33 #include <cds/gc/hp.h>
34 #include <cds/container/msqueue.h>
37 namespace cc = cds::container;
38 typedef cds::gc::HP gc_type;
41 class MSQueue_HP : public cds_test::generic_queue
46 typedef cc::MSQueue< gc_type, int > queue_type;
48 cds::gc::hp::GarbageCollector::Construct( queue_type::c_nHazardPtrCount, 1, 16 );
49 cds::threading::Manager::attachThread();
54 cds::threading::Manager::detachThread();
55 cds::gc::hp::GarbageCollector::Destruct( true );
59 TEST_F( MSQueue_HP, defaulted )
61 typedef cds::container::MSQueue< gc_type, int > test_queue;
67 TEST_F( MSQueue_HP, item_counting )
69 typedef cds::container::MSQueue < gc_type, int,
70 typename cds::container::msqueue::make_traits <
71 cds::opt::item_counter < cds::atomicity::item_counter >
79 TEST_F( MSQueue_HP, relaxed )
81 typedef cds::container::MSQueue < gc_type, int,
82 typename cds::container::msqueue::make_traits <
83 cds::opt::item_counter< cds::atomicity::item_counter >
84 , cds::opt::memory_model < cds::opt::v::relaxed_ordering >
92 TEST_F( MSQueue_HP, aligned )
94 typedef cds::container::MSQueue < gc_type, int,
95 typename cds::container::msqueue::make_traits <
96 cds::opt::memory_model< cds::opt::v::relaxed_ordering>
97 , cds::opt::padding < 32 >
105 TEST_F( MSQueue_HP, seq_cst )
107 struct traits : public cc::msqueue::traits
109 typedef cds::opt::v::sequential_consistent memory_model;
110 typedef cds::atomicity::item_counter item_counter;
111 enum { padding = 64 };
113 typedef cds::container::MSQueue < gc_type, int, traits > test_queue;
119 TEST_F( MSQueue_HP, move )
121 typedef cds::container::MSQueue< gc_type, std::string > test_queue;
127 TEST_F( MSQueue_HP, move_item_counting )
129 struct traits : public cc::msqueue::traits
131 typedef cds::atomicity::item_counter item_counter;
133 typedef cds::container::MSQueue< gc_type, std::string, traits > test_queue;