mirror of
https://github.com/isc-projects/bind9.git
synced 2026-03-16 07:32:57 -04:00
086b63f56d
Replace the ISC_LIST based deadnodes implementation with isc_queue which is wait-free and we don't have to acquire neither the tree nor node lock to append nodes to the queue and the cleaning process can also copy (splice) the list into a local copy without acquiring the list. Currently, there's little benefit to this as we need to hold those locks anyway, but in the future as we move to RCU based implementation, this will be ready. To align the cleaning with our event loop based model, remove the hardcoded count for the node locks and use the number of the event loops instead. This way, each event loop can have its own cleaning as part of the process. Use uniform random numbers to spread the nodes evenly between the buckets (instead of hashing the domain name).
219 lines
6.4 KiB
C
219 lines
6.4 KiB
C
/*
|
|
* Copyright (C) Internet Systems Consortium, Inc. ("ISC")
|
|
*
|
|
* SPDX-License-Identifier: MPL-2.0
|
|
*
|
|
* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, you can obtain one at https://mozilla.org/MPL/2.0/.
|
|
*
|
|
* See the COPYRIGHT file distributed with this work for additional
|
|
* information regarding copyright ownership.
|
|
*/
|
|
|
|
#include <inttypes.h>
|
|
#include <sched.h> /* IWYU pragma: keep */
|
|
#include <setjmp.h>
|
|
#include <stdarg.h>
|
|
#include <stddef.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <unistd.h>
|
|
|
|
#define UNIT_TESTING
|
|
#include <cmocka.h>
|
|
|
|
#include <isc/util.h>
|
|
|
|
#include <dns/rbt.h>
|
|
#include <dns/rdatalist.h>
|
|
#include <dns/rdataset.h>
|
|
#include <dns/rdatastruct.h>
|
|
#define KEEP_BEFORE
|
|
|
|
/* Include the main file */
|
|
|
|
#pragma GCC diagnostic push
|
|
#pragma GCC diagnostic ignored "-Wshadow"
|
|
#undef CHECK
|
|
#include "qpcache.c"
|
|
#pragma GCC diagnostic pop
|
|
|
|
#undef CHECK
|
|
#include <tests/dns.h>
|
|
|
|
/* Set to true (or use -v option) for verbose output */
|
|
static bool verbose = false;
|
|
|
|
/*
|
|
* Add to a cache DB 'db' an rdataset of type 'rtype' at a name
|
|
* <idx>.example.com. The rdataset would contain one data, and rdata_len is
|
|
* its length. 'rtype' is supposed to be some private type whose data can be
|
|
* arbitrary (and it doesn't matter in this test).
|
|
*/
|
|
static void
|
|
overmempurge_addrdataset(dns_db_t *db, isc_stdtime_t now, int idx,
|
|
dns_rdatatype_t rtype, size_t rdata_len,
|
|
bool longname) {
|
|
isc_result_t result;
|
|
dns_rdata_t rdata;
|
|
dns_dbnode_t *node = NULL;
|
|
dns_rdatalist_t rdatalist;
|
|
dns_rdataset_t rdataset;
|
|
dns_fixedname_t fname;
|
|
dns_name_t *name;
|
|
char namebuf[DNS_NAME_FORMATSIZE];
|
|
unsigned char rdatabuf[65535] = { 0 }; /* large enough for any valid
|
|
RDATA */
|
|
|
|
REQUIRE(rdata_len <= sizeof(rdatabuf));
|
|
|
|
if (longname) {
|
|
/*
|
|
* Build a longest possible name (in wire format) that would
|
|
* result in a new rbt node with the long name data.
|
|
*/
|
|
snprintf(namebuf, sizeof(namebuf),
|
|
"%010d.%010dabcdef%010dabcdef%010dabcdef%010dabcde."
|
|
"%010dabcdef%010dabcdef%010dabcdef%010dabcde."
|
|
"%010dabcdef%010dabcdef%010dabcdef%010dabcde."
|
|
"%010dabcdef%010dabcdef%010dabcdef01.",
|
|
idx, idx, idx, idx, idx, idx, idx, idx, idx, idx, idx,
|
|
idx, idx, idx, idx, idx);
|
|
} else {
|
|
snprintf(namebuf, sizeof(namebuf), "%d.example.com.", idx);
|
|
}
|
|
dns_test_namefromstring(namebuf, &fname);
|
|
name = dns_fixedname_name(&fname);
|
|
|
|
result = dns_db_findnode(db, name, true, &node);
|
|
assert_int_equal(result, ISC_R_SUCCESS);
|
|
assert_non_null(node);
|
|
|
|
dns_rdata_init(&rdata);
|
|
rdata.length = rdata_len;
|
|
rdata.data = rdatabuf;
|
|
rdata.rdclass = dns_rdataclass_in;
|
|
rdata.type = rtype;
|
|
|
|
dns_rdatalist_init(&rdatalist);
|
|
rdatalist.rdclass = dns_rdataclass_in;
|
|
rdatalist.type = rtype;
|
|
rdatalist.ttl = 3600;
|
|
ISC_LIST_APPEND(rdatalist.rdata, &rdata, link);
|
|
|
|
dns_rdataset_init(&rdataset);
|
|
dns_rdatalist_tordataset(&rdatalist, &rdataset);
|
|
|
|
result = dns_db_addrdataset(db, node, NULL, now, &rdataset, 0, NULL);
|
|
assert_int_equal(result, ISC_R_SUCCESS);
|
|
|
|
dns_db_detachnode(db, &node);
|
|
}
|
|
|
|
ISC_LOOP_TEST_IMPL(overmempurge_bigrdata) {
|
|
size_t maxcache = 2097152U; /* 2MB - same as DNS_CACHE_MINSIZE */
|
|
size_t hiwater = maxcache - (maxcache >> 3); /* borrowed from cache.c */
|
|
size_t lowater = maxcache - (maxcache >> 2); /* ditto */
|
|
isc_result_t result;
|
|
dns_db_t *db = NULL;
|
|
isc_mem_t *mctx2 = NULL;
|
|
isc_stdtime_t now = isc_stdtime_now();
|
|
size_t i;
|
|
|
|
isc_mem_create(&mctx2);
|
|
|
|
result = dns_db_create(mctx2, CACHEDB_DEFAULT, dns_rootname,
|
|
dns_dbtype_cache, dns_rdataclass_in, 0, NULL,
|
|
&db);
|
|
assert_int_equal(result, ISC_R_SUCCESS);
|
|
|
|
isc_mem_setwater(mctx2, hiwater, lowater);
|
|
|
|
/*
|
|
* Add cache entries with minimum size of data until 'overmem'
|
|
* condition is triggered.
|
|
* This should eventually happen, but we also limit the number of
|
|
* iteration to avoid an infinite loop in case something gets wrong.
|
|
*/
|
|
for (i = 0; !isc_mem_isovermem(mctx2) && i < (maxcache / 10); i++) {
|
|
overmempurge_addrdataset(db, now, i, 50053, 0, false);
|
|
}
|
|
assert_true(isc_mem_isovermem(mctx2));
|
|
|
|
/*
|
|
* Then try to add the same number of entries, each has very large data.
|
|
* 'overmem purge' should keep the total cache size from exceeding
|
|
* the 'hiwater' mark too much. So we should be able to assume the
|
|
* cache size doesn't reach the "max".
|
|
*/
|
|
while (i-- > 0) {
|
|
overmempurge_addrdataset(db, now, i, 50054, 65535, false);
|
|
if (verbose) {
|
|
print_message("# inuse: %zd max: %zd\n",
|
|
isc_mem_inuse(mctx2), maxcache);
|
|
}
|
|
assert_true(isc_mem_inuse(mctx2) < maxcache);
|
|
}
|
|
|
|
dns_db_detach(&db);
|
|
isc_mem_destroy(&mctx2);
|
|
isc_loopmgr_shutdown(loopmgr);
|
|
}
|
|
|
|
ISC_LOOP_TEST_IMPL(overmempurge_longname) {
|
|
size_t maxcache = 2097152U; /* 2MB - same as DNS_CACHE_MINSIZE */
|
|
size_t hiwater = maxcache - (maxcache >> 3); /* borrowed from cache.c */
|
|
size_t lowater = maxcache - (maxcache >> 2); /* ditto */
|
|
isc_result_t result;
|
|
dns_db_t *db = NULL;
|
|
isc_mem_t *mctx2 = NULL;
|
|
isc_stdtime_t now = isc_stdtime_now();
|
|
size_t i;
|
|
|
|
isc_mem_create(&mctx2);
|
|
|
|
result = dns_db_create(mctx2, CACHEDB_DEFAULT, dns_rootname,
|
|
dns_dbtype_cache, dns_rdataclass_in, 0, NULL,
|
|
&db);
|
|
assert_int_equal(result, ISC_R_SUCCESS);
|
|
|
|
isc_mem_setwater(mctx2, hiwater, lowater);
|
|
|
|
/*
|
|
* Add cache entries with minimum size of data until 'overmem'
|
|
* condition is triggered.
|
|
* This should eventually happen, but we also limit the number of
|
|
* iteration to avoid an infinite loop in case something gets wrong.
|
|
*/
|
|
for (i = 0; !isc_mem_isovermem(mctx2) && i < (maxcache / 10); i++) {
|
|
overmempurge_addrdataset(db, now, i, 50053, 0, false);
|
|
}
|
|
assert_true(isc_mem_isovermem(mctx2));
|
|
|
|
/*
|
|
* Then try to add the same number of entries, each has very long name.
|
|
* 'overmem purge' should keep the total cache size from not exceeding
|
|
* the 'hiwater' mark too much. So we should be able to assume the cache
|
|
* size doesn't reach the "max".
|
|
*/
|
|
while (i-- > 0) {
|
|
overmempurge_addrdataset(db, now, i, 50054, 0, true);
|
|
if (verbose) {
|
|
print_message("# inuse: %zd max: %zd\n",
|
|
isc_mem_inuse(mctx2), maxcache);
|
|
}
|
|
assert_true(isc_mem_inuse(mctx2) < maxcache);
|
|
}
|
|
|
|
dns_db_detach(&db);
|
|
isc_mem_destroy(&mctx2);
|
|
isc_loopmgr_shutdown(loopmgr);
|
|
}
|
|
|
|
ISC_TEST_LIST_START
|
|
ISC_TEST_ENTRY_CUSTOM(overmempurge_bigrdata, setup_managers, teardown_managers)
|
|
ISC_TEST_ENTRY_CUSTOM(overmempurge_longname, setup_managers, teardown_managers)
|
|
ISC_TEST_LIST_END
|
|
|
|
ISC_TEST_MAIN
|