File: intrusive_iterable_dhp.cpp

package info (click to toggle)
libcds 2.3.3-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye
  • size: 15,564 kB
  • sloc: cpp: 135,002; ansic: 7,218; perl: 243; sh: 237; makefile: 6
file content (145 lines) | stat: -rw-r--r-- 4,685 bytes parent folder | download | duplicates (3)
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
// 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)

#include "test_intrusive_iterable_list_hp.h"
#include <cds/intrusive/iterable_list_dhp.h>

namespace {
    namespace ci = cds::intrusive;
    typedef cds::gc::DHP gc_type;

    class IntrusiveIterableList_DHP : public cds_test::intrusive_iterable_list_hp
    {
    protected:
        void SetUp()
        {
            typedef ci::IterableList< gc_type, item_type > list_type;

            cds::gc::dhp::smr::construct( list_type::c_nHazardPtrCount );
            cds::threading::Manager::attachThread();
        }

        void TearDown()
        {
            cds::threading::Manager::detachThread();
            cds::gc::dhp::smr::destruct();
        }
    };

    TEST_F( IntrusiveIterableList_DHP, less )
    {
        typedef ci::IterableList< gc_type, item_type,
            typename ci::iterable_list::make_traits<
                ci::opt::disposer< mock_disposer >
                ,cds::opt::less< less< item_type >>
                , cds::opt::item_counter< cds::atomicity::item_counter >
            >::type
       > list_type;

       list_type l;
       test_common( l );
       test_ordered_iterator( l );
       test_hp( l );
    }

    TEST_F( IntrusiveIterableList_DHP, compare )
    {
        typedef ci::IterableList< gc_type, item_type,
            typename ci::iterable_list::make_traits<
                ci::opt::disposer< mock_disposer >
                , cds::opt::compare< cmp< item_type >>
                , cds::opt::item_counter< cds::atomicity::item_counter >
            >::type
        > list_type;

        list_type l;
        test_common( l );
        test_ordered_iterator( l );
        test_hp( l );
    }

    TEST_F( IntrusiveIterableList_DHP, item_counting )
    {
        struct traits : public ci::iterable_list::traits {
            typedef mock_disposer disposer;
            typedef cmp< item_type > compare;
            typedef intrusive_iterable_list::less< item_type > less;
            typedef cds::atomicity::item_counter item_counter;
        };
        typedef ci::IterableList< gc_type, item_type, traits > list_type;

        list_type l;
        test_common( l );
        test_ordered_iterator( l );
        test_hp( l );
    }

    TEST_F( IntrusiveIterableList_DHP, backoff )
    {
        struct traits : public ci::iterable_list::traits {
            typedef mock_disposer disposer;
            typedef cmp< item_type > compare;
            typedef intrusive_iterable_list::less< item_type > less;
            typedef cds::atomicity::item_counter item_counter;
            typedef cds::backoff::pause back_off;
        };
        typedef ci::IterableList< gc_type, item_type, traits > list_type;

        list_type l;
        test_common( l );
        test_ordered_iterator( l );
        test_hp( l );
    }

    TEST_F( IntrusiveIterableList_DHP, seqcst )
    {
        struct traits : public ci::iterable_list::traits {
            typedef mock_disposer disposer;
            typedef intrusive_iterable_list::less< item_type > less;
            typedef cds::atomicity::item_counter item_counter;
            typedef cds::opt::v::sequential_consistent memory_model;
        };
        typedef ci::IterableList< gc_type, item_type, traits > list_type;

        list_type l;
        test_common( l );
        test_ordered_iterator( l );
        test_hp( l );
    }

    TEST_F( IntrusiveIterableList_DHP, stat )
    {
        struct traits: public ci::iterable_list::traits {
            typedef mock_disposer disposer;
            typedef intrusive_iterable_list::less< item_type > less;
            typedef cds::atomicity::item_counter item_counter;
            typedef cds::intrusive::iterable_list::stat<> stat;
        };
        typedef ci::IterableList< gc_type, item_type, traits > list_type;

        list_type l;
        test_common( l );
        test_ordered_iterator( l );
        test_hp( l );
    }

    TEST_F( IntrusiveIterableList_DHP, wrapped_stat )
    {
        struct traits: public ci::iterable_list::traits {
            typedef mock_disposer disposer;
            typedef intrusive_iterable_list::less< item_type > less;
            typedef cds::atomicity::item_counter item_counter;
            typedef cds::intrusive::iterable_list::wrapped_stat<> stat;
        };
        typedef ci::IterableList< gc_type, item_type, traits > list_type;

        traits::stat::stat_type st;
        list_type l( st );
        test_common( l );
        test_ordered_iterator( l );
        test_hp( l );
    }

} // namespace