some Fossies-reported spelling errors were accidentally left unfixed

This commit is contained in:
Evan Hunt
2020-02-21 14:12:42 -08:00
parent 2296df45d5
commit a2aa29ed4f
20 changed files with 65 additions and 65 deletions

View File

@@ -16,14 +16,14 @@ See COPYRIGHT in the source root or http://isc.org/copyright.html for terms.
* dnssec-signzone should add cds and/or cdnskey to zone apex iff the
DNSKEY is published and is signing the DNSKEY RRset. CDS and CDNSKEY
records are only removed if there is a deletion date set (implicit on
matching DNSKEY going inactive / unpublished or explict).
matching DNSKEY going inactive / unpublished or explicit).
Non-matching CDS and CDNSKEY are removed.
* auto-dnssec maintain should cds and/or cdnskey to zone apex iff the
DNSKEY is published and is signing the DNSKEY RRset. CDS and CDNSKEY
records are only removed if there is a deletion date set (implicit on
matching DNSKEY going inactive / unpublished or explict).
matching DNSKEY going inactive / unpublished or explicit).
* UPDATE should check that CDS and CDNSKEY match a active DNSKEY that
is signing the DNSKEY RRset and ignore otherwise. This should be

View File

@@ -53,7 +53,7 @@ Implementation:
the valid compression methods of the RBT. All nodes of the RBT
will have an offset excluding the root node.
The local compression RBT will be initalised with the owner name
The local compression RBT will be initialised with the owner name
and the start of the rdata will be recorded.
We will use deepest partial match to find the potential
@@ -70,7 +70,7 @@ Functions:
dns_result_t
dns_compress_init(dns_compress_t *cctx, int edns, isc_mem_t *mctx);
Initalises cctx to empty and sets whether 16 bit global
Initialises cctx to empty and sets whether 16 bit global
compression targets are to be added to the global RBT based on the
edns value.
@@ -78,7 +78,7 @@ Functions:
dns_compress_localinit(dns_compress_t *cctx, dns_name_t *owner,
isc_buffer_t *target);
Initalise a RBT for local compression, freeing and existing RBT.
Initialise a RBT for local compression, freeing and existing RBT.
Record current offset.
dns_compress_invalidate(dns_compress_t *cctx);
@@ -130,7 +130,7 @@ Functions:
Find the best best match in the global / local RBT. Returns prefix,
suffix and offset of the bestmatch. Findglobal(), findlocal()
requires as workspace as it may be neccessary to spit a bit stream
requires as workspace as it may be necessary to spit a bit stream
label. The result prefix will be such that it can be added to the
wire format followed by a compression pointer pointing to offset.
Suffix is returned so that it is possible to add the compression
@@ -143,7 +143,7 @@ Functions:
Add compression pointers pointing to lebels (if any) in prefix.
The offset to the first label is passed in offset.
Dependancy:
Dependency:
Requires RBT deepest match.
Requires the ability to walk the RBT and remove any node which

View File

@@ -11,7 +11,7 @@ Overview.
In general the resolver / nameserver should accept any compression
method at any time regardless of whether it was legal to
send it. This fits with the priciple of being liberal with
send it. This fits with the principle of being liberal with
what you accept and strict with what you send.
There are a few cases where it does not make sense to accept
@@ -20,7 +20,7 @@ Overview.
or in a question.
When performing regression testing however we should be as strict
as possible. Hence we need to be able modifiy the behaviour of the
as possible. Hence we need to be able modify the behaviour of the
decompression routines.
To be able to decompress a domain name we need some or all of the
@@ -53,13 +53,13 @@ Functions:
void
dns_decompress_init(dns_decompress_t *dctx, int edns,
bool strict);
initalise dctx
initialise dctx
dctx->ownername is invalidated
void
dns_decompress_localinit(dns_decompress_t *dctx, dns_name_t *name,
isc_buffer_t *source);
initalise dctx->ownername
initialise dctx->ownername
record source->current to dctx->rdata
void

View File

@@ -91,7 +91,7 @@ is set for a zone.
signing process. This likely will go away in favor of a new method.
1. `sig-validity-interval`: Specifies the number of days a signature is valid.
The second optional value is the refresh interval. Thos option will
The second optional value is the refresh interval. Those option will
be replaced by KASP configuration values "signatures-validity" and
"signatures-refresh".

View File

@@ -82,7 +82,7 @@ struct isc_socketevent {
unsigned int dscp; /*%< UDP dscp value */
};
A convience function will be provided to allocate and intialize the structure.
A convenience function will be provided to allocate and initialize the structure.
isc_socketevent_t *
isc_socket_socketevent(isc_socket_t *sock0, isc_eventtype_t eventtype,

View File

@@ -22,7 +22,7 @@ any, libraries will write log messages.
FUNDAMENTALS
This section describes the basics of how the system works, introduces
terms and defines C preprocessor symbols used in conjuction with
terms and defines C preprocessor symbols used in conjunction with
logging functions. Actual uses of functions are demonstrated in the
following two sections.
@@ -115,7 +115,7 @@ no version control.
Since null channels go nowhere, no additional destination
specification is necessary.
The words "destination" and "channel" can be used interchangably in
The words "destination" and "channel" can be used interchangeably in
some contexts. Referring to a file channel, for example, means a
channel that has a file destination.
@@ -154,7 +154,7 @@ corresponding print strings appear in a log message:
You can set all four of those options with ISC_LOG_PRINTALL.
Syslog channels do not need ISC_LOG_PRINTTIME, but it is usally a good
Syslog channels do not need ISC_LOG_PRINTTIME, but it is usually a good
idea for file and file descriptor feeds.
The additional option does not affect formatting. It is
@@ -286,7 +286,7 @@ rudimentary initialization of both.
if (isc_log_create(mctx, &lctx, &lcfg) != ISC_R_SUCCESS))
oops_it_didnt_work();
3) Initalize any additional libraries. The convention for the name of
3) Initialize any additional libraries. The convention for the name of
the initialization function is {library}_log_init, with just a pointer
to the logging context as an argument. The function can only be
called once in a program or it will generate an assertion error.
@@ -376,7 +376,7 @@ isc_log_usechannel(). When it is all ready:
result = isc_logconfig_use(lctx, newlcfg);
If the new configration is successfully installed, then the old one
If the new configuration is successfully installed, then the old one
will be destroyed, freeing all memory it used.
There are three additional functions you might find useful in your
@@ -479,7 +479,7 @@ ISC_LOG_PRINTMODULE. On rare occasion it might be necessary to
differentiate very similar messages in the same module.
When available, include standard library return codes via %s in the
format string, with strerrr(errno) from the system libary or functions
format string, with strerrr(errno) from the system library or functions
like isc_result_totext(result) and dns_result_totext(result).
THINGS I AM NOT KEEN ABOUT

View File

@@ -72,7 +72,7 @@ UDP listener sockets automatically create an array of 'child' sockets,
each associated with one networker, and all listening on the same address
via `SO_REUSEADDR`. (The parent's reference counter is used for all the
parent and child sockets together; none are destroyed until there are no
remaining referenes to any of tem.)
remaining references to any of tem.)
## TCP listening

View File

@@ -34,7 +34,7 @@ Algorithms_, Cormen, Leiserson, and Rivest, MIT Press / McGraw Hill,
In BIND9, the red-black tree implementation uses DNS names as keys,
and can store arbitrary data with each key value. "name" and "key"
are used interchangably in this document.
are used interchangeably in this document.
The basic red-black tree algorithm is further adapted for use in BIND9
to incorporate the notion of hierarchy, creating a tree of red-black
@@ -227,7 +227,7 @@ Each node in the tree of trees is represented by the following structure:
/*
* The following bitfields add up to a total bitwidth of 32.
* The range of values necessary for each item is indicated,
* but in the case of "attributes" the field is wider to accomodate
* but in the case of "attributes" the field is wider to accommodate
* possible future expansion. "offsetlen" could be one bit
* narrower by always adjusting its value by 1 to find the real
* offsetlen, but doing so does not gain anything (except perhaps

View File

@@ -9,7 +9,7 @@ See COPYRIGHT in the source root or http://isc.org/copyright.html for terms.
* check that each RRSIG set has a valid RRSIG and that all DNSKEY algorithms
in use are checked.
* provide a mechanism to mark DNSKEY algorithms to be ignored to support
verification of zones that are in the processs of adding/removing
verification of zones that are in the process of adding/removing
support for a algorithm.
* provide a mechanism to check the zone as of a specified date and time.
* check that RRSIG won't expire within the TTL interval.

View File

@@ -7,7 +7,7 @@ See COPYRIGHT in the source root or http://isc.org/copyright.html for terms.
Overview
Zones are the unit of delegation in the DNS and may go from holding
RR's only at the zone top to holding the complete hierachy (private
RR's only at the zone top to holding the complete hierarchy (private
roots zones). Zones have an associated database which is the
container for the RR sets that make up the zone.
@@ -56,7 +56,7 @@ Overview
support IXFR requests. While the entire contents of the old
version does not need to be kept, a change log needs to be
kept. An index into this log would be useful in speeding
up replies. These versions have an explict expiry date.
up replies. These versions have an explicit expiry date.
"How long are we going to keep them operationally?"
While there are expriry dates based on last update /
@@ -102,7 +102,7 @@ Overview
Compatibility:
Zones are required to be configuration file compatable with
Zones are required to be configuration file compatible with
BIND 8.x.
Types: