|
@@ -0,0 +1,174 @@
|
|
|
+
|
|
|
+
|
|
|
+
|
|
|
+#include "or.h"
|
|
|
+#include "address_set.h"
|
|
|
+#include "microdesc.h"
|
|
|
+#include "networkstatus.h"
|
|
|
+#include "nodelist.h"
|
|
|
+#include "routerlist.h"
|
|
|
+#include "torcert.h"
|
|
|
+
|
|
|
+#include "test.h"
|
|
|
+
|
|
|
+static networkstatus_t *dummy_ns = NULL;
|
|
|
+static networkstatus_t *
|
|
|
+mock_networkstatus_get_latest_consensus(void)
|
|
|
+{
|
|
|
+ return dummy_ns;
|
|
|
+}
|
|
|
+
|
|
|
+static networkstatus_t *
|
|
|
+mock_networkstatus_get_latest_consensus_by_flavor(consensus_flavor_t f)
|
|
|
+{
|
|
|
+ tor_assert(f == FLAV_MICRODESC);
|
|
|
+ return dummy_ns;
|
|
|
+}
|
|
|
+
|
|
|
+
|
|
|
+ * value. This is to control the size of the bloom filter. */
|
|
|
+static int addr_per_node = 2;
|
|
|
+static int
|
|
|
+mock_get_estimated_address_per_node(void)
|
|
|
+{
|
|
|
+ return addr_per_node;
|
|
|
+}
|
|
|
+
|
|
|
+static void
|
|
|
+test_contains(void *arg)
|
|
|
+{
|
|
|
+ int ret;
|
|
|
+ address_set_t *set = NULL;
|
|
|
+
|
|
|
+ (void) arg;
|
|
|
+
|
|
|
+
|
|
|
+ tor_addr_t addr_v6;
|
|
|
+ tor_addr_parse(&addr_v6, "1:2:3:4::");
|
|
|
+ tor_addr_t addr_v4;
|
|
|
+ tor_addr_parse(&addr_v4, "42.42.42.42");
|
|
|
+ uint32_t ipv4h = tor_addr_to_ipv4h(&addr_v4);
|
|
|
+
|
|
|
+
|
|
|
+ * extremely rare. */
|
|
|
+ set = address_set_new(1024);
|
|
|
+ tt_assert(set);
|
|
|
+
|
|
|
+
|
|
|
+ address_set_add(set, &addr_v6);
|
|
|
+ ret = address_set_probably_contains(set, &addr_v6);
|
|
|
+ tt_int_op(ret, OP_EQ, 1);
|
|
|
+
|
|
|
+
|
|
|
+ address_set_add_ipv4h(set, ipv4h);
|
|
|
+ ret = address_set_probably_contains(set, &addr_v4);
|
|
|
+ tt_int_op(ret, OP_EQ, 1);
|
|
|
+
|
|
|
+
|
|
|
+ tor_addr_t dummy_addr;
|
|
|
+ memset(&dummy_addr, 'A', sizeof(dummy_addr));
|
|
|
+ dummy_addr.family = AF_INET;
|
|
|
+ ret = address_set_probably_contains(set, &dummy_addr);
|
|
|
+ tt_int_op(ret, OP_EQ, 0);
|
|
|
+ dummy_addr.family = AF_INET6;
|
|
|
+ ret = address_set_probably_contains(set, &dummy_addr);
|
|
|
+ tt_int_op(ret, OP_EQ, 0);
|
|
|
+
|
|
|
+ done:
|
|
|
+ address_set_free(set);
|
|
|
+}
|
|
|
+
|
|
|
+static void
|
|
|
+test_nodelist(void *arg)
|
|
|
+{
|
|
|
+ int ret;
|
|
|
+ routerstatus_t *rs = NULL; microdesc_t *md = NULL; routerinfo_t *ri = NULL;
|
|
|
+
|
|
|
+ (void) arg;
|
|
|
+
|
|
|
+ MOCK(networkstatus_get_latest_consensus,
|
|
|
+ mock_networkstatus_get_latest_consensus);
|
|
|
+ MOCK(networkstatus_get_latest_consensus_by_flavor,
|
|
|
+ mock_networkstatus_get_latest_consensus_by_flavor);
|
|
|
+ MOCK(get_estimated_address_per_node,
|
|
|
+ mock_get_estimated_address_per_node);
|
|
|
+
|
|
|
+ dummy_ns = tor_malloc_zero(sizeof(*dummy_ns));
|
|
|
+ dummy_ns->flavor = FLAV_MICRODESC;
|
|
|
+ dummy_ns->routerstatus_list = smartlist_new();
|
|
|
+
|
|
|
+ tor_addr_t addr_v4, addr_v6, dummy_addr;
|
|
|
+ tor_addr_parse(&addr_v4, "42.42.42.42");
|
|
|
+ uint32_t ipv4h = tor_addr_to_ipv4h(&addr_v4);
|
|
|
+ tor_addr_parse(&addr_v6, "1:2:3:4::");
|
|
|
+ memset(&dummy_addr, 'A', sizeof(dummy_addr));
|
|
|
+
|
|
|
+
|
|
|
+ * (the_nodelist->node_addrs) so we will fail the contain test rarely. */
|
|
|
+ addr_per_node = 1024;
|
|
|
+
|
|
|
+
|
|
|
+ nodelist_set_consensus(dummy_ns);
|
|
|
+
|
|
|
+
|
|
|
+ ret = nodelist_probably_contains_address(&addr_v4);
|
|
|
+ tt_int_op(ret, OP_EQ, 0);
|
|
|
+ ret = nodelist_probably_contains_address(&addr_v6);
|
|
|
+ tt_int_op(ret, OP_EQ, 0);
|
|
|
+ dummy_addr.family = AF_INET;
|
|
|
+ ret = nodelist_probably_contains_address(&dummy_addr);
|
|
|
+ tt_int_op(ret, OP_EQ, 0);
|
|
|
+ dummy_addr.family = AF_INET6;
|
|
|
+ ret = nodelist_probably_contains_address(&dummy_addr);
|
|
|
+ tt_int_op(ret, OP_EQ, 0);
|
|
|
+
|
|
|
+ md = tor_malloc_zero(sizeof(*md));
|
|
|
+ ri = tor_malloc_zero(sizeof(*ri));
|
|
|
+ rs = tor_malloc_zero(sizeof(*rs));
|
|
|
+ crypto_rand(rs->identity_digest, sizeof(rs->identity_digest));
|
|
|
+ crypto_rand(md->digest, sizeof(md->digest));
|
|
|
+ memcpy(rs->descriptor_digest, md->digest, DIGEST256_LEN);
|
|
|
+
|
|
|
+
|
|
|
+ rs->addr = ipv4h;
|
|
|
+ tor_addr_parse(&rs->ipv6_addr, "1:2:3:4::");
|
|
|
+ ri->addr = ipv4h;
|
|
|
+ tor_addr_parse(&ri->ipv6_addr, "1:2:3:4::");
|
|
|
+ tor_addr_parse(&md->ipv6_addr, "1:2:3:4::");
|
|
|
+
|
|
|
+
|
|
|
+ smartlist_add(dummy_ns->routerstatus_list, rs);
|
|
|
+ nodelist_set_consensus(dummy_ns);
|
|
|
+
|
|
|
+
|
|
|
+ * we should be able to lookup. */
|
|
|
+ ret = nodelist_probably_contains_address(&addr_v4);
|
|
|
+ tt_int_op(ret, OP_EQ, 1);
|
|
|
+ ret = nodelist_probably_contains_address(&addr_v6);
|
|
|
+ tt_int_op(ret, OP_EQ, 1);
|
|
|
+
|
|
|
+ dummy_addr.family = AF_INET;
|
|
|
+ ret = nodelist_probably_contains_address(&dummy_addr);
|
|
|
+ tt_int_op(ret, OP_EQ, 0);
|
|
|
+ dummy_addr.family = AF_INET6;
|
|
|
+ ret = nodelist_probably_contains_address(&dummy_addr);
|
|
|
+ tt_int_op(ret, OP_EQ, 0);
|
|
|
+
|
|
|
+ done:
|
|
|
+ routerstatus_free(rs); routerinfo_free(ri); microdesc_free(md);
|
|
|
+ smartlist_clear(dummy_ns->routerstatus_list);
|
|
|
+ networkstatus_vote_free(dummy_ns);
|
|
|
+ UNMOCK(networkstatus_get_latest_consensus);
|
|
|
+ UNMOCK(networkstatus_get_latest_consensus_by_flavor);
|
|
|
+ UNMOCK(get_estimated_address_per_node);
|
|
|
+}
|
|
|
+
|
|
|
+struct testcase_t address_set_tests[] = {
|
|
|
+ { "contains", test_contains, TT_FORK,
|
|
|
+ NULL, NULL },
|
|
|
+ { "nodelist", test_nodelist, TT_FORK,
|
|
|
+ NULL, NULL },
|
|
|
+
|
|
|
+ END_OF_TESTCASES
|
|
|
+};
|
|
|
+
|