fq.cpp 3.96 KB
Newer Older
1
/*
2 3
    Copyright (c) 2007-2011 iMatix Corporation
    Copyright (c) 2007-2011 Other contributors as noted in the AUTHORS file
4 5 6 7

    This file is part of 0MQ.

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

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

#include "fq.hpp"
#include "pipe.hpp"
#include "err.hpp"
24
#include "msg.hpp"
25

26
zmq::fq_t::fq_t () :
27
    active (0),
28
    current (0),
29
    more (false)
30 31 32 33 34
{
}

zmq::fq_t::~fq_t ()
{
35
    zmq_assert (pipes.empty ());
36 37
}

38
void zmq::fq_t::attach (pipe_t *pipe_)
39 40 41 42 43 44
{
    pipes.push_back (pipe_);
    pipes.swap (active, pipes.size () - 1);
    active++;
}

45
void zmq::fq_t::terminated (pipe_t *pipe_)
46 47 48
{
    //  Remove the pipe from the list; adjust number of active pipes
    //  accordingly.
49
    if (pipes.index (pipe_) < active) {
50
        active--;
51 52 53
        if (current == active)
            current = 0;
    }
54 55 56
    pipes.erase (pipe_);
}

57
void zmq::fq_t::activated (pipe_t *pipe_)
58 59 60 61 62 63
{
    //  Move the pipe to the list of active pipes.
    pipes.swap (pipes.index (pipe_), active);
    active++;
}

64
int zmq::fq_t::recv (msg_t *msg_, int flags_)
65 66 67 68 69
{
    return recvpipe (msg_, flags_, NULL);
}

int zmq::fq_t::recvpipe (msg_t *msg_, int flags_, pipe_t **pipe_)
70 71
{
    //  Deallocate old content of the message.
72 73
    int rc = msg_->close ();
    errno_assert (rc == 0);
74

75
    //  Round-robin over the pipes to get the next message.
76
    for (pipes_t::size_type count = active; count != 0; count--) {
77 78 79

        //  Try to fetch new message. If we've already read part of the message
        //  subsequent part should be immediately available.
80
        bool fetched = pipes [current]->read (msg_);
81 82 83 84

        //  Check the atomicity of the message. If we've already received the
        //  first part of the message we should get the remaining parts
        //  without blocking.
85
        zmq_assert (!(more && !fetched));
86

87 88
        //  Note that when message is not fetched, current pipe is deactivated
        //  and replaced by another active pipe. Thus we don't have to increase
89 90
        //  the 'current' pointer.
        if (fetched) {
91 92
            if (pipe_)
                *pipe_ = pipes [current];
Martin Sustrik's avatar
Martin Sustrik committed
93 94
            more =
                msg_->flags () & (msg_t::more | msg_t::label) ? true : false;
95
            if (!more) {
96 97 98 99
                current++;
                if (current >= active)
                    current = 0;
            }
100
            return 0;
101
        }
102 103 104 105 106 107
        else {
            active--;
            pipes.swap (current, active);
            if (current == active)
                current = 0;
        }
108 109 110 111
    }

    //  No message is available. Initialise the output parameter
    //  to be a 0-byte message.
112 113
    rc = msg_->init ();
    errno_assert (rc == 0);
114 115 116 117 118 119
    errno = EAGAIN;
    return -1;
}

bool zmq::fq_t::has_in ()
{
120
    //  There are subsequent parts of the partly-read message available.
121
    if (more)
122 123
        return true;

124 125 126 127
    //  Note that messing with current doesn't break the fairness of fair
    //  queueing algorithm. If there are no messages available current will
    //  get back to its original value. Otherwise it'll point to the first
    //  pipe holding messages, skipping only pipes with no messages available.
128
    for (pipes_t::size_type count = active; count != 0; count--) {
129 130
        if (pipes [current]->check_read ())
            return true;
131 132 133 134 135

        //  Deactivate the pipe.
        active--;
        pipes.swap (current, active);
        if (current == active)
136 137 138 139 140 141
            current = 0;
    }

    return false;
}