mirror of
https://github.com/zeromq/libzmq.git
synced 2024-12-31 01:43:02 +08:00
5934919f3e
Solution: use ZMQ_LAST_ENDPOINT in most places. This alllows running tests in paralle, and on over-booked shared machines where many of the ports would be already in use. Keep 3 tests with an hardcoded port, as there are some code paths that require it (eg: connect before bind), but list those ports in tests/testutil.hpp as macros so that they do not overlap and still allow parallel runs. These changes were inspired by a patch uploaded to Ubuntu by the package maintainer, Steve Langasek <steve.langasek@ubuntu.com>. Thank you Steve!
267 lines
8.0 KiB
C++
267 lines
8.0 KiB
C++
/*
|
|
Copyright (c) 2007-2017 Contributors as noted in the AUTHORS file
|
|
|
|
This file is part of libzmq, the ZeroMQ core engine in C++.
|
|
|
|
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
|
|
(at your option) any later version.
|
|
|
|
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.
|
|
|
|
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/>.
|
|
*/
|
|
|
|
#include "testutil.hpp"
|
|
|
|
const char *bind_address = 0;
|
|
char connect_address[MAX_SOCKET_STRING];
|
|
|
|
void test_round_robin_out (void *ctx)
|
|
{
|
|
void *req = zmq_socket (ctx, ZMQ_REQ);
|
|
assert (req);
|
|
|
|
int rc = zmq_bind (req, bind_address);
|
|
assert (rc == 0);
|
|
size_t len = MAX_SOCKET_STRING;
|
|
rc = zmq_getsockopt (req, ZMQ_LAST_ENDPOINT, connect_address, &len);
|
|
assert (rc == 0);
|
|
|
|
const size_t services = 5;
|
|
void *rep [services];
|
|
for (size_t peer = 0; peer < services; peer++) {
|
|
rep [peer] = zmq_socket (ctx, ZMQ_REP);
|
|
assert (rep [peer]);
|
|
|
|
int timeout = 250;
|
|
rc = zmq_setsockopt (rep [peer], ZMQ_RCVTIMEO, &timeout, sizeof (int));
|
|
assert (rc == 0);
|
|
|
|
rc = zmq_connect (rep [peer], connect_address);
|
|
assert (rc == 0);
|
|
}
|
|
// We have to give the connects time to finish otherwise the requests
|
|
// will not properly round-robin. We could alternatively connect the
|
|
// REQ sockets to the REP sockets.
|
|
msleep (SETTLE_TIME);
|
|
|
|
// Send our peer-replies, and expect every REP it used once in order
|
|
for (size_t peer = 0; peer < services; peer++) {
|
|
s_send_seq (req, "ABC", SEQ_END);
|
|
s_recv_seq (rep [peer], "ABC", SEQ_END);
|
|
s_send_seq (rep [peer], "DEF", SEQ_END);
|
|
s_recv_seq (req, "DEF", SEQ_END);
|
|
}
|
|
|
|
close_zero_linger (req);
|
|
for (size_t peer = 0; peer < services; peer++)
|
|
close_zero_linger (rep [peer]);
|
|
|
|
// Wait for disconnects.
|
|
msleep (SETTLE_TIME);
|
|
}
|
|
|
|
void test_req_only_listens_to_current_peer (void *ctx)
|
|
{
|
|
void *req = zmq_socket (ctx, ZMQ_REQ);
|
|
assert (req);
|
|
|
|
int rc = zmq_setsockopt(req, ZMQ_IDENTITY, "A", 2);
|
|
assert (rc == 0);
|
|
|
|
rc = zmq_bind (req, bind_address);
|
|
assert (rc == 0);
|
|
size_t len = MAX_SOCKET_STRING;
|
|
rc = zmq_getsockopt (req, ZMQ_LAST_ENDPOINT, connect_address, &len);
|
|
assert (rc == 0);
|
|
|
|
const size_t services = 3;
|
|
void *router [services];
|
|
|
|
for (size_t i = 0; i < services; ++i) {
|
|
router [i] = zmq_socket (ctx, ZMQ_ROUTER);
|
|
assert (router [i]);
|
|
|
|
int timeout = 250;
|
|
rc = zmq_setsockopt (router [i], ZMQ_RCVTIMEO, &timeout, sizeof (timeout));
|
|
assert (rc == 0);
|
|
|
|
int enabled = 1;
|
|
rc = zmq_setsockopt (router [i], ZMQ_ROUTER_MANDATORY, &enabled, sizeof (enabled));
|
|
assert (rc == 0);
|
|
|
|
rc = zmq_connect (router [i], connect_address);
|
|
assert (rc == 0);
|
|
}
|
|
|
|
// Wait for connects to finish.
|
|
msleep (SETTLE_TIME);
|
|
|
|
for (size_t i = 0; i < services; ++i) {
|
|
// There still is a race condition when a stale peer's message
|
|
// arrives at the REQ just after a request was sent to that peer.
|
|
// To avoid that happening in the test, sleep for a bit.
|
|
rc = zmq_poll (0, 0, 10);
|
|
assert (rc == 0);
|
|
|
|
s_send_seq (req, "ABC", SEQ_END);
|
|
|
|
// Receive on router i
|
|
s_recv_seq (router [i], "A", 0, "ABC", SEQ_END);
|
|
|
|
// Send back replies on all routers
|
|
for (size_t j = 0; j < services; ++j) {
|
|
const char *replies [] = { "WRONG", "GOOD" };
|
|
const char *reply = replies [i == j ? 1 : 0];
|
|
s_send_seq (router [j], "A", 0, reply, SEQ_END);
|
|
}
|
|
|
|
// Receive only the good reply
|
|
s_recv_seq (req, "GOOD", SEQ_END);
|
|
}
|
|
|
|
close_zero_linger (req);
|
|
for (size_t i = 0; i < services; ++i)
|
|
close_zero_linger (router [i]);
|
|
|
|
// Wait for disconnects.
|
|
msleep (SETTLE_TIME);
|
|
}
|
|
|
|
void test_req_message_format (void *ctx)
|
|
{
|
|
void *req = zmq_socket (ctx, ZMQ_REQ);
|
|
assert (req);
|
|
|
|
void *router = zmq_socket (ctx, ZMQ_ROUTER);
|
|
assert (router);
|
|
|
|
int rc = zmq_bind (req, bind_address);
|
|
assert (rc == 0);
|
|
size_t len = MAX_SOCKET_STRING;
|
|
rc = zmq_getsockopt (req, ZMQ_LAST_ENDPOINT, connect_address, &len);
|
|
assert (rc == 0);
|
|
|
|
rc = zmq_connect (router, connect_address);
|
|
assert (rc == 0);
|
|
|
|
// Send a multi-part request.
|
|
s_send_seq (req, "ABC", "DEF", SEQ_END);
|
|
|
|
zmq_msg_t msg;
|
|
zmq_msg_init (&msg);
|
|
|
|
// Receive peer identity
|
|
rc = zmq_msg_recv (&msg, router, 0);
|
|
assert (rc != -1);
|
|
assert (zmq_msg_size (&msg) > 0);
|
|
zmq_msg_t peer_id_msg;
|
|
zmq_msg_init (&peer_id_msg);
|
|
zmq_msg_copy (&peer_id_msg, &msg);
|
|
|
|
int more = 0;
|
|
size_t more_size = sizeof (more);
|
|
rc = zmq_getsockopt (router, ZMQ_RCVMORE, &more, &more_size);
|
|
assert (rc == 0);
|
|
assert (more);
|
|
|
|
// Receive the rest.
|
|
s_recv_seq (router, 0, "ABC", "DEF", SEQ_END);
|
|
|
|
// Send back a single-part reply.
|
|
rc = zmq_msg_send (&peer_id_msg, router, ZMQ_SNDMORE);
|
|
assert (rc != -1);
|
|
s_send_seq (router, 0, "GHI", SEQ_END);
|
|
|
|
// Receive reply.
|
|
s_recv_seq (req, "GHI", SEQ_END);
|
|
|
|
rc = zmq_msg_close (&msg);
|
|
assert (rc == 0);
|
|
|
|
rc = zmq_msg_close (&peer_id_msg);
|
|
assert (rc == 0);
|
|
|
|
close_zero_linger (req);
|
|
close_zero_linger (router);
|
|
|
|
// Wait for disconnects.
|
|
msleep (SETTLE_TIME);
|
|
}
|
|
|
|
void test_block_on_send_no_peers (void *ctx)
|
|
{
|
|
void *sc = zmq_socket (ctx, ZMQ_REQ);
|
|
assert (sc);
|
|
|
|
int timeout = 250;
|
|
int rc = zmq_setsockopt (sc, ZMQ_SNDTIMEO, &timeout, sizeof (timeout));
|
|
assert (rc == 0);
|
|
|
|
rc = zmq_send (sc, 0, 0, ZMQ_DONTWAIT);
|
|
assert (rc == -1);
|
|
assert (errno == EAGAIN);
|
|
|
|
rc = zmq_send (sc, 0, 0, 0);
|
|
assert (rc == -1);
|
|
assert (errno == EAGAIN);
|
|
|
|
rc = zmq_close (sc);
|
|
assert (rc == 0);
|
|
}
|
|
|
|
int main (void)
|
|
{
|
|
setup_test_environment();
|
|
void *ctx = zmq_ctx_new ();
|
|
assert (ctx);
|
|
|
|
const char *binds [] = { "inproc://a", "tcp://127.0.0.1:*" };
|
|
|
|
for (int transport = 0; transport < 2; transport++) {
|
|
bind_address = binds [transport];
|
|
|
|
// SHALL route outgoing messages to connected peers using a round-robin
|
|
// strategy.
|
|
test_round_robin_out (ctx);
|
|
|
|
// The request and reply messages SHALL have this format on the wire:
|
|
// * A delimiter, consisting of an empty frame, added by the REQ socket.
|
|
// * One or more data frames, comprising the message visible to the
|
|
// application.
|
|
test_req_message_format (ctx);
|
|
|
|
// SHALL block on sending, or return a suitable error, when it has no
|
|
// connected peers.
|
|
test_block_on_send_no_peers (ctx);
|
|
|
|
// SHALL accept an incoming message only from the last peer that it sent a
|
|
// request to.
|
|
// SHALL discard silently any messages received from other peers.
|
|
// PH: this test is still failing; disabled for now to allow build to
|
|
// complete.
|
|
// test_req_only_listens_to_current_peer (ctx);
|
|
}
|
|
|
|
int rc = zmq_ctx_term (ctx);
|
|
assert (rc == 0);
|
|
|
|
return 0 ;
|
|
}
|