2009-12-13 14:45:23 +01:00
|
|
|
/*
|
2011-10-31 16:20:30 +01:00
|
|
|
Copyright (c) 2009-2011 250bpm s.r.o.
|
2011-11-01 18:06:11 +01:00
|
|
|
Copyright (c) 2011 iMatix Corporation
|
2011-03-02 16:30:40 +01:00
|
|
|
Copyright (c) 2007-2011 Other contributors as noted in the AUTHORS file
|
2009-12-13 14:45:23 +01:00
|
|
|
|
|
|
|
This file is part of 0MQ.
|
|
|
|
|
|
|
|
0MQ is free software; you can redistribute it and/or modify it under
|
2010-10-30 15:08:28 +02:00
|
|
|
the terms of the GNU Lesser General Public License as published by
|
2009-12-13 14:45:23 +01:00
|
|
|
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
|
2010-10-30 15:08:28 +02:00
|
|
|
GNU Lesser General Public License for more details.
|
2009-12-13 14:45:23 +01:00
|
|
|
|
2010-10-30 15:08:28 +02:00
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
2009-12-13 14:45:23 +01:00
|
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef __ZMQ_XREP_HPP_INCLUDED__
|
|
|
|
#define __ZMQ_XREP_HPP_INCLUDED__
|
|
|
|
|
2010-02-16 18:30:38 +01:00
|
|
|
#include <map>
|
|
|
|
|
2009-12-13 14:45:23 +01:00
|
|
|
#include "socket_base.hpp"
|
2011-09-15 10:00:23 +02:00
|
|
|
#include "session_base.hpp"
|
2011-06-22 11:02:16 +02:00
|
|
|
#include "stdint.hpp"
|
2011-04-21 22:27:48 +02:00
|
|
|
#include "msg.hpp"
|
2011-06-22 16:51:40 +02:00
|
|
|
#include "fq.hpp"
|
2009-12-13 14:45:23 +01:00
|
|
|
|
|
|
|
namespace zmq
|
|
|
|
{
|
|
|
|
|
2010-04-27 17:36:00 +02:00
|
|
|
// TODO: This class uses O(n) scheduling. Rewrite it to use O(1) algorithm.
|
2010-08-06 17:49:37 +02:00
|
|
|
class xrep_t :
|
2011-05-23 20:30:01 +02:00
|
|
|
public socket_base_t
|
2009-12-13 14:45:23 +01:00
|
|
|
{
|
|
|
|
public:
|
|
|
|
|
2010-11-05 16:38:52 +01:00
|
|
|
xrep_t (class ctx_t *parent_, uint32_t tid_);
|
2009-12-13 14:45:23 +01:00
|
|
|
~xrep_t ();
|
|
|
|
|
|
|
|
// Overloads of functions from socket_base_t.
|
2011-07-15 11:24:33 +02:00
|
|
|
void xattach_pipe (class pipe_t *pipe_);
|
2011-04-21 22:27:48 +02:00
|
|
|
int xsend (class msg_t *msg_, int flags_);
|
|
|
|
int xrecv (class msg_t *msg_, int flags_);
|
2009-12-13 14:45:23 +01:00
|
|
|
bool xhas_in ();
|
|
|
|
bool xhas_out ();
|
2011-05-23 20:30:01 +02:00
|
|
|
void xread_activated (class pipe_t *pipe_);
|
|
|
|
void xwrite_activated (class pipe_t *pipe_);
|
|
|
|
void xterminated (class pipe_t *pipe_);
|
2009-12-13 14:45:23 +01:00
|
|
|
|
2011-05-08 09:02:47 +02:00
|
|
|
protected:
|
|
|
|
|
|
|
|
// Rollback any message parts that were sent but not yet flushed.
|
|
|
|
int rollback ();
|
|
|
|
|
2010-08-11 14:09:56 +02:00
|
|
|
private:
|
|
|
|
|
2011-06-22 16:51:40 +02:00
|
|
|
// Fair queueing object for inbound pipes.
|
|
|
|
fq_t fq;
|
2010-04-27 17:36:00 +02:00
|
|
|
|
2010-07-06 22:47:07 +02:00
|
|
|
// Have we prefetched a message.
|
|
|
|
bool prefetched;
|
|
|
|
|
|
|
|
// Holds the prefetched message.
|
2011-04-21 22:27:48 +02:00
|
|
|
msg_t prefetched_msg;
|
2010-07-06 22:47:07 +02:00
|
|
|
|
2010-04-27 17:36:00 +02:00
|
|
|
// If true, more incoming message parts are expected.
|
|
|
|
bool more_in;
|
|
|
|
|
|
|
|
struct outpipe_t
|
|
|
|
{
|
2011-05-22 17:26:53 +02:00
|
|
|
class pipe_t *pipe;
|
2010-04-27 17:36:00 +02:00
|
|
|
bool active;
|
|
|
|
};
|
2009-12-15 09:09:19 +01:00
|
|
|
|
2011-06-22 11:02:16 +02:00
|
|
|
// Outbound pipes indexed by the peer IDs.
|
|
|
|
typedef std::map <uint32_t, outpipe_t> outpipes_t;
|
2010-02-16 18:30:38 +01:00
|
|
|
outpipes_t outpipes;
|
|
|
|
|
2010-04-27 17:36:00 +02:00
|
|
|
// The pipe we are currently writing to.
|
2011-05-22 17:26:53 +02:00
|
|
|
class pipe_t *current_out;
|
2010-04-27 17:36:00 +02:00
|
|
|
|
|
|
|
// If true, more outgoing message parts are expected.
|
|
|
|
bool more_out;
|
|
|
|
|
2011-06-22 11:02:16 +02:00
|
|
|
// Peer ID are generated. It's a simple increment and wrap-over
|
|
|
|
// algorithm. This value is the next ID to use (if not used already).
|
|
|
|
uint32_t next_peer_id;
|
|
|
|
|
2009-12-13 14:45:23 +01:00
|
|
|
xrep_t (const xrep_t&);
|
2011-01-13 11:44:23 +01:00
|
|
|
const xrep_t &operator = (const xrep_t&);
|
2009-12-13 14:45:23 +01:00
|
|
|
};
|
|
|
|
|
2011-09-15 10:00:23 +02:00
|
|
|
class xrep_session_t : public session_base_t
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
|
|
|
|
xrep_session_t (class io_thread_t *io_thread_, bool connect_,
|
|
|
|
class socket_base_t *socket_, const options_t &options_,
|
|
|
|
const char *protocol_, const char *address_);
|
|
|
|
~xrep_session_t ();
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
|
|
|
xrep_session_t (const xrep_session_t&);
|
|
|
|
const xrep_session_t &operator = (const xrep_session_t&);
|
|
|
|
};
|
|
|
|
|
2009-12-13 14:45:23 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|