decoder.hpp 5.16 KB
Newer Older
Martin Sustrik's avatar
Martin Sustrik committed
1
/*
2
    Copyright (c) 2007-2010 iMatix Corporation
Martin Sustrik's avatar
Martin Sustrik committed
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

    This file is part of 0MQ.

    0MQ is free software; you can redistribute it and/or modify it under
    the terms of the Lesser GNU General Public License as published by
    the Free Software Foundation; either version 3 of the License, or
    (at your option) any later version.

    0MQ 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
    Lesser GNU General Public License for more details.

    You should have received a copy of the Lesser GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/

Martin Sustrik's avatar
Martin Sustrik committed
20 21
#ifndef __ZMQ_DECODER_HPP_INCLUDED__
#define __ZMQ_DECODER_HPP_INCLUDED__
Martin Sustrik's avatar
Martin Sustrik committed
22 23 24

#include <stddef.h>
#include <string.h>
25
#include <stdlib.h>
Martin Sustrik's avatar
Martin Sustrik committed
26 27
#include <algorithm>

28 29
#include "err.hpp"

Martin Sustrik's avatar
Martin Sustrik committed
30
namespace zmq
Martin Sustrik's avatar
Martin Sustrik committed
31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47
{

    //  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. Both AMQP and backend protocol are based on
    //  size-prefixed paradigm, therefore they are using decoder_t to parse
    //  the messages. 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.
    //
    //  Decoder implements the state machine that parses the incoming buffer.
    //  Derived class should implement individual state machine actions.

    template <typename T> class decoder_t
    {
    public:

48 49
        inline decoder_t (size_t bufsize_) :
            read_pos (NULL),
Martin Sustrik's avatar
Martin Sustrik committed
50
            to_read (0),
51 52 53 54 55 56 57 58 59 60 61 62 63 64
            next (NULL),
            bufsize (bufsize_)
        {
            buf = (unsigned char*) malloc (bufsize_);
            zmq_assert (buf);
        }

        inline ~decoder_t ()
        {
            free (buf);
        }

        //  Returns a buffer to be filled with binary data.
        inline void get_buffer (unsigned char **data_, size_t *size_)
Martin Sustrik's avatar
Martin Sustrik committed
65
        {
66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81
            //  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.
            if (to_read >= bufsize) {
                *data_ = read_pos;
                *size_ = to_read;
                return;
            }

            *data_ = buf;
            *size_ = bufsize;
Martin Sustrik's avatar
Martin Sustrik committed
82 83
        }

84 85 86 87 88
        //  Processes the data in the buffer previously allocated using
        //  get_buffer function. size_ argument specifies nemuber of bytes
        //  actually filled into the buffer. Function returns number of
        //  bytes actually processed.
        inline size_t process_buffer (unsigned char *data_, size_t size_)
Martin Sustrik's avatar
Martin Sustrik committed
89
        {
90 91 92 93 94 95 96 97 98 99 100 101 102
            //  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.
            if (data_ == read_pos) {
                read_pos += size_;
                to_read -= size_;

                while (!to_read)
                    if (!(static_cast <T*> (this)->*next) ())
                        return size_;
                return size_;
            }

Martin Sustrik's avatar
Martin Sustrik committed
103 104
            size_t pos = 0;
            while (true) {
105 106 107

                //  Try to get more space in the message to fill in.
                //  If none is available, return.
Martin Sustrik's avatar
Martin Sustrik committed
108 109 110
                while (!to_read)
                    if (!(static_cast <T*> (this)->*next) ())
                        return pos;
111 112

                //  If there are no more data in the buffer, return.
Martin Sustrik's avatar
Martin Sustrik committed
113 114
                if (pos == size_)
                    return pos;
115 116 117 118 119 120 121

                //  Copy the data from buffer to the message.
                size_t to_copy = std::min (to_read, size_ - pos);
                memcpy (read_pos, data_ + pos, to_copy);
                read_pos += to_copy;
                pos += to_copy;
                to_read -= to_copy;
Martin Sustrik's avatar
Martin Sustrik committed
122 123 124 125 126 127 128 129 130 131 132
            }
        }

    protected:

        //  Prototype of state machine action. Action should return false if
        //  it is unable to push the data to the system.
        typedef bool (T::*step_t) ();

        //  This function should be called from derived class to read data
        //  from the buffer and schedule next state machine action.
133
        inline void next_step (void *read_pos_, size_t to_read_,
Martin Sustrik's avatar
Martin Sustrik committed
134 135
            step_t next_)
        {
136
            read_pos = (unsigned char*) read_pos_;
Martin Sustrik's avatar
Martin Sustrik committed
137 138 139 140 141 142
            to_read = to_read_;
            next = next_;
        }

    private:

143
        unsigned char *read_pos;
Martin Sustrik's avatar
Martin Sustrik committed
144 145 146
        size_t to_read;
        step_t next;

147 148 149
        size_t bufsize;
        unsigned char *buf;

Martin Sustrik's avatar
Martin Sustrik committed
150 151 152 153 154 155 156
        decoder_t (const decoder_t&);
        void operator = (const decoder_t&);
    };

}

#endif