2010-12-04 23:14:38 +01:00
|
|
|
/*
|
2014-01-02 12:00:57 +01:00
|
|
|
Copyright (c) 2007-2014 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/>.
|
|
|
|
*/
|
|
|
|
|
2011-05-30 10:07:34 +02:00
|
|
|
#include <string.h>
|
|
|
|
|
2010-12-04 23:14:38 +01:00
|
|
|
#include "xpub.hpp"
|
|
|
|
#include "pipe.hpp"
|
2011-04-21 22:27:48 +02:00
|
|
|
#include "err.hpp"
|
|
|
|
#include "msg.hpp"
|
2010-12-04 23:14:38 +01:00
|
|
|
|
2012-03-19 19:41:20 -05:00
|
|
|
zmq::xpub_t::xpub_t (class ctx_t *parent_, uint32_t tid_, int sid_) :
|
|
|
|
socket_base_t (parent_, tid_, sid_),
|
2012-10-08 00:57:43 +09:00
|
|
|
verbose(false),
|
2011-06-12 10:19:21 +02:00
|
|
|
more (false)
|
2010-12-04 23:14:38 +01:00
|
|
|
{
|
2010-12-06 22:36:10 +01:00
|
|
|
options.type = ZMQ_XPUB;
|
2010-12-04 23:14:38 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
zmq::xpub_t::~xpub_t ()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2013-08-31 09:53:47 -04:00
|
|
|
void zmq::xpub_t::xattach_pipe (pipe_t *pipe_, bool subscribe_to_all_)
|
2010-12-04 23:14:38 +01:00
|
|
|
{
|
2011-05-22 17:26:53 +02:00
|
|
|
zmq_assert (pipe_);
|
|
|
|
dist.attach (pipe_);
|
2011-05-31 16:21:17 +02:00
|
|
|
|
2013-08-31 09:53:47 -04:00
|
|
|
// If subscribe_to_all_ is specified, the caller would like to subscribe
|
2012-02-02 13:07:48 +01:00
|
|
|
// to all data on this pipe, implicitly.
|
2013-08-31 09:53:47 -04:00
|
|
|
if (subscribe_to_all_)
|
2012-02-02 13:07:48 +01:00
|
|
|
subscriptions.add (NULL, 0, pipe_);
|
|
|
|
|
2011-05-31 16:21:17 +02:00
|
|
|
// The pipe is active when attached. Let's read the subscriptions from
|
|
|
|
// it, if any.
|
|
|
|
xread_activated (pipe_);
|
2011-05-30 10:07:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void zmq::xpub_t::xread_activated (pipe_t *pipe_)
|
|
|
|
{
|
2011-05-31 16:21:17 +02:00
|
|
|
// There are some subscriptions waiting. Let's process them.
|
|
|
|
msg_t sub;
|
2012-06-26 01:56:54 +02:00
|
|
|
while (pipe_->read (&sub)) {
|
2013-04-18 17:23:57 +02:00
|
|
|
// Apply the subscription to the trie
|
|
|
|
unsigned char *const data = (unsigned char *) sub.data ();
|
2012-06-26 01:56:54 +02:00
|
|
|
const size_t size = sub.size ();
|
2012-01-09 12:19:59 +01:00
|
|
|
if (size > 0 && (*data == 0 || *data == 1)) {
|
|
|
|
bool unique;
|
|
|
|
if (*data == 0)
|
|
|
|
unique = subscriptions.rm (data + 1, size - 1, pipe_);
|
|
|
|
else
|
|
|
|
unique = subscriptions.add (data + 1, size - 1, pipe_);
|
|
|
|
|
|
|
|
// If the subscription is not a duplicate store it so that it can be
|
2012-11-15 15:30:30 -06:00
|
|
|
// passed to used on next recv call. (Unsubscribe is not verbose.)
|
2013-04-18 17:23:57 +02:00
|
|
|
if (options.type == ZMQ_XPUB && (unique || (*data && verbose))) {
|
|
|
|
pending_data.push_back (blob_t (data, size));
|
|
|
|
pending_flags.push_back (0);
|
|
|
|
}
|
2012-01-09 12:19:59 +01:00
|
|
|
}
|
2013-04-18 17:23:57 +02:00
|
|
|
else {
|
2013-01-08 09:16:50 +01:00
|
|
|
// Process user message coming upstream from xsub socket
|
2013-04-18 17:23:57 +02:00
|
|
|
pending_data.push_back (blob_t (data, size));
|
|
|
|
pending_flags.push_back (sub.flags ());
|
|
|
|
}
|
2012-06-26 01:56:54 +02:00
|
|
|
sub.close ();
|
2011-05-31 16:21:17 +02:00
|
|
|
}
|
2011-05-22 17:26:53 +02:00
|
|
|
}
|
|
|
|
|
2011-05-23 20:30:01 +02:00
|
|
|
void zmq::xpub_t::xwrite_activated (pipe_t *pipe_)
|
2011-05-22 17:26:53 +02:00
|
|
|
{
|
|
|
|
dist.activated (pipe_);
|
|
|
|
}
|
|
|
|
|
2012-10-08 00:57:43 +09:00
|
|
|
int zmq::xpub_t::xsetsockopt (int option_, const void *optval_,
|
|
|
|
size_t optvallen_)
|
|
|
|
{
|
|
|
|
if (option_ != ZMQ_XPUB_VERBOSE) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
if (optvallen_ != sizeof (int) || *static_cast <const int*> (optval_) < 0) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return -1;
|
|
|
|
}
|
2013-02-19 14:18:50 +01:00
|
|
|
verbose = (*static_cast <const int*> (optval_) != 0);
|
2012-10-08 00:57:43 +09:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-05-28 16:49:24 +02:00
|
|
|
void zmq::xpub_t::xpipe_terminated (pipe_t *pipe_)
|
2011-05-22 17:26:53 +02:00
|
|
|
{
|
2011-05-30 10:07:34 +02:00
|
|
|
// Remove the pipe from the trie. If there are topics that nobody
|
|
|
|
// is interested in anymore, send corresponding unsubscriptions
|
|
|
|
// upstream.
|
|
|
|
subscriptions.rm (pipe_, send_unsubscription, this);
|
|
|
|
|
2013-05-28 16:49:24 +02:00
|
|
|
dist.pipe_terminated (pipe_);
|
2010-12-04 23:14:38 +01:00
|
|
|
}
|
|
|
|
|
2011-06-11 20:29:56 +02:00
|
|
|
void zmq::xpub_t::mark_as_matching (pipe_t *pipe_, void *arg_)
|
|
|
|
{
|
|
|
|
xpub_t *self = (xpub_t*) arg_;
|
|
|
|
self->dist.match (pipe_);
|
|
|
|
}
|
|
|
|
|
2012-11-09 17:08:03 +01:00
|
|
|
int zmq::xpub_t::xsend (msg_t *msg_)
|
2011-06-11 20:29:56 +02:00
|
|
|
{
|
2011-11-01 13:39:54 +01:00
|
|
|
bool msg_more = msg_->flags () & msg_t::more ? true : false;
|
2011-06-12 10:19:21 +02:00
|
|
|
|
|
|
|
// For the first part of multi-part message, find the matching pipes.
|
|
|
|
if (!more)
|
|
|
|
subscriptions.match ((unsigned char*) msg_->data (), msg_->size (),
|
|
|
|
mark_as_matching, this);
|
2011-06-11 20:29:56 +02:00
|
|
|
|
|
|
|
// Send the message to all the pipes that were marked as matching
|
|
|
|
// in the previous step.
|
2012-11-09 17:08:03 +01:00
|
|
|
int rc = dist.send_to_matching (msg_);
|
2011-06-12 10:19:21 +02:00
|
|
|
if (rc != 0)
|
|
|
|
return rc;
|
|
|
|
|
|
|
|
// If we are at the end of multi-part message we can mark all the pipes
|
|
|
|
// as non-matching.
|
|
|
|
if (!msg_more)
|
|
|
|
dist.unmatch ();
|
|
|
|
|
|
|
|
more = msg_more;
|
|
|
|
|
|
|
|
return 0;
|
2010-12-04 23:14:38 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
bool zmq::xpub_t::xhas_out ()
|
|
|
|
{
|
2011-01-14 12:05:10 +01:00
|
|
|
return dist.has_out ();
|
2010-12-04 23:14:38 +01:00
|
|
|
}
|
|
|
|
|
2012-11-09 17:17:43 +01:00
|
|
|
int zmq::xpub_t::xrecv (msg_t *msg_)
|
2011-01-14 12:38:07 +01:00
|
|
|
{
|
2011-05-30 10:07:34 +02:00
|
|
|
// If there is at least one
|
2013-04-18 17:23:57 +02:00
|
|
|
if (pending_data.empty ()) {
|
2011-05-30 10:07:34 +02:00
|
|
|
errno = EAGAIN;
|
|
|
|
return -1;
|
|
|
|
}
|
2011-05-31 16:21:17 +02:00
|
|
|
|
|
|
|
int rc = msg_->close ();
|
|
|
|
errno_assert (rc == 0);
|
2013-04-18 17:23:57 +02:00
|
|
|
rc = msg_->init_size (pending_data.front ().size ());
|
2011-05-31 16:21:17 +02:00
|
|
|
errno_assert (rc == 0);
|
2013-04-18 17:23:57 +02:00
|
|
|
memcpy (msg_->data (),
|
|
|
|
pending_data.front ().data (),
|
|
|
|
pending_data.front ().size ());
|
|
|
|
msg_->set_flags (pending_flags.front ());
|
|
|
|
pending_data.pop_front ();
|
|
|
|
pending_flags.pop_front ();
|
2011-05-30 10:07:34 +02:00
|
|
|
return 0;
|
2011-01-14 12:38:07 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
bool zmq::xpub_t::xhas_in ()
|
|
|
|
{
|
2013-04-18 17:23:57 +02:00
|
|
|
return !pending_data.empty ();
|
2011-05-30 10:07:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void zmq::xpub_t::send_unsubscription (unsigned char *data_, size_t size_,
|
|
|
|
void *arg_)
|
|
|
|
{
|
|
|
|
xpub_t *self = (xpub_t*) arg_;
|
|
|
|
|
|
|
|
if (self->options.type != ZMQ_PUB) {
|
2013-01-08 09:16:50 +01:00
|
|
|
// Place the unsubscription to the queue of pending (un)sunscriptions
|
|
|
|
// to be retrived by the user later on.
|
|
|
|
blob_t unsub (size_ + 1, 0);
|
|
|
|
unsub [0] = 0;
|
|
|
|
memcpy (&unsub [1], data_, size_);
|
2013-04-18 17:23:57 +02:00
|
|
|
self->pending_data.push_back (unsub);
|
|
|
|
self->pending_flags.push_back (0);
|
2011-05-30 10:07:34 +02:00
|
|
|
}
|
2011-01-14 12:38:07 +01:00
|
|
|
}
|