libzmq/tests/test_spec_rep.cpp

156 lines
4.4 KiB
C++
Raw Normal View History

/*
2014-01-02 12:00:57 +01:00
Copyright (c) 2007-2014 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/>.
*/
#include "testutil.hpp"
const char *bind_address = 0;
const char *connect_address = 0;
void test_fair_queue_in (void *ctx)
{
void *rep = zmq_socket (ctx, ZMQ_REP);
assert (rep);
int timeout = 100;
2013-07-14 08:32:35 +02:00
int rc = zmq_setsockopt (rep, ZMQ_RCVTIMEO, &timeout, sizeof (int));
assert (rc == 0);
rc = zmq_bind (rep, bind_address);
assert (rc == 0);
2013-07-14 08:32:35 +02:00
const size_t services = 5;
void *reqs [services];
for (size_t peer = 0; peer < services; ++peer) {
reqs [peer] = zmq_socket (ctx, ZMQ_REQ);
assert (reqs [peer]);
2013-07-14 08:32:35 +02:00
rc = zmq_setsockopt (reqs [peer], ZMQ_RCVTIMEO, &timeout, sizeof (int));
assert (rc == 0);
2013-07-14 08:32:35 +02:00
rc = zmq_connect (reqs [peer], connect_address);
assert (rc == 0);
}
2013-07-14 08:32:35 +02:00
s_send_seq (reqs [0], "A", SEQ_END);
s_recv_seq (rep, "A", SEQ_END);
s_send_seq (rep, "A", SEQ_END);
2013-07-14 08:32:35 +02:00
s_recv_seq (reqs [0], "A", SEQ_END);
2013-07-14 08:32:35 +02:00
s_send_seq (reqs [0], "A", SEQ_END);
s_recv_seq (rep, "A", SEQ_END);
s_send_seq (rep, "A", SEQ_END);
2013-07-14 08:32:35 +02:00
s_recv_seq (reqs [0], "A", SEQ_END);
2013-10-02 12:15:31 +02:00
// TODO: following test fails randomly on some boxes
#ifdef SOMEONE_FIXES_THIS
// send N requests
2013-07-14 08:32:35 +02:00
for (size_t peer = 0; peer < services; ++peer) {
char * str = strdup("A");
2013-07-14 08:32:35 +02:00
str [0] += peer;
s_send_seq (reqs [peer], str, SEQ_END);
free (str);
}
// handle N requests
2013-07-14 08:32:35 +02:00
for (size_t peer = 0; peer < services; ++peer) {
char * str = strdup("A");
2013-07-14 08:32:35 +02:00
str [0] += peer;
2013-10-02 12:15:31 +02:00
// Test fails here
s_recv_seq (rep, str, SEQ_END);
s_send_seq (rep, str, SEQ_END);
2013-07-14 08:32:35 +02:00
s_recv_seq (reqs [peer], str, SEQ_END);
free (str);
}
2013-10-02 12:15:31 +02:00
#endif
close_zero_linger (rep);
2013-07-14 08:32:35 +02:00
for (size_t peer = 0; peer < services; ++peer)
close_zero_linger (reqs [peer]);
// Wait for disconnects.
rc = zmq_poll (0, 0, 100);
assert (rc == 0);
}
void test_envelope (void *ctx)
{
void *rep = zmq_socket (ctx, ZMQ_REP);
assert (rep);
int rc = zmq_bind (rep, bind_address);
assert (rc == 0);
void *dealer = zmq_socket (ctx, ZMQ_DEALER);
assert (dealer);
rc = zmq_connect (dealer, connect_address);
assert (rc == 0);
// minimal envelope
s_send_seq (dealer, 0, "A", SEQ_END);
s_recv_seq (rep, "A", SEQ_END);
s_send_seq (rep, "A", SEQ_END);
s_recv_seq (dealer, 0, "A", SEQ_END);
// big envelope
s_send_seq (dealer, "X", "Y", 0, "A", SEQ_END);
s_recv_seq (rep, "A", SEQ_END);
s_send_seq (rep, "A", SEQ_END);
s_recv_seq (dealer, "X", "Y", 0, "A", SEQ_END);
close_zero_linger (rep);
close_zero_linger (dealer);
// Wait for disconnects.
rc = zmq_poll (0, 0, 100);
assert (rc == 0);
}
2013-07-14 08:32:35 +02:00
int main (void)
{
setup_test_environment();
void *ctx = zmq_ctx_new ();
assert (ctx);
2013-09-18 12:58:19 +02:00
const char *binds [] = { "inproc://a", "tcp://127.0.0.1:5555" };
2013-07-14 08:32:35 +02:00
const char *connects [] = { "inproc://a", "tcp://localhost:5555" };
2013-07-14 08:32:35 +02:00
for (int transport = 0; transport < 2; ++transport) {
bind_address = binds [transport];
connect_address = connects [transport];
// SHALL receive incoming messages from its peers using a fair-queuing
// strategy.
test_fair_queue_in (ctx);
// For an incoming message:
// SHALL remove and store the address envelope, including the delimiter.
// SHALL pass the remaining data frames to its calling application.
// SHALL wait for a single reply message from its calling application.
// SHALL prepend the address envelope and delimiter.
// SHALL deliver this message back to the originating peer.
test_envelope (ctx);
}
int rc = zmq_ctx_term (ctx);
assert (rc == 0);
return 0 ;
}