2009-09-10 12:00:47 +02:00
|
|
|
/*
|
2010-01-05 08:29:35 +01:00
|
|
|
Copyright (c) 2007-2010 iMatix Corporation
|
2009-09-10 12:00:47 +02:00
|
|
|
|
|
|
|
This file is part of 0MQ.
|
|
|
|
|
|
|
|
0MQ is free software; you can redistribute it and/or modify it under
|
|
|
|
the terms of the Lesser GNU 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
|
|
|
|
Lesser GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the Lesser GNU General Public License
|
|
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
2009-11-24 11:23:10 +01:00
|
|
|
#ifndef __ZMQ_SUB_HPP_INCLUDED__
|
|
|
|
#define __ZMQ_SUB_HPP_INCLUDED__
|
2009-09-10 12:00:47 +02:00
|
|
|
|
2010-03-11 20:33:27 +01:00
|
|
|
#include "../include/zmq.h"
|
2010-01-13 19:21:23 +01:00
|
|
|
|
2010-08-28 13:26:19 +02:00
|
|
|
#include "trie.hpp"
|
2009-09-10 12:00:47 +02:00
|
|
|
#include "socket_base.hpp"
|
2009-12-15 09:09:19 +01:00
|
|
|
#include "fq.hpp"
|
2009-09-10 12:00:47 +02:00
|
|
|
|
|
|
|
namespace zmq
|
|
|
|
{
|
|
|
|
|
2010-09-18 07:37:36 +02:00
|
|
|
class sub_t : public socket_base_t
|
2009-09-10 12:00:47 +02:00
|
|
|
{
|
|
|
|
public:
|
|
|
|
|
2010-08-06 17:49:37 +02:00
|
|
|
sub_t (class ctx_t *parent_, uint32_t slot_);
|
2009-09-10 12:00:47 +02:00
|
|
|
~sub_t ();
|
|
|
|
|
2009-09-21 14:39:59 +02:00
|
|
|
protected:
|
|
|
|
|
|
|
|
// Overloads of functions from socket_base_t.
|
2010-02-16 18:30:38 +01:00
|
|
|
void xattach_pipes (class reader_t *inpipe_, class writer_t *outpipe_,
|
|
|
|
const blob_t &peer_identity_);
|
2009-09-21 14:39:59 +02:00
|
|
|
int xsetsockopt (int option_, const void *optval_, size_t optvallen_);
|
2009-09-23 10:22:54 +02:00
|
|
|
int xrecv (zmq_msg_t *msg_, int flags_);
|
2009-10-01 10:56:17 +02:00
|
|
|
bool xhas_in ();
|
2009-09-10 12:00:47 +02:00
|
|
|
|
|
|
|
private:
|
|
|
|
|
2010-08-11 14:09:56 +02:00
|
|
|
// Hook into the termination process.
|
2010-10-16 10:53:29 +02:00
|
|
|
void process_term (int linger_);
|
2010-08-11 14:09:56 +02:00
|
|
|
|
2010-01-13 19:21:23 +01:00
|
|
|
// Check whether the message matches at least one subscription.
|
|
|
|
bool match (zmq_msg_t *msg_);
|
|
|
|
|
2009-12-15 09:09:19 +01:00
|
|
|
// Fair queueing object for inbound pipes.
|
2010-01-31 20:14:30 +01:00
|
|
|
fq_t fq;
|
2009-09-11 16:23:16 +02:00
|
|
|
|
2010-01-31 20:14:30 +01:00
|
|
|
// The repository of subscriptions.
|
2010-08-28 13:26:19 +02:00
|
|
|
trie_t subscriptions;
|
2009-09-21 14:39:59 +02:00
|
|
|
|
2010-01-13 19:21:23 +01:00
|
|
|
// If true, 'message' contains a matching message to return on the
|
|
|
|
// next recv call.
|
|
|
|
bool has_message;
|
|
|
|
zmq_msg_t message;
|
|
|
|
|
2010-03-27 09:24:38 +01:00
|
|
|
// If true, part of a multipart message was already received, but
|
|
|
|
// there are following parts still waiting.
|
2010-03-27 21:25:40 +01:00
|
|
|
bool more;
|
2010-03-27 09:24:38 +01:00
|
|
|
|
2009-09-21 14:39:59 +02:00
|
|
|
sub_t (const sub_t&);
|
|
|
|
void operator = (const sub_t&);
|
2009-09-10 12:00:47 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|