* PERFORMANCE OF THIS SOFTWARE.
*/
-/* $Id: gen-unix.h,v 1.19 2007/06/19 23:47:16 tbox Exp $ */
+/* $Id: gen-unix.h,v 1.20 2009/01/17 14:23:37 fdupont Exp $ */
/*! \file
* \brief
* directly portable between Unix-like systems and Windows NT, option
* parsing and directory scanning. It is here because it was decided
* that the "gen" build utility was not to depend on libisc.a, so
- * the functions delcared in isc/commandline.h and isc/dir.h could not
+ * the functions declared in isc/commandline.h and isc/dir.h could not
* be used.
*
* The commandline stuff is really just a wrapper around getopt().
* SUCH DAMAGE.
*/
-/* $Id: gen-win32.h,v 1.23 2007/06/19 23:47:16 tbox Exp $ */
+/* $Id: gen-win32.h,v 1.24 2009/01/17 14:24:25 fdupont Exp $ */
/*! \file
* \author Principal Authors: Computer Systems Research Group at UC Berkeley
* directly portable between Unix-like systems and Windows NT, option
* parsing and directory scanning. It is here because it was decided
* that the "gen" build utility was not to depend on libisc.a, so
- * the functions delcared in isc/commandline.h and isc/dir.h could not
+ * the functions declared in isc/commandline.h and isc/dir.h could not
* be used.
*
* The commandline stuff is pretty much a straight copy from the initial
* PERFORMANCE OF THIS SOFTWARE.
*/
-/* $Id: journal.c,v 1.103 2008/09/25 02:01:45 marka Exp $ */
+/* $Id: journal.c,v 1.104 2009/01/17 14:28:17 fdupont Exp $ */
#include <config.h>
#include <dns/soa.h>
/*! \file
- * \brief Journalling.
+ * \brief Journaling.
*
* A journal file consists of
*
return (result);
}
-/* Journalling */
+/* Journaling */
/*%
* On-disk representation of a "pointer" to a journal entry.
dns_rdata_init(&j->it.rdata);
/*
- * Set up empty initial buffers for uncheched and checked
+ * Set up empty initial buffers for unchecked and checked
* wire format RR data. They will be reallocated
* later.
*/
dns_diff_init(j->mctx, &diff);
/*
- * Set up empty initial buffers for uncheched and checked
+ * Set up empty initial buffers for unchecked and checked
* wire format transaction data. They will be reallocated
* later.
*/
dns_diff_init(j->mctx, &diff);
/*
- * Set up empty initial buffers for uncheched and checked
+ * Set up empty initial buffers for unchecked and checked
* wire format transaction data. They will be reallocated
* later.
*/
* PERFORMANCE OF THIS SOFTWARE.
*/
-/* $Id: master.c,v 1.172 2008/11/30 23:49:21 marka Exp $ */
+/* $Id: master.c,v 1.173 2009/01/17 14:32:33 fdupont Exp $ */
/*! \file */
/*
* Find type in rdatalist.
* If it does not exist create new one and prepend to list
- * as this will mimimise list traversal.
+ * as this will minimise list traversal.
*/
if (ictx->glue != NULL)
this = ISC_LIST_HEAD(glue_list);
* PERFORMANCE OF THIS SOFTWARE.
*/
-/* $Id: masterdump.c,v 1.95 2008/12/12 04:41:25 marka Exp $ */
+/* $Id: masterdump.c,v 1.96 2009/01/17 14:33:54 fdupont Exp $ */
/*! \file */
/*
* Do not return ISC_R_NOSPACE if the line break string
* buffer is too small, because that would just make
- * dump_rdataset() retry indenfinitely with ever
+ * dump_rdataset() retry indefinitely with ever
* bigger target buffers. That's a different buffer,
* so it won't help. Use DNS_R_TEXTTOOLONG as a substitute.
*/
* PERFORMANCE OF THIS SOFTWARE.
*/
-/* $Id: message.c,v 1.245 2008/09/24 02:46:22 marka Exp $ */
+/* $Id: message.c,v 1.246 2009/01/17 14:35:40 fdupont Exp $ */
/*! \file */
/*%
* "helper" type, which consists of a block of some type, and is linkable.
* For it to work, sizeof(dns_msgblock_t) must be a multiple of the pointer
- * size, or the allocated elements will not be alligned correctly.
+ * size, or the allocated elements will not be aligned correctly.
*/
struct dns_msgblock {
unsigned int count;
*
* XXXMLG Need to change this when
* dns_rdataset_towire() can render partial
- * sets starting at some arbitary point in the
+ * sets starting at some arbitrary point in the
* set. This will include setting a bit in the
* rdataset to indicate that a partial
* rendering was done, and some state saved
/*
* Principal Author: Brian Wellington
- * $Id: openssl_link.c,v 1.22 2008/04/05 23:47:11 tbox Exp $
+ * $Id: openssl_link.c,v 1.23 2009/01/17 14:39:28 fdupont Exp $
*/
#ifdef OPENSSL
for (e = ENGINE_get_first(); e != NULL; e = ENGINE_get_next(e)) {
/*
- * Something wierd here. If we call ENGINE_finish()
+ * Something weird here. If we call ENGINE_finish()
* ENGINE_get_default_RAND() will fail.
*/
if (ENGINE_init(e)) {
*
* 'engine_id' is the openssl engine name.
*
- * pre_cmds and post_cmds a sequence if command arguement pairs
+ * pre_cmds and post_cmds a sequence if command argument pairs
* pre_num and post_num are a count of those pairs.
*
* "SO_PATH", PKCS11_SO_PATH ("/usr/local/lib/engines/engine_pkcs11.so")
/*
* Principal Author: Brian Wellington
- * $Id: opensslrsa_link.c,v 1.22 2009/01/14 23:48:00 tbox Exp $
+ * $Id: opensslrsa_link.c,v 1.23 2009/01/17 14:41:43 fdupont Exp $
*/
#ifdef OPENSSL
#ifndef USE_EVP
/*
- * XXXMPA Temporarially disable RSA_BLINDING as it requires
- * good quality random data that cannot currently be guarenteed.
+ * XXXMPA Temporarily disable RSA_BLINDING as it requires
+ * good quality random data that cannot currently be guaranteed.
* XXXMPA Find which versions of openssl use pseudo random data
* and set RSA_FLAG_BLINDING for those.
*/
* PERFORMANCE OF THIS SOFTWARE.
*/
-/* $Id: rbt.c,v 1.142 2008/09/24 02:46:22 marka Exp $ */
+/* $Id: rbt.c,v 1.143 2009/01/17 14:45:17 fdupont Exp $ */
/*! \file */
* Chain management.
*
* The "ancestors" member of chains were removed, with their job now
- * being wholy handled by parent pointers (which didn't exist, because
+ * being wholly handled by parent pointers (which didn't exist, because
* of memory concerns, when chains were first implemented).
*/
#define ADD_LEVEL(chain, node) \
} else {
/*
* Child is parent's right child.
- * Everything is doen the same as above,
+ * Everything is done the same as above,
* except mirrored.
*/
sibling = LEFT(parent);
* reached without having traversed any left links, ascend one
* level and look for either a right link off the point of
* ascent, or search for a left link upward again, repeating
- * ascents until either case is true.
+ * ascends until either case is true.
*/
do {
while (! IS_ROOT(current)) {