mirror of
https://github.com/zeromq/libzmq.git
synced 2025-03-10 07:56:09 +00:00
ec81f8fb25
This patch introduces two changes: 1. 32-bit ID is used to identify the peer instead of UUID 2. REQ socket seeds the label stack with unique 32-bit request ID It also drops any replies with non-matching request ID Signed-off-by: Martin Sustrik <sustrik@250bpm.com>
64 lines
1.9 KiB
C++
64 lines
1.9 KiB
C++
/*
|
|
Copyright (c) 2007-2011 iMatix Corporation
|
|
Copyright (c) 2007-2011 Other contributors as noted in the AUTHORS file
|
|
|
|
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/>.
|
|
*/
|
|
|
|
#ifndef __ZMQ_REQ_HPP_INCLUDED__
|
|
#define __ZMQ_REQ_HPP_INCLUDED__
|
|
|
|
#include "xreq.hpp"
|
|
#include "stdint.hpp"
|
|
|
|
namespace zmq
|
|
{
|
|
|
|
class req_t : public xreq_t
|
|
{
|
|
public:
|
|
|
|
req_t (class ctx_t *parent_, uint32_t tid_);
|
|
~req_t ();
|
|
|
|
// Overloads of functions from socket_base_t.
|
|
int xsend (class msg_t *msg_, int flags_);
|
|
int xrecv (class msg_t *msg_, int flags_);
|
|
bool xhas_in ();
|
|
bool xhas_out ();
|
|
|
|
private:
|
|
|
|
// If true, request was already sent and reply wasn't received yet or
|
|
// was raceived partially.
|
|
bool receiving_reply;
|
|
|
|
// If true, we are starting to send/recv a message. The first part
|
|
// of the message must be empty message part (backtrace stack bottom).
|
|
bool message_begins;
|
|
|
|
// Request ID. Request numbers gradually increase (and wrap over)
|
|
// so that we don't have to generate random ID for each request.
|
|
uint32_t request_id;
|
|
|
|
req_t (const req_t&);
|
|
const req_t &operator = (const req_t&);
|
|
};
|
|
|
|
}
|
|
|
|
#endif
|