2
0
mirror of https://gitlab.isc.org/isc-projects/bind9 synced 2025-08-23 10:39:16 +00:00
bind/lib/dns/rdatalist.c
Tony Finch 856a6e4afb
Give the rdataset->privateN fields more helpful names
BIND's rdataset structure is a view of some DNS records. It is
polymorphic, so the details of how the records are stored can vary.
For instance, the records can be held in an rdatalist, or in an
rdataslab in the rbtdb.

The dns_rdataset structure previously had a number of fields called
`private1` up to `private7`, which were used by the various rdataset
implementations. It was not at all clear what these fields were for,
without reading the code and working it out from context.

This change makes the rdataset inheritance hierarchy more clear. The
polymorphic part of a `struct dns_rdataset` is now a union of structs,
each of which is named for the class of implementation using it. The
fields of these structs replace the old `privateN` fields. (Note: the
term "inheritance hierarchy" refers to the fact that the builtin and
SDLZ implementations are based on and inherit from the rdatalist
implementation, which in turn inherits from the generic rdataset.

Most of this change is mechanical, but there are a few extras.

In keynode.c there were a number of REQUIRE()ments that were not
necessary: they had already been checked by the rdataset method
dispatch code. On the other hand, In ncache.c there was a public
function which needed to REQUIRE() that an rdataset was valid.

I have removed lots of "reset iterator state" comments, because it
should now be clear from `target->iter = NULL` where before
`target->private5 = NULL` could have been doing anything.

Initialization is a bit neater in a few places, using C structure
literals where appropriate.

The pointer arithmetic for translating between an rdataslab header and
its raw contents is now fractionally safer.
2023-07-17 14:50:25 +02:00

434 lines
9.6 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.
*/
/*! \file */
#include <stddef.h>
#include <string.h>
#include <isc/util.h>
#include <dns/name.h>
#include <dns/nsec3.h>
#include <dns/rdata.h>
#include <dns/rdatalist.h>
#include <dns/rdataset.h>
static dns_rdatasetmethods_t methods = {
.disassociate = dns_rdatalist_disassociate,
.first = dns_rdatalist_first,
.next = dns_rdatalist_next,
.current = dns_rdatalist_current,
.clone = dns_rdatalist_clone,
.count = dns_rdatalist_count,
.addnoqname = dns_rdatalist_addnoqname,
.getnoqname = dns_rdatalist_getnoqname,
.addclosest = dns_rdatalist_addclosest,
.getclosest = dns_rdatalist_getclosest,
.setownercase = dns_rdatalist_setownercase,
.getownercase = dns_rdatalist_getownercase,
};
void
dns_rdatalist_init(dns_rdatalist_t *rdatalist) {
REQUIRE(rdatalist != NULL);
/*
* Initialize rdatalist.
*/
*rdatalist = (dns_rdatalist_t){
.rdata = ISC_LIST_INITIALIZER,
.link = ISC_LINK_INITIALIZER,
};
memset(rdatalist->upper, 0xeb, sizeof(rdatalist->upper));
/*
* Clear upper set bit.
*/
rdatalist->upper[0] &= ~0x01;
}
void
dns_rdatalist_tordataset(dns_rdatalist_t *rdatalist, dns_rdataset_t *rdataset) {
/*
* Make 'rdataset' refer to the rdata in 'rdatalist'.
*/
REQUIRE(rdatalist != NULL);
REQUIRE(DNS_RDATASET_VALID(rdataset));
REQUIRE(!dns_rdataset_isassociated(rdataset));
/* Check if dns_rdatalist_init has was called. */
REQUIRE(rdatalist->upper[0] == 0xea);
*rdataset = (dns_rdataset_t){
.methods = &methods,
.rdclass = rdatalist->rdclass,
.type = rdatalist->type,
.covers = rdatalist->covers,
.ttl = rdatalist->ttl,
.rdlist.list = rdatalist,
.link = rdataset->link,
.count = rdataset->count,
.attributes = rdataset->attributes,
.magic = rdataset->magic,
};
}
void
dns_rdatalist_fromrdataset(dns_rdataset_t *rdataset,
dns_rdatalist_t **rdatalist) {
REQUIRE(rdatalist != NULL && rdataset != NULL);
REQUIRE(rdataset->methods == &methods);
*rdatalist = rdataset->rdlist.list;
}
void
dns_rdatalist_disassociate(dns_rdataset_t *rdataset DNS__DB_FLARG) {
UNUSED(rdataset);
}
isc_result_t
dns_rdatalist_first(dns_rdataset_t *rdataset) {
dns_rdatalist_t *rdatalist = NULL;
rdatalist = rdataset->rdlist.list;
rdataset->rdlist.iter = ISC_LIST_HEAD(rdatalist->rdata);
if (rdataset->rdlist.iter == NULL) {
return (ISC_R_NOMORE);
}
return (ISC_R_SUCCESS);
}
isc_result_t
dns_rdatalist_next(dns_rdataset_t *rdataset) {
dns_rdata_t *rdata;
rdata = rdataset->rdlist.iter;
if (rdata == NULL) {
return (ISC_R_NOMORE);
}
rdataset->rdlist.iter = ISC_LIST_NEXT(rdata, link);
if (rdataset->rdlist.iter == NULL) {
return (ISC_R_NOMORE);
}
return (ISC_R_SUCCESS);
}
void
dns_rdatalist_current(dns_rdataset_t *rdataset, dns_rdata_t *rdata) {
dns_rdata_t *list_rdata;
list_rdata = rdataset->rdlist.iter;
INSIST(list_rdata != NULL);
dns_rdata_clone(list_rdata, rdata);
}
void
dns_rdatalist_clone(dns_rdataset_t *source,
dns_rdataset_t *target DNS__DB_FLARG) {
REQUIRE(source != NULL);
REQUIRE(target != NULL);
*target = *source;
target->rdlist.iter = NULL;
}
unsigned int
dns_rdatalist_count(dns_rdataset_t *rdataset) {
dns_rdatalist_t *rdatalist;
dns_rdata_t *rdata;
unsigned int count;
REQUIRE(rdataset != NULL);
rdatalist = rdataset->rdlist.list;
count = 0;
for (rdata = ISC_LIST_HEAD(rdatalist->rdata); rdata != NULL;
rdata = ISC_LIST_NEXT(rdata, link))
{
count++;
}
return (count);
}
isc_result_t
dns_rdatalist_addnoqname(dns_rdataset_t *rdataset, const dns_name_t *name) {
dns_rdataset_t *neg = NULL;
dns_rdataset_t *negsig = NULL;
dns_rdataset_t *rdset;
dns_ttl_t ttl;
REQUIRE(rdataset != NULL);
for (rdset = ISC_LIST_HEAD(name->list); rdset != NULL;
rdset = ISC_LIST_NEXT(rdset, link))
{
if (rdset->rdclass != rdataset->rdclass) {
continue;
}
if (rdset->type == dns_rdatatype_nsec ||
rdset->type == dns_rdatatype_nsec3)
{
neg = rdset;
}
}
if (neg == NULL) {
return (ISC_R_NOTFOUND);
}
for (rdset = ISC_LIST_HEAD(name->list); rdset != NULL;
rdset = ISC_LIST_NEXT(rdset, link))
{
if (rdset->type == dns_rdatatype_rrsig &&
rdset->covers == neg->type)
{
negsig = rdset;
}
}
if (negsig == NULL) {
return (ISC_R_NOTFOUND);
}
/*
* Minimise ttl.
*/
ttl = rdataset->ttl;
if (neg->ttl < ttl) {
ttl = neg->ttl;
}
if (negsig->ttl < ttl) {
ttl = negsig->ttl;
}
rdataset->ttl = neg->ttl = negsig->ttl = ttl;
rdataset->attributes |= DNS_RDATASETATTR_NOQNAME;
rdataset->rdlist.noqname = name;
return (ISC_R_SUCCESS);
}
isc_result_t
dns_rdatalist_getnoqname(dns_rdataset_t *rdataset, dns_name_t *name,
dns_rdataset_t *neg,
dns_rdataset_t *negsig DNS__DB_FLARG) {
dns_rdataclass_t rdclass;
dns_rdataset_t *tneg = NULL;
dns_rdataset_t *tnegsig = NULL;
const dns_name_t *noqname;
REQUIRE(rdataset != NULL);
REQUIRE((rdataset->attributes & DNS_RDATASETATTR_NOQNAME) != 0);
rdclass = rdataset->rdclass;
noqname = rdataset->rdlist.noqname;
(void)dns_name_dynamic(noqname); /* Sanity Check. */
for (rdataset = ISC_LIST_HEAD(noqname->list); rdataset != NULL;
rdataset = ISC_LIST_NEXT(rdataset, link))
{
if (rdataset->rdclass != rdclass) {
continue;
}
if (rdataset->type == dns_rdatatype_nsec ||
rdataset->type == dns_rdatatype_nsec3)
{
tneg = rdataset;
}
}
if (tneg == NULL) {
return (ISC_R_NOTFOUND);
}
for (rdataset = ISC_LIST_HEAD(noqname->list); rdataset != NULL;
rdataset = ISC_LIST_NEXT(rdataset, link))
{
if (rdataset->type == dns_rdatatype_rrsig &&
rdataset->covers == tneg->type)
{
tnegsig = rdataset;
}
}
if (tnegsig == NULL) {
return (ISC_R_NOTFOUND);
}
dns_name_clone(noqname, name);
dns_rdataset_clone(tneg, neg);
dns_rdataset_clone(tnegsig, negsig);
return (ISC_R_SUCCESS);
}
isc_result_t
dns_rdatalist_addclosest(dns_rdataset_t *rdataset, const dns_name_t *name) {
dns_rdataset_t *neg = NULL;
dns_rdataset_t *negsig = NULL;
dns_rdataset_t *rdset;
dns_ttl_t ttl;
REQUIRE(rdataset != NULL);
for (rdset = ISC_LIST_HEAD(name->list); rdset != NULL;
rdset = ISC_LIST_NEXT(rdset, link))
{
if (rdset->rdclass != rdataset->rdclass) {
continue;
}
if (rdset->type == dns_rdatatype_nsec ||
rdset->type == dns_rdatatype_nsec3)
{
neg = rdset;
}
}
if (neg == NULL) {
return (ISC_R_NOTFOUND);
}
for (rdset = ISC_LIST_HEAD(name->list); rdset != NULL;
rdset = ISC_LIST_NEXT(rdset, link))
{
if (rdset->type == dns_rdatatype_rrsig &&
rdset->covers == neg->type)
{
negsig = rdset;
}
}
if (negsig == NULL) {
return (ISC_R_NOTFOUND);
}
/*
* Minimise ttl.
*/
ttl = rdataset->ttl;
if (neg->ttl < ttl) {
ttl = neg->ttl;
}
if (negsig->ttl < ttl) {
ttl = negsig->ttl;
}
rdataset->ttl = neg->ttl = negsig->ttl = ttl;
rdataset->attributes |= DNS_RDATASETATTR_CLOSEST;
rdataset->rdlist.closest = name;
return (ISC_R_SUCCESS);
}
isc_result_t
dns_rdatalist_getclosest(dns_rdataset_t *rdataset, dns_name_t *name,
dns_rdataset_t *neg,
dns_rdataset_t *negsig DNS__DB_FLARG) {
dns_rdataclass_t rdclass;
dns_rdataset_t *tneg = NULL;
dns_rdataset_t *tnegsig = NULL;
const dns_name_t *closest;
REQUIRE(rdataset != NULL);
REQUIRE((rdataset->attributes & DNS_RDATASETATTR_CLOSEST) != 0);
rdclass = rdataset->rdclass;
closest = rdataset->rdlist.closest;
(void)dns_name_dynamic(closest); /* Sanity Check. */
for (rdataset = ISC_LIST_HEAD(closest->list); rdataset != NULL;
rdataset = ISC_LIST_NEXT(rdataset, link))
{
if (rdataset->rdclass != rdclass) {
continue;
}
if (rdataset->type == dns_rdatatype_nsec ||
rdataset->type == dns_rdatatype_nsec3)
{
tneg = rdataset;
}
}
if (tneg == NULL) {
return (ISC_R_NOTFOUND);
}
for (rdataset = ISC_LIST_HEAD(closest->list); rdataset != NULL;
rdataset = ISC_LIST_NEXT(rdataset, link))
{
if (rdataset->type == dns_rdatatype_rrsig &&
rdataset->covers == tneg->type)
{
tnegsig = rdataset;
}
}
if (tnegsig == NULL) {
return (ISC_R_NOTFOUND);
}
dns_name_clone(closest, name);
dns_rdataset_clone(tneg, neg);
dns_rdataset_clone(tnegsig, negsig);
return (ISC_R_SUCCESS);
}
void
dns_rdatalist_setownercase(dns_rdataset_t *rdataset, const dns_name_t *name) {
dns_rdatalist_t *rdatalist;
unsigned int i;
/*
* We do not need to worry about label lengths as they are all
* less than or equal to 63.
*/
rdatalist = rdataset->rdlist.list;
memset(rdatalist->upper, 0, sizeof(rdatalist->upper));
for (i = 1; i < name->length; i++) {
if (name->ndata[i] >= 0x41 && name->ndata[i] <= 0x5a) {
rdatalist->upper[i / 8] |= 1 << (i % 8);
}
}
/*
* Record that upper has been set.
*/
rdatalist->upper[0] |= 0x01;
}
void
dns_rdatalist_getownercase(const dns_rdataset_t *rdataset, dns_name_t *name) {
dns_rdatalist_t *rdatalist;
unsigned int i;
rdatalist = rdataset->rdlist.list;
if ((rdatalist->upper[0] & 0x01) == 0) {
return;
}
for (i = 0; i < name->length; i++) {
/*
* Set the case bit if it does not match the recorded bit.
*/
if (name->ndata[i] >= 0x61 && name->ndata[i] <= 0x7a &&
(rdatalist->upper[i / 8] & (1 << (i % 8))) != 0)
{
name->ndata[i] &= ~0x20; /* clear the lower case bit */
} else if (name->ndata[i] >= 0x41 && name->ndata[i] <= 0x5a &&
(rdatalist->upper[i / 8] & (1 << (i % 8))) == 0)
{
name->ndata[i] |= 0x20; /* set the lower case bit */
}
}
}