Commit b6574683 authored by Francis Dupont's avatar Francis Dupont

spelling

parent 09eaa8e3
......@@ -15,7 +15,7 @@
* PERFORMANCE OF THIS SOFTWARE.
*/
/* $Id: entropy.h,v 1.32 2007/06/19 23:47:18 tbox Exp $ */
/* $Id: entropy.h,v 1.33 2009/01/17 23:04:25 fdupont Exp $ */
#ifndef ISC_ENTROPY_H
#define ISC_ENTROPY_H 1
......@@ -103,7 +103,7 @@ typedef void (*isc_entropystop_t)(isc_entropysource_t *source, void *arg);
/*!
* \brief
* Estimate the amount of entropy contained in the sample pool.
* If this is not set, the source will be gathered and perodically
* If this is not set, the source will be gathered and periodically
* mixed into the entropy pool, but no increment in contained entropy
* will be assumed. This flag only makes sense on sample sources.
*/
......
......@@ -15,7 +15,7 @@
* PERFORMANCE OF THIS SOFTWARE.
*/
/* $Id: file.h,v 1.33 2007/06/19 23:47:18 tbox Exp $ */
/* $Id: file.h,v 1.34 2009/01/17 23:06:37 fdupont Exp $ */
#ifndef ISC_FILE_H
#define ISC_FILE_H 1
......@@ -35,7 +35,7 @@ isc_file_settime(const char *file, isc_time_t *time);
isc_result_t
isc_file_getmodtime(const char *file, isc_time_t *time);
/*!<
* \brief Get the time of last modication of a file.
* \brief Get the time of last modification of a file.
*
* Notes:
*\li The time that is set is relative to the (OS-specific) epoch, as are
......
......@@ -15,7 +15,7 @@
* PERFORMANCE OF THIS SOFTWARE.
*/
/* $Id: fsaccess.h,v 1.14 2007/06/19 23:47:18 tbox Exp $ */
/* $Id: fsaccess.h,v 1.15 2009/01/17 23:09:51 fdupont Exp $ */
#ifndef ISC_FSACCESS_H
#define ISC_FSACCESS_H 1
......@@ -25,8 +25,8 @@
* and directory access permissions into one API that is meant to be
* portable to multiple operating systems.
*
* The two primary operating system flavors that are initially accomodated are
* POSIX and Windows NT 4.0 and later. The Windows NT access model is
* The two primary operating system flavors that are initially accommodated
* are POSIX and Windows NT 4.0 and later. The Windows NT access model is
* considerable more flexible than POSIX's model (as much as I am loathe to
* admit it), and so the ISC API has a higher degree of complexity than would
* be needed to simply address POSIX's needs.
......@@ -88,7 +88,7 @@
*
* The rest of this comment discusses a few of the incompatibilities
* between the two systems that need more thought if this API is to
* be extended to accomodate them.
* be extended to accommodate them.
*
* The Windows standard access right "DELETE" doesn't have a direct
* equivalent in the Unix world, so it isn't clear what should be done
......@@ -98,7 +98,7 @@
* of allowing users to create files in a directory but not delete or
* rename them, it does not have a concept of allowing them to be deleted
* if they are owned by the user trying to delete/rename. While it is
* probable that something could be cobbled together in NT 5 with inheritence,
* probable that something could be cobbled together in NT 5 with inheritance,
* it can't really be done in NT 4 as a single property that you could
* set on a directory. You'd need to coordinate something with file creation
* so that every file created had DELETE set for the owner but noone else.
......@@ -156,7 +156,7 @@
* Adding any permission bits beyond 0x200 would mean typedef'ing
* isc_fsaccess_t as isc_uint64_t, and redefining this value to
* reflect the new range of permission types, Probably to 21 for
* maximum flexibility. The number of bits has to accomodate all of
* maximum flexibility. The number of bits has to accommodate all of
* the permission types, and three full sets of them have to fit
* within an isc_fsaccess_t.
*/
......
......@@ -15,7 +15,7 @@
* PERFORMANCE OF THIS SOFTWARE.
*/
/* $Id: hash.h,v 1.10 2007/06/19 23:47:18 tbox Exp $ */
/* $Id: hash.h,v 1.11 2009/01/17 23:12:09 fdupont Exp $ */
#ifndef ISC_HASH_H
#define ISC_HASH_H 1
......@@ -36,7 +36,7 @@
* in the random vector are unpredictable, the probability of hash
* collision between arbitrary two different values is at most 1/2^16.
*
* Altough the API is generic about the hash keys, it mainly expects
* Although the API is generic about the hash keys, it mainly expects
* DNS names (and sometimes IPv4/v6 addresses) as inputs. It has an
* upper limit of the input length, and may run slow to calculate the
* hash values for large inputs.
......
......@@ -15,7 +15,7 @@
* PERFORMANCE OF THIS SOFTWARE.
*/
/* $Id: heap.h,v 1.24 2007/06/19 23:47:18 tbox Exp $ */
/* $Id: heap.h,v 1.25 2009/01/17 23:13:19 fdupont Exp $ */
#ifndef ISC_HEAP_H
#define ISC_HEAP_H 1
......@@ -28,7 +28,7 @@
ISC_LANG_BEGINDECLS
/*%
* The comparision function returns ISC_TRUE if the first argument has
* The comparison function returns ISC_TRUE if the first argument has
* higher priority than the second argument, and ISC_FALSE otherwise.
*/
typedef isc_boolean_t (*isc_heapcompare_t)(void *, void *);
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment