d2f062af9225740b22a86c653ddcf5033c8c5798
[libcds.git] / tests / test-hdr / queue / hdr_basketqueue_hp.cpp
1 /*
2     This file is a part of libcds - Concurrent Data Structures library
3
4     (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
5
6     Source code repo: http://github.com/khizmax/libcds/
7     Download: http://sourceforge.net/projects/libcds/files/
8     
9     Redistribution and use in source and binary forms, with or without
10     modification, are permitted provided that the following conditions are met:
11
12     * Redistributions of source code must retain the above copyright notice, this
13       list of conditions and the following disclaimer.
14
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.
18
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.     
29 */
30
31 #include <cds/gc/hp.h>
32 #include <cds/container/basket_queue.h>
33
34 #include "queue/hdr_queue.h"
35
36 namespace queue {
37
38     void HdrTestQueue::BasketQueue_HP()
39     {
40         typedef cds::container::BasketQueue< cds::gc::HP, int > queue_type;
41         test_no_ic< queue_type >();
42     }
43
44     void HdrTestQueue::BasketQueue_HP_Counted()
45     {
46         struct traits : public cds::container::basket_queue::traits
47         {
48             typedef cds::atomicity::item_counter item_counter;
49         };
50         typedef cds::container::BasketQueue< cds::gc::HP, int, traits > queue_type;
51         test_ic< queue_type >();
52     }
53
54     void HdrTestQueue::BasketQueue_HP_relax()
55     {
56         struct traits : public
57             cds::container::basket_queue::make_traits <
58                 cds::opt::memory_model< cds::opt::v::relaxed_ordering>
59             > ::type
60         {};
61         typedef cds::container::BasketQueue< cds::gc::HP, int, traits > queue_type;
62         test_no_ic< queue_type >();
63     }
64
65     void HdrTestQueue::BasketQueue_HP_Counted_relax()
66     {
67         typedef cds::container::BasketQueue< cds::gc::HP, int,
68             typename cds::container::basket_queue::make_traits <
69                 cds::opt::item_counter< cds::atomicity::item_counter >
70                 ,cds::opt::memory_model< cds::opt::v::relaxed_ordering>
71             >::type
72         > queue_type;
73         test_ic< queue_type >();
74     }
75
76     void HdrTestQueue::BasketQueue_HP_seqcst()
77     {
78         struct traits : public cds::container::basket_queue::traits
79         {
80             typedef cds::opt::v::sequential_consistent memory_model;
81         };
82         typedef cds::container::BasketQueue< cds::gc::HP, int, traits > queue_type;
83         test_no_ic< queue_type >();
84     }
85
86     void HdrTestQueue::BasketQueue_HP_Counted_seqcst()
87     {
88         typedef cds::container::BasketQueue < cds::gc::HP, int,
89             typename cds::container::basket_queue::make_traits <
90                 cds::opt::item_counter< cds::atomicity::item_counter >
91                 ,cds::opt::memory_model< cds::opt::v::sequential_consistent>
92             >::type
93         > queue_type;
94         test_ic< queue_type >();
95     }
96
97     void HdrTestQueue::BasketQueue_HP_relax_align()
98     {
99         typedef cds::container::BasketQueue < cds::gc::HP, int,
100             typename cds::container::basket_queue::make_traits <
101                 cds::opt::memory_model< cds::opt::v::relaxed_ordering>
102                 ,cds::opt::padding< 16 >
103             >::type
104         > queue_type;
105         test_no_ic< queue_type >();
106     }
107
108     void HdrTestQueue::BasketQueue_HP_Counted_relax_align()
109     {
110         struct traits : public cds::container::basket_queue::traits
111         {
112             typedef cds::atomicity::item_counter item_counter;
113             typedef cds::opt::v::relaxed_ordering memory_model;
114             enum { padding = 32 };
115         };
116         typedef cds::container::BasketQueue < cds::gc::HP, int, traits > queue_type;
117         test_ic< queue_type >();
118     }
119
120     void HdrTestQueue::BasketQueue_HP_seqcst_align()
121     {
122         typedef cds::container::BasketQueue < cds::gc::HP, int,
123             typename cds::container::basket_queue::make_traits <
124                 cds::opt::memory_model< cds::opt::v::sequential_consistent>
125                 , cds::opt::padding< cds::opt::no_special_padding >
126             > ::type
127         > queue_type;
128         test_no_ic< queue_type >();
129     }
130
131     void HdrTestQueue::BasketQueue_HP_Counted_seqcst_align()
132     {
133         typedef cds::container::BasketQueue < cds::gc::HP, int,
134             typename cds::container::basket_queue::make_traits <
135                 cds::opt::item_counter< cds::atomicity::item_counter >
136                 ,cds::opt::memory_model< cds::opt::v::sequential_consistent>
137                 ,cds::opt::padding< cds::opt::cache_line_padding >
138             > ::type
139         > queue_type;
140         test_ic< queue_type >();
141     }
142
143 }   // namespace queue