|
Packit Service |
ae04f2 |
/*
|
|
Packit Service |
ae04f2 |
* Copyright (C) Internet Systems Consortium, Inc. ("ISC")
|
|
Packit Service |
ae04f2 |
*
|
|
Packit Service |
ae04f2 |
* This Source Code Form is subject to the terms of the Mozilla Public
|
|
Packit Service |
ae04f2 |
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
Packit Service |
ae04f2 |
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
|
Packit Service |
ae04f2 |
*
|
|
Packit Service |
ae04f2 |
* See the COPYRIGHT file distributed with this work for additional
|
|
Packit Service |
ae04f2 |
* information regarding copyright ownership.
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
#include <config.h>
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
#if HAVE_CMOCKA
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
#include <stdarg.h>
|
|
Packit Service |
ae04f2 |
#include <stddef.h>
|
|
Packit Service |
ae04f2 |
#include <setjmp.h>
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
#include <ctype.h>
|
|
Packit Service |
ae04f2 |
#include <fcntl.h>
|
|
Packit Service |
ae04f2 |
#include <inttypes.h>
|
|
Packit Service |
ae04f2 |
#include <sched.h> /* IWYU pragma: keep */
|
|
Packit Service |
ae04f2 |
#include <stdbool.h>
|
|
Packit Service |
ae04f2 |
#include <stdlib.h>
|
|
Packit Service |
ae04f2 |
#include <string.h>
|
|
Packit Service |
ae04f2 |
#include <time.h>
|
|
Packit Service |
ae04f2 |
#include <unistd.h>
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
#define UNIT_TESTING
|
|
Packit Service |
ae04f2 |
#include <cmocka.h>
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
#include <isc/app.h>
|
|
Packit Service |
ae04f2 |
#include <isc/buffer.h>
|
|
Packit Service |
ae04f2 |
#include <isc/entropy.h>
|
|
Packit Service |
ae04f2 |
#include <isc/file.h>
|
|
Packit Service |
ae04f2 |
#include <isc/hash.h>
|
|
Packit Service |
ae04f2 |
#include <isc/mem.h>
|
|
Packit Service |
ae04f2 |
#include <isc/mem.h>
|
|
Packit Service |
ae04f2 |
#include <isc/os.h>
|
|
Packit Service |
ae04f2 |
#include <isc/print.h>
|
|
Packit Service |
ae04f2 |
#include <isc/random.h>
|
|
Packit Service |
ae04f2 |
#include <isc/socket.h>
|
|
Packit Service |
ae04f2 |
#include <isc/stdio.h>
|
|
Packit Service |
ae04f2 |
#include <isc/string.h>
|
|
Packit Service |
ae04f2 |
#include <isc/string.h>
|
|
Packit Service |
ae04f2 |
#include <isc/task.h>
|
|
Packit Service |
ae04f2 |
#include <isc/thread.h>
|
|
Packit Service |
ae04f2 |
#include <isc/time.h>
|
|
Packit Service |
ae04f2 |
#include <isc/timer.h>
|
|
Packit Service |
ae04f2 |
#include <isc/util.h>
|
|
Packit Service |
ae04f2 |
#include <isc/util.h>
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
#include <dns/compress.h>
|
|
Packit Service |
ae04f2 |
#include <dns/fixedname.h>
|
|
Packit Service |
ae04f2 |
#include <dns/log.h>
|
|
Packit Service |
ae04f2 |
#include <dns/name.h>
|
|
Packit Service |
ae04f2 |
#include <dns/name.h>
|
|
Packit Service |
ae04f2 |
#include <dns/rbt.h>
|
|
Packit Service |
ae04f2 |
#include <dns/result.h>
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
#include <dst/dst.h>
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
#include "dnstest.h"
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
typedef struct {
|
|
Packit Service |
ae04f2 |
dns_rbt_t *rbt;
|
|
Packit Service |
ae04f2 |
dns_rbt_t *rbt_distances;
|
|
Packit Service |
ae04f2 |
} test_context_t;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* The initial structure of domain tree will be as follows:
|
|
Packit Service |
ae04f2 |
*
|
|
Packit Service |
ae04f2 |
* .
|
|
Packit Service |
ae04f2 |
* |
|
|
Packit Service |
ae04f2 |
* b
|
|
Packit Service |
ae04f2 |
* / \
|
|
Packit Service |
ae04f2 |
* a d.e.f
|
|
Packit Service |
ae04f2 |
* / | \
|
|
Packit Service |
ae04f2 |
* c | g.h
|
|
Packit Service |
ae04f2 |
* | |
|
|
Packit Service |
ae04f2 |
* w.y i
|
|
Packit Service |
ae04f2 |
* / | \ \
|
|
Packit Service |
ae04f2 |
* x | z k
|
|
Packit Service |
ae04f2 |
* | |
|
|
Packit Service |
ae04f2 |
* p j
|
|
Packit Service |
ae04f2 |
* / \
|
|
Packit Service |
ae04f2 |
* o q
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* The full absolute names of the nodes in the tree (the tree also
|
|
Packit Service |
ae04f2 |
* contains "." which is not included in this list).
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
static const char * const domain_names[] = {
|
|
Packit Service |
ae04f2 |
"c", "b", "a", "x.d.e.f", "z.d.e.f", "g.h", "i.g.h", "o.w.y.d.e.f",
|
|
Packit Service |
ae04f2 |
"j.z.d.e.f", "p.w.y.d.e.f", "q.w.y.d.e.f", "k.g.h"
|
|
Packit Service |
ae04f2 |
};
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
static const size_t domain_names_count = (sizeof(domain_names) /
|
|
Packit Service |
ae04f2 |
sizeof(domain_names[0]));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* These are set as the node data for the tree used in distances check
|
|
Packit Service |
ae04f2 |
* (for the names in domain_names[] above).
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
static const int node_distances[] = {
|
|
Packit Service |
ae04f2 |
3, 1, 2, 2, 2, 3, 1, 2, 1, 1, 2, 2
|
|
Packit Service |
ae04f2 |
};
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/*
|
|
Packit Service |
ae04f2 |
* The domain order should be:
|
|
Packit Service |
ae04f2 |
* ., a, b, c, d.e.f, x.d.e.f, w.y.d.e.f, o.w.y.d.e.f, p.w.y.d.e.f,
|
|
Packit Service |
ae04f2 |
* q.w.y.d.e.f, z.d.e.f, j.z.d.e.f, g.h, i.g.h, k.g.h
|
|
Packit Service |
ae04f2 |
* . (no data, can't be found)
|
|
Packit Service |
ae04f2 |
* |
|
|
Packit Service |
ae04f2 |
* b
|
|
Packit Service |
ae04f2 |
* / \
|
|
Packit Service |
ae04f2 |
* a d.e.f
|
|
Packit Service |
ae04f2 |
* / | \
|
|
Packit Service |
ae04f2 |
* c | g.h
|
|
Packit Service |
ae04f2 |
* | |
|
|
Packit Service |
ae04f2 |
* w.y i
|
|
Packit Service |
ae04f2 |
* / | \ \
|
|
Packit Service |
ae04f2 |
* x | z k
|
|
Packit Service |
ae04f2 |
* | |
|
|
Packit Service |
ae04f2 |
* p j
|
|
Packit Service |
ae04f2 |
* / \
|
|
Packit Service |
ae04f2 |
* o q
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
static const char * const ordered_names[] = {
|
|
Packit Service |
ae04f2 |
"a", "b", "c", "d.e.f", "x.d.e.f", "w.y.d.e.f", "o.w.y.d.e.f",
|
|
Packit Service |
ae04f2 |
"p.w.y.d.e.f", "q.w.y.d.e.f", "z.d.e.f", "j.z.d.e.f",
|
|
Packit Service |
ae04f2 |
"g.h", "i.g.h", "k.g.h"};
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
static const size_t ordered_names_count = (sizeof(ordered_names) /
|
|
Packit Service |
ae04f2 |
sizeof(*ordered_names));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
static int
|
|
Packit Service |
ae04f2 |
_setup(void **state) {
|
|
Packit Service |
ae04f2 |
isc_result_t result;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
UNUSED(state);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_test_begin(NULL, false);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
return (0);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
static int
|
|
Packit Service |
ae04f2 |
_teardown(void **state) {
|
|
Packit Service |
ae04f2 |
UNUSED(state);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_test_end();
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
return (0);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
delete_data(void *data, void *arg) {
|
|
Packit Service |
ae04f2 |
UNUSED(arg);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
isc_mem_put(mctx, data, sizeof(size_t));
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
static test_context_t *
|
|
Packit Service |
ae04f2 |
test_context_setup(void) {
|
|
Packit Service |
ae04f2 |
test_context_t *ctx;
|
|
Packit Service |
ae04f2 |
isc_result_t result;
|
|
Packit Service |
ae04f2 |
size_t i;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
ctx = isc_mem_get(mctx, sizeof(*ctx));
|
|
Packit Service |
ae04f2 |
assert_non_null(ctx);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
ctx->rbt = NULL;
|
|
Packit Service |
ae04f2 |
result = dns_rbt_create(mctx, delete_data, NULL, &ctx->rbt);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
ctx->rbt_distances = NULL;
|
|
Packit Service |
ae04f2 |
result = dns_rbt_create(mctx, delete_data, NULL, &ctx->rbt_distances);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
for (i = 0; i < domain_names_count; i++) {
|
|
Packit Service |
ae04f2 |
size_t *n;
|
|
Packit Service |
ae04f2 |
dns_fixedname_t fname;
|
|
Packit Service |
ae04f2 |
dns_name_t *name;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring(domain_names[i], &fname);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
n = isc_mem_get(mctx, sizeof(size_t));
|
|
Packit Service |
ae04f2 |
assert_non_null(n);
|
|
Packit Service |
ae04f2 |
*n = i + 1;
|
|
Packit Service |
ae04f2 |
result = dns_rbt_addname(ctx->rbt, name, n);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
n = isc_mem_get(mctx, sizeof(size_t));
|
|
Packit Service |
ae04f2 |
assert_non_null(n);
|
|
Packit Service |
ae04f2 |
*n = node_distances[i];
|
|
Packit Service |
ae04f2 |
result = dns_rbt_addname(ctx->rbt_distances, name, n);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
return (ctx);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
test_context_teardown(test_context_t *ctx) {
|
|
Packit Service |
ae04f2 |
dns_rbt_destroy(&ctx->rbt);
|
|
Packit Service |
ae04f2 |
dns_rbt_destroy(&ctx->rbt_distances);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
isc_mem_put(mctx, ctx, sizeof(*ctx));
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/*
|
|
Packit Service |
ae04f2 |
* Walk the tree and ensure that all the test nodes are present.
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
check_test_data(dns_rbt_t *rbt) {
|
|
Packit Service |
ae04f2 |
dns_fixedname_t fixed;
|
|
Packit Service |
ae04f2 |
isc_result_t result;
|
|
Packit Service |
ae04f2 |
dns_name_t *foundname;
|
|
Packit Service |
ae04f2 |
size_t i;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
foundname = dns_fixedname_initname(&fixed);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
for (i = 0; i < domain_names_count; i++) {
|
|
Packit Service |
ae04f2 |
dns_fixedname_t fname;
|
|
Packit Service |
ae04f2 |
dns_name_t *name;
|
|
Packit Service |
ae04f2 |
size_t *n;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring(domain_names[i], &fname);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
n = NULL;
|
|
Packit Service |
ae04f2 |
result = dns_rbt_findname(rbt, name, 0, foundname,
|
|
Packit Service |
ae04f2 |
(void *) &n);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
assert_int_equal(*n, i + 1);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Test the creation of an rbt */
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
rbt_create(void **state) {
|
|
Packit Service |
ae04f2 |
test_context_t *ctx;
|
|
Packit Service |
ae04f2 |
bool tree_ok;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
UNUSED(state);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
isc_mem_debugging = ISC_MEM_DEBUGRECORD;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
ctx = test_context_setup();
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
check_test_data(ctx->rbt);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
tree_ok = dns__rbt_checkproperties(ctx->rbt);
|
|
Packit Service |
ae04f2 |
assert_true(tree_ok);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
test_context_teardown(ctx);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Test dns_rbt_nodecount() on a tree */
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
rbt_nodecount(void **state) {
|
|
Packit Service |
ae04f2 |
test_context_t *ctx;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
UNUSED(state);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
isc_mem_debugging = ISC_MEM_DEBUGRECORD;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
ctx = test_context_setup();
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
assert_int_equal(15, dns_rbt_nodecount(ctx->rbt));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
test_context_teardown(ctx);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Test dns_rbtnode_get_distance() on a tree */
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
rbtnode_get_distance(void **state) {
|
|
Packit Service |
ae04f2 |
isc_result_t result;
|
|
Packit Service |
ae04f2 |
test_context_t *ctx;
|
|
Packit Service |
ae04f2 |
const char *name_str = "a";
|
|
Packit Service |
ae04f2 |
dns_fixedname_t fname;
|
|
Packit Service |
ae04f2 |
dns_name_t *name;
|
|
Packit Service |
ae04f2 |
dns_rbtnode_t *node = NULL;
|
|
Packit Service |
ae04f2 |
dns_rbtnodechain_t chain;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
UNUSED(state);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
isc_mem_debugging = ISC_MEM_DEBUGRECORD;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
ctx = test_context_setup();
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring(name_str, &fname);
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_rbtnodechain_init(&chain, mctx);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbt_findnode(ctx->rbt_distances, name, NULL,
|
|
Packit Service |
ae04f2 |
&node, &chain, 0, NULL, NULL);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
while (node != NULL) {
|
|
Packit Service |
ae04f2 |
const size_t *distance = (const size_t *) node->data;
|
|
Packit Service |
ae04f2 |
if (distance != NULL)
|
|
Packit Service |
ae04f2 |
assert_int_equal(*distance,
|
|
Packit Service |
ae04f2 |
dns__rbtnode_getdistance(node));
|
|
Packit Service |
ae04f2 |
result = dns_rbtnodechain_next(&chain, NULL, NULL);
|
|
Packit Service |
ae04f2 |
if (result == ISC_R_NOMORE)
|
|
Packit Service |
ae04f2 |
break;
|
|
Packit Service |
ae04f2 |
dns_rbtnodechain_current(&chain, NULL, NULL, &node);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_NOMORE);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_rbtnodechain_invalidate(&chain);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
test_context_teardown(ctx);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/*
|
|
Packit Service |
ae04f2 |
* Test tree balance, inserting names in random order.
|
|
Packit Service |
ae04f2 |
*
|
|
Packit Service |
ae04f2 |
* This test checks an important performance-related property of
|
|
Packit Service |
ae04f2 |
* the red-black tree, which is important for us: the longest
|
|
Packit Service |
ae04f2 |
* path from a sub-tree's root to a node is no more than
|
|
Packit Service |
ae04f2 |
* 2log(n). This check verifies that the tree is balanced.
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
rbt_check_distance_random(void **state) {
|
|
Packit Service |
ae04f2 |
dns_rbt_t *mytree = NULL;
|
|
Packit Service |
ae04f2 |
const unsigned int log_num_nodes = 16;
|
|
Packit Service |
ae04f2 |
isc_result_t result;
|
|
Packit Service |
ae04f2 |
bool tree_ok;
|
|
Packit Service |
ae04f2 |
int i;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
UNUSED(state);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
isc_mem_debugging = ISC_MEM_DEBUGRECORD;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbt_create(mctx, delete_data, NULL, &mytree);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Names are inserted in random order. */
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Make a large 65536 node top-level domain tree, i.e., the
|
|
Packit Service |
ae04f2 |
* following code inserts names such as:
|
|
Packit Service |
ae04f2 |
*
|
|
Packit Service |
ae04f2 |
* savoucnsrkrqzpkqypbygwoiliawpbmz.
|
|
Packit Service |
ae04f2 |
* wkadamcbbpjtundbxcmuayuycposvngx.
|
|
Packit Service |
ae04f2 |
* wzbpznemtooxdpjecdxynsfztvnuyfao.
|
|
Packit Service |
ae04f2 |
* yueojmhyffslpvfmgyfwioxegfhepnqq.
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
for (i = 0; i < (1 << log_num_nodes); i++) {
|
|
Packit Service |
ae04f2 |
size_t *n;
|
|
Packit Service |
ae04f2 |
char namebuf[34];
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
n = isc_mem_get(mctx, sizeof(size_t));
|
|
Packit Service |
ae04f2 |
assert_non_null(n);
|
|
Packit Service |
ae04f2 |
*n = i + 1;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
while (1) {
|
|
Packit Service |
ae04f2 |
int j;
|
|
Packit Service |
ae04f2 |
dns_fixedname_t fname;
|
|
Packit Service |
ae04f2 |
dns_name_t *name;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
for (j = 0; j < 32; j++) {
|
|
Packit Service |
ae04f2 |
uint32_t v;
|
|
Packit Service |
ae04f2 |
isc_random_get(&v);
|
|
Packit Service |
ae04f2 |
namebuf[j] = 'a' + (v % 26);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
namebuf[32] = '.';
|
|
Packit Service |
ae04f2 |
namebuf[33] = 0;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring(namebuf, &fname);
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbt_addname(mytree, name, n);
|
|
Packit Service |
ae04f2 |
if (result == ISC_R_SUCCESS)
|
|
Packit Service |
ae04f2 |
break;
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* 1 (root . node) + (1 << log_num_nodes) */
|
|
Packit Service |
ae04f2 |
assert_int_equal(1U + (1U << log_num_nodes),
|
|
Packit Service |
ae04f2 |
dns_rbt_nodecount(mytree));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* The distance from each node to its sub-tree root must be less
|
|
Packit Service |
ae04f2 |
* than 2 * log(n).
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
assert_true((2U * log_num_nodes) >= dns__rbt_getheight(mytree));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Also check RB tree properties */
|
|
Packit Service |
ae04f2 |
tree_ok = dns__rbt_checkproperties(mytree);
|
|
Packit Service |
ae04f2 |
assert_true(tree_ok);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_rbt_destroy(&mytree);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/*
|
|
Packit Service |
ae04f2 |
* Test tree balance, inserting names in sorted order.
|
|
Packit Service |
ae04f2 |
*
|
|
Packit Service |
ae04f2 |
* This test checks an important performance-related property of
|
|
Packit Service |
ae04f2 |
* the red-black tree, which is important for us: the longest
|
|
Packit Service |
ae04f2 |
* path from a sub-tree's root to a node is no more than
|
|
Packit Service |
ae04f2 |
* 2log(n). This check verifies that the tree is balanced.
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
rbt_check_distance_ordered(void **state) {
|
|
Packit Service |
ae04f2 |
dns_rbt_t *mytree = NULL;
|
|
Packit Service |
ae04f2 |
const unsigned int log_num_nodes = 16;
|
|
Packit Service |
ae04f2 |
isc_result_t result;
|
|
Packit Service |
ae04f2 |
bool tree_ok;
|
|
Packit Service |
ae04f2 |
int i;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
UNUSED(state);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
isc_mem_debugging = ISC_MEM_DEBUGRECORD;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbt_create(mctx, delete_data, NULL, &mytree);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Names are inserted in sorted order. */
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Make a large 65536 node top-level domain tree, i.e., the
|
|
Packit Service |
ae04f2 |
* following code inserts names such as:
|
|
Packit Service |
ae04f2 |
*
|
|
Packit Service |
ae04f2 |
* name00000000.
|
|
Packit Service |
ae04f2 |
* name00000001.
|
|
Packit Service |
ae04f2 |
* name00000002.
|
|
Packit Service |
ae04f2 |
* name00000003.
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
for (i = 0; i < (1 << log_num_nodes); i++) {
|
|
Packit Service |
ae04f2 |
size_t *n;
|
|
Packit Service |
ae04f2 |
char namebuf[14];
|
|
Packit Service |
ae04f2 |
dns_fixedname_t fname;
|
|
Packit Service |
ae04f2 |
dns_name_t *name;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
n = isc_mem_get(mctx, sizeof(size_t));
|
|
Packit Service |
ae04f2 |
assert_non_null(n);
|
|
Packit Service |
ae04f2 |
*n = i + 1;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
snprintf(namebuf, sizeof(namebuf), "name%08x.", i);
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring(namebuf, &fname);
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbt_addname(mytree, name, n);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* 1 (root . node) + (1 << log_num_nodes) */
|
|
Packit Service |
ae04f2 |
assert_int_equal(1U + (1U << log_num_nodes),
|
|
Packit Service |
ae04f2 |
dns_rbt_nodecount(mytree));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* The distance from each node to its sub-tree root must be less
|
|
Packit Service |
ae04f2 |
* than 2 * log(n).
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
assert_true((2U * log_num_nodes) >= dns__rbt_getheight(mytree));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Also check RB tree properties */
|
|
Packit Service |
ae04f2 |
tree_ok = dns__rbt_checkproperties(mytree);
|
|
Packit Service |
ae04f2 |
assert_true(tree_ok);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_rbt_destroy(&mytree);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
static isc_result_t
|
|
Packit Service |
ae04f2 |
insert_helper(dns_rbt_t *rbt, const char *namestr, dns_rbtnode_t **node) {
|
|
Packit Service |
ae04f2 |
dns_fixedname_t fname;
|
|
Packit Service |
ae04f2 |
dns_name_t *name;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring(namestr, &fname);
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
return (dns_rbt_addnode(rbt, name, node));
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
static bool
|
|
Packit Service |
ae04f2 |
compare_labelsequences(dns_rbtnode_t *node, const char *labelstr) {
|
|
Packit Service |
ae04f2 |
dns_name_t name;
|
|
Packit Service |
ae04f2 |
isc_result_t result;
|
|
Packit Service |
ae04f2 |
char *nodestr = NULL;
|
|
Packit Service |
ae04f2 |
bool is_equal;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_name_init(&name, NULL);
|
|
Packit Service |
ae04f2 |
dns_rbt_namefromnode(node, &name);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_name_tostring(&name, &nodestr, mctx);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
is_equal = strcmp(labelstr, nodestr) == 0 ? true : false;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
isc_mem_free(mctx, nodestr);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
return (is_equal);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Test insertion into a tree */
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
rbt_insert(void **state) {
|
|
Packit Service |
ae04f2 |
isc_result_t result;
|
|
Packit Service |
ae04f2 |
test_context_t *ctx;
|
|
Packit Service |
ae04f2 |
dns_rbtnode_t *node;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
UNUSED(state);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
isc_mem_debugging = ISC_MEM_DEBUGRECORD;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
ctx = test_context_setup();
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Check node count before beginning. */
|
|
Packit Service |
ae04f2 |
assert_int_equal(15, dns_rbt_nodecount(ctx->rbt));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Try to insert a node that already exists. */
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "d.e.f", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_EXISTS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Node count must not have changed. */
|
|
Packit Service |
ae04f2 |
assert_int_equal(15, dns_rbt_nodecount(ctx->rbt));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Try to insert a node that doesn't exist. */
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "0", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
assert_true(compare_labelsequences(node, "0"));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Node count must have increased. */
|
|
Packit Service |
ae04f2 |
assert_int_equal(16, dns_rbt_nodecount(ctx->rbt));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Another. */
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "example.com", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
assert_non_null(node);
|
|
Packit Service |
ae04f2 |
assert_null(node->data);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Node count must have increased. */
|
|
Packit Service |
ae04f2 |
assert_int_equal(17, dns_rbt_nodecount(ctx->rbt));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Re-adding it should return EXISTS */
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "example.com", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_EXISTS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Node count must not have changed. */
|
|
Packit Service |
ae04f2 |
assert_int_equal(17, dns_rbt_nodecount(ctx->rbt));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Fission the node d.e.f */
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "k.e.f", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
assert_true(compare_labelsequences(node, "k"));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Node count must have incremented twice ("d.e.f" fissioned to
|
|
Packit Service |
ae04f2 |
* "d" and "e.f", and the newly added "k").
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
assert_int_equal(19, dns_rbt_nodecount(ctx->rbt));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Fission the node "g.h" */
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "h", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
assert_true(compare_labelsequences(node, "h"));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Node count must have incremented ("g.h" fissioned to "g" and
|
|
Packit Service |
ae04f2 |
* "h").
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
assert_int_equal(20, dns_rbt_nodecount(ctx->rbt));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Add child domains */
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "m.p.w.y.d.e.f", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
assert_true(compare_labelsequences(node, "m"));
|
|
Packit Service |
ae04f2 |
assert_int_equal(21, dns_rbt_nodecount(ctx->rbt));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "n.p.w.y.d.e.f", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
assert_true(compare_labelsequences(node, "n"));
|
|
Packit Service |
ae04f2 |
assert_int_equal(22, dns_rbt_nodecount(ctx->rbt));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "l.a", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
assert_true(compare_labelsequences(node, "l"));
|
|
Packit Service |
ae04f2 |
assert_int_equal(23, dns_rbt_nodecount(ctx->rbt));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "r.d.e.f", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "s.d.e.f", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
assert_int_equal(25, dns_rbt_nodecount(ctx->rbt));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "h.w.y.d.e.f", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Add more nodes one by one to cover left and right rotation
|
|
Packit Service |
ae04f2 |
* functions.
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "f", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "m", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "nm", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "om", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "k", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "l", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "fe", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "ge", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "i", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "ae", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(ctx->rbt, "n", &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
test_context_teardown(ctx);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/*
|
|
Packit Service |
ae04f2 |
* Test removal from a tree
|
|
Packit Service |
ae04f2 |
*
|
|
Packit Service |
ae04f2 |
* This testcase checks that after node removal, the binary-search tree is
|
|
Packit Service |
ae04f2 |
* valid and all nodes that are supposed to exist are present in the
|
|
Packit Service |
ae04f2 |
* correct order. It mainly tests DomainTree as a BST, and not particularly
|
|
Packit Service |
ae04f2 |
* as a red-black tree. This test checks node deletion when upper nodes
|
|
Packit Service |
ae04f2 |
* have data.
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
rbt_remove(void **state) {
|
|
Packit Service |
ae04f2 |
isc_result_t result; size_t j;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
UNUSED(state);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
isc_mem_debugging = ISC_MEM_DEBUGRECORD;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/*
|
|
Packit Service |
ae04f2 |
* Delete single nodes and check if the rest of the nodes exist.
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
for (j = 0; j < ordered_names_count; j++) {
|
|
Packit Service |
ae04f2 |
dns_rbt_t *mytree = NULL;
|
|
Packit Service |
ae04f2 |
dns_rbtnode_t *node;
|
|
Packit Service |
ae04f2 |
size_t i;
|
|
Packit Service |
ae04f2 |
size_t *n;
|
|
Packit Service |
ae04f2 |
bool tree_ok;
|
|
Packit Service |
ae04f2 |
dns_rbtnodechain_t chain;
|
|
Packit Service |
ae04f2 |
size_t start_node;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Create a tree. */
|
|
Packit Service |
ae04f2 |
result = dns_rbt_create(mctx, delete_data, NULL, &mytree);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Insert test data into the tree. */
|
|
Packit Service |
ae04f2 |
for (i = 0; i < domain_names_count; i++) {
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(mytree, domain_names[i], &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Check that all names exist in order. */
|
|
Packit Service |
ae04f2 |
for (i = 0; i < ordered_names_count; i++) {
|
|
Packit Service |
ae04f2 |
dns_fixedname_t fname;
|
|
Packit Service |
ae04f2 |
dns_name_t *name;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring(ordered_names[i], &fname);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = dns_rbt_findnode(mytree, name, NULL,
|
|
Packit Service |
ae04f2 |
&node, NULL,
|
|
Packit Service |
ae04f2 |
DNS_RBTFIND_EMPTYDATA,
|
|
Packit Service |
ae04f2 |
NULL, NULL);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Add node data */
|
|
Packit Service |
ae04f2 |
assert_non_null(node);
|
|
Packit Service |
ae04f2 |
assert_null(node->data);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
n = isc_mem_get(mctx, sizeof(size_t));
|
|
Packit Service |
ae04f2 |
assert_non_null(n);
|
|
Packit Service |
ae04f2 |
*n = i;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
node->data = n;
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Now, delete the j'th node from the tree. */
|
|
Packit Service |
ae04f2 |
{
|
|
Packit Service |
ae04f2 |
dns_fixedname_t fname;
|
|
Packit Service |
ae04f2 |
dns_name_t *name;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring(ordered_names[j], &fname);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbt_deletename(mytree, name, false);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Check RB tree properties. */
|
|
Packit Service |
ae04f2 |
tree_ok = dns__rbt_checkproperties(mytree);
|
|
Packit Service |
ae04f2 |
assert_true(tree_ok);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_rbtnodechain_init(&chain, mctx);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Now, walk through nodes in order. */
|
|
Packit Service |
ae04f2 |
if (j == 0) {
|
|
Packit Service |
ae04f2 |
/*
|
|
Packit Service |
ae04f2 |
* Node for ordered_names[0] was already deleted
|
|
Packit Service |
ae04f2 |
* above. We start from node 1.
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
dns_fixedname_t fname;
|
|
Packit Service |
ae04f2 |
dns_name_t *name;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring(ordered_names[0], &fname);
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = dns_rbt_findnode(mytree, name, NULL,
|
|
Packit Service |
ae04f2 |
&node, NULL,
|
|
Packit Service |
ae04f2 |
0,
|
|
Packit Service |
ae04f2 |
NULL, NULL);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_NOTFOUND);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring(ordered_names[1], &fname);
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = dns_rbt_findnode(mytree, name, NULL,
|
|
Packit Service |
ae04f2 |
&node, &chain,
|
|
Packit Service |
ae04f2 |
0,
|
|
Packit Service |
ae04f2 |
NULL, NULL);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
start_node = 1;
|
|
Packit Service |
ae04f2 |
} else {
|
|
Packit Service |
ae04f2 |
/* Start from node 0. */
|
|
Packit Service |
ae04f2 |
dns_fixedname_t fname;
|
|
Packit Service |
ae04f2 |
dns_name_t *name;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring(ordered_names[0], &fname);
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = dns_rbt_findnode(mytree, name, NULL,
|
|
Packit Service |
ae04f2 |
&node, &chain,
|
|
Packit Service |
ae04f2 |
0,
|
|
Packit Service |
ae04f2 |
NULL, NULL);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
start_node = 0;
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/*
|
|
Packit Service |
ae04f2 |
* node and chain have been set by the code above at
|
|
Packit Service |
ae04f2 |
* this point.
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
for (i = start_node; i < ordered_names_count; i++) {
|
|
Packit Service |
ae04f2 |
dns_fixedname_t fname_j, fname_i;
|
|
Packit Service |
ae04f2 |
dns_name_t *name_j, *name_i;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring(ordered_names[j], &fname_j);
|
|
Packit Service |
ae04f2 |
name_j = dns_fixedname_name(&fname_j);
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring(ordered_names[i], &fname_i);
|
|
Packit Service |
ae04f2 |
name_i = dns_fixedname_name(&fname_i);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
if (dns_name_equal(name_i, name_j)) {
|
|
Packit Service |
ae04f2 |
/*
|
|
Packit Service |
ae04f2 |
* This may be true for the last node if
|
|
Packit Service |
ae04f2 |
* we seek ahead in the loop using
|
|
Packit Service |
ae04f2 |
* dns_rbtnodechain_next() below.
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
if (node == NULL) {
|
|
Packit Service |
ae04f2 |
break;
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* All ordered nodes have data
|
|
Packit Service |
ae04f2 |
* initially. If any node is empty, it
|
|
Packit Service |
ae04f2 |
* means it was removed, but an empty
|
|
Packit Service |
ae04f2 |
* node exists because it is a
|
|
Packit Service |
ae04f2 |
* super-domain. Just skip it.
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
if (node->data == NULL) {
|
|
Packit Service |
ae04f2 |
result = dns_rbtnodechain_next(&chain,
|
|
Packit Service |
ae04f2 |
NULL,
|
|
Packit Service |
ae04f2 |
NULL);
|
|
Packit Service |
ae04f2 |
if (result == ISC_R_NOMORE) {
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
} else {
|
|
Packit Service |
ae04f2 |
dns_rbtnodechain_current(&chain,
|
|
Packit Service |
ae04f2 |
NULL,
|
|
Packit Service |
ae04f2 |
NULL,
|
|
Packit Service |
ae04f2 |
&node);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
continue;
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
assert_non_null(node);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
n = (size_t *) node->data;
|
|
Packit Service |
ae04f2 |
if (n != NULL) {
|
|
Packit Service |
ae04f2 |
/* printf("n=%zu, i=%zu\n", *n, i); */
|
|
Packit Service |
ae04f2 |
assert_int_equal(*n, i);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbtnodechain_next(&chain, NULL, NULL);
|
|
Packit Service |
ae04f2 |
if (result == ISC_R_NOMORE) {
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
} else {
|
|
Packit Service |
ae04f2 |
dns_rbtnodechain_current(&chain, NULL, NULL,
|
|
Packit Service |
ae04f2 |
&node);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* We should have reached the end of the tree. */
|
|
Packit Service |
ae04f2 |
assert_null(node);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_rbt_destroy(&mytree);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
insert_nodes(dns_rbt_t *mytree, char **names,
|
|
Packit Service |
ae04f2 |
size_t *names_count, uint32_t num_names)
|
|
Packit Service |
ae04f2 |
{
|
|
Packit Service |
ae04f2 |
uint32_t i;
|
|
Packit Service |
ae04f2 |
dns_rbtnode_t *node;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
for (i = 0; i < num_names; i++) {
|
|
Packit Service |
ae04f2 |
size_t *n;
|
|
Packit Service |
ae04f2 |
char namebuf[34];
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
n = isc_mem_get(mctx, sizeof(size_t));
|
|
Packit Service |
ae04f2 |
assert_non_null(n);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
*n = i; /* Unused value */
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
while (1) {
|
|
Packit Service |
ae04f2 |
int j;
|
|
Packit Service |
ae04f2 |
dns_fixedname_t fname;
|
|
Packit Service |
ae04f2 |
dns_name_t *name;
|
|
Packit Service |
ae04f2 |
isc_result_t result;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
for (j = 0; j < 32; j++) {
|
|
Packit Service |
ae04f2 |
uint32_t v;
|
|
Packit Service |
ae04f2 |
isc_random_get(&v);
|
|
Packit Service |
ae04f2 |
namebuf[j] = 'a' + (v % 26);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
namebuf[32] = '.';
|
|
Packit Service |
ae04f2 |
namebuf[33] = 0;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring(namebuf, &fname);
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = dns_rbt_addnode(mytree, name, &node);
|
|
Packit Service |
ae04f2 |
if (result == ISC_R_SUCCESS) {
|
|
Packit Service |
ae04f2 |
node->data = n;
|
|
Packit Service |
ae04f2 |
names[*names_count] = isc_mem_strdup(mctx,
|
|
Packit Service |
ae04f2 |
namebuf);
|
|
Packit Service |
ae04f2 |
assert_non_null(names[*names_count]);
|
|
Packit Service |
ae04f2 |
*names_count += 1;
|
|
Packit Service |
ae04f2 |
break;
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
remove_nodes(dns_rbt_t *mytree, char **names,
|
|
Packit Service |
ae04f2 |
size_t *names_count, uint32_t num_names)
|
|
Packit Service |
ae04f2 |
{
|
|
Packit Service |
ae04f2 |
uint32_t i;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
UNUSED(mytree);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
for (i = 0; i < num_names && *names_count > 0; i++) {
|
|
Packit Service |
ae04f2 |
uint32_t node;
|
|
Packit Service |
ae04f2 |
dns_fixedname_t fname;
|
|
Packit Service |
ae04f2 |
dns_name_t *name;
|
|
Packit Service |
ae04f2 |
isc_result_t result;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
isc_random_get(&node);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
node %= *names_count;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring(names[node], &fname);
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbt_deletename(mytree, name, false);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
isc_mem_free(mctx, names[node]);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
names[node] = names[*names_count - 1];
|
|
Packit Service |
ae04f2 |
names[*names_count - 1] = NULL;
|
|
Packit Service |
ae04f2 |
*names_count -= 1;
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
check_tree(dns_rbt_t *mytree, char **names, size_t names_count) {
|
|
Packit Service |
ae04f2 |
bool tree_ok;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
UNUSED(names);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
assert_int_equal(names_count + 1, dns_rbt_nodecount(mytree));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/*
|
|
Packit Service |
ae04f2 |
* The distance from each node to its sub-tree root must be less
|
|
Packit Service |
ae04f2 |
* than 2 * log_2(1024).
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
assert_true((2 * 10) >= dns__rbt_getheight(mytree));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Also check RB tree properties */
|
|
Packit Service |
ae04f2 |
tree_ok = dns__rbt_checkproperties(mytree);
|
|
Packit Service |
ae04f2 |
assert_true(tree_ok);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/*
|
|
Packit Service |
ae04f2 |
* Test insert and remove in a loop.
|
|
Packit Service |
ae04f2 |
*
|
|
Packit Service |
ae04f2 |
* What is the best way to test our red-black tree code? It is
|
|
Packit Service |
ae04f2 |
* not a good method to test every case handled in the actual
|
|
Packit Service |
ae04f2 |
* code itself. This is because our approach itself may be
|
|
Packit Service |
ae04f2 |
* incorrect.
|
|
Packit Service |
ae04f2 |
*
|
|
Packit Service |
ae04f2 |
* We test our code at the interface level here by exercising the
|
|
Packit Service |
ae04f2 |
* tree randomly multiple times, checking that red-black tree
|
|
Packit Service |
ae04f2 |
* properties are valid, and all the nodes that are supposed to be
|
|
Packit Service |
ae04f2 |
* in the tree exist and are in order.
|
|
Packit Service |
ae04f2 |
*
|
|
Packit Service |
ae04f2 |
* NOTE: These tests are run within a single tree level in the
|
|
Packit Service |
ae04f2 |
* forest. The number of nodes in the tree level doesn't grow
|
|
Packit Service |
ae04f2 |
* over 1024.
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
rbt_insert_and_remove(void **state) {
|
|
Packit Service |
ae04f2 |
isc_result_t result;
|
|
Packit Service |
ae04f2 |
dns_rbt_t *mytree = NULL;
|
|
Packit Service |
ae04f2 |
size_t *n;
|
|
Packit Service |
ae04f2 |
char *names[1024];
|
|
Packit Service |
ae04f2 |
size_t names_count;
|
|
Packit Service |
ae04f2 |
int i;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
UNUSED(state);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
isc_mem_debugging = ISC_MEM_DEBUGRECORD;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbt_create(mctx, delete_data, NULL, &mytree);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
n = isc_mem_get(mctx, sizeof(size_t));
|
|
Packit Service |
ae04f2 |
assert_non_null(n);
|
|
Packit Service |
ae04f2 |
result = dns_rbt_addname(mytree, dns_rootname, n);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
memset(names, 0, sizeof(names));
|
|
Packit Service |
ae04f2 |
names_count = 0;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Repeat the insert/remove test some 4096 times */
|
|
Packit Service |
ae04f2 |
for (i = 0; i < 4096; i++) {
|
|
Packit Service |
ae04f2 |
uint32_t num_names;
|
|
Packit Service |
ae04f2 |
isc_random_get(&num_names);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
if (names_count < 1024) {
|
|
Packit Service |
ae04f2 |
num_names %= 1024 - names_count;
|
|
Packit Service |
ae04f2 |
num_names++;
|
|
Packit Service |
ae04f2 |
} else {
|
|
Packit Service |
ae04f2 |
num_names = 0;
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
insert_nodes(mytree, names, &names_count, num_names);
|
|
Packit Service |
ae04f2 |
check_tree(mytree, names, names_count);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
isc_random_get(&num_names);
|
|
Packit Service |
ae04f2 |
if (names_count > 0) {
|
|
Packit Service |
ae04f2 |
num_names %= names_count;
|
|
Packit Service |
ae04f2 |
num_names++;
|
|
Packit Service |
ae04f2 |
} else {
|
|
Packit Service |
ae04f2 |
num_names = 0;
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
remove_nodes(mytree, names, &names_count, num_names);
|
|
Packit Service |
ae04f2 |
check_tree(mytree, names, names_count);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Remove the rest of the nodes */
|
|
Packit Service |
ae04f2 |
remove_nodes(mytree, names, &names_count, names_count);
|
|
Packit Service |
ae04f2 |
check_tree(mytree, names, names_count);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
for (i = 0; i < 1024; i++) {
|
|
Packit Service |
ae04f2 |
if (names[i] != NULL) {
|
|
Packit Service |
ae04f2 |
isc_mem_free(mctx, names[i]);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbt_deletename(mytree, dns_rootname, false);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
assert_int_equal(dns_rbt_nodecount(mytree), 0);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_rbt_destroy(&mytree);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Test findname return values */
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
rbt_findname(void **state) {
|
|
Packit Service |
ae04f2 |
isc_result_t result;
|
|
Packit Service |
ae04f2 |
test_context_t *ctx = NULL;
|
|
Packit Service |
ae04f2 |
dns_fixedname_t fname, found;
|
|
Packit Service |
ae04f2 |
dns_name_t *name = NULL, *foundname = NULL;
|
|
Packit Service |
ae04f2 |
size_t *n = NULL;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
UNUSED(state);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
isc_mem_debugging = ISC_MEM_DEBUGRECORD;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
ctx = test_context_setup();
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Try to find a name that exists. */
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring("d.e.f", &fname);
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
foundname = dns_fixedname_initname(&found);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbt_findname(ctx->rbt, name,
|
|
Packit Service |
ae04f2 |
DNS_RBTFIND_EMPTYDATA,
|
|
Packit Service |
ae04f2 |
foundname, (void *) &n);
|
|
Packit Service |
ae04f2 |
assert_true(dns_name_equal(foundname, name));
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Now without EMPTYDATA */
|
|
Packit Service |
ae04f2 |
result = dns_rbt_findname(ctx->rbt, name, 0,
|
|
Packit Service |
ae04f2 |
foundname, (void *) &n);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_NOTFOUND);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Now one that partially matches */
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring("d.e.f.g.h.i.j", &fname);
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
result = dns_rbt_findname(ctx->rbt, name,
|
|
Packit Service |
ae04f2 |
DNS_RBTFIND_EMPTYDATA,
|
|
Packit Service |
ae04f2 |
foundname, (void *) &n);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, DNS_R_PARTIALMATCH);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Now one that doesn't match */
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring("1.2", &fname);
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
result = dns_rbt_findname(ctx->rbt, name,
|
|
Packit Service |
ae04f2 |
DNS_RBTFIND_EMPTYDATA,
|
|
Packit Service |
ae04f2 |
foundname, (void *) &n);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, DNS_R_PARTIALMATCH);
|
|
Packit Service |
ae04f2 |
assert_true(dns_name_equal(foundname, dns_rootname));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
test_context_teardown(ctx);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Test addname return values */
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
rbt_addname(void **state) {
|
|
Packit Service |
ae04f2 |
isc_result_t result;
|
|
Packit Service |
ae04f2 |
test_context_t *ctx = NULL;
|
|
Packit Service |
ae04f2 |
dns_fixedname_t fname;
|
|
Packit Service |
ae04f2 |
dns_name_t *name = NULL;
|
|
Packit Service |
ae04f2 |
size_t *n;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
UNUSED(state);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
isc_mem_debugging = ISC_MEM_DEBUGRECORD;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
ctx = test_context_setup();
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
n = isc_mem_get(mctx, sizeof(size_t));
|
|
Packit Service |
ae04f2 |
assert_non_null(n);
|
|
Packit Service |
ae04f2 |
*n = 1;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring("d.e.f.g.h.i.j.k", &fname);
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Add a name that doesn't exist */
|
|
Packit Service |
ae04f2 |
result = dns_rbt_addname(ctx->rbt, name, n);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Now add again, should get ISC_R_EXISTS */
|
|
Packit Service |
ae04f2 |
n = isc_mem_get(mctx, sizeof(size_t));
|
|
Packit Service |
ae04f2 |
assert_non_null(n);
|
|
Packit Service |
ae04f2 |
*n = 2;
|
|
Packit Service |
ae04f2 |
result = dns_rbt_addname(ctx->rbt, name, n);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_EXISTS);
|
|
Packit Service |
ae04f2 |
isc_mem_put(mctx, n, sizeof(size_t));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
test_context_teardown(ctx);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Test deletename return values */
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
rbt_deletename(void **state) {
|
|
Packit Service |
ae04f2 |
isc_result_t result;
|
|
Packit Service |
ae04f2 |
test_context_t *ctx = NULL;
|
|
Packit Service |
ae04f2 |
dns_fixedname_t fname;
|
|
Packit Service |
ae04f2 |
dns_name_t *name = NULL;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
UNUSED(state);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
isc_mem_debugging = ISC_MEM_DEBUGRECORD;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
ctx = test_context_setup();
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Delete a name that doesn't exist */
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring("z.x.y.w", &fname);
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
result = dns_rbt_deletename(ctx->rbt, name, false);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_NOTFOUND);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Now one that does */
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring("d.e.f", &fname);
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
result = dns_rbt_deletename(ctx->rbt, name, false);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_NOTFOUND);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
test_context_teardown(ctx);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Test nodechain */
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
rbt_nodechain(void **state) {
|
|
Packit Service |
ae04f2 |
isc_result_t result;
|
|
Packit Service |
ae04f2 |
test_context_t *ctx;
|
|
Packit Service |
ae04f2 |
dns_fixedname_t fname, found, expect;
|
|
Packit Service |
ae04f2 |
dns_name_t *name, *foundname, *expected;
|
|
Packit Service |
ae04f2 |
dns_rbtnode_t *node = NULL;
|
|
Packit Service |
ae04f2 |
dns_rbtnodechain_t chain;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
UNUSED(state);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
isc_mem_debugging = ISC_MEM_DEBUGRECORD;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
ctx = test_context_setup();
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_rbtnodechain_init(&chain, mctx);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring("a", &fname);
|
|
Packit Service |
ae04f2 |
name = dns_fixedname_name(&fname);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbt_findnode(ctx->rbt, name, NULL,
|
|
Packit Service |
ae04f2 |
&node, &chain, 0, NULL, NULL);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
foundname = dns_fixedname_initname(&found);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring("a", &expect);
|
|
Packit Service |
ae04f2 |
expected = dns_fixedname_name(&expect);
|
|
Packit Service |
ae04f2 |
UNUSED(expected);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbtnodechain_first(&chain, ctx->rbt, foundname, NULL);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, DNS_R_NEWORIGIN);
|
|
Packit Service |
ae04f2 |
assert_int_equal(dns_name_countlabels(foundname), 0);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbtnodechain_prev(&chain, NULL, NULL);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_NOMORE);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbtnodechain_next(&chain, NULL, NULL);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbtnodechain_next(&chain, NULL, NULL);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbtnodechain_last(&chain, ctx->rbt, NULL, NULL);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, DNS_R_NEWORIGIN);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbtnodechain_next(&chain, NULL, NULL);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_NOMORE);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbtnodechain_last(&chain, ctx->rbt, NULL, NULL);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, DNS_R_NEWORIGIN);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = dns_rbtnodechain_prev(&chain, NULL, NULL);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_rbtnodechain_invalidate(&chain);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
test_context_teardown(ctx);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
#ifdef ISC_PLATFORM_USETHREADS
|
|
Packit Service |
ae04f2 |
#ifdef DNS_BENCHMARK_TESTS
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/*
|
|
Packit Service |
ae04f2 |
* XXXMUKS: Don't delete this code. It is useful in benchmarking the
|
|
Packit Service |
ae04f2 |
* RBT, but we don't require it as part of the unit test runs.
|
|
Packit Service |
ae04f2 |
*/
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
static dns_fixedname_t *fnames;
|
|
Packit Service |
ae04f2 |
static dns_name_t **names;
|
|
Packit Service |
ae04f2 |
static int *values;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
static void *
|
|
Packit Service |
ae04f2 |
find_thread(void *arg) {
|
|
Packit Service |
ae04f2 |
dns_rbt_t *mytree;
|
|
Packit Service |
ae04f2 |
isc_result_t result;
|
|
Packit Service |
ae04f2 |
dns_rbtnode_t *node;
|
|
Packit Service |
ae04f2 |
unsigned int j, i;
|
|
Packit Service |
ae04f2 |
unsigned int start = 0;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
mytree = (dns_rbt_t *) arg;
|
|
Packit Service |
ae04f2 |
while (start == 0)
|
|
Packit Service |
ae04f2 |
start = random() % 4000000;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Query 32 million random names from it in each thread */
|
|
Packit Service |
ae04f2 |
for (j = 0; j < 8; j++) {
|
|
Packit Service |
ae04f2 |
for (i = start; i != start - 1; i = (i + 1) % 4000000) {
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = dns_rbt_findnode(mytree, names[i], NULL,
|
|
Packit Service |
ae04f2 |
&node, NULL,
|
|
Packit Service |
ae04f2 |
DNS_RBTFIND_EMPTYDATA,
|
|
Packit Service |
ae04f2 |
NULL, NULL);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
assert_non_null(node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(values[i], (intptr_t) node->data);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
return (NULL);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Benchmark RBT implementation */
|
|
Packit Service |
ae04f2 |
static void
|
|
Packit Service |
ae04f2 |
benchmark(void **state) {
|
|
Packit Service |
ae04f2 |
isc_result_t result;
|
|
Packit Service |
ae04f2 |
char namestr[sizeof("name18446744073709551616.example.org.")];
|
|
Packit Service |
ae04f2 |
unsigned int r;
|
|
Packit Service |
ae04f2 |
dns_rbt_t *mytree;
|
|
Packit Service |
ae04f2 |
dns_rbtnode_t *node;
|
|
Packit Service |
ae04f2 |
unsigned int i;
|
|
Packit Service |
ae04f2 |
unsigned int maxvalue = 1000000;
|
|
Packit Service |
ae04f2 |
isc_time_t ts1, ts2;
|
|
Packit Service |
ae04f2 |
double t;
|
|
Packit Service |
ae04f2 |
unsigned int nthreads;
|
|
Packit Service |
ae04f2 |
isc_thread_t threads[32];
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
UNUSED(state);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
srandom(time(NULL));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
debug_mem_record = false;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
fnames = (dns_fixedname_t *) malloc(4000000 * sizeof(dns_fixedname_t));
|
|
Packit Service |
ae04f2 |
names = (dns_name_t **) malloc(4000000 * sizeof(dns_name_t *));
|
|
Packit Service |
ae04f2 |
values = (int *) malloc(4000000 * sizeof(int));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
for (i = 0; i < 4000000; i++) {
|
|
Packit Service |
ae04f2 |
r = ((unsigned long) random()) % maxvalue;
|
|
Packit Service |
ae04f2 |
snprintf(namestr, sizeof(namestr), "name%u.example.org.", r);
|
|
Packit Service |
ae04f2 |
dns_test_namefromstring(namestr, &fnames[i]);
|
|
Packit Service |
ae04f2 |
names[i] = dns_fixedname_name(&fnames[i]);
|
|
Packit Service |
ae04f2 |
values[i] = r;
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Create a tree. */
|
|
Packit Service |
ae04f2 |
mytree = NULL;
|
|
Packit Service |
ae04f2 |
result = dns_rbt_create(mctx, NULL, NULL, &mytree);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
/* Insert test data into the tree. */
|
|
Packit Service |
ae04f2 |
for (i = 0; i < maxvalue; i++) {
|
|
Packit Service |
ae04f2 |
snprintf(namestr, sizeof(namestr), "name%u.example.org.", i);
|
|
Packit Service |
ae04f2 |
node = NULL;
|
|
Packit Service |
ae04f2 |
result = insert_helper(mytree, namestr, &node);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
node->data = (void *) (intptr_t) i;
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = isc_time_now(&ts1;;
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
nthreads = ISC_MIN(isc_os_ncpus(), 32);
|
|
Packit Service |
ae04f2 |
nthreads = ISC_MAX(nthreads, 1);
|
|
Packit Service |
ae04f2 |
for (i = 0; i < nthreads; i++) {
|
|
Packit Service |
ae04f2 |
result = isc_thread_create(find_thread, mytree, &threads[i]);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
for (i = 0; i < nthreads; i++) {
|
|
Packit Service |
ae04f2 |
result = isc_thread_join(threads[i], NULL);
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
result = isc_time_now(&ts2;;
|
|
Packit Service |
ae04f2 |
assert_int_equal(result, ISC_R_SUCCESS);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
t = isc_time_microdiff(&ts2, &ts1;;
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
printf("%u findnode calls, %f seconds, %f calls/second\n",
|
|
Packit Service |
ae04f2 |
nthreads * 8 * 4000000, t / 1000000.0,
|
|
Packit Service |
ae04f2 |
(nthreads * 8 * 4000000) / (t / 1000000.0));
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
free(values);
|
|
Packit Service |
ae04f2 |
free(names);
|
|
Packit Service |
ae04f2 |
free(fnames);
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
dns_rbt_destroy(&mytree);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
#endif /* DNS_BENCHMARK_TESTS */
|
|
Packit Service |
ae04f2 |
#endif /* ISC_PLATFORM_USETHREADS */
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
int
|
|
Packit Service |
ae04f2 |
main(void) {
|
|
Packit Service |
ae04f2 |
const struct CMUnitTest tests[] = {
|
|
Packit Service |
ae04f2 |
cmocka_unit_test_setup_teardown(rbt_create, _setup, _teardown),
|
|
Packit Service |
ae04f2 |
cmocka_unit_test_setup_teardown(rbt_nodecount,
|
|
Packit Service |
ae04f2 |
_setup, _teardown),
|
|
Packit Service |
ae04f2 |
cmocka_unit_test_setup_teardown(rbtnode_get_distance,
|
|
Packit Service |
ae04f2 |
_setup, _teardown),
|
|
Packit Service |
ae04f2 |
cmocka_unit_test_setup_teardown(rbt_check_distance_random,
|
|
Packit Service |
ae04f2 |
_setup, _teardown),
|
|
Packit Service |
ae04f2 |
cmocka_unit_test_setup_teardown(rbt_check_distance_ordered,
|
|
Packit Service |
ae04f2 |
_setup, _teardown),
|
|
Packit Service |
ae04f2 |
cmocka_unit_test_setup_teardown(rbt_insert, _setup, _teardown),
|
|
Packit Service |
ae04f2 |
cmocka_unit_test_setup_teardown(rbt_remove, _setup, _teardown),
|
|
Packit Service |
ae04f2 |
cmocka_unit_test_setup_teardown(rbt_insert_and_remove,
|
|
Packit Service |
ae04f2 |
_setup, _teardown),
|
|
Packit Service |
ae04f2 |
cmocka_unit_test_setup_teardown(rbt_findname,
|
|
Packit Service |
ae04f2 |
_setup, _teardown),
|
|
Packit Service |
ae04f2 |
cmocka_unit_test_setup_teardown(rbt_addname, _setup, _teardown),
|
|
Packit Service |
ae04f2 |
cmocka_unit_test_setup_teardown(rbt_deletename,
|
|
Packit Service |
ae04f2 |
_setup, _teardown),
|
|
Packit Service |
ae04f2 |
cmocka_unit_test_setup_teardown(rbt_nodechain,
|
|
Packit Service |
ae04f2 |
_setup, _teardown),
|
|
Packit Service |
ae04f2 |
#ifdef ISC_PLATFORM_USETHREADS
|
|
Packit Service |
ae04f2 |
#ifdef DNS_BENCHMARK_TESTS
|
|
Packit Service |
ae04f2 |
cmocka_unit_test_setup_teardown(benchmark, _setup, _teardown),
|
|
Packit Service |
ae04f2 |
#endif /* DNS_BENCHMARK_TESTS */
|
|
Packit Service |
ae04f2 |
#endif /* ISC_PLATFORM_USETHREADS */
|
|
Packit Service |
ae04f2 |
};
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
return (cmocka_run_group_tests(tests, dns_test_init, dns_test_final));
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
#else /* HAVE_CMOCKA */
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
#include <stdio.h>
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
int
|
|
Packit Service |
ae04f2 |
main(void) {
|
|
Packit Service |
ae04f2 |
printf("1..0 # Skipped: cmocka not available\n");
|
|
Packit Service |
ae04f2 |
return (0);
|
|
Packit Service |
ae04f2 |
}
|
|
Packit Service |
ae04f2 |
|
|
Packit Service |
ae04f2 |
#endif
|