fq.hpp 1.97 KB
Newer Older
1
/*
2
    Copyright (c) 2007-2013 Contributors as noted in the AUTHORS file
3 4 5 6

    This file is part of 0MQ.

    0MQ is free software; you can redistribute it and/or modify it under
7
    the terms of the GNU Lesser General Public License as published by
8 9 10 11 12 13
    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
14
    GNU Lesser General Public License for more details.
15

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

#ifndef __ZMQ_FQ_HPP_INCLUDED__
#define __ZMQ_FQ_HPP_INCLUDED__

23
#include "array.hpp"
24
#include "pipe.hpp"
25
#include "msg.hpp"
26 27 28 29 30

namespace zmq
{

    //  Class manages a set of inbound pipes. On receive it performs fair
31
    //  queueing so that senders gone berserk won't cause denial of
32
    //  service for decent senders.
33

34
    class fq_t
35 36 37
    {
    public:

38
        fq_t ();
39 40
        ~fq_t ();

41
        void attach (pipe_t *pipe_);
42
        void activated (pipe_t *pipe_);
43
        void pipe_terminated (pipe_t *pipe_);
44

45 46
        int recv (msg_t *msg_);
        int recvpipe (msg_t *msg_, pipe_t **pipe_);
47 48 49 50 51
        bool has_in ();

    private:

        //  Inbound pipes.
52
        typedef array_t <pipe_t, 1> pipes_t;
53 54 55 56 57 58 59 60 61
        pipes_t pipes;

        //  Number of active pipes. All the active pipes are located at the
        //  beginning of the pipes array.
        pipes_t::size_type active;

        //  Index of the next bound pipe to read a message from.
        pipes_t::size_type current;

62 63
        //  If true, part of a multipart message was already received, but
        //  there are following parts still waiting in the current pipe.
64
        bool more;
65

66
        fq_t (const fq_t&);
67
        const fq_t &operator = (const fq_t&);
68 69 70 71 72
    };

}

#endif