int
zloop_timer (zloop_t *self, size_t delay, size_t times, zloop_timer_fn handler, void *arg)
{
assert (self);
// Catch excessive use of timers
if (self->max_timers && zlistx_size (self->timers) == self->max_timers) {
zsys_error ("zloop: timer limit reached (max=%d)", self->max_timers);
return -1;
}
int timer_id = s_next_timer_id (self);
s_timer_t *timer = s_timer_new (timer_id, delay, times, handler, arg);
if (timer) {
timer->list_handle = zlistx_add_end (self->timers, timer);
if (!timer->list_handle) {
s_timer_destroy (&timer);
return -1;
}
if (self->verbose)
zsys_debug ("zloop: register timer id=%d delay=%d times=%d",
timer_id, (int) delay, (int) times);
return timer_id;
}
else
return -1;
}
void
s_service_dispatch (service_t *self)
{
// for each message, check regexp and dispatch if possible
if (zlistx_size (self->offers)) {
mlm_msg_t *message = (mlm_msg_t *) zlistx_first (self->queue);
while (message) {
offer_t *offer = (offer_t *) zlistx_first (self->offers);
while (offer) {
if (zrex_matches (offer->rex, mlm_msg_subject (message))) {
client_t *target = offer->client;
assert (target);
assert (!target->msg);
target->msg = (mlm_msg_t *) zlistx_detach (
self->queue, zlistx_cursor (self->queue));
engine_send_event (target, service_message_event);
zlistx_move_end (self->offers, zlistx_cursor (self->offers));
break;
}
offer = (offer_t *) zlistx_next (self->offers);
}
message = (mlm_msg_t *) zlistx_next (self->queue);
}
}
}
int
ztrie_remove_route (ztrie_t *self, const char *path)
{
assert (self);
ztrie_node_t *match = s_ztrie_parse_path (self, path, MODE_LOOKUP);
// The path did match a node which is endpoint to a route
if (match && match->endpoint) {
// This node is part of other routes, thus it cannot destroy it
if (zlistx_size (match->children) > 0) {
match->endpoint = false;
if (match->data && match->destroy_data_fn)
(match->destroy_data_fn) (&match->data);
}
// If this node is not part of other routes, destroy it
else {
// Delete match from parent's children before destroying
void *handle = zlistx_find (match->parent->children, match);
assert (handle);
zlistx_delete (match->parent->children, handle);
s_ztrie_node_destroy (&match);
}
return 0;
}
// If there is no match or the match is not endpoint to a route, fail
else
return -1;
}
void
zlistx_purge (zlistx_t *self)
{
assert (self);
while (zlistx_size (self) > 0)
zlistx_delete (self, NULL);
}
static ztrie_node_t *
s_ztrie_node_new (ztrie_node_t *parent, char *token, int token_len, zlistx_t *param_keys, int token_type)
{
ztrie_node_t *self = (ztrie_node_t *) zmalloc (sizeof (ztrie_node_t));
assert (self);
// Initialize properties
self->token = s_strndup (token, token_len);
self->token_type = token_type;
self->token_len = token_len;
self->endpoint = false;
self->parameter_count = 0;
self->parameter_names = NULL;
self->parameter_values = NULL;
if (param_keys && zlistx_size (param_keys) > 0) {
self->parameter_count = zlistx_size (param_keys);
self->parameter_names = (char **) malloc (sizeof (char *) * self->parameter_count);
self->parameter_values = (char **) malloc (sizeof (char *) * self->parameter_count);
char *key = (char *) zlistx_first (param_keys);
int index;
for (index = 0; index < zlistx_size (param_keys); index++) {
self->parameter_names [index] = key;
self->parameter_values [index] = NULL;
key = (char *) zlistx_next (param_keys);
}
}
if (self->token_type == NODE_TYPE_REGEX || self->token_type == NODE_TYPE_PARAM)
self->regex = zrex_new (self->token);
self->data = NULL;
// Initialize relationships
self->parent = parent;
if (self->parent) {
zlistx_add_end (self->parent->children, self);
// Sort regexes to the end to avoid conlficts
zlistx_sort (self->parent->children);
}
size_t parent_path_len = self->parent? self->parent->path_len: 0;
self->path_len = parent_path_len + strlen (self->token) + 1; // +1 path delimiter
self->children = zlistx_new ();
zlistx_set_comparator (self->children, s_ztrie_node_compare);
return self;
}
static int
s_rebuild_pollset (zloop_t *self)
{
free (self->pollset);
free (self->readact);
free (self->pollact);
self->pollset = NULL;
self->readact = NULL;
self->pollact = NULL;
self->poll_size = zlistx_size (self->readers) + zlistx_size (self->pollers);
self->pollset = (zmq_pollitem_t *) zmalloc (self->poll_size * sizeof (zmq_pollitem_t));
if (!self->pollset)
return -1;
self->readact = (s_reader_t *) zmalloc (self->poll_size * sizeof (s_reader_t));
if (!self->readact)
return -1;
self->pollact = (s_poller_t *) zmalloc (self->poll_size * sizeof (s_poller_t));
if (!self->pollact)
return -1;
s_reader_t *reader = (s_reader_t *) zlistx_first (self->readers);
uint item_nbr = 0;
while (reader) {
zmq_pollitem_t poll_item = { zsock_resolve (reader->sock), 0, ZMQ_POLLIN };
self->pollset [item_nbr] = poll_item;
self->readact [item_nbr] = *reader;
item_nbr++;
reader = (s_reader_t *) zlistx_next (self->readers);
}
s_poller_t *poller = (s_poller_t *) zlistx_first (self->pollers);
while (poller) {
self->pollset [item_nbr] = poller->item;
self->pollact [item_nbr] = *poller;
item_nbr++;
poller = (s_poller_t *) zlistx_next (self->pollers);
}
self->need_rebuild = false;
return 0;
}
static void
s_service_dispatch (service_t *self)
{
// for each message, check regexp and dispatch if possible
if (zlistx_size (self->offers)) {
mlm_msg_t *message = mlm_msgq_first (self->queue);
while (message) {
mlm_msg_link(message);
if (s_service_dispatch_message (self, message))
mlm_msgq_dequeue_cursor (self->queue);
mlm_msg_unlink(&message);
message = mlm_msgq_next (self->queue);
}
}
}
void
mlm_server_test (bool verbose)
{
printf (" * mlm_server: ");
if (verbose)
printf ("\n");
// @selftest
zactor_t *server = zactor_new (mlm_server, "mlm_server_test");
if (verbose)
zstr_send (server, "VERBOSE");
zstr_sendx (server, "BIND", "tcp://127.0.0.1:*", NULL);
zstr_sendx (server, "PORT", NULL);
char *command, *port;
int rc = zstr_recvx (server, &command, &port, NULL);
assert (rc == 2);
assert (streq (command, "PORT"));
assert (strlen (port) > 0 && strlen (port) < 6);
assert (!streq (port, "-1"));
zsock_t *reader = zsock_new (ZMQ_DEALER);
assert (reader);
zsock_connect (reader, "tcp://127.0.0.1:%s", port);
zsock_set_rcvtimeo (reader, 500);
mlm_proto_t *proto = mlm_proto_new ();
// Server insists that connection starts properly
mlm_proto_set_id (proto, MLM_PROTO_STREAM_WRITE);
mlm_proto_send (proto, reader);
zclock_sleep (500); // to calm things down && make memcheck pass. Thanks @malanka
mlm_proto_recv (proto, reader);
zclock_sleep (500); // detto as above
assert (mlm_proto_id (proto) == MLM_PROTO_ERROR);
assert (mlm_proto_status_code (proto) == MLM_PROTO_COMMAND_INVALID);
// Now do a stream publish-subscribe test
zsock_t *writer = zsock_new (ZMQ_DEALER);
assert (writer);
zsock_connect (writer, "tcp://127.0.0.1:%s", port);
zsock_set_rcvtimeo (reader, 500);
// Open connections from both reader and writer
mlm_proto_set_id (proto, MLM_PROTO_CONNECTION_OPEN);
mlm_proto_send (proto, reader);
mlm_proto_recv (proto, reader);
assert (mlm_proto_id (proto) == MLM_PROTO_OK);
mlm_proto_set_id (proto, MLM_PROTO_CONNECTION_OPEN);
mlm_proto_send (proto, writer);
mlm_proto_recv (proto, writer);
assert (mlm_proto_id (proto) == MLM_PROTO_OK);
// Prepare to write and read a "weather" stream
mlm_proto_set_id (proto, MLM_PROTO_STREAM_WRITE);
mlm_proto_set_stream (proto, "weather");
mlm_proto_send (proto, writer);
mlm_proto_recv (proto, writer);
assert (mlm_proto_id (proto) == MLM_PROTO_OK);
mlm_proto_set_id (proto, MLM_PROTO_STREAM_READ);
mlm_proto_set_pattern (proto, "temp.*");
mlm_proto_send (proto, reader);
mlm_proto_recv (proto, reader);
assert (mlm_proto_id (proto) == MLM_PROTO_OK);
// Now send some weather data, with null contents
mlm_proto_set_id (proto, MLM_PROTO_STREAM_SEND);
mlm_proto_set_subject (proto, "temp.moscow");
mlm_proto_send (proto, writer);
mlm_proto_set_subject (proto, "rain.moscow");
mlm_proto_send (proto, writer);
mlm_proto_set_subject (proto, "temp.chicago");
mlm_proto_send (proto, writer);
mlm_proto_set_subject (proto, "rain.chicago");
mlm_proto_send (proto, writer);
mlm_proto_set_subject (proto, "temp.london");
mlm_proto_send (proto, writer);
mlm_proto_set_subject (proto, "rain.london");
mlm_proto_send (proto, writer);
// We should receive exactly three deliveries, in order
mlm_proto_recv (proto, reader);
assert (mlm_proto_id (proto) == MLM_PROTO_STREAM_DELIVER);
assert (streq (mlm_proto_subject (proto), "temp.moscow"));
mlm_proto_recv (proto, reader);
assert (mlm_proto_id (proto) == MLM_PROTO_STREAM_DELIVER);
assert (streq (mlm_proto_subject (proto), "temp.chicago"));
mlm_proto_recv (proto, reader);
assert (mlm_proto_id (proto) == MLM_PROTO_STREAM_DELIVER);
assert (streq (mlm_proto_subject (proto), "temp.london"));
mlm_proto_destroy (&proto);
// Finished, we can clean up
zsock_destroy (&writer);
zsock_destroy (&reader);
zactor_destroy (&server);
zstr_free (&port);
zstr_free (&command);
// Test Case:
// CLIENTLIST command
{
const char *endpoint = "inproc://mlm_server_clientlist_test";
zactor_t *server = zactor_new (mlm_server, "mlm_server_clientlist_test");
if (verbose)
zstr_send (server, "VERBOSE");
zstr_sendx (server, "BIND", endpoint, NULL);
mlm_client_t *client_1 = mlm_client_new ();
int rv = mlm_client_connect (client_1, endpoint, 1000, "Karol");
assert (rv >= 0);
mlm_client_t *client_2 = mlm_client_new ();
rv = mlm_client_connect (client_2, endpoint, 1000, "Tomas");
assert (rv >= 0);
mlm_client_t *client_3 = mlm_client_new ();
rv = mlm_client_connect (client_3, endpoint, 1000, "Alenka");
assert (rv >= 0);
zclock_sleep (500);
zstr_sendx (server, "CLIENTLIST", NULL);
zmsg_t *message = zmsg_recv (server);
assert (message);
assert (zmsg_size (message) == 4);
char *pop = zmsg_popstr (message);
assert (streq (pop, "CLIENTLIST"));
zstr_free (&pop);
zlistx_t *expected_names = zlistx_new ();
assert (expected_names);
zlistx_set_destructor (expected_names, (czmq_destructor *) zstr_free);
zlistx_set_duplicator (expected_names, (czmq_duplicator *) strdup);
zlistx_set_comparator (expected_names, (czmq_comparator *) strcmp);
zlistx_add_end (expected_names, (void *) "Karol");
zlistx_add_end (expected_names, (void *) "Tomas");
zlistx_add_end (expected_names, (void *) "Alenka");
pop = zmsg_popstr (message);
assert (pop);
void *handle = zlistx_find (expected_names, pop);
assert (handle);
rv = zlistx_delete (expected_names, handle);
assert (rv == 0);
zstr_free (&pop);
pop = zmsg_popstr (message);
assert (pop);
handle = zlistx_find (expected_names, pop);
assert (handle);
rv = zlistx_delete (expected_names, handle);
assert (rv == 0);
zstr_free (&pop);
pop = zmsg_popstr (message);
assert (pop);
handle = zlistx_find (expected_names, pop);
assert (handle);
rv = zlistx_delete (expected_names, handle);
assert (rv == 0);
zstr_free (&pop);
pop = zmsg_popstr (message);
assert (pop == NULL);
assert (zlistx_size (expected_names) == 0);
zmsg_destroy (&message);
// remove a client Karol
mlm_client_destroy (&client_1);
zlistx_add_end (expected_names, (void *) "Tomas");
zlistx_add_end (expected_names, (void *) "Alenka");
zstr_sendx (server, "CLIENTLIST", NULL);
zclock_sleep (100);
message = zmsg_recv (server);
assert (message);
assert (zmsg_size (message) == 3);
pop = zmsg_popstr (message);
assert (streq (pop, "CLIENTLIST"));
zstr_free (&pop);
pop = zmsg_popstr (message);
assert (pop);
handle = zlistx_find (expected_names, pop);
assert (handle);
rv = zlistx_delete (expected_names, handle);
assert (rv == 0);
zstr_free (&pop);
pop = zmsg_popstr (message);
assert (pop);
handle = zlistx_find (expected_names, pop);
assert (handle);
rv = zlistx_delete (expected_names, handle);
assert (rv == 0);
zstr_free (&pop);
pop = zmsg_popstr (message);
assert (pop == NULL);
assert (zlistx_size (expected_names) == 0);
zlistx_destroy (&expected_names);
zmsg_destroy (&message);
mlm_client_destroy (&client_2);
mlm_client_destroy (&client_3);
zactor_destroy (&server);
}
// Test Case:
// STREAMLIST command
{
const char *endpoint = "inproc://mlm_server_streamlist_test";
zactor_t *server = zactor_new (mlm_server, "mlm_server_streamlist_test");
if (verbose)
zstr_send (server, "VERBOSE");
zstr_sendx (server, "BIND", endpoint, NULL);
mlm_client_t *client_1 = mlm_client_new ();
int rv = mlm_client_connect (client_1, endpoint, 1000, "Karol");
assert (rv != -1);
rv = mlm_client_set_producer (client_1, "STREAM_1");
assert (rv != -1);
mlm_client_t *client_2 = mlm_client_new ();
rv = mlm_client_connect (client_2, endpoint, 1000, "Tomas");
assert (rv != -1);
rv = mlm_client_set_producer (client_2, "STREAM_2");
assert (rv != -1);
mlm_client_t *client_3 = mlm_client_new ();
rv = mlm_client_connect (client_3, endpoint, 1000, "Alenka");
assert (rv != -1);
rv = mlm_client_set_consumer (client_3, "STREAM_2", ".*");
assert (rv != -1);
zclock_sleep (100);
zlistx_t *expected_streams = zlistx_new ();
assert (expected_streams);
zlistx_set_destructor (expected_streams, (czmq_destructor *) zstr_free);
zlistx_set_duplicator (expected_streams, (czmq_duplicator *) strdup);
zlistx_set_comparator (expected_streams, (czmq_comparator *) strcmp);
zlistx_add_end (expected_streams, (void *) "STREAM_1");
zlistx_add_end (expected_streams, (void *) "STREAM_2");
zstr_sendx (server, "STREAMLIST", NULL);
zmsg_t *message = zmsg_recv (server);
assert (message);
assert (zmsg_size (message) == 3);
char *pop = zmsg_popstr (message);
assert (streq (pop, "STREAMLIST"));
zstr_free (&pop);
pop = zmsg_popstr (message);
assert (pop);
void *handle = zlistx_find (expected_streams, pop);
assert (handle);
rv = zlistx_delete (expected_streams, handle);
assert (rv == 0);
zstr_free (&pop);
pop = zmsg_popstr (message);
assert (pop);
handle = zlistx_find (expected_streams, pop);
assert (handle);
rv = zlistx_delete (expected_streams, handle);
assert (rv == 0);
zstr_free (&pop);
pop = zmsg_popstr (message);
assert (pop == NULL);
assert (zlistx_size (expected_streams) == 0);
zmsg_destroy (&message);
// NOTE: Currently when producer disconnects, malamute does not destroy the stream
// Therefore it doesn't make sense to test removal of streams, but addition
mlm_client_t *client_4 = mlm_client_new ();
rv = mlm_client_connect (client_4, endpoint, 1000, "Michal");
assert (rv >= 0);
rv = mlm_client_set_producer (client_4, "New stream");
assert (rv >= 0);
zlistx_add_end (expected_streams, (void *) "STREAM_1");
zlistx_add_end (expected_streams, (void *) "STREAM_2");
zlistx_add_end (expected_streams, (void *) "New stream");
zclock_sleep (100);
zstr_sendx (server, "STREAMLIST", NULL);
zclock_sleep (100);
message = zmsg_recv (server);
assert (message);
assert (zmsg_size (message) == 4);
pop = zmsg_popstr (message);
assert (streq (pop, "STREAMLIST"));
zstr_free (&pop);
pop = zmsg_popstr (message);
assert (pop);
handle = zlistx_find (expected_streams, pop);
assert (handle);
rv = zlistx_delete (expected_streams, handle);
assert (rv == 0);
zstr_free (&pop);
pop = zmsg_popstr (message);
assert (pop);
handle = zlistx_find (expected_streams, pop);
assert (handle);
rv = zlistx_delete (expected_streams, handle);
assert (rv == 0);
zstr_free (&pop);
pop = zmsg_popstr (message);
assert (pop);
handle = zlistx_find (expected_streams, pop);
assert (handle);
rv = zlistx_delete (expected_streams, handle);
assert (rv == 0);
zstr_free (&pop);
pop = zmsg_popstr (message);
assert (pop == NULL);
assert (zlistx_size (expected_streams) == 0);
zlistx_destroy (&expected_streams);
zmsg_destroy (&message);
mlm_client_destroy (&client_1);
mlm_client_destroy (&client_2);
mlm_client_destroy (&client_3);
mlm_client_destroy (&client_4);
zactor_destroy (&server);
}
// Regression Test Case:
// Segfault from deregistering zombie connection
{
const char *endpoint = "inproc://mlm_server_deregister_zombie_connection_test";
zactor_t *server = zactor_new (mlm_server, "mlm_server_deregister_zombie_connection_test");
if (verbose)
zstr_send (server, "VERBOSE");
zstr_sendx (server, "BIND", endpoint, NULL);
zstr_sendx (server, "SET", "server/timeout", "3000", NULL); // 3 second client timeout
zsock_t *reader = zsock_new (ZMQ_DEALER);
assert (reader);
zsock_connect (reader, "inproc://mlm_server_deregister_zombie_connection_test");
zsock_set_rcvtimeo (reader, 500);
mlm_proto_t *proto = mlm_proto_new ();
// If the malamute server is restarted and clients have queued
// up ping messages, the'll be sent before any
// CONNECTION_OPEN. The server eventually tries to deregister
// this and (previously) would derefence a null pointer for
// the client address.
mlm_proto_set_id (proto, MLM_PROTO_CONNECTION_PING);
mlm_proto_send (proto, reader);
printf("Regression test for segfault due to leftover client messages after restart...\n");
// Give the server more than 3 seconds to time out the client...
zclock_sleep (3100);
printf("passed\n");
mlm_proto_destroy (&proto);
zsock_destroy (&reader);
zactor_destroy (&server);
}
{
const char *endpoint = "inproc://mlm_server_disconnect_pending_stream_traffic";
zactor_t *server = zactor_new (mlm_server, "mlm_server_disconnect_pending_stream_traffic");
if (verbose) {
zstr_send (server, "VERBOSE");
printf("Regression test for use-after-free with pending stream traffic after disconnect\n");
}
zstr_sendx (server, "BIND", endpoint, NULL);
mlm_client_t *producer = mlm_client_new ();
assert (mlm_client_connect (producer, endpoint, 1000, "producer") >= 0);
assert (mlm_client_set_producer (producer, "STREAM_TEST") >= 0);
zstr_sendx (server, "SLOW_TEST_MODE", NULL);
mlm_client_t *consumer = mlm_client_new ();
assert (mlm_client_connect (consumer, endpoint, 1000, "consumer") >= 0);
assert (mlm_client_set_consumer (consumer, "STREAM_TEST", ".*") >= 0);
zmsg_t *msg = zmsg_new ();
zmsg_addstr (msg, "world");
assert (mlm_client_send (producer, "hello", &msg) >= 0);
mlm_client_destroy (&consumer);
zclock_sleep (2000);
mlm_client_destroy (&producer);
zactor_destroy (&server);
}
// @end
printf ("OK\n");
}
void
zlistx_test (bool verbose)
{
printf (" * zlistx: ");
// @selftest
zlistx_t *list = zlistx_new ();
assert (list);
assert (zlistx_size (list) == 0);
// Test operations on an empty list
assert (zlistx_first (list) == NULL);
assert (zlistx_last (list) == NULL);
assert (zlistx_next (list) == NULL);
assert (zlistx_prev (list) == NULL);
assert (zlistx_find (list, "hello") == NULL);
assert (zlistx_delete (list, NULL) == -1);
assert (zlistx_detach (list, NULL) == NULL);
assert (zlistx_delete (list, NULL) == -1);
assert (zlistx_detach (list, NULL) == NULL);
zlistx_purge (list);
zlistx_sort (list);
// Use item handlers
zlistx_set_destructor (list, (zlistx_destructor_fn *) zstr_free);
zlistx_set_duplicator (list, (zlistx_duplicator_fn *) strdup);
zlistx_set_comparator (list, (zlistx_comparator_fn *) strcmp);
// Try simple insert/sort/delete/next
assert (zlistx_next (list) == NULL);
zlistx_add_end (list, "world");
assert (streq ((char *) zlistx_next (list), "world"));
zlistx_add_end (list, "hello");
assert (streq ((char *) zlistx_prev (list), "hello"));
zlistx_sort (list);
assert (zlistx_size (list) == 2);
void *handle = zlistx_find (list, "hello");
char *item1 = (char *) zlistx_item (list);
char *item2 = (char *) zlistx_handle_item (handle);
assert (item1 == item2);
assert (streq (item1, "hello"));
zlistx_delete (list, handle);
assert (zlistx_size (list) == 1);
char *string = (char *) zlistx_detach (list, NULL);
assert (streq (string, "world"));
free (string);
assert (zlistx_size (list) == 0);
// Check next/back work
// Now populate the list with items
zlistx_add_start (list, "five");
zlistx_add_end (list, "six");
zlistx_add_start (list, "four");
zlistx_add_end (list, "seven");
zlistx_add_start (list, "three");
zlistx_add_end (list, "eight");
zlistx_add_start (list, "two");
zlistx_add_end (list, "nine");
zlistx_add_start (list, "one");
zlistx_add_end (list, "ten");
// Test our navigation skills
assert (zlistx_size (list) == 10);
assert (streq ((char *) zlistx_last (list), "ten"));
assert (streq ((char *) zlistx_prev (list), "nine"));
assert (streq ((char *) zlistx_prev (list), "eight"));
assert (streq ((char *) zlistx_prev (list), "seven"));
assert (streq ((char *) zlistx_prev (list), "six"));
assert (streq ((char *) zlistx_prev (list), "five"));
assert (streq ((char *) zlistx_first (list), "one"));
assert (streq ((char *) zlistx_next (list), "two"));
assert (streq ((char *) zlistx_next (list), "three"));
assert (streq ((char *) zlistx_next (list), "four"));
// Sort by alphabetical order
zlistx_sort (list);
assert (streq ((char *) zlistx_first (list), "eight"));
assert (streq ((char *) zlistx_last (list), "two"));
// Moving items around
handle = zlistx_find (list, "six");
zlistx_move_start (list, handle);
assert (streq ((char *) zlistx_first (list), "six"));
zlistx_move_end (list, handle);
assert (streq ((char *) zlistx_last (list), "six"));
zlistx_sort (list);
assert (streq ((char *) zlistx_last (list), "two"));
// Copying a list
zlistx_t *copy = zlistx_dup (list);
assert (copy);
assert (zlistx_size (copy) == 10);
assert (streq ((char *) zlistx_first (copy), "eight"));
assert (streq ((char *) zlistx_last (copy), "two"));
zlistx_destroy (©);
// Delete items while iterating
string = (char *) zlistx_first (list);
assert (streq (string, "eight"));
string = (char *) zlistx_next (list);
assert (streq (string, "five"));
zlistx_delete (list, zlistx_cursor (list));
string = (char *) zlistx_next (list);
assert (streq (string, "four"));
zlistx_purge (list);
zlistx_destroy (&list);
// @end
printf ("OK\n");
}
///
// Return the number of items in the list
size_t QZlistx::size ()
{
size_t rv = zlistx_size (self);
return rv;
}
void
zhashx_test (int verbose)
{
printf (" * zhashx: ");
// @selftest
zhashx_t *hash = zhashx_new ();
assert (hash);
assert (zhashx_size (hash) == 0);
assert (zhashx_first (hash) == NULL);
assert (zhashx_cursor (hash) == NULL);
// Insert some items
int rc;
rc = zhashx_insert (hash, "DEADBEEF", "dead beef");
char *item = (char *) zhashx_first (hash);
assert (streq ((char *) zhashx_cursor (hash), "DEADBEEF"));
assert (streq (item, "dead beef"));
assert (rc == 0);
rc = zhashx_insert (hash, "ABADCAFE", "a bad cafe");
assert (rc == 0);
rc = zhashx_insert (hash, "C0DEDBAD", "coded bad");
assert (rc == 0);
rc = zhashx_insert (hash, "DEADF00D", "dead food");
assert (rc == 0);
assert (zhashx_size (hash) == 4);
// Look for existing items
item = (char *) zhashx_lookup (hash, "DEADBEEF");
assert (streq (item, "dead beef"));
item = (char *) zhashx_lookup (hash, "ABADCAFE");
assert (streq (item, "a bad cafe"));
item = (char *) zhashx_lookup (hash, "C0DEDBAD");
assert (streq (item, "coded bad"));
item = (char *) zhashx_lookup (hash, "DEADF00D");
assert (streq (item, "dead food"));
// Look for non-existent items
item = (char *) zhashx_lookup (hash, "foo");
assert (item == NULL);
// Try to insert duplicate items
rc = zhashx_insert (hash, "DEADBEEF", "foo");
assert (rc == -1);
item = (char *) zhashx_lookup (hash, "DEADBEEF");
assert (streq (item, "dead beef"));
// Some rename tests
// Valid rename, key is now LIVEBEEF
rc = zhashx_rename (hash, "DEADBEEF", "LIVEBEEF");
assert (rc == 0);
item = (char *) zhashx_lookup (hash, "LIVEBEEF");
assert (streq (item, "dead beef"));
// Trying to rename an unknown item to a non-existent key
rc = zhashx_rename (hash, "WHATBEEF", "NONESUCH");
assert (rc == -1);
// Trying to rename an unknown item to an existing key
rc = zhashx_rename (hash, "WHATBEEF", "LIVEBEEF");
assert (rc == -1);
item = (char *) zhashx_lookup (hash, "LIVEBEEF");
assert (streq (item, "dead beef"));
// Trying to rename an existing item to another existing item
rc = zhashx_rename (hash, "LIVEBEEF", "ABADCAFE");
assert (rc == -1);
item = (char *) zhashx_lookup (hash, "LIVEBEEF");
assert (streq (item, "dead beef"));
item = (char *) zhashx_lookup (hash, "ABADCAFE");
assert (streq (item, "a bad cafe"));
// Test keys method
zlistx_t *keys = zhashx_keys (hash);
assert (zlistx_size (keys) == 4);
zlistx_destroy (&keys);
zlistx_t *values = zhashx_values(hash);
assert (zlistx_size (values) == 4);
zlistx_destroy (&values);
// Test dup method
zhashx_t *copy = zhashx_dup (hash);
assert (zhashx_size (copy) == 4);
item = (char *) zhashx_lookup (copy, "LIVEBEEF");
assert (item);
assert (streq (item, "dead beef"));
zhashx_destroy (©);
// Test pack/unpack methods
zframe_t *frame = zhashx_pack (hash);
copy = zhashx_unpack (frame);
zframe_destroy (&frame);
assert (zhashx_size (copy) == 4);
item = (char *) zhashx_lookup (copy, "LIVEBEEF");
assert (item);
assert (streq (item, "dead beef"));
zhashx_destroy (©);
// Test save and load
zhashx_comment (hash, "This is a test file");
zhashx_comment (hash, "Created by %s", "czmq_selftest");
zhashx_save (hash, ".cache");
copy = zhashx_new ();
assert (copy);
zhashx_load (copy, ".cache");
item = (char *) zhashx_lookup (copy, "LIVEBEEF");
assert (item);
assert (streq (item, "dead beef"));
zhashx_destroy (©);
zsys_file_delete (".cache");
// Delete a item
zhashx_delete (hash, "LIVEBEEF");
item = (char *) zhashx_lookup (hash, "LIVEBEEF");
assert (item == NULL);
assert (zhashx_size (hash) == 3);
// Check that the queue is robust against random usage
struct {
char name [100];
bool exists;
} testset [200];
memset (testset, 0, sizeof (testset));
int testmax = 200, testnbr, iteration;
srandom ((unsigned) time (NULL));
for (iteration = 0; iteration < 25000; iteration++) {
testnbr = randof (testmax);
if (testset [testnbr].exists) {
item = (char *) zhashx_lookup (hash, testset [testnbr].name);
assert (item);
zhashx_delete (hash, testset [testnbr].name);
testset [testnbr].exists = false;
}
else {
sprintf (testset [testnbr].name, "%x-%x", rand (), rand ());
if (zhashx_insert (hash, testset [testnbr].name, "") == 0)
testset [testnbr].exists = true;
}
}
// Test 10K lookups
for (iteration = 0; iteration < 10000; iteration++)
item = (char *) zhashx_lookup (hash, "DEADBEEFABADCAFE");
// Destructor should be safe to call twice
zhashx_destroy (&hash);
zhashx_destroy (&hash);
assert (hash == NULL);
// Test autofree; automatically copies and frees string values
hash = zhashx_new ();
assert (hash);
zhashx_autofree (hash);
char value [255];
strcpy (value, "This is a string");
rc = zhashx_insert (hash, "key1", value);
assert (rc == 0);
strcpy (value, "Ring a ding ding");
rc = zhashx_insert (hash, "key2", value);
assert (rc == 0);
assert (streq ((char *) zhashx_lookup (hash, "key1"), "This is a string"));
assert (streq ((char *) zhashx_lookup (hash, "key2"), "Ring a ding ding"));
zhashx_destroy (&hash);
// @end
printf ("OK\n");
}
size_t
ziflist_size (ziflist_t *self)
{
assert (self);
return zlistx_size ((zlistx_t *) self);
}
static ztrie_node_t *
s_ztrie_parse_path (ztrie_t *self, const char *path, int mode)
{
int state = 0;
char *needle, *beginToken = NULL, *beginRegex = NULL;
ztrie_node_t *parent = self->root;
if (zlistx_size (self->params) > 0)
zlistx_purge (self->params);
int len = strlen (path);
needle = (char *) path;
char *needle_stop = needle + len;
// Ignore trailing delimiter
if (needle[len-1] == self->delimiter)
needle_stop -= 1;
while (needle < needle_stop + 1) {
// It is valid not to have an delimiter at the end of the path
if (*needle == self->delimiter || needle == needle_stop) {
// Token starts with delimiter ignore everything that comes before
if (state == 0) {
beginToken = needle + 1;
state++;
if (mode == MODE_INSERT || mode == MODE_LOOKUP)
// Increment so regexes are parsed which is only relevant
// during INSERT or LOOKUP. Using different states gives a small
// performance boost for matching.
state++;
}
// Token ends with delimiter.
else
if (state < 3) {
int matchType = zlistx_size (self->params) > 0? NODE_TYPE_PARAM:
beginRegex? NODE_TYPE_REGEX: NODE_TYPE_STRING;
char *matchToken = beginRegex? beginRegex: beginToken;
int matchTokenLen = needle - matchToken - (beginRegex? 1: 0);
// Illegal token
if (matchTokenLen == 0)
return NULL;
ztrie_node_t *match = NULL;
// Asterisk nodes are only allowed at the end of a route
if (needle == needle_stop && *matchToken == '*') {
if (zlistx_size (parent->children) == 0) {
matchType = NODE_TYPE_ASTERISK;
matchToken = needle - 1;
matchTokenLen = 1;
}
// Asterisk must be a leaf in the tree
else
return NULL;
}
else {
matchType = zlistx_size (self->params) > 0? NODE_TYPE_PARAM:
beginRegex? NODE_TYPE_REGEX: NODE_TYPE_STRING;
matchToken = beginRegex? beginRegex: beginToken;
matchTokenLen = needle - matchToken - (beginRegex? 1: 0);
}
// In insert and lookup mode only do a string comparison
if (mode == MODE_INSERT || mode == MODE_LOOKUP)
match = s_ztrie_compare_token (parent, matchToken, matchTokenLen);
else
// Otherwise evaluate regexes
if (mode == MODE_MATCH)
match = s_ztrie_matches_token (parent, matchToken, matchTokenLen);
// Mismatch behavior depends on mode
if (!match) {
// Append to common prefix
if (mode == MODE_INSERT) {
// It's not allowed to append on asterisk
if (parent->token_type == NODE_TYPE_ASTERISK ||
(zlistx_size (parent->children) == 1 &&
((ztrie_node_t *) (zlistx_first (parent->children)))->token_type == NODE_TYPE_ASTERISK))
return NULL;
parent = s_ztrie_node_new (parent, matchToken, matchTokenLen, self->params, matchType);
}
else
// No match for path found
if (mode == MODE_MATCH || mode == MODE_LOOKUP)
return NULL;
}
// If a match has been found it becomes the parent for next path token
else {
parent = match;
// In case a asterisk match has been made skip the rest of the route
if (parent->token_type == NODE_TYPE_ASTERISK)
break;
}
// Cleanup for next token
beginRegex = NULL;
if (zlistx_size (self->params) > 0)
zlistx_purge (self->params);
// Token end equals token begin
beginToken = needle + 1;
}
}
else
// regex starts with '{'
if (state == 2 && *needle == '{') {
beginRegex = needle + 1;
state++;
}
else
// in the middle of the regex. Found a named regex.
if (state == 3 && (*needle == ':')) {
zlistx_add_end (self->params, s_strndup (beginRegex, needle - beginRegex));
beginRegex = needle + 1;
}
else
// regex ends with {
if (state == 3 && *needle == '}') {
state--;
}
needle++;
}
// In matching mode the discovered node must be an endpoint
if (parent && mode == MODE_MATCH && !parent->endpoint)
return NULL;
return parent;
}
