2010-12-04 23:14:38 +01:00
|
|
|
/*
|
2016-01-28 15:07:31 +01:00
|
|
|
Copyright (c) 2007-2016 Contributors as noted in the AUTHORS file
|
2010-12-04 23:14:38 +01:00
|
|
|
|
2015-06-02 22:33:55 +02:00
|
|
|
This file is part of libzmq, the ZeroMQ core engine in C++.
|
2010-12-04 23:14:38 +01:00
|
|
|
|
2015-06-02 22:33:55 +02:00
|
|
|
libzmq is free software; you can redistribute it and/or modify it under
|
|
|
|
the terms of the GNU Lesser General Public License (LGPL) as published
|
|
|
|
by the Free Software Foundation; either version 3 of the License, or
|
2010-12-04 23:14:38 +01:00
|
|
|
(at your option) any later version.
|
|
|
|
|
2015-06-02 22:33:55 +02:00
|
|
|
As a special exception, the Contributors give you permission to link
|
|
|
|
this library with independent modules to produce an executable,
|
|
|
|
regardless of the license terms of these independent modules, and to
|
|
|
|
copy and distribute the resulting executable under terms of your choice,
|
|
|
|
provided that you also meet, for each linked independent module, the
|
|
|
|
terms and conditions of the license of that module. An independent
|
|
|
|
module is a module which is not derived from or based on this library.
|
|
|
|
If you modify this library, you must extend this exception to your
|
|
|
|
version of the library.
|
|
|
|
|
|
|
|
libzmq 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.
|
2010-12-04 23:14:38 +01:00
|
|
|
|
|
|
|
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/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef __ZMQ_XSUB_HPP_INCLUDED__
|
|
|
|
#define __ZMQ_XSUB_HPP_INCLUDED__
|
|
|
|
|
|
|
|
#include "socket_base.hpp"
|
2011-09-15 10:00:23 +02:00
|
|
|
#include "session_base.hpp"
|
2011-05-30 10:07:34 +02:00
|
|
|
#include "dist.hpp"
|
2010-12-04 23:14:38 +01:00
|
|
|
#include "fq.hpp"
|
2011-05-30 10:07:34 +02:00
|
|
|
#include "trie.hpp"
|
2010-12-04 23:14:38 +01:00
|
|
|
|
|
|
|
namespace zmq
|
|
|
|
{
|
|
|
|
|
2011-11-09 15:22:20 +01:00
|
|
|
class ctx_t;
|
|
|
|
class pipe_t;
|
|
|
|
class io_thread_t;
|
|
|
|
|
2011-05-22 17:26:53 +02:00
|
|
|
class xsub_t :
|
2011-05-23 20:30:01 +02:00
|
|
|
public socket_base_t
|
2010-12-04 23:14:38 +01:00
|
|
|
{
|
|
|
|
public:
|
|
|
|
|
2012-03-19 19:41:20 -05:00
|
|
|
xsub_t (zmq::ctx_t *parent_, uint32_t tid_, int sid_);
|
2010-12-04 23:14:38 +01:00
|
|
|
~xsub_t ();
|
|
|
|
|
|
|
|
protected:
|
|
|
|
|
2014-01-08 18:25:31 +01:00
|
|
|
// Overrides of functions from socket_base_t.
|
2013-08-31 09:53:47 -04:00
|
|
|
void xattach_pipe (zmq::pipe_t *pipe_, bool subscribe_to_all_);
|
2012-11-09 17:08:03 +01:00
|
|
|
int xsend (zmq::msg_t *msg_);
|
2010-12-05 09:48:52 +01:00
|
|
|
bool xhas_out ();
|
2012-11-09 17:17:43 +01:00
|
|
|
int xrecv (zmq::msg_t *msg_);
|
2010-12-04 23:14:38 +01:00
|
|
|
bool xhas_in ();
|
2014-01-12 21:58:36 +01:00
|
|
|
blob_t get_credential () const;
|
2011-11-09 15:22:20 +01:00
|
|
|
void xread_activated (zmq::pipe_t *pipe_);
|
|
|
|
void xwrite_activated (zmq::pipe_t *pipe_);
|
2011-05-30 10:07:34 +02:00
|
|
|
void xhiccuped (pipe_t *pipe_);
|
2013-05-28 16:49:24 +02:00
|
|
|
void xpipe_terminated (zmq::pipe_t *pipe_);
|
2010-12-04 23:14:38 +01:00
|
|
|
|
|
|
|
private:
|
|
|
|
|
2011-05-30 10:07:34 +02:00
|
|
|
// Check whether the message matches at least one subscription.
|
2011-11-09 15:22:20 +01:00
|
|
|
bool match (zmq::msg_t *msg_);
|
2011-05-30 10:07:34 +02:00
|
|
|
|
|
|
|
// Function to be applied to the trie to send all the subsciptions
|
|
|
|
// upstream.
|
|
|
|
static void send_subscription (unsigned char *data_, size_t size_,
|
|
|
|
void *arg_);
|
|
|
|
|
2010-12-04 23:14:38 +01:00
|
|
|
// Fair queueing object for inbound pipes.
|
|
|
|
fq_t fq;
|
|
|
|
|
2011-05-30 10:07:34 +02:00
|
|
|
// Object for distributing the subscriptions upstream.
|
|
|
|
dist_t dist;
|
|
|
|
|
|
|
|
// The repository of subscriptions.
|
|
|
|
trie_t subscriptions;
|
|
|
|
|
|
|
|
// If true, 'message' contains a matching message to return on the
|
|
|
|
// next recv call.
|
|
|
|
bool has_message;
|
|
|
|
msg_t message;
|
|
|
|
|
|
|
|
// If true, part of a multipart message was already received, but
|
|
|
|
// there are following parts still waiting.
|
|
|
|
bool more;
|
|
|
|
|
2010-12-04 23:14:38 +01:00
|
|
|
xsub_t (const xsub_t&);
|
2011-01-13 11:44:23 +01:00
|
|
|
const xsub_t &operator = (const xsub_t&);
|
2010-12-04 23:14:38 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|