1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
|
// Copyright (c) 2006-2018 Maxim Khizhinsky
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)
#ifndef CDSSTRESS_PQUEUE_TYPES_H
#define CDSSTRESS_PQUEUE_TYPES_H
#include <cds/urcu/general_instant.h>
#include <cds/urcu/general_buffered.h>
#include <cds/urcu/general_threaded.h>
#include <cds/urcu/signal_buffered.h>
#include <cds/container/mspriority_queue.h>
#include <cds/container/fcpriority_queue.h>
#include <cds/container/ellen_bintree_set_hp.h>
#include <cds/container/ellen_bintree_set_dhp.h>
#include <cds/container/ellen_bintree_set_rcu.h>
#include <cds/container/skip_list_set_hp.h>
#include <cds/container/skip_list_set_dhp.h>
#include <cds/container/skip_list_set_rcu.h>
#include <cds/sync/spinlock.h>
#include <queue>
#include <vector>
#include <deque>
#include <mutex> //unique_lock
#include <boost/container/stable_vector.hpp>
#include <boost/container/deque.hpp>
#include <cds_test/stress_test.h>
#include <cds_test/stat_ellenbintree_out.h>
#include <cds_test/stat_skiplist_out.h>
#include <cds_test/stat_flat_combining_out.h>
namespace pqueue {
namespace cc = cds::container;
namespace co = cds::opt;
namespace details {
template <typename T, typename Container, typename Lock, typename Less = std::less<typename Container::value_type> >
class StdPQueue
{
public:
typedef T value_type;
typedef std::priority_queue<value_type, Container, Less> pqueue_type;
private:
pqueue_type m_PQueue;
mutable Lock m_Lock;
typedef std::unique_lock<Lock> scoped_lock;
public:
bool push( value_type const& val )
{
scoped_lock l( m_Lock );
m_PQueue.push( val );
return true;
}
bool pop( value_type& dest )
{
scoped_lock l( m_Lock );
if ( !m_PQueue.empty()) {
dest = m_PQueue.top();
m_PQueue.pop();
return true;
}
return false;
}
template <typename Q, typename MoveFunc>
bool pop_with( Q& dest, MoveFunc f )
{
scoped_lock l( m_Lock );
if ( !m_PQueue.empty()) {
f( dest, m_PQueue.top());
m_PQueue.pop();
return true;
}
return false;
}
void clear()
{
scoped_lock l( m_Lock );
while ( !m_PQueue.empty())
m_PQueue.pop();
}
template <typename Func>
void clear_with( Func f )
{
scoped_lock l( m_Lock );
while ( !m_PQueue.empty()) {
f( m_PQueue.top());
m_PQueue.pop();
}
}
bool empty() const
{
scoped_lock l( m_Lock );
return m_PQueue.empty();
}
size_t size() const
{
scoped_lock l( m_Lock );
return m_PQueue.size();
}
cds::opt::none statistics() const
{
return cds::opt::none();
}
};
// EllenBinTree priority queue
template <typename GC>
struct EllenBinTreePQueue_pop_max
{
template <typename T, typename Tree>
bool operator()( T& dest, Tree& container ) const
{
typename Tree::guarded_ptr gp( container.extract_max());
if ( gp )
dest = *gp;
return !gp.empty();
}
};
template <typename RCU>
struct EllenBinTreePQueue_pop_max< cds::urcu::gc<RCU> >
{
template <typename T, typename Tree>
bool operator()( T& dest, Tree& container ) const
{
typename Tree::exempt_ptr ep( container.extract_max());
if ( ep )
dest = *ep;
return !ep.empty();
}
};
template <typename GC>
struct EllenBinTreePQueue_pop_min
{
template <typename T, typename Tree>
bool operator()( T& dest, Tree& container ) const
{
typename Tree::guarded_ptr gp( container.extract_min());
if ( gp )
dest = *gp;
return !gp.empty();
}
};
template <typename RCU>
struct EllenBinTreePQueue_pop_min< cds::urcu::gc<RCU> >
{
template <typename T, typename Tree>
bool operator()( T& dest, Tree& container ) const
{
typename Tree::exempt_ptr ep( container.extract_min());
if ( ep )
dest = *ep;
return !ep.empty();
}
};
template <typename GC, typename Key, typename T, typename Traits, bool Max = true>
class EllenBinTreePQueue : protected cds::container::EllenBinTreeSet< GC, Key, T, Traits >
{
typedef cds::container::EllenBinTreeSet< GC, Key, T, Traits > base_class;
template <typename GC2> friend struct EllenBinTreePQueue_pop_max;
template <typename GC2> friend struct EllenBinTreePQueue_pop_min;
public:
typedef T value_type;
bool push( value_type const& val )
{
return base_class::insert( val );
}
bool pop( value_type& dest )
{
return Max ? EllenBinTreePQueue_pop_max< typename base_class::gc >()(dest, *this)
: EllenBinTreePQueue_pop_min< typename base_class::gc >()(dest, *this);
}
void clear()
{
base_class::clear();
}
bool empty() const
{
return base_class::empty();
}
size_t size() const
{
return base_class::size();
}
typename base_class::stat const& statistics() const
{
return base_class::statistics();
}
};
// SkipList property queue
template <typename GC>
struct SkipListPQueue_pop_max
{
template <typename T, typename Set>
bool operator()( T& dest, Set& container ) const
{
typename Set::guarded_ptr gp( container.extract_max());
if ( gp )
dest = *gp;
return !gp.empty();
}
};
template <typename RCU>
struct SkipListPQueue_pop_max< cds::urcu::gc<RCU> >
{
template <typename T, typename Set>
bool operator()( T& dest, Set& container ) const
{
typename Set::exempt_ptr ep( container.extract_max());
if ( ep )
dest = *ep;
return !ep.empty();
}
};
template <typename GC>
struct SkipListPQueue_pop_min
{
template <typename T, typename Set>
bool operator()( T& dest, Set& container ) const
{
typename Set::guarded_ptr gp( container.extract_min());
if ( gp )
dest = *gp;
return !gp.empty();
}
};
template <typename RCU>
struct SkipListPQueue_pop_min< cds::urcu::gc<RCU> >
{
template <typename T, typename Set>
bool operator()( T& dest, Set& container ) const
{
typename Set::exempt_ptr ep( container.extract_min());
if ( ep )
dest = *ep;
return !ep.empty();
}
};
template <typename GC, typename T, typename Traits, bool Max = true>
class SkipListPQueue : protected cds::container::SkipListSet< GC, T, Traits >
{
typedef cds::container::SkipListSet< GC, T, Traits > base_class;
template <typename GC2> friend struct SkipListPQueue_pop_max;
template <typename GC2> friend struct SkipListPQueue_pop_min;
public:
typedef T value_type;
bool push( value_type const& val )
{
return base_class::insert( val );
}
bool pop( value_type& dest )
{
return Max ? SkipListPQueue_pop_max< typename base_class::gc >()(dest, *this)
: SkipListPQueue_pop_min< typename base_class::gc >()(dest, *this);
}
void clear()
{
base_class::clear();
}
bool empty() const
{
return base_class::empty();
}
size_t size() const
{
return base_class::size();
}
typename base_class::stat const& statistics() const
{
return base_class::statistics();
}
};
} // namespace details
template <typename Value>
struct Types
{
static size_t const c_nBoundedCapacity = 1024 * 1024 * 16;
typedef std::less<Value> less;
struct cmp {
int operator()( Value const& v1, Value const& v2 ) const
{
return less()( v1, v2 ) ? -1 : less()( v2, v1 ) ? 1 : 0;
}
};
typedef cds::urcu::gc< cds::urcu::general_instant<> > rcu_gpi;
typedef cds::urcu::gc< cds::urcu::general_buffered<> > rcu_gpb;
typedef cds::urcu::gc< cds::urcu::general_threaded<> > rcu_gpt;
#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
typedef cds::urcu::gc< cds::urcu::signal_buffered<> > rcu_shb;
#endif
// MSPriorityQueue
struct traits_MSPriorityQueue_static_less : public
cc::mspriority_queue::make_traits <
co::buffer < co::v::initialized_static_buffer< char, c_nBoundedCapacity > >
> ::type
{};
typedef cc::MSPriorityQueue< Value, traits_MSPriorityQueue_static_less > MSPriorityQueue_static_less;
struct traits_MSPriorityQueue_static_less_stat : public cc::mspriority_queue::traits
{
typedef co::v::initialized_static_buffer< char, c_nBoundedCapacity > buffer;
typedef cc::mspriority_queue::stat<> stat;
};
typedef cc::MSPriorityQueue< Value, traits_MSPriorityQueue_static_less_stat > MSPriorityQueue_static_less_stat;
struct traits_MSPriorityQueue_static_cmp : public
cc::mspriority_queue::make_traits <
co::buffer< co::v::initialized_static_buffer< char, c_nBoundedCapacity > >
, co::compare < cmp >
> ::type
{};
typedef cc::MSPriorityQueue< Value, traits_MSPriorityQueue_static_cmp > MSPriorityQueue_static_cmp;
struct traits_MSPriorityQueue_static_mutex : public
cc::mspriority_queue::make_traits<
co::buffer< co::v::initialized_static_buffer< char, c_nBoundedCapacity > >
, co::lock_type<std::mutex>
>::type
{};
typedef cc::MSPriorityQueue< Value, traits_MSPriorityQueue_static_mutex > MSPriorityQueue_static_mutex;
struct traits_MSPriorityQueue_dyn: public cc::mspriority_queue::traits
{
typedef co::v::initialized_dynamic_buffer< char > buffer;
};
typedef cc::MSPriorityQueue< Value, traits_MSPriorityQueue_dyn > MSPriorityQueue_dyn_less;
struct traits_MSPriorityQueue_dyn_less_stat: public traits_MSPriorityQueue_dyn
{
typedef cc::mspriority_queue::stat<> stat;
};
typedef cc::MSPriorityQueue< Value, traits_MSPriorityQueue_dyn_less_stat > MSPriorityQueue_dyn_less_stat;
struct traits_MSPriorityQueue_dyn_cmp : public
cc::mspriority_queue::make_traits <
co::buffer< co::v::initialized_dynamic_buffer< char > >
, co::compare < cmp >
> ::type
{};
typedef cc::MSPriorityQueue< Value, traits_MSPriorityQueue_dyn_cmp > MSPriorityQueue_dyn_cmp;
struct traits_MSPriorityQueue_dyn_mutex : public
cc::mspriority_queue::make_traits <
co::buffer< co::v::initialized_dynamic_buffer< char > >
, co::lock_type < std::mutex >
> ::type
{};
typedef cc::MSPriorityQueue< Value, traits_MSPriorityQueue_dyn_mutex > MSPriorityQueue_dyn_mutex;
// Priority queue based on EllenBinTreeSet
struct traits_EllenBinTree_max :
public cc::ellen_bintree::make_set_traits<
cc::ellen_bintree::key_extractor< typename Value::key_extractor >
,cc::opt::less< std::less<Value> >
,co::stat< cc::ellen_bintree::stat<> >
>::type
{};
typedef details::EllenBinTreePQueue< cds::gc::HP, typename Value::key_type, Value, traits_EllenBinTree_max > EllenBinTree_HP_max;
typedef details::EllenBinTreePQueue< cds::gc::DHP, typename Value::key_type, Value, traits_EllenBinTree_max > EllenBinTree_DHP_max;
typedef details::EllenBinTreePQueue< rcu_gpi, typename Value::key_type, Value, traits_EllenBinTree_max > EllenBinTree_RCU_gpi_max;
typedef details::EllenBinTreePQueue< rcu_gpb, typename Value::key_type, Value, traits_EllenBinTree_max > EllenBinTree_RCU_gpb_max;
typedef details::EllenBinTreePQueue< rcu_gpt, typename Value::key_type, Value, traits_EllenBinTree_max > EllenBinTree_RCU_gpt_max;
#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
typedef details::EllenBinTreePQueue< rcu_shb, typename Value::key_type, Value, traits_EllenBinTree_max > EllenBinTree_RCU_shb_max;
#endif
struct traits_EllenBinTree_max_stat :
public cc::ellen_bintree::make_set_traits<
cc::ellen_bintree::key_extractor< typename Value::key_extractor >
,cc::opt::less< std::less<Value> >
,co::stat< cc::ellen_bintree::stat<> >
>::type
{};
typedef details::EllenBinTreePQueue< cds::gc::HP, typename Value::key_type, Value, traits_EllenBinTree_max_stat > EllenBinTree_HP_max_stat;
typedef details::EllenBinTreePQueue< cds::gc::DHP, typename Value::key_type, Value, traits_EllenBinTree_max_stat > EllenBinTree_DHP_max_stat;
typedef details::EllenBinTreePQueue< rcu_gpi, typename Value::key_type, Value, traits_EllenBinTree_max_stat > EllenBinTree_RCU_gpi_max_stat;
typedef details::EllenBinTreePQueue< rcu_gpb, typename Value::key_type, Value, traits_EllenBinTree_max_stat > EllenBinTree_RCU_gpb_max_stat;
typedef details::EllenBinTreePQueue< rcu_gpt, typename Value::key_type, Value, traits_EllenBinTree_max_stat > EllenBinTree_RCU_gpt_max_stat;
#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
typedef details::EllenBinTreePQueue< rcu_shb, typename Value::key_type, Value, traits_EllenBinTree_max_stat > EllenBinTree_RCU_shb_max_stat;
#endif
struct traits_EllenBinTree_min :
public cc::ellen_bintree::make_set_traits<
cc::ellen_bintree::key_extractor< typename Value::key_extractor >
,cc::opt::less< std::greater<Value> >
>::type
{};
typedef details::EllenBinTreePQueue< cds::gc::HP, typename Value::key_type, Value, traits_EllenBinTree_min, false > EllenBinTree_HP_min;
typedef details::EllenBinTreePQueue< cds::gc::DHP, typename Value::key_type, Value, traits_EllenBinTree_min, false > EllenBinTree_DHP_min;
typedef details::EllenBinTreePQueue< rcu_gpi, typename Value::key_type, Value, traits_EllenBinTree_min, false > EllenBinTree_RCU_gpi_min;
typedef details::EllenBinTreePQueue< rcu_gpb, typename Value::key_type, Value, traits_EllenBinTree_min, false > EllenBinTree_RCU_gpb_min;
typedef details::EllenBinTreePQueue< rcu_gpt, typename Value::key_type, Value, traits_EllenBinTree_min, false > EllenBinTree_RCU_gpt_min;
#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
typedef details::EllenBinTreePQueue< rcu_shb, typename Value::key_type, Value, traits_EllenBinTree_min, false > EllenBinTree_RCU_shb_min;
#endif
struct traits_EllenBinTree_min_stat :
public cc::ellen_bintree::make_set_traits<
cc::ellen_bintree::key_extractor< typename Value::key_extractor >
,cc::opt::less< std::greater<Value> >
,co::stat< cc::ellen_bintree::stat<> >
>::type
{};
typedef details::EllenBinTreePQueue< cds::gc::HP, typename Value::key_type, Value, traits_EllenBinTree_min_stat, false > EllenBinTree_HP_min_stat;
typedef details::EllenBinTreePQueue< cds::gc::DHP, typename Value::key_type, Value, traits_EllenBinTree_min_stat, false > EllenBinTree_DHP_min_stat;
typedef details::EllenBinTreePQueue< rcu_gpi, typename Value::key_type, Value, traits_EllenBinTree_min_stat, false > EllenBinTree_RCU_gpi_min_stat;
typedef details::EllenBinTreePQueue< rcu_gpb, typename Value::key_type, Value, traits_EllenBinTree_min_stat, false > EllenBinTree_RCU_gpb_min_stat;
typedef details::EllenBinTreePQueue< rcu_gpt, typename Value::key_type, Value, traits_EllenBinTree_min_stat, false > EllenBinTree_RCU_gpt_min_stat;
#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
typedef details::EllenBinTreePQueue< rcu_shb, typename Value::key_type, Value, traits_EllenBinTree_min_stat, false > EllenBinTree_RCU_shb_min_stat;
#endif
// Priority queue based on SkipListSet
struct traits_SkipList_max :
public cc::skip_list::make_traits <
cc::opt::less < std::less<Value> >
> ::type
{};
typedef details::SkipListPQueue< cds::gc::HP, Value, traits_SkipList_max > SkipList32_HP_max;
typedef details::SkipListPQueue< cds::gc::DHP, Value, traits_SkipList_max > SkipList32_DHP_max;
typedef details::SkipListPQueue< rcu_gpi, Value, traits_SkipList_max > SkipList32_RCU_gpi_max;
typedef details::SkipListPQueue< rcu_gpb, Value, traits_SkipList_max > SkipList32_RCU_gpb_max;
typedef details::SkipListPQueue< rcu_gpt, Value, traits_SkipList_max > SkipList32_RCU_gpt_max;
#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
typedef details::SkipListPQueue< rcu_shb, Value, traits_SkipList_max > SkipList32_RCU_shb_max;
#endif
struct traits_SkipList24_max: public traits_SkipList_max
{
typedef cc::skip_list::turbo24 random_level_generator;
};
typedef details::SkipListPQueue< cds::gc::HP, Value, traits_SkipList24_max > SkipList24_HP_max;
typedef details::SkipListPQueue< cds::gc::DHP, Value, traits_SkipList24_max > SkipList24_DHP_max;
typedef details::SkipListPQueue< rcu_gpi, Value, traits_SkipList24_max > SkipList24_RCU_gpi_max;
typedef details::SkipListPQueue< rcu_gpb, Value, traits_SkipList24_max > SkipList24_RCU_gpb_max;
typedef details::SkipListPQueue< rcu_gpt, Value, traits_SkipList24_max > SkipList24_RCU_gpt_max;
#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
typedef details::SkipListPQueue< rcu_shb, Value, traits_SkipList24_max > SkipList24_RCU_shb_max;
#endif
struct traits_SkipList16_max: public traits_SkipList_max
{
typedef cc::skip_list::turbo16 random_level_generator;
};
typedef details::SkipListPQueue< cds::gc::HP, Value, traits_SkipList16_max > SkipList16_HP_max;
typedef details::SkipListPQueue< cds::gc::DHP, Value, traits_SkipList16_max > SkipList16_DHP_max;
typedef details::SkipListPQueue< rcu_gpi, Value, traits_SkipList16_max > SkipList16_RCU_gpi_max;
typedef details::SkipListPQueue< rcu_gpb, Value, traits_SkipList16_max > SkipList16_RCU_gpb_max;
typedef details::SkipListPQueue< rcu_gpt, Value, traits_SkipList16_max > SkipList16_RCU_gpt_max;
#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
typedef details::SkipListPQueue< rcu_shb, Value, traits_SkipList16_max > SkipList16_RCU_shb_max;
#endif
struct traits_SkipList_max_stat :
public cc::skip_list::make_traits<
cc::opt::less< std::less<Value> >
,co::stat< cc::skip_list::stat<> >
>::type
{};
typedef details::SkipListPQueue< cds::gc::HP, Value, traits_SkipList_max_stat > SkipList32_HP_max_stat;
typedef details::SkipListPQueue< cds::gc::DHP, Value, traits_SkipList_max_stat > SkipList32_DHP_max_stat;
typedef details::SkipListPQueue< rcu_gpi, Value, traits_SkipList_max_stat > SkipList32_RCU_gpi_max_stat;
typedef details::SkipListPQueue< rcu_gpb, Value, traits_SkipList_max_stat > SkipList32_RCU_gpb_max_stat;
typedef details::SkipListPQueue< rcu_gpt, Value, traits_SkipList_max_stat > SkipList32_RCU_gpt_max_stat;
#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
typedef details::SkipListPQueue< rcu_shb, Value, traits_SkipList_max_stat > SkipList32_RCU_shb_max_stat;
#endif
struct traits_SkipList24_max_stat: public traits_SkipList_max_stat
{
typedef cc::skip_list::turbo24 random_level_generator;
};
typedef details::SkipListPQueue< cds::gc::HP, Value, traits_SkipList24_max_stat > SkipList24_HP_max_stat;
typedef details::SkipListPQueue< cds::gc::DHP, Value, traits_SkipList24_max_stat > SkipList24_DHP_max_stat;
typedef details::SkipListPQueue< rcu_gpi, Value, traits_SkipList24_max_stat > SkipList24_RCU_gpi_max_stat;
typedef details::SkipListPQueue< rcu_gpb, Value, traits_SkipList24_max_stat > SkipList24_RCU_gpb_max_stat;
typedef details::SkipListPQueue< rcu_gpt, Value, traits_SkipList24_max_stat > SkipList24_RCU_gpt_max_stat;
#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
typedef details::SkipListPQueue< rcu_shb, Value, traits_SkipList24_max_stat > SkipList24_RCU_shb_max_stat;
#endif
struct traits_SkipList16_max_stat: public traits_SkipList_max_stat
{
typedef cc::skip_list::turbo16 random_level_generator;
};
typedef details::SkipListPQueue< cds::gc::HP, Value, traits_SkipList16_max_stat > SkipList16_HP_max_stat;
typedef details::SkipListPQueue< cds::gc::DHP, Value, traits_SkipList16_max_stat > SkipList16_DHP_max_stat;
typedef details::SkipListPQueue< rcu_gpi, Value, traits_SkipList16_max_stat > SkipList16_RCU_gpi_max_stat;
typedef details::SkipListPQueue< rcu_gpb, Value, traits_SkipList16_max_stat > SkipList16_RCU_gpb_max_stat;
typedef details::SkipListPQueue< rcu_gpt, Value, traits_SkipList16_max_stat > SkipList16_RCU_gpt_max_stat;
#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
typedef details::SkipListPQueue< rcu_shb, Value, traits_SkipList16_max_stat > SkipList16_RCU_shb_max_stat;
#endif
struct traits_SkipList_min :
public cc::skip_list::make_traits<
cc::opt::less< std::greater<Value> >
>::type
{};
typedef details::SkipListPQueue< cds::gc::HP, Value, traits_SkipList_min, false > SkipList32_HP_min;
typedef details::SkipListPQueue< cds::gc::DHP, Value, traits_SkipList_min, false > SkipList32_DHP_min;
typedef details::SkipListPQueue< rcu_gpi, Value, traits_SkipList_min, false > SkipList32_RCU_gpi_min;
typedef details::SkipListPQueue< rcu_gpb, Value, traits_SkipList_min, false > SkipList32_RCU_gpb_min;
typedef details::SkipListPQueue< rcu_gpt, Value, traits_SkipList_min, false > SkipList32_RCU_gpt_min;
#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
typedef details::SkipListPQueue< rcu_shb, Value, traits_SkipList_min, false > SkipList32_RCU_shb_min;
#endif
struct traits_SkipList24_min: public traits_SkipList_min
{
typedef cc::skip_list::turbo24 random_level_generator;
};
typedef details::SkipListPQueue< cds::gc::HP, Value, traits_SkipList24_min > SkipList24_HP_min;
typedef details::SkipListPQueue< cds::gc::DHP, Value, traits_SkipList24_min > SkipList24_DHP_min;
typedef details::SkipListPQueue< rcu_gpi, Value, traits_SkipList24_min > SkipList24_RCU_gpi_min;
typedef details::SkipListPQueue< rcu_gpb, Value, traits_SkipList24_min > SkipList24_RCU_gpb_min;
typedef details::SkipListPQueue< rcu_gpt, Value, traits_SkipList24_min > SkipList24_RCU_gpt_min;
#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
typedef details::SkipListPQueue< rcu_shb, Value, traits_SkipList24_min > SkipList24_RCU_shb_min;
#endif
struct traits_SkipList16_min: public traits_SkipList_min
{
typedef cc::skip_list::turbo16 random_level_generator;
};
typedef details::SkipListPQueue< cds::gc::HP, Value, traits_SkipList16_min > SkipList16_HP_min;
typedef details::SkipListPQueue< cds::gc::DHP, Value, traits_SkipList16_min > SkipList16_DHP_min;
typedef details::SkipListPQueue< rcu_gpi, Value, traits_SkipList16_min > SkipList16_RCU_gpi_min;
typedef details::SkipListPQueue< rcu_gpb, Value, traits_SkipList16_min > SkipList16_RCU_gpb_min;
typedef details::SkipListPQueue< rcu_gpt, Value, traits_SkipList16_min > SkipList16_RCU_gpt_min;
#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
typedef details::SkipListPQueue< rcu_shb, Value, traits_SkipList16_min > SkipList16_RCU_shb_min;
#endif
struct traits_SkipList_min_stat :
public cc::skip_list::make_traits<
cc::opt::less< std::greater<Value> >
,co::stat< cc::skip_list::stat<> >
>::type
{};
typedef details::SkipListPQueue< cds::gc::HP, Value, traits_SkipList_min_stat, false > SkipList32_HP_min_stat;
typedef details::SkipListPQueue< cds::gc::DHP, Value, traits_SkipList_min_stat, false > SkipList32_DHP_min_stat;
typedef details::SkipListPQueue< rcu_gpi, Value, traits_SkipList_min_stat, false > SkipList32_RCU_gpi_min_stat;
typedef details::SkipListPQueue< rcu_gpb, Value, traits_SkipList_min_stat, false > SkipList32_RCU_gpb_min_stat;
typedef details::SkipListPQueue< rcu_gpt, Value, traits_SkipList_min_stat, false > SkipList32_RCU_gpt_min_stat;
#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
typedef details::SkipListPQueue< rcu_shb, Value, traits_SkipList_min_stat, false > SkipList32_RCU_shb_min_stat;
#endif
struct traits_SkipList24_min_stat: public traits_SkipList_min_stat
{
typedef cc::skip_list::turbo24 random_level_generator;
};
typedef details::SkipListPQueue< cds::gc::HP, Value, traits_SkipList24_min_stat > SkipList24_HP_min_stat;
typedef details::SkipListPQueue< cds::gc::DHP, Value, traits_SkipList24_min_stat > SkipList24_DHP_min_stat;
typedef details::SkipListPQueue< rcu_gpi, Value, traits_SkipList24_min_stat > SkipList24_RCU_gpi_min_stat;
typedef details::SkipListPQueue< rcu_gpb, Value, traits_SkipList24_min_stat > SkipList24_RCU_gpb_min_stat;
typedef details::SkipListPQueue< rcu_gpt, Value, traits_SkipList24_min_stat > SkipList24_RCU_gpt_min_stat;
#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
typedef details::SkipListPQueue< rcu_shb, Value, traits_SkipList24_min_stat > SkipList24_RCU_shb_min_stat;
#endif
struct traits_SkipList16_min_stat: public traits_SkipList_min_stat
{
typedef cc::skip_list::turbo16 random_level_generator;
};
typedef details::SkipListPQueue< cds::gc::HP, Value, traits_SkipList16_min_stat > SkipList16_HP_min_stat;
typedef details::SkipListPQueue< cds::gc::DHP, Value, traits_SkipList16_min_stat > SkipList16_DHP_min_stat;
typedef details::SkipListPQueue< rcu_gpi, Value, traits_SkipList16_min_stat > SkipList16_RCU_gpi_min_stat;
typedef details::SkipListPQueue< rcu_gpb, Value, traits_SkipList16_min_stat > SkipList16_RCU_gpb_min_stat;
typedef details::SkipListPQueue< rcu_gpt, Value, traits_SkipList16_min_stat > SkipList16_RCU_gpt_min_stat;
#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
typedef details::SkipListPQueue< rcu_shb, Value, traits_SkipList16_min_stat > SkipList16_RCU_shb_min_stat;
#endif
// FCPriorityQueue
struct traits_FCPQueue_stat : public
cds::container::fcpqueue::make_traits <
cds::opt::stat < cds::container::fcpqueue::stat<> >
> ::type
{};
typedef cds::container::FCPriorityQueue< Value > FCPQueue_vector;
typedef cds::container::FCPriorityQueue< Value
,std::priority_queue<Value>
,traits_FCPQueue_stat
> FCPQueue_vector_stat;
typedef cds::container::FCPriorityQueue< Value
,std::priority_queue<Value, std::deque<Value> >
> FCPQueue_deque;
typedef cds::container::FCPriorityQueue< Value
,std::priority_queue<Value, std::deque<Value> >
,traits_FCPQueue_stat
> FCPQueue_deque_stat;
typedef cds::container::FCPriorityQueue< Value
,std::priority_queue<Value, boost::container::deque<Value> >
> FCPQueue_boost_deque;
typedef cds::container::FCPriorityQueue< Value
,std::priority_queue<Value, boost::container::deque<Value> >
,traits_FCPQueue_stat
> FCPQueue_boost_deque_stat;
typedef cds::container::FCPriorityQueue< Value
,std::priority_queue<Value, boost::container::stable_vector<Value> >
> FCPQueue_boost_stable_vector;
typedef cds::container::FCPriorityQueue< Value
,std::priority_queue<Value, boost::container::stable_vector<Value> >
,traits_FCPQueue_stat
> FCPQueue_boost_stable_vector_stat;
/// Standard priority_queue
typedef details::StdPQueue< Value, std::vector<Value>, cds::sync::spin> StdPQueue_vector_spin;
typedef details::StdPQueue< Value, std::vector<Value>, std::mutex > StdPQueue_vector_mutex;
typedef details::StdPQueue< Value, std::deque<Value>, cds::sync::spin> StdPQueue_deque_spin;
typedef details::StdPQueue< Value, std::deque<Value>, std::mutex > StdPQueue_deque_mutex;
};
} // namespace pqueue
// *********************************************
// Priority queue statistics
namespace cds_test {
static inline property_stream& operator <<( property_stream& o, cds::opt::none )
{
return o;
}
static inline property_stream& operator <<( property_stream& o, cds::container::fcpqueue::empty_stat const& )
{
return o;
}
static inline property_stream& operator <<( property_stream& o, cds::container::fcpqueue::stat<> const& s )
{
return o
<< CDSSTRESS_STAT_OUT( s, m_nPush )
<< CDSSTRESS_STAT_OUT( s, m_nPushMove )
<< CDSSTRESS_STAT_OUT( s, m_nPop )
<< CDSSTRESS_STAT_OUT( s, m_nFailedPop )
<< static_cast<cds::algo::flat_combining::stat<> const&>(s);
}
static inline property_stream& operator <<( property_stream& o, cds::container::mspriority_queue::empty_stat const& /*s*/ )
{
return o;
}
static inline property_stream& operator <<( property_stream& o, cds::container::mspriority_queue::stat<> const& s )
{
return o
<< CDSSTRESS_STAT_OUT( s, m_nPushCount )
<< CDSSTRESS_STAT_OUT( s, m_nPopCount )
<< CDSSTRESS_STAT_OUT( s, m_nPushFailCount )
<< CDSSTRESS_STAT_OUT( s, m_nPopFailCount )
<< CDSSTRESS_STAT_OUT( s, m_nPushHeapifySwapCount )
<< CDSSTRESS_STAT_OUT( s, m_nPopHeapifySwapCount )
<< CDSSTRESS_STAT_OUT( s, m_nItemMovedTop )
<< CDSSTRESS_STAT_OUT( s, m_nItemMovedUp )
<< CDSSTRESS_STAT_OUT( s, m_nPushEmptyPass );
}
} // namespace cds_test
#endif // #ifndef CDSSTRESS_PQUEUE_TYPES_H
|
