2010-12-04 23:14:38 +01:00
|
|
|
/*
|
2011-11-01 18:06:11 +01:00
|
|
|
Copyright (c) 2010-2011 250bpm s.r.o.
|
2011-11-01 13:39:54 +01:00
|
|
|
Copyright (c) 2011 VMware, Inc.
|
2011-11-01 18:06:11 +01:00
|
|
|
Copyright (c) 2010-2011 Other contributors as noted in the AUTHORS file
|
2010-12-04 23:14:38 +01:00
|
|
|
|
|
|
|
This file is part of 0MQ.
|
|
|
|
|
|
|
|
0MQ is free software; you can redistribute it and/or modify it under
|
|
|
|
the terms of the GNU Lesser 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
|
|
|
|
GNU Lesser General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
#include "xsub.hpp"
|
|
|
|
#include "err.hpp"
|
|
|
|
|
2012-03-19 19:41:20 -05:00
|
|
|
zmq::xsub_t::xsub_t (class ctx_t *parent_, uint32_t tid_, int sid_) :
|
|
|
|
socket_base_t (parent_, tid_, sid_),
|
2011-05-30 10:07:34 +02:00
|
|
|
has_message (false),
|
|
|
|
more (false)
|
2010-12-04 23:14:38 +01:00
|
|
|
{
|
2010-12-06 22:36:10 +01:00
|
|
|
options.type = ZMQ_XSUB;
|
2011-12-17 23:42:45 +01:00
|
|
|
|
|
|
|
// When socket is being closed down we don't want to wait till pending
|
|
|
|
// subscription commands are sent to the wire.
|
|
|
|
options.linger = 0;
|
|
|
|
|
2011-05-30 10:07:34 +02:00
|
|
|
int rc = message.init ();
|
|
|
|
errno_assert (rc == 0);
|
2010-12-04 23:14:38 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
zmq::xsub_t::~xsub_t ()
|
|
|
|
{
|
2011-05-30 10:07:34 +02:00
|
|
|
int rc = message.close ();
|
|
|
|
errno_assert (rc == 0);
|
2010-12-04 23:14:38 +01:00
|
|
|
}
|
|
|
|
|
2012-02-02 13:07:48 +01:00
|
|
|
void zmq::xsub_t::xattach_pipe (pipe_t *pipe_, bool icanhasall_)
|
2010-12-04 23:14:38 +01:00
|
|
|
{
|
2012-08-27 16:05:51 -07:00
|
|
|
// icanhasall_ is unused
|
|
|
|
(void)icanhasall_;
|
|
|
|
|
2011-05-22 17:26:53 +02:00
|
|
|
zmq_assert (pipe_);
|
|
|
|
fq.attach (pipe_);
|
2011-05-30 10:07:34 +02:00
|
|
|
dist.attach (pipe_);
|
|
|
|
|
|
|
|
// Send all the cached subscriptions to the new upstream peer.
|
|
|
|
subscriptions.apply (send_subscription, pipe_);
|
|
|
|
pipe_->flush ();
|
2011-05-22 17:26:53 +02:00
|
|
|
}
|
|
|
|
|
2011-05-23 20:30:01 +02:00
|
|
|
void zmq::xsub_t::xread_activated (pipe_t *pipe_)
|
2011-05-22 17:26:53 +02:00
|
|
|
{
|
|
|
|
fq.activated (pipe_);
|
|
|
|
}
|
|
|
|
|
2011-05-30 10:07:34 +02:00
|
|
|
void zmq::xsub_t::xwrite_activated (pipe_t *pipe_)
|
|
|
|
{
|
|
|
|
dist.activated (pipe_);
|
|
|
|
}
|
|
|
|
|
2011-05-23 20:30:01 +02:00
|
|
|
void zmq::xsub_t::xterminated (pipe_t *pipe_)
|
2011-05-22 17:26:53 +02:00
|
|
|
{
|
|
|
|
fq.terminated (pipe_);
|
2011-05-30 10:07:34 +02:00
|
|
|
dist.terminated (pipe_);
|
2010-12-04 23:14:38 +01:00
|
|
|
}
|
|
|
|
|
2011-05-30 10:07:34 +02:00
|
|
|
void zmq::xsub_t::xhiccuped (pipe_t *pipe_)
|
2010-12-04 23:14:38 +01:00
|
|
|
{
|
2011-05-30 10:07:34 +02:00
|
|
|
// Send all the cached subscriptions to the hiccuped pipe.
|
|
|
|
subscriptions.apply (send_subscription, pipe_);
|
|
|
|
pipe_->flush ();
|
|
|
|
}
|
|
|
|
|
2012-11-09 17:08:03 +01:00
|
|
|
int zmq::xsub_t::xsend (msg_t *msg_)
|
2011-05-30 10:07:34 +02:00
|
|
|
{
|
|
|
|
size_t size = msg_->size ();
|
|
|
|
unsigned char *data = (unsigned char*) msg_->data ();
|
|
|
|
|
|
|
|
// Malformed subscriptions.
|
|
|
|
if (size < 1 || (*data != 0 && *data != 1)) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Process the subscription.
|
|
|
|
if (*data == 1) {
|
2012-10-27 15:51:03 -05:00
|
|
|
// this used to filter out duplicate subscriptions,
|
|
|
|
// however this is alread done on the XPUB side and
|
|
|
|
// doing it here as well breaks ZMQ_XPUB_VERBOSE
|
|
|
|
// when there are forwarding devices involved
|
2012-10-28 07:36:18 +09:00
|
|
|
subscriptions.add (data + 1, size - 1);
|
2012-11-09 17:08:03 +01:00
|
|
|
return dist.send_to_all (msg_);
|
2011-05-30 10:07:34 +02:00
|
|
|
}
|
2012-04-24 14:01:26 +02:00
|
|
|
else {
|
2011-05-30 10:07:34 +02:00
|
|
|
if (subscriptions.rm (data + 1, size - 1))
|
2012-11-09 17:08:03 +01:00
|
|
|
return dist.send_to_all (msg_);
|
2011-05-30 10:07:34 +02:00
|
|
|
}
|
2011-06-13 08:15:05 +02:00
|
|
|
|
2012-04-24 14:01:26 +02:00
|
|
|
int rc = msg_->close ();
|
|
|
|
errno_assert (rc == 0);
|
|
|
|
rc = msg_->init ();
|
|
|
|
errno_assert (rc == 0);
|
|
|
|
|
|
|
|
return 0;
|
2010-12-05 09:48:52 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
bool zmq::xsub_t::xhas_out ()
|
|
|
|
{
|
|
|
|
// Subscription can be added/removed anytime.
|
|
|
|
return true;
|
2010-12-04 23:14:38 +01:00
|
|
|
}
|
|
|
|
|
2012-11-09 17:17:43 +01:00
|
|
|
int zmq::xsub_t::xrecv (msg_t *msg_)
|
2010-12-04 23:14:38 +01:00
|
|
|
{
|
2011-05-30 10:07:34 +02:00
|
|
|
// If there's already a message prepared by a previous call to zmq_poll,
|
|
|
|
// return it straight ahead.
|
|
|
|
if (has_message) {
|
|
|
|
int rc = msg_->move (message);
|
|
|
|
errno_assert (rc == 0);
|
|
|
|
has_message = false;
|
2011-11-01 13:39:54 +01:00
|
|
|
more = msg_->flags () & msg_t::more ? true : false;
|
2011-05-30 10:07:34 +02:00
|
|
|
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) {
|
|
|
|
|
|
|
|
// Get a message using fair queueing algorithm.
|
2012-04-26 13:16:51 +02:00
|
|
|
int rc = fq.recv (msg_);
|
2011-05-30 10:07:34 +02:00
|
|
|
|
|
|
|
// 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.
|
|
|
|
// Non-initial parts of the message are passed
|
2011-06-12 15:24:08 +02:00
|
|
|
if (more || !options.filter || match (msg_)) {
|
2011-11-01 13:39:54 +01:00
|
|
|
more = msg_->flags () & msg_t::more ? true : false;
|
2011-05-30 10:07:34 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Message doesn't match. Pop any remaining parts of the message
|
|
|
|
// from the pipe.
|
2011-11-01 13:39:54 +01:00
|
|
|
while (msg_->flags () & msg_t::more) {
|
2012-04-26 13:16:51 +02:00
|
|
|
rc = fq.recv (msg_);
|
2012-05-28 23:13:09 +02:00
|
|
|
errno_assert (rc == 0);
|
2011-05-30 10:07:34 +02:00
|
|
|
}
|
|
|
|
}
|
2010-12-04 23:14:38 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
bool zmq::xsub_t::xhas_in ()
|
|
|
|
{
|
2011-05-30 10:07:34 +02:00
|
|
|
// There are subsequent parts of the partly-read message available.
|
|
|
|
if (more)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
// 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.
|
2012-04-26 13:16:51 +02:00
|
|
|
int rc = fq.recv (&message);
|
2011-05-30 10:07:34 +02:00
|
|
|
|
|
|
|
// If there's no message available, return immediately.
|
|
|
|
// The same when error occurs.
|
|
|
|
if (rc != 0) {
|
2012-05-28 23:13:09 +02:00
|
|
|
errno_assert (errno == EAGAIN);
|
2011-05-30 10:07:34 +02:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check whether the message matches at least one subscription.
|
2011-06-12 15:24:08 +02:00
|
|
|
if (!options.filter || match (&message)) {
|
2011-05-30 10:07:34 +02:00
|
|
|
has_message = true;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Message doesn't match. Pop any remaining parts of the message
|
|
|
|
// from the pipe.
|
2011-11-01 13:39:54 +01:00
|
|
|
while (message.flags () & msg_t::more) {
|
2012-04-26 13:16:51 +02:00
|
|
|
rc = fq.recv (&message);
|
2012-05-28 23:13:09 +02:00
|
|
|
errno_assert (rc == 0);
|
2011-05-30 10:07:34 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool zmq::xsub_t::match (msg_t *msg_)
|
|
|
|
{
|
|
|
|
return subscriptions.check ((unsigned char*) msg_->data (), msg_->size ());
|
2010-12-04 23:14:38 +01:00
|
|
|
}
|
2011-04-21 22:27:48 +02:00
|
|
|
|
2011-05-30 10:07:34 +02:00
|
|
|
void zmq::xsub_t::send_subscription (unsigned char *data_, size_t size_,
|
|
|
|
void *arg_)
|
|
|
|
{
|
|
|
|
pipe_t *pipe = (pipe_t*) arg_;
|
|
|
|
|
|
|
|
// Create the subsctription message.
|
|
|
|
msg_t msg;
|
|
|
|
int rc = msg.init_size (size_ + 1);
|
2012-05-28 23:13:09 +02:00
|
|
|
errno_assert (rc == 0);
|
2011-05-30 10:07:34 +02:00
|
|
|
unsigned char *data = (unsigned char*) msg.data ();
|
|
|
|
data [0] = 1;
|
|
|
|
memcpy (data + 1, data_, size_);
|
|
|
|
|
|
|
|
// Send it to the pipe.
|
|
|
|
bool sent = pipe->write (&msg);
|
2012-02-16 14:49:47 +01:00
|
|
|
// If we reached the SNDHWM, and thus cannot send the subscription, drop
|
|
|
|
// the subscription message instead. This matches the behaviour of
|
|
|
|
// zmq_setsockopt(ZMQ_SUBSCRIBE, ...), which also drops subscriptions
|
|
|
|
// when the SNDHWM is reached.
|
|
|
|
if (!sent)
|
|
|
|
msg.close ();
|
2011-05-30 10:07:34 +02:00
|
|
|
}
|
|
|
|
|
2011-09-15 10:00:23 +02:00
|
|
|
zmq::xsub_session_t::xsub_session_t (io_thread_t *io_thread_, bool connect_,
|
|
|
|
socket_base_t *socket_, const options_t &options_,
|
2012-02-02 14:56:51 +01:00
|
|
|
const address_t *addr_) :
|
|
|
|
session_base_t (io_thread_, connect_, socket_, options_, addr_)
|
2011-09-15 10:00:23 +02:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
zmq::xsub_session_t::~xsub_session_t ()
|
|
|
|
{
|
|
|
|
}
|
2011-05-30 10:07:34 +02:00
|
|
|
|