decoder.hpp 6.9 KB
Newer Older
Martin Sustrik's avatar
Martin Sustrik committed
1
/*
2
    Copyright (c) 2007-2016 Contributors as noted in the AUTHORS file
Martin Sustrik's avatar
Martin Sustrik committed
3

4
    This file is part of libzmq, the ZeroMQ core engine in C++.
Martin Sustrik's avatar
Martin Sustrik committed
5

6 7 8
    libzmq is free software; you can redistribute it and/or modify it under
    the terms of the GNU Lesser General Public License (LGPL) as published
    by the Free Software Foundation; either version 3 of the License, or
Martin Sustrik's avatar
Martin Sustrik committed
9 10
    (at your option) any later version.

11 12 13 14 15 16 17 18 19 20 21 22 23 24
    As a special exception, the Contributors give you permission to link
    this library with independent modules to produce an executable,
    regardless of the license terms of these independent modules, and to
    copy and distribute the resulting executable under terms of your choice,
    provided that you also meet, for each linked independent module, the
    terms and conditions of the license of that module. An independent
    module is a module which is not derived from or based on this library.
    If you modify this library, you must extend this exception to your
    version of the library.

    libzmq 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.
Martin Sustrik's avatar
Martin Sustrik committed
25

26
    You should have received a copy of the GNU Lesser General Public License
Martin Sustrik's avatar
Martin Sustrik committed
27 28 29
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/

Martin Sustrik's avatar
Martin Sustrik committed
30 31
#ifndef __ZMQ_DECODER_HPP_INCLUDED__
#define __ZMQ_DECODER_HPP_INCLUDED__
Martin Sustrik's avatar
Martin Sustrik committed
32 33

#include <algorithm>
34
#include <cstddef>
35
#include <cstring>
Martin Sustrik's avatar
Martin Sustrik committed
36

37
#include "decoder_allocators.hpp"
38
#include "err.hpp"
39
#include "i_decoder.hpp"
40
#include "stdint.hpp"
41

Martin Sustrik's avatar
Martin Sustrik committed
42
namespace zmq
Martin Sustrik's avatar
Martin Sustrik committed
43
{
44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59
//  Helper base class for decoders that know the amount of data to read
//  in advance at any moment. Knowing the amount in advance is a property
//  of the protocol used. 0MQ framing protocol is based size-prefixed
//  paradigm, which qualifies it to be parsed by this class.
//  On the other hand, XML-based transports (like XMPP or SOAP) don't allow
//  for knowing the size of data to read in advance and should use different
//  decoding algorithms.
//
//  This class implements the state machine that parses the incoming buffer.
//  Derived class should implement individual state machine actions.
//
//  Buffer management is done by an allocator policy.
template <typename T, typename A = c_single_allocator>
class decoder_base_t : public i_decoder
{
  public:
60
    explicit decoder_base_t (const size_t buf_size_) :
61 62 63 64
        _next (NULL),
        _read_pos (NULL),
        _to_read (0),
        _allocator (buf_size_)
Martin Sustrik's avatar
Martin Sustrik committed
65
    {
66
        _buf = _allocator.allocate ();
67
    }
68

69 70
    //  The destructor doesn't have to be virtual. It is made virtual
    //  just to keep ICC and code checking tools from complaining.
71
    virtual ~decoder_base_t () { _allocator.deallocate (); }
72

73 74 75
    //  Returns a buffer to be filled with binary data.
    void get_buffer (unsigned char **data_, std::size_t *size_)
    {
76
        _buf = _allocator.allocate ();
77 78 79 80 81 82 83 84 85

        //  If we are expected to read large message, we'll opt for zero-
        //  copy, i.e. we'll ask caller to fill the data directly to the
        //  message. Note that subsequent read(s) are non-blocking, thus
        //  each single read reads at most SO_RCVBUF bytes at once not
        //  depending on how large is the chunk returned from here.
        //  As a consequence, large messages being received won't block
        //  other engines running in the same I/O thread for excessive
        //  amounts of time.
86 87 88
        if (_to_read >= _allocator.size ()) {
            *data_ = _read_pos;
            *size_ = _to_read;
89
            return;
Martin Sustrik's avatar
Martin Sustrik committed
90 91
        }

92 93
        *data_ = _buf;
        *size_ = _allocator.size ();
94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110
    }

    //  Processes the data in the buffer previously allocated using
    //  get_buffer function. size_ argument specifies number of bytes
    //  actually filled into the buffer. Function returns 1 when the
    //  whole message was decoded or 0 when more data is required.
    //  On error, -1 is returned and errno set accordingly.
    //  Number of bytes processed is returned in bytes_used_.
    int decode (const unsigned char *data_,
                std::size_t size_,
                std::size_t &bytes_used_)
    {
        bytes_used_ = 0;

        //  In case of zero-copy simply adjust the pointers, no copying
        //  is required. Also, run the state machine in case all the data
        //  were processed.
111 112 113 114
        if (data_ == _read_pos) {
            zmq_assert (size_ <= _to_read);
            _read_pos += size_;
            _to_read -= size_;
115 116
            bytes_used_ = size_;

117
            while (!_to_read) {
118
                const int rc =
119
                  (static_cast<T *> (this)->*_next) (data_ + bytes_used_);
120 121
                if (rc != 0)
                    return rc;
Martin Hurton's avatar
Martin Hurton committed
122
            }
123
            return 0;
124 125
        }

126 127
        while (bytes_used_ < size_) {
            //  Copy the data from buffer to the message.
128
            const size_t to_copy = std::min (_to_read, size_ - bytes_used_);
129 130
            // Only copy when destination address is different from the
            // current address in the buffer.
131 132
            if (_read_pos != data_ + bytes_used_) {
                memcpy (_read_pos, data_ + bytes_used_, to_copy);
133
            }
Martin Sustrik's avatar
Martin Sustrik committed
134

135 136
            _read_pos += to_copy;
            _to_read -= to_copy;
137 138 139
            bytes_used_ += to_copy;
            //  Try to get more space in the message to fill in.
            //  If none is available, return.
140
            while (_to_read == 0) {
141 142
                // pass current address in the buffer
                const int rc =
143
                  (static_cast<T *> (this)->*_next) (data_ + bytes_used_);
144 145 146
                if (rc != 0)
                    return rc;
            }
Martin Sustrik's avatar
Martin Sustrik committed
147 148
        }

149 150
        return 0;
    }
Martin Hurton's avatar
Martin Hurton committed
151

152
    virtual void resize_buffer (std::size_t new_size_)
153
    {
154
        _allocator.resize (new_size_);
155
    }
156

157 158 159 160
  protected:
    //  Prototype of state machine action. Action should return false if
    //  it is unable to push the data to the system.
    typedef int (T::*step_t) (unsigned char const *);
161

162 163 164 165
    //  This function should be called from derived class to read data
    //  from the buffer and schedule next state machine action.
    void next_step (void *read_pos_, std::size_t to_read_, step_t next_)
    {
166 167 168
        _read_pos = static_cast<unsigned char *> (read_pos_);
        _to_read = to_read_;
        _next = next_;
169 170
    }

171
    A &get_allocator () { return _allocator; }
172

173 174 175 176
  private:
    //  Next step. If set to NULL, it means that associated data stream
    //  is dead. Note that there can be still data in the process in such
    //  case.
177
    step_t _next;
178 179

    //  Where to store the read data.
180
    unsigned char *_read_pos;
181 182

    //  How much data to read before taking next step.
183
    std::size_t _to_read;
184 185

    //  The duffer for data to decode.
186 187
    A _allocator;
    unsigned char *_buf;
188 189 190 191

    decoder_base_t (const decoder_base_t &);
    const decoder_base_t &operator= (const decoder_base_t &);
};
Martin Sustrik's avatar
Martin Sustrik committed
192 193 194
}

#endif