doudou / orocos-rtt forked from psoetens/orocos-rtt

Orocos Real-Time Toolkit

This URL has Read+Write access

Janosch Machowinski (author)
Wed Nov 26 07:50:12 -0800 2008
Sylvain Joyeux (committer)
Fri Dec 19 07:31:38 -0800 2008
orocos-rtt / src / BufferLocked.hpp
100644 166 lines (140 sloc) 5.533 kb
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
/***************************************************************************
tag: Peter Soetens Wed Jan 18 14:11:39 CET 2006 BufferLocked.hpp
 
BufferLocked.hpp - description
-------------------
begin : Wed January 18 2006
copyright : (C) 2006 Peter Soetens
email : peter.soetens@mech.kuleuven.be
 
***************************************************************************
* This library is free software; you can redistribute it and/or *
* modify it under the terms of the GNU General Public *
* License as published by the Free Software Foundation; *
* version 2 of the License. *
* *
* As a special exception, you may use this file as part of a free *
* software library without restriction. Specifically, if other files *
* instantiate templates or use macros or inline functions from this *
* file, or you compile this file and link it with other files to *
* produce an executable, this file does not by itself cause the *
* resulting executable to be covered by the GNU General Public *
* License. This exception does not however invalidate any other *
* reasons why the executable file might be covered by the GNU General *
* Public License. *
* *
* This library is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *
* Lesser General Public License for more details. *
* *
* You should have received a copy of the GNU General Public *
* License along with this library; if not, write to the Free Software *
* Foundation, Inc., 59 Temple Place, *
* Suite 330, Boston, MA 02111-1307 USA *
* *
***************************************************************************/
 
 
 
 
 
#ifndef ORO_CORELIB_BUFFER_LOCKED_HPP
#define ORO_CORELIB_BUFFER_LOCKED_HPP
 
#include "os/Mutex.hpp"
#include "os/MutexLock.hpp"
#include "BufferInterface.hpp"
 
namespace RTT
{
 
    /**
* Implements a very simple blocking threadsafe buffer, using mutexes (locks).
*
* @see BufferLockFree
* @ingroup Ports
*/
    template<class T>
    class BufferLocked
        :public BufferInterface<T>
    {
    public:
 
        typedef typename ReadInterface<T>::reference_t reference_t;
        typedef typename WriteInterface<T>::param_t param_t;
        typedef typename BufferInterface<T>::size_type size_type;
        typedef T value_t;
 
        /**
* Create a buffer of size \a size.
*/
        BufferLocked( size_type size, const T& initial_value = T() )
            : buf()
        {
            buf.resize(size, initial_value);
            buf.resize(0);
        }
 
        /**
* Destructor
*/
        ~BufferLocked() {}
 
        bool Push( param_t item )
        {
            OS::MutexLock locker(lock);
            if ( buf.capacity() == buf.size() )
                return false;
            buf.push_back( item );
            return true;
        }
 
        size_type Push(const std::vector<T>& items)
        {
            OS::MutexLock locker(lock);
            typename std::vector<T>::const_iterator itl( items.begin() );
            while ( buf.size() != buf.capacity() && itl != items.end() ) {
                buf.push_back( *itl );
                ++itl;
            }
            return (itl - items.begin());
 
        }
        bool Pop( reference_t item )
        {
            OS::MutexLock locker(lock);
            if ( buf.empty() )
                return false;
            item = buf.front();
            buf.erase( buf.begin() );
            return true;
        }
 
        size_type Pop(std::vector<T>& items )
        {
            OS::MutexLock locker(lock);
            int quant = 0;
            while ( !buf.empty() ) {
                items.push_back( buf.front() );
                buf.erase( buf.begin() );
                ++quant;
            }
            return quant;
        }
 
        value_t front() const
        {
            OS::MutexLock locker(lock);
            value_t item = value_t();
            if ( !buf.empty() )
                item = buf.front();
            return item;
        }
 
        size_type capacity() const {
            OS::MutexLock locker(lock);
            return buf.capacity();
        }
 
        size_type size() const {
            OS::MutexLock locker(lock);
            return buf.size();
        }
 
        void clear() {
            OS::MutexLock locker(lock);
            buf.clear();
        }
 
        bool empty() const {
            return buf.empty();
        }
 
        bool full() const {
            OS::MutexLock locker(lock);
            return buf.size() == buf.capacity();
        }
    private:
        std::vector<T> buf;
        mutable OS::Mutex lock;
 
    };
}
 
#endif // BUFFERSIMPLE_HPP