2 This file is a part of libcds - Concurrent Data Structures library
4 (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
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 "hdr_intrusive_segmented_queue.h"
32 #include <cds/intrusive/segmented_queue.h>
33 #include <cds/gc/hp.h>
37 void HdrIntrusiveSegmentedQueue::SegmQueue_HP()
39 struct queue_traits : public cds::intrusive::segmented_queue::traits
41 typedef Disposer disposer;
43 typedef cds::intrusive::SegmentedQueue< cds::gc::HP, item, queue_traits > queue_type;
48 void HdrIntrusiveSegmentedQueue::SegmQueue_HP_mutex()
50 struct queue_traits : public
51 cds::intrusive::segmented_queue::make_traits <
52 cds::intrusive::opt::disposer< Disposer >
53 ,cds::opt::lock_type < std::mutex >
56 typedef cds::intrusive::SegmentedQueue< cds::gc::HP, item, queue_traits > queue_type;
61 void HdrIntrusiveSegmentedQueue::SegmQueue_HP_shuffle()
63 typedef cds::intrusive::SegmentedQueue< cds::gc::HP, item,
64 cds::intrusive::segmented_queue::make_traits<
65 cds::intrusive::opt::disposer< Disposer >
66 ,cds::opt::item_counter< cds::atomicity::item_counter >
67 ,cds::opt::permutation_generator< cds::opt::v::random_shuffle_permutation<> >
74 void HdrIntrusiveSegmentedQueue::SegmQueue_HP_stat()
76 typedef cds::intrusive::SegmentedQueue< cds::gc::HP, item,
77 cds::intrusive::segmented_queue::make_traits<
78 cds::intrusive::opt::disposer< Disposer >
79 ,cds::opt::item_counter< cds::atomicity::item_counter >
80 ,cds::opt::permutation_generator< cds::opt::v::random_permutation<> >
81 ,cds::opt::stat< cds::intrusive::segmented_queue::stat<> >
88 void HdrIntrusiveSegmentedQueue::SegmQueue_HP_cacheline_padding()
90 struct queue_traits : public cds::intrusive::segmented_queue::traits
92 typedef Disposer disposer;
93 enum { padding = cds::opt::cache_line_padding };
95 typedef cds::intrusive::SegmentedQueue< cds::gc::HP, item, queue_traits > queue_type;
100 void HdrIntrusiveSegmentedQueue::SegmQueue_HP_mutex_cacheline_padding()
102 struct queue_traits : public
103 cds::intrusive::segmented_queue::make_traits <
104 cds::intrusive::opt::disposer< Disposer >
105 ,cds::opt::lock_type < std::mutex >
106 ,cds::opt::padding< cds::opt::cache_line_padding >
109 typedef cds::intrusive::SegmentedQueue< cds::gc::HP, item, queue_traits > queue_type;
114 void HdrIntrusiveSegmentedQueue::SegmQueue_HP_shuffle_cacheline_padding()
116 typedef cds::intrusive::SegmentedQueue< cds::gc::HP, item,
117 cds::intrusive::segmented_queue::make_traits<
118 cds::intrusive::opt::disposer< Disposer >
119 ,cds::opt::item_counter< cds::atomicity::item_counter >
120 , cds::opt::padding< cds::opt::cache_line_padding >
121 ,cds::opt::permutation_generator< cds::opt::v::random_shuffle_permutation<> >
128 void HdrIntrusiveSegmentedQueue::SegmQueue_HP_stat_cacheline_padding()
130 typedef cds::intrusive::SegmentedQueue< cds::gc::HP, item,
131 cds::intrusive::segmented_queue::make_traits<
132 cds::intrusive::opt::disposer< Disposer >
133 , cds::opt::padding< cds::opt::cache_line_padding >
134 ,cds::opt::item_counter< cds::atomicity::item_counter >
135 ,cds::opt::permutation_generator< cds::opt::v::random_permutation<> >
136 ,cds::opt::stat< cds::intrusive::segmented_queue::stat<> >
143 void HdrIntrusiveSegmentedQueue::SegmQueue_HP_256_padding()
145 struct queue_traits : public cds::intrusive::segmented_queue::traits
147 typedef Disposer disposer;
148 enum { padding = 256 };
150 typedef cds::intrusive::SegmentedQueue< cds::gc::HP, item, queue_traits > queue_type;
155 void HdrIntrusiveSegmentedQueue::SegmQueue_HP_mutex_256_padding()
157 struct queue_traits : public
158 cds::intrusive::segmented_queue::make_traits <
159 cds::intrusive::opt::disposer< Disposer >
160 ,cds::opt::lock_type < std::mutex >
161 ,cds::opt::padding< 256 >
164 typedef cds::intrusive::SegmentedQueue< cds::gc::HP, item, queue_traits > queue_type;
169 void HdrIntrusiveSegmentedQueue::SegmQueue_HP_shuffle_256_padding()
171 typedef cds::intrusive::SegmentedQueue< cds::gc::HP, item,
172 cds::intrusive::segmented_queue::make_traits<
173 cds::intrusive::opt::disposer< Disposer >
174 ,cds::opt::item_counter< cds::atomicity::item_counter >
175 , cds::opt::padding< 256 >
176 ,cds::opt::permutation_generator< cds::opt::v::random_shuffle_permutation<> >
183 void HdrIntrusiveSegmentedQueue::SegmQueue_HP_stat_256_padding()
185 typedef cds::intrusive::SegmentedQueue< cds::gc::HP, item,
186 cds::intrusive::segmented_queue::make_traits<
187 cds::intrusive::opt::disposer< Disposer >
188 , cds::opt::padding< 256 >
189 ,cds::opt::item_counter< cds::atomicity::item_counter >
190 ,cds::opt::permutation_generator< cds::opt::v::random_permutation<> >
191 ,cds::opt::stat< cds::intrusive::segmented_queue::stat<> >
198 void HdrIntrusiveSegmentedQueue::SegmQueue_HP_cacheline_padding_bigdata()
200 struct queue_traits : public cds::intrusive::segmented_queue::traits
202 typedef Disposer disposer;
203 enum { padding = cds::opt::cache_line_padding | cds::opt::padding_tiny_data_only };
205 typedef cds::intrusive::SegmentedQueue< cds::gc::HP, big_item, queue_traits > queue_type;
210 void HdrIntrusiveSegmentedQueue::SegmQueue_HP_mutex_cacheline_padding_bigdata()
212 struct queue_traits : public
213 cds::intrusive::segmented_queue::make_traits <
214 cds::intrusive::opt::disposer< Disposer >
215 ,cds::opt::lock_type < std::mutex >
216 , cds::opt::padding< cds::opt::cache_line_padding | cds::opt::padding_tiny_data_only >
219 typedef cds::intrusive::SegmentedQueue< cds::gc::HP, big_item, queue_traits > queue_type;
224 void HdrIntrusiveSegmentedQueue::SegmQueue_HP_shuffle_cacheline_padding_bigdata()
226 typedef cds::intrusive::SegmentedQueue< cds::gc::HP, big_item,
227 cds::intrusive::segmented_queue::make_traits<
228 cds::intrusive::opt::disposer< Disposer >
229 ,cds::opt::item_counter< cds::atomicity::item_counter >
230 , cds::opt::padding< cds::opt::cache_line_padding | cds::opt::padding_tiny_data_only >
231 ,cds::opt::permutation_generator< cds::opt::v::random_shuffle_permutation<> >
238 void HdrIntrusiveSegmentedQueue::SegmQueue_HP_stat_cacheline_padding_bigdata()
240 typedef cds::intrusive::SegmentedQueue< cds::gc::HP, big_item,
241 cds::intrusive::segmented_queue::make_traits<
242 cds::intrusive::opt::disposer< Disposer >
243 , cds::opt::padding< cds::opt::cache_line_padding | cds::opt::padding_tiny_data_only >
244 ,cds::opt::item_counter< cds::atomicity::item_counter >
245 ,cds::opt::permutation_generator< cds::opt::v::random_permutation<> >
246 ,cds::opt::stat< cds::intrusive::segmented_queue::stat<> >