summaryrefslogtreecommitdiff
path: root/src/req.hpp
blob: 5ab7bca07c6fbc8a7b2a8430b87b59a29f76986f (plain)
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
/*
    Copyright (c) 2007-2010 iMatix Corporation

    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/>.
*/

#ifndef __ZMQ_REQ_HPP_INCLUDED__
#define __ZMQ_REQ_HPP_INCLUDED__

#include "socket_base.hpp"
#include "yarray.hpp"

namespace zmq
{

    class req_t : public socket_base_t
    {
    public:

        req_t (class app_thread_t *parent_);
        ~req_t ();

        //  Overloads of functions from socket_base_t.
        void xattach_pipes (class reader_t *inpipe_, class writer_t *outpipe_,
            const blob_t &peer_identity_);
        void xdetach_inpipe (class reader_t *pipe_);
        void xdetach_outpipe (class writer_t *pipe_);
        void xkill (class reader_t *pipe_);
        void xrevive (class reader_t *pipe_);
        void xrevive (class writer_t *pipe_);
        int xsetsockopt (int option_, const void *optval_, size_t optvallen_);
        int xsend (zmq_msg_t *msg_, int flags_);
        int xrecv (zmq_msg_t *msg_, int flags_);
        bool xhas_in ();
        bool xhas_out ();

    private:

        //  List in outbound and inbound pipes. Note that the two lists are
        //  always in sync. I.e. outpipe with index N communicates with the
        //  same session as inpipe with index N.
        //
        //  TODO: Once we have queue limits in place, list of active outpipes
        //  is to be held (presumably by stacking active outpipes at
        //  the beginning of the array). We don't have to do the same thing for
        //  inpipes, because we know which pipe we want to read the
        //  reply from.
        typedef yarray_t <class writer_t> out_pipes_t;
        out_pipes_t out_pipes;
        typedef yarray_t <class reader_t> in_pipes_t;
        in_pipes_t in_pipes;

        //  Number of active pipes.
        size_t active;

        //  Req_t load-balances the requests - 'current' points to the session
        //  that's processing the request at the moment.
        out_pipes_t::size_type current;

        //  If true, request was already sent and reply wasn't received yet or
        //  was raceived partially.
        bool receiving_reply;

        //  True, if read can be attempted from the reply pipe.
        bool reply_pipe_active;

        //  True, if message processed at the moment (either sent or received)
        //  is processed only partially.
        bool more;

        //  Pipe we are awaiting the reply from.
        class reader_t *reply_pipe;

        req_t (const req_t&);
        void operator = (const req_t&);
    };

}

#endif