2018-02-15 13:09:04 +01:00
|
|
|
/*
|
|
|
|
Copyright (c) 2018 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 "../tests/testutil.hpp"
|
|
|
|
|
|
|
|
#if defined(min)
|
|
|
|
#undef min
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include <generic_mtrie_impl.hpp>
|
|
|
|
|
|
|
|
#include <unity.h>
|
|
|
|
|
|
|
|
void setUp ()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
void tearDown ()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2018-02-16 11:30:04 +01:00
|
|
|
int getlen (const zmq::generic_mtrie_t<int>::prefix_t &data)
|
|
|
|
{
|
|
|
|
return strlen (reinterpret_cast<const char *> (data));
|
|
|
|
}
|
|
|
|
|
2018-02-15 13:09:04 +01:00
|
|
|
void test_create ()
|
|
|
|
{
|
|
|
|
zmq::generic_mtrie_t<int> mtrie;
|
|
|
|
}
|
|
|
|
|
|
|
|
void mtrie_count (int *pipe, void *arg)
|
|
|
|
{
|
|
|
|
LIBZMQ_UNUSED (pipe);
|
|
|
|
int *count = static_cast<int *> (arg);
|
|
|
|
++*count;
|
|
|
|
}
|
|
|
|
|
|
|
|
void test_check_empty_match_nonempty_data ()
|
|
|
|
{
|
|
|
|
zmq::generic_mtrie_t<int> mtrie;
|
|
|
|
const zmq::generic_mtrie_t<int>::prefix_t test_name =
|
|
|
|
reinterpret_cast<zmq::generic_mtrie_t<int>::prefix_t> ("foo");
|
|
|
|
|
|
|
|
int count = 0;
|
2018-02-16 11:30:04 +01:00
|
|
|
mtrie.match (test_name, getlen (test_name), mtrie_count, &count);
|
2018-02-15 13:09:04 +01:00
|
|
|
TEST_ASSERT_EQUAL_INT (0, count);
|
|
|
|
}
|
|
|
|
|
|
|
|
void test_check_empty_match_empty_data ()
|
|
|
|
{
|
|
|
|
zmq::generic_mtrie_t<int> mtrie;
|
|
|
|
|
|
|
|
int count = 0;
|
|
|
|
mtrie.match (NULL, 0, mtrie_count, &count);
|
|
|
|
TEST_ASSERT_EQUAL_INT (0, count);
|
|
|
|
}
|
|
|
|
|
|
|
|
void test_add_single_entry_match_exact ()
|
|
|
|
{
|
|
|
|
int pipe;
|
|
|
|
|
|
|
|
zmq::generic_mtrie_t<int> mtrie;
|
|
|
|
const zmq::generic_mtrie_t<int>::prefix_t test_name =
|
|
|
|
reinterpret_cast<zmq::generic_mtrie_t<int>::prefix_t> ("foo");
|
|
|
|
|
2018-02-16 11:30:04 +01:00
|
|
|
bool res = mtrie.add (test_name, getlen (test_name), &pipe);
|
2018-02-15 13:09:04 +01:00
|
|
|
TEST_ASSERT_TRUE (res);
|
|
|
|
|
|
|
|
int count = 0;
|
2018-02-16 11:30:04 +01:00
|
|
|
mtrie.match (test_name, getlen (test_name), mtrie_count, &count);
|
2018-02-15 13:09:04 +01:00
|
|
|
TEST_ASSERT_EQUAL_INT (1, count);
|
|
|
|
}
|
|
|
|
|
2018-02-16 11:30:04 +01:00
|
|
|
void test_add_two_entries_with_same_name_match_exact ()
|
|
|
|
{
|
|
|
|
int pipe_1, pipe_2;
|
|
|
|
|
|
|
|
zmq::generic_mtrie_t<int> mtrie;
|
|
|
|
const zmq::generic_mtrie_t<int>::prefix_t test_name =
|
|
|
|
reinterpret_cast<zmq::generic_mtrie_t<int>::prefix_t> ("foo");
|
|
|
|
|
|
|
|
bool res = mtrie.add (test_name, getlen (test_name), &pipe_1);
|
|
|
|
TEST_ASSERT_TRUE (res);
|
|
|
|
|
|
|
|
res = mtrie.add (test_name, getlen (test_name), &pipe_2);
|
|
|
|
TEST_ASSERT_FALSE (res);
|
|
|
|
|
|
|
|
int count = 0;
|
|
|
|
mtrie.match (test_name, getlen (test_name), mtrie_count, &count);
|
|
|
|
TEST_ASSERT_EQUAL_INT (2, count);
|
|
|
|
}
|
|
|
|
|
|
|
|
void test_add_two_entries_match_prefix_and_exact ()
|
|
|
|
{
|
|
|
|
int pipe_1, pipe_2;
|
|
|
|
|
|
|
|
zmq::generic_mtrie_t<int> mtrie;
|
|
|
|
const zmq::generic_mtrie_t<int>::prefix_t test_name_prefix =
|
|
|
|
reinterpret_cast<zmq::generic_mtrie_t<int>::prefix_t> ("foo");
|
|
|
|
const zmq::generic_mtrie_t<int>::prefix_t test_name_full =
|
|
|
|
reinterpret_cast<zmq::generic_mtrie_t<int>::prefix_t> ("foobar");
|
|
|
|
|
|
|
|
bool res = mtrie.add (test_name_prefix, getlen (test_name_prefix), &pipe_1);
|
|
|
|
TEST_ASSERT_TRUE (res);
|
|
|
|
|
|
|
|
res = mtrie.add (test_name_full, getlen (test_name_full), &pipe_2);
|
|
|
|
TEST_ASSERT_TRUE (res);
|
|
|
|
|
|
|
|
int count = 0;
|
|
|
|
mtrie.match (test_name_full, getlen (test_name_full), mtrie_count, &count);
|
|
|
|
TEST_ASSERT_EQUAL_INT (2, count);
|
|
|
|
}
|
|
|
|
|
2018-02-15 13:09:04 +01:00
|
|
|
void test_add_rm_single_entry_match_exact ()
|
|
|
|
{
|
|
|
|
int pipe;
|
|
|
|
zmq::generic_mtrie_t<int> mtrie;
|
|
|
|
const zmq::generic_mtrie_t<int>::prefix_t test_name =
|
|
|
|
reinterpret_cast<zmq::generic_mtrie_t<int>::prefix_t> ("foo");
|
|
|
|
|
2018-02-16 11:30:04 +01:00
|
|
|
mtrie.add (test_name, getlen (test_name), &pipe);
|
|
|
|
bool res = mtrie.rm (test_name, getlen (test_name), &pipe);
|
2018-02-15 13:09:04 +01:00
|
|
|
TEST_ASSERT_TRUE (res);
|
|
|
|
|
|
|
|
int count = 0;
|
2018-02-16 11:30:04 +01:00
|
|
|
mtrie.match (test_name, getlen (test_name), mtrie_count, &count);
|
2018-02-15 13:09:04 +01:00
|
|
|
TEST_ASSERT_EQUAL_INT (0, count);
|
|
|
|
}
|
|
|
|
|
2018-02-18 18:59:30 +01:00
|
|
|
void test_rm_nonexistent_empty ()
|
2018-02-16 13:21:50 +01:00
|
|
|
{
|
|
|
|
int pipe;
|
|
|
|
zmq::generic_mtrie_t<int> mtrie;
|
|
|
|
const zmq::generic_mtrie_t<int>::prefix_t test_name =
|
|
|
|
reinterpret_cast<zmq::generic_mtrie_t<int>::prefix_t> ("foo");
|
|
|
|
|
|
|
|
bool res = mtrie.rm (test_name, getlen (test_name), &pipe);
|
|
|
|
TEST_ASSERT_FALSE (res);
|
|
|
|
|
|
|
|
int count = 0;
|
|
|
|
mtrie.match (test_name, getlen (test_name), mtrie_count, &count);
|
|
|
|
TEST_ASSERT_EQUAL_INT (0, count);
|
|
|
|
}
|
|
|
|
|
2018-02-18 18:33:38 +01:00
|
|
|
void test_add_and_rm_other (const char *add_name, const char *rm_name)
|
|
|
|
{
|
|
|
|
int addpipe, rmpipe;
|
|
|
|
zmq::generic_mtrie_t<int> mtrie;
|
|
|
|
const zmq::generic_mtrie_t<int>::prefix_t add_name_data =
|
|
|
|
reinterpret_cast<zmq::generic_mtrie_t<int>::prefix_t> (add_name);
|
|
|
|
const zmq::generic_mtrie_t<int>::prefix_t rm_name_data =
|
|
|
|
reinterpret_cast<zmq::generic_mtrie_t<int>::prefix_t> (rm_name);
|
|
|
|
|
|
|
|
mtrie.add (add_name_data, getlen (add_name_data), &addpipe);
|
|
|
|
|
|
|
|
bool res = mtrie.rm (rm_name_data, getlen (rm_name_data), &rmpipe);
|
|
|
|
TEST_ASSERT_FALSE (res);
|
|
|
|
|
|
|
|
{
|
|
|
|
int count = 0;
|
|
|
|
mtrie.match (add_name_data, getlen (add_name_data), mtrie_count,
|
|
|
|
&count);
|
|
|
|
TEST_ASSERT_EQUAL_INT (1, count);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (strncmp (add_name, rm_name,
|
|
|
|
std::min (strlen (add_name), strlen (rm_name) + 1))
|
|
|
|
!= 0) {
|
|
|
|
int count = 0;
|
|
|
|
mtrie.match (rm_name_data, getlen (rm_name_data), mtrie_count, &count);
|
|
|
|
TEST_ASSERT_EQUAL_INT (0, count);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void test_rm_nonexistent_nonempty_samename ()
|
|
|
|
{
|
|
|
|
// TODO this triggers an assertion
|
|
|
|
test_add_and_rm_other ("foo", "foo");
|
|
|
|
}
|
|
|
|
|
|
|
|
void test_rm_nonexistent_nonempty_differentname ()
|
|
|
|
{
|
|
|
|
test_add_and_rm_other ("foo", "bar");
|
|
|
|
}
|
|
|
|
|
|
|
|
void test_rm_nonexistent_nonempty_prefix ()
|
|
|
|
{
|
|
|
|
// TODO here, a test assertion fails
|
|
|
|
test_add_and_rm_other ("foobar", "foo");
|
|
|
|
}
|
|
|
|
|
|
|
|
void test_rm_nonexistent_nonempty_prefixed ()
|
|
|
|
{
|
|
|
|
test_add_and_rm_other ("foo", "foobar");
|
|
|
|
}
|
|
|
|
|
2018-02-18 18:59:30 +01:00
|
|
|
void add_indexed_expect_unique (zmq::generic_mtrie_t<int> &mtrie,
|
|
|
|
int *pipes,
|
|
|
|
const char **names,
|
|
|
|
int i)
|
|
|
|
{
|
|
|
|
const zmq::generic_mtrie_t<int>::prefix_t name_data =
|
|
|
|
reinterpret_cast<zmq::generic_mtrie_t<int>::prefix_t> (names[i]);
|
|
|
|
|
|
|
|
bool res = mtrie.add (name_data, getlen (name_data), &pipes[i]);
|
|
|
|
TEST_ASSERT_TRUE (res);
|
|
|
|
}
|
|
|
|
|
|
|
|
void test_rm_nonexistent_between ()
|
|
|
|
{
|
|
|
|
int pipes[3];
|
|
|
|
const char *names[3] = {"foo1", "foo2", "foo3"};
|
|
|
|
|
|
|
|
zmq::generic_mtrie_t<int> mtrie;
|
|
|
|
add_indexed_expect_unique (mtrie, pipes, names, 0);
|
|
|
|
add_indexed_expect_unique (mtrie, pipes, names, 2);
|
|
|
|
|
|
|
|
|
|
|
|
const zmq::generic_mtrie_t<int>::prefix_t name_data =
|
|
|
|
reinterpret_cast<zmq::generic_mtrie_t<int>::prefix_t> (names[1]);
|
|
|
|
|
|
|
|
bool res = mtrie.rm (name_data, getlen (name_data), &pipes[1]);
|
|
|
|
TEST_ASSERT_FALSE (res);
|
|
|
|
}
|
|
|
|
|
2018-02-18 18:33:38 +01:00
|
|
|
void test_add_multiple ()
|
|
|
|
{
|
|
|
|
int pipes[3];
|
|
|
|
const char *names[3] = {"foo1", "foo2", "foo3"};
|
|
|
|
|
|
|
|
zmq::generic_mtrie_t<int> mtrie;
|
|
|
|
for (int i = 0; i < 3; ++i) {
|
2018-02-18 18:59:30 +01:00
|
|
|
add_indexed_expect_unique (mtrie, pipes, names, i);
|
2018-02-18 18:33:38 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void test_rm_multiple_in_order ()
|
|
|
|
{
|
|
|
|
int pipes[3];
|
|
|
|
const char *names[3] = {"foo1", "foo2", "foo3"};
|
|
|
|
|
|
|
|
zmq::generic_mtrie_t<int> mtrie;
|
|
|
|
for (int i = 0; i < 3; ++i) {
|
2018-02-18 18:59:30 +01:00
|
|
|
add_indexed_expect_unique (mtrie, pipes, names, i);
|
2018-02-18 18:33:38 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
for (int i = 0; i < 3; ++i) {
|
|
|
|
const zmq::generic_mtrie_t<int>::prefix_t name_data =
|
|
|
|
reinterpret_cast<zmq::generic_mtrie_t<int>::prefix_t> (names[i]);
|
|
|
|
|
|
|
|
bool res = mtrie.rm (name_data, getlen (name_data), &pipes[i]);
|
|
|
|
TEST_ASSERT_TRUE (res);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void test_rm_multiple_reverse_order ()
|
|
|
|
{
|
|
|
|
int pipes[3];
|
|
|
|
const char *names[3] = {"foo1", "foo2", "foo3"};
|
|
|
|
|
|
|
|
zmq::generic_mtrie_t<int> mtrie;
|
|
|
|
for (int i = 0; i < 3; ++i) {
|
2018-02-18 18:59:30 +01:00
|
|
|
add_indexed_expect_unique (mtrie, pipes, names, i);
|
2018-02-18 18:33:38 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
for (int i = 2; i >= 0; --i) {
|
|
|
|
const zmq::generic_mtrie_t<int>::prefix_t name_data =
|
|
|
|
reinterpret_cast<zmq::generic_mtrie_t<int>::prefix_t> (names[i]);
|
|
|
|
|
|
|
|
bool res = mtrie.rm (name_data, getlen (name_data), &pipes[i]);
|
|
|
|
TEST_ASSERT_TRUE (res);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-02-15 13:09:04 +01:00
|
|
|
int main (void)
|
|
|
|
{
|
|
|
|
setup_test_environment ();
|
|
|
|
|
|
|
|
UNITY_BEGIN ();
|
|
|
|
RUN_TEST (test_create);
|
|
|
|
RUN_TEST (test_check_empty_match_nonempty_data);
|
|
|
|
RUN_TEST (test_check_empty_match_empty_data);
|
|
|
|
RUN_TEST (test_add_single_entry_match_exact);
|
|
|
|
RUN_TEST (test_add_rm_single_entry_match_exact);
|
2018-02-16 11:30:04 +01:00
|
|
|
RUN_TEST (test_add_two_entries_match_prefix_and_exact);
|
|
|
|
RUN_TEST (test_add_two_entries_with_same_name_match_exact);
|
2018-02-18 18:33:38 +01:00
|
|
|
|
2018-02-18 18:59:30 +01:00
|
|
|
RUN_TEST (test_rm_nonexistent_empty);
|
2018-02-18 18:33:38 +01:00
|
|
|
#if 0
|
|
|
|
RUN_TEST (test_rm_nonexistent_nonempty_samename);
|
|
|
|
#endif
|
|
|
|
RUN_TEST (test_rm_nonexistent_nonempty_differentname);
|
|
|
|
#if 0
|
|
|
|
RUN_TEST (test_rm_nonexistent_nonempty_prefix);
|
|
|
|
#endif
|
|
|
|
RUN_TEST (test_rm_nonexistent_nonempty_prefixed);
|
2018-02-18 18:59:30 +01:00
|
|
|
RUN_TEST (test_rm_nonexistent_between);
|
2018-02-18 18:33:38 +01:00
|
|
|
|
|
|
|
RUN_TEST (test_add_multiple);
|
|
|
|
RUN_TEST (test_rm_multiple_in_order);
|
|
|
|
RUN_TEST (test_rm_multiple_reverse_order);
|
2018-02-15 13:09:04 +01:00
|
|
|
|
|
|
|
return UNITY_END ();
|
|
|
|
}
|