File: push.cpp

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 (184 lines) | stat: -rw-r--r-- 5,885 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
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
// 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 "stack_type.h"

namespace {

    static size_t s_nThreadCount = 8;
    static size_t s_nStackSize = 10000000;
    static size_t s_nEliminationSize = 4;

    class stack_push : public cds_test::stress_fixture
    {
    protected:

        struct value_type {
            size_t      nNo;
            size_t      nThread;

            value_type()
                : nNo( 0 )
                , nThread( 0 )
            {}
            value_type( size_t n )
                : nNo( n )
                , nThread( 0 )
            {}
        };

        template <class Stack>
        class Producer: public cds_test::thread
        {
            typedef cds_test::thread base_class;

        public:
            Producer( cds_test::thread_pool& pool, Stack& stack )
                : base_class( pool )
                , m_stack( stack )
                , m_nStartItem( 0 )
                , m_nEndItem( 0 )
                , m_nPushError( 0 )
            {}

            Producer( Producer& src )
                : base_class( src )
                , m_stack( src.m_stack )
                , m_nStartItem( 0 )
                , m_nEndItem( 0 )
                , m_nPushError( 0 )
            {}

            virtual thread * clone()
            {
                return new Producer( *this );
            }

            virtual void test()
            {
                value_type v;
                v.nThread = id();
                for ( v.nNo = m_nStartItem; v.nNo < m_nEndItem; ++v.nNo ) {
                    if ( !m_stack.push( v ))
                        ++m_nPushError;
                }
            }

        public:
            Stack&  m_stack;
            size_t  m_nStartItem;
            size_t  m_nEndItem;
            size_t  m_nPushError;
        };

    protected:
        static void SetUpTestCase()
        {
            cds_test::config const& cfg = get_config("Stack_Push");

            s_nThreadCount     = cfg.get_size_t( "ThreadCount",     s_nThreadCount );
            s_nStackSize       = cfg.get_size_t( "StackSize",       s_nStackSize );
            s_nEliminationSize = cfg.get_size_t( "EliminationSize", s_nEliminationSize );

            if ( s_nThreadCount == 0 )
                s_nThreadCount = 1;
        }

        //static void TearDownTestCase();

        template <typename Stack>
        void test( Stack& stack )
        {
            cds_test::thread_pool& pool = get_pool();

            pool.add( new Producer<Stack>( pool, stack ), s_nThreadCount );

            size_t nStart = 0;
            size_t nThreadItemCount = s_nStackSize / s_nThreadCount;
            for ( size_t i = 0; i < pool.size(); ++i ) {
                Producer<Stack>& thread = static_cast<Producer<Stack>&>( pool.get( i ));
                thread.m_nStartItem = nStart;
                nStart += nThreadItemCount;
                thread.m_nEndItem = nStart;
            }

            propout() << std::make_pair( "thread_count", s_nThreadCount )
                << std::make_pair( "push_count", s_nStackSize );

            std::chrono::milliseconds duration = pool.run();

            propout() << std::make_pair( "duration", duration );

            analyze( stack );

            propout() << stack.statistics();
        }

        template <typename Stack>
        void test_elimination( Stack& stack )
        {
            test( stack );
            check_elimination_stat( stack.statistics());
        }

        void check_elimination_stat( cds::container::treiber_stack::empty_stat const& )
        {}

        void check_elimination_stat( cds::container::treiber_stack::stat<> const& s )
        {
            EXPECT_EQ( s.m_PushCount.get(), s.m_PopCount.get());
        }

        template <class Stack>
        void analyze( Stack& testStack )
        {
            cds_test::thread_pool& pool = get_pool();

            size_t nThreadItems = s_nStackSize / s_nThreadCount;
            std::vector<size_t> aThread;
            aThread.resize( s_nThreadCount );

            for ( size_t i = 0; i < pool.size(); ++i ) {
                Producer<Stack>& producer = static_cast<Producer<Stack>&>( pool.get( i ));
                EXPECT_EQ( producer.m_nPushError, 0u ) << "Producer=" << i;
                aThread[producer.id()] = producer.m_nEndItem - 1;
            }
            EXPECT_FALSE( testStack.empty());

            std::unique_ptr< uint8_t[] > uarr( new uint8_t[s_nStackSize] );
            uint8_t * arr = uarr.get();
            memset( arr, 0, sizeof( arr[0] ) * s_nStackSize );

            auto time_start = std::chrono::steady_clock::now();
            size_t nPopped = 0;
            value_type val;
            while ( testStack.pop( val )) {
                nPopped++;
                ASSERT_LT( val.nNo, s_nStackSize );
                ++arr[val.nNo];
                ASSERT_LT( val.nThread, s_nThreadCount );
                ASSERT_EQ( aThread[val.nThread], val.nNo );
                aThread[val.nThread]--;
            }
            propout() << std::make_pair( "pop_duration", std::chrono::duration_cast<std::chrono::milliseconds>(std::chrono::steady_clock::now() - time_start));

            size_t nTotalItems = nThreadItems * s_nThreadCount;
            size_t nError = 0;
            for ( size_t i = 0; i < nTotalItems; ++i ) {
                EXPECT_EQ( arr[i], 1 ) << "i=" << i;
                if ( ++nError > 10 ) {
                    ASSERT_EQ( arr[i], 1 );
                }
            }
        }
    };

    CDSSTRESS_TreiberStack( stack_push )
    CDSSTRESS_EliminationStack( stack_push )
    CDSSTRESS_FCStack( stack_push )
    CDSSTRESS_FCDeque( stack_push )
    CDSSTRESS_StdStack( stack_push )

} // namespace