Fixed common misspellings.

Mostly found by 'codespell'.
This commit is contained in:
Tobias Brunner
2011-07-20 16:14:10 +02:00
parent 20a44a5c66
commit f3bb1bd039
85 changed files with 146 additions and 146 deletions
+4 -4
View File
@@ -57,7 +57,7 @@ chunk_t chunk_create_clone(u_char *ptr, chunk_t chunk)
}
/**
* Decribed in header.
* Described in header.
*/
size_t chunk_length(const char* mode, ...)
{
@@ -87,7 +87,7 @@ size_t chunk_length(const char* mode, ...)
}
/**
* Decribed in header.
* Described in header.
*/
chunk_t chunk_create_cat(u_char *ptr, const char* mode, ...)
{
@@ -133,7 +133,7 @@ chunk_t chunk_create_cat(u_char *ptr, const char* mode, ...)
}
/**
* Decribed in header.
* Described in header.
*/
void chunk_split(chunk_t chunk, const char *mode, ...)
{
@@ -313,7 +313,7 @@ chunk_t chunk_from_hex(chunk_t hex, char *buf)
/* subtract the number of optional ':' separation characters */
len = hex.len;
ptr = hex.ptr;
for (i = 0; i < hex.len; i++)
for (i = 0; i < hex.len; i++)
{
if (*ptr++ == ':')
{
+1 -1
View File
@@ -254,7 +254,7 @@ static inline bool chunk_equals(chunk_t a, chunk_t b)
* Increment a chunk, as it would reprensent a network order integer.
*
* @param chunk chunk to increment
* @return TRUE if an overflow occured
* @return TRUE if an overflow occurred
*/
bool chunk_increment(chunk_t chunk);
+2 -2
View File
@@ -31,7 +31,7 @@ typedef enum auth_class_t auth_class_t;
/**
* Class of authentication to use. This is different to auth_method_t in that
* it does not specify a method, but a class of acceptable methods. The found
* certificate finally dictates wich method is used.
* certificate finally dictates which method is used.
*/
enum auth_class_t {
/** any class acceptable */
@@ -57,7 +57,7 @@ extern enum_name_t *auth_class_names;
* - For configs specifying local authentication behavior, the rules define
* which authentication method in which way.
* - For configs specifying remote peer authentication, the rules define
* constraints the peer has to fullfill.
* constraints the peer has to fulfill.
*
* Additionally to the rules, there is a set of helper items. These are used
* to transport credentials during the authentication process.
@@ -176,7 +176,7 @@ struct certificate_t {
/**
* Check if two certificates are equal.
*
* @param other certificate to compair against this
* @param other certificate to compare against this
* @return TRUE if certificates are equal
*/
bool (*equals)(certificate_t *this, certificate_t *other);
+1 -1
View File
@@ -111,7 +111,7 @@ struct aead_t {
* Create a aead instance using traditional transforms.
*
* @param crypter encryption transform for this aead
* @param signer integrity tranform for this aead
* @param signer integrity transform for this aead
* @return aead transform
*/
aead_t *aead_create(crypter_t *crypter, signer_t *signer);
+1 -1
View File
@@ -37,7 +37,7 @@ SUCH DAMAGE.
The license and distribution terms for any publically available version or
derivative of this code cannot be changed. i.e. this code cannot simply be
copied and put under another distrubution license
copied and put under another distribution license
[including the GNU Public License.]
The reason behind this being stated in this direct manner is past
+1 -1
View File
@@ -67,7 +67,7 @@ typedef struct __attribute__((packed)) {
u_char salt[SALT_SIZE];
u_char iv[IV_SIZE];
} nonce;
/* lenght of plain text, q */
/* length of plain text, q */
u_char q[Q_SIZE];
} b0_t;
+3 -3
View File
@@ -80,7 +80,7 @@ struct private_des_crypter_t {
des_crypter_t public;
/**
* Key size, depends on algoritm...
* Key size, depends on algorithm...
*/
size_t key_size;
@@ -127,7 +127,7 @@ YOU SHOULD NOT HAVE BOTH DES_RISC1 AND DES_RISC2 DEFINED!!!!!
#endif
/* Unroll the inner loop, this sometimes helps, sometimes hinders.
* Very mucy CPU dependant */
* Very much CPU dependent */
#ifndef DES_UNROLL
#define DES_UNROLL
#endif
@@ -316,7 +316,7 @@ YOU SHOULD NOT HAVE BOTH DES_RISC1 AND DES_RISC2 DEFINED!!!!!
* bytes, probably an issue of accessing non-word aligned objects :-( */
#ifdef DES_PTR
/* It recently occured to me that 0^0^0^0^0^0^0 == 0, so there
/* It recently occurred to me that 0^0^0^0^0^0^0 == 0, so there
* is no reason to not xor all the sub items together. This potentially
* saves a register since things can be xored directly into L */
@@ -68,7 +68,7 @@ chunk_t gcrypt_rsa_find_token(gcry_sexp_t sexp, char *name, gcry_sexp_t key)
if (key)
{
/* gcrypt might return more bytes than necessary. Truncate
* to key lenght if key given, or prepend zeros if needed */
* to key length if key given, or prepend zeros if needed */
len = gcry_pk_get_nbits(key);
len = len / 8 + (len % 8 ? 1 : 0);
if (len > data.len)
+1 -1
View File
@@ -30,7 +30,7 @@ typedef struct hmac_t hmac_t;
* Message authentication using hash functions.
*
* This class implements the message authenticaion algorithm
* described in RFC2104. It uses a hash function, wich must
* described in RFC2104. It uses a hash function, which must
* be implemented as a hasher_t class.
*/
struct hmac_t {
@@ -495,7 +495,7 @@ typedef struct {
CK_SESSION_HANDLE session;
/* pkcs11 library */
pkcs11_library_t *lib;
/* attributes to retreive */
/* attributes to retrieve */
CK_ATTRIBUTE_PTR attr;
/* number of attributes */
CK_ULONG count;
@@ -32,7 +32,7 @@ typedef struct pkcs11_manager_t pkcs11_manager_t;
*
* @param data user supplied data, as passed to pkcs11_manager_create()
* @param p11 loaded PKCS#11 library token belongs to
* @param slot slot number the event occured in
* @param slot slot number the event occurred in
* @param add TRUE if token was added to the slot, FALSE if removed
*/
typedef void (*pkcs11_manager_token_event_t)(void *data, pkcs11_library_t *p11,
+1 -1
View File
@@ -52,7 +52,7 @@ struct plugin_t {
/**
* Plugin constructor function definiton.
* Plugin constructor function definition.
*
* Each plugin has a constructor function. This function is called on daemon
* startup to initialize each plugin.
@@ -62,7 +62,7 @@ struct private_callback_job_t {
mutex_t *mutex;
/**
* list of asociated child jobs
* list of associated child jobs
*/
linked_list_t *children;
+1 -1
View File
@@ -35,7 +35,7 @@ typedef struct scheduler_t scheduler_t;
* based data structure that satisfies the following property: if B is a child
* node of A, then key(A) >= (or <=) key(B). So either the element with the
* greatest (max-heap) or the smallest (min-heap) key is the root of the heap.
* We use a min-heap whith the key being the absolute unix time at which an
* We use a min-heap with the key being the absolute unix time at which an
* event is scheduled. So the root is always the event that will fire next.
*
* An earlier implementation of the scheduler used a sorted linked list to store
+1 -1
View File
@@ -110,7 +110,7 @@ u_int32_t settings_value_as_time(char *value, u_int32_t def);
* already existing values are replaced.
*
* All settings included from files are added relative to the section the
* include statment is in.
* include statement is in.
*
* The following files result in the same final config as above:
*
+1 -1
View File
@@ -36,7 +36,7 @@ struct enumerator_t {
* The enumerate function takes a variable argument list containing
* pointers where the enumerated values get written.
*
* @param ... variable list of enumerated items, implementation dependant
* @param ... variable list of enumerated items, implementation dependent
* @return TRUE if pointers returned
*/
bool (*enumerate)(enumerator_t *this, ...);
+1 -1
View File
@@ -40,7 +40,7 @@ struct private_host_t {
host_t public;
/**
* low-lewel structure, wich stores the address
* low-lewel structure, which stores the address
*/
union {
/** generic type */
+1 -1
View File
@@ -293,7 +293,7 @@ struct identification_t {
*
* In favour of pluto, domainnames are prepended with an @, since
* pluto resolves domainnames without an @ to IPv4 addresses. Since
* we use a seperate host_t class for addresses, this doesn't
* we use a separate host_t class for addresses, this doesn't
* make sense for us.
*
* A distinguished name may contain one or more of the following RDNs: