sub.cpp 4.38 KB
Newer Older
1
/*
2
    Copyright (c) 2007-2010 iMatix Corporation
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
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/

20 21
#include <string.h>

22
#include "../include/zmq.h"
23 24 25 26

#include "sub.hpp"
#include "err.hpp"

27 28
zmq::sub_t::sub_t (class ctx_t *parent_, uint32_t slot_) :
    socket_base_t (parent_, slot_),
29
    fq (this),
30
    has_message (false),
31
    more (false)
32
{
33
    options.type = ZMQ_SUB;
34 35
    options.requires_in = true;
    options.requires_out = false;
36
    zmq_msg_init (&message);
37 38 39 40
}

zmq::sub_t::~sub_t ()
{
41
    zmq_msg_close (&message);
42 43
}

44
void zmq::sub_t::xattach_pipes (class reader_t *inpipe_,
45
    class writer_t *outpipe_, const blob_t &peer_identity_)
46
{
47 48
    zmq_assert (inpipe_ && !outpipe_);
    fq.attach (inpipe_);
49 50
}

51
void zmq::sub_t::process_term (int linger_)
52
{
53
    fq.terminate ();
54
    socket_base_t::process_term (linger_);
55 56 57
}

int zmq::sub_t::xsetsockopt (int option_, const void *optval_,
58 59 60
    size_t optvallen_)
{
    if (option_ == ZMQ_SUBSCRIBE) {
61
        subscriptions.add ((unsigned char*) optval_, optvallen_);
62 63 64 65
        return 0;
    }
    
    if (option_ == ZMQ_UNSUBSCRIBE) {
66 67 68
        if (!subscriptions.rm ((unsigned char*) optval_, optvallen_)) {
            errno = EINVAL;
            return -1;
69 70 71 72
        }
        return 0;
    }

73 74
    errno = EINVAL;
    return -1;
75 76
}

77
int zmq::sub_t::xrecv (zmq_msg_t *msg_, int flags_)
78
{
79 80 81 82 83
    //  If there's already a message prepared by a previous call to zmq_poll,
    //  return it straight ahead.
    if (has_message) {
        zmq_msg_move (msg_, &message);
        has_message = false;
84
        more = msg_->flags & ZMQ_MSG_MORE;
85 86 87 88 89 90 91
        return 0;
    }

    //  TODO: This can result in infinite loop in the case of continuous
    //  stream of non-matching messages which breaks the non-blocking recv
    //  semantics.
    while (true) {
92

93 94
        //  Get a message using fair queueing algorithm.
        int rc = fq.recv (msg_, flags_);
95

96 97 98 99 100 101
        //  If there's no message available, return immediately.
        //  The same when error occurs.
        if (rc != 0)
            return -1;

        //  Check whether the message matches at least one subscription.
102
        //  Non-initial parts of the message are passed 
103 104
        if (more || match (msg_)) {
            more = msg_->flags & ZMQ_MSG_MORE;
105
            return 0;
106 107 108 109
        }

        //  Message doesn't match. Pop any remaining parts of the message
        //  from the pipe.
110
        while (msg_->flags & ZMQ_MSG_MORE) {
111 112 113
            rc = fq.recv (msg_, ZMQ_NOBLOCK);
            zmq_assert (rc == 0);
        }
114 115 116 117 118
    }
}

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

123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146
    //  If there's already a message prepared by a previous call to zmq_poll,
    //  return straight ahead.
    if (has_message)
        return true;

    //  TODO: This can result in infinite loop in the case of continuous
    //  stream of non-matching messages.
    while (true) {

        //  Get a message using fair queueing algorithm.
        int rc = fq.recv (&message, ZMQ_NOBLOCK);

        //  If there's no message available, return immediately.
        //  The same when error occurs.
        if (rc != 0) {
            zmq_assert (errno == EAGAIN);
            return false;
        }

        //  Check whether the message matches at least one subscription.
        if (match (&message)) {
            has_message = true;
            return true;
        }
147 148 149

        //  Message doesn't match. Pop any remaining parts of the message
        //  from the pipe.
150
        while (message.flags & ZMQ_MSG_MORE) {
151 152 153
            rc = fq.recv (&message, ZMQ_NOBLOCK);
            zmq_assert (rc == 0);
        }
154 155 156 157 158
    }
}

bool zmq::sub_t::match (zmq_msg_t *msg_)
{
159 160
    return subscriptions.check ((unsigned char*) zmq_msg_data (msg_),
        zmq_msg_size (msg_));
161
}