File: test_intrusive_treiber_stack.h

package info (click to toggle)
libcds 2.3.3-6
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 15,632 kB
  • sloc: cpp: 135,002; ansic: 7,234; perl: 243; sh: 237; makefile: 6
file content (109 lines) | stat: -rw-r--r-- 3,143 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
// 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 CDSUNIT_STACK_INTRUSIVE_TREIBER_STACK_H
#define CDSUNIT_STACK_INTRUSIVE_TREIBER_STACK_H

#include <cds_test/ext_gtest.h>
#include <cds/intrusive/details/single_link_struct.h>

namespace cds_test {

    class IntrusiveTreiberStack : public ::testing::Test
    {
    protected:
        template <typename GC>
        struct base_hook_item : public cds::intrusive::single_link::node< GC >
        {
            int nVal;
            int nDisposeCount;

            base_hook_item()
                : nDisposeCount( 0 )
            {}
        };

        template <typename GC>
        struct member_hook_item
        {
            int nVal;
            int nDisposeCount;
            cds::intrusive::single_link::node< GC > hMember;

            member_hook_item()
                : nDisposeCount( 0 )
            {}
        };

        struct mock_disposer
        {
            template <typename T>
            void operator ()( T * p )
            {
                ++p->nDisposeCount;
            }
        };

        template <typename Stack>
        void test( Stack& stack )
        {
            typedef typename Stack::value_type  value_type;

            ASSERT_TRUE( stack.empty());

            value_type v1, v2, v3;
            v1.nVal = 1;
            v2.nVal = 2;
            v3.nVal = 3;
            ASSERT_TRUE( stack.push( v1 ));
            ASSERT_TRUE( !stack.empty());
            ASSERT_TRUE( stack.push( v2 ));
            ASSERT_TRUE( !stack.empty());
            ASSERT_TRUE( stack.push( v3 ));
            ASSERT_TRUE( !stack.empty());

            value_type * pv;
            pv = stack.pop();
            ASSERT_NE( pv, nullptr );
            ASSERT_EQ( pv, &v3 );
            ASSERT_EQ( pv->nVal, 3 );
            ASSERT_TRUE( !stack.empty());
            pv = stack.pop();
            ASSERT_NE( pv, nullptr );
            ASSERT_EQ( pv, &v2 );
            ASSERT_EQ( pv->nVal, 2 );
            ASSERT_TRUE( !stack.empty());
            pv = stack.pop();
            ASSERT_NE( pv, nullptr );
            ASSERT_EQ( pv, &v1 );
            ASSERT_EQ( pv->nVal, 1 );
            ASSERT_TRUE( stack.empty());
            pv = stack.pop();
            ASSERT_EQ( pv, nullptr );
            ASSERT_TRUE( stack.empty());

            ASSERT_EQ( v1.nDisposeCount, 0 );
            ASSERT_EQ( v2.nDisposeCount, 0 );
            ASSERT_EQ( v3.nDisposeCount, 0 );

            stack.push( v1 );
            stack.push( v2 );
            stack.push( v3 );

            stack.clear();
            ASSERT_TRUE( stack.empty());

            Stack::gc::scan();
            if ( !std::is_same<typename Stack::disposer, cds::intrusive::opt::v::empty_disposer>::value ) {
                ASSERT_EQ( v1.nDisposeCount, 1 );
                ASSERT_EQ( v2.nDisposeCount, 1 );
                ASSERT_EQ( v3.nDisposeCount, 1 );
            }
        }
    };

} // namespace cds_test

#endif // CDSUNIT_STACK_INTRUSIVE_TREIBER_STACK_H