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
+1 -1
View File
@@ -177,7 +177,7 @@ struct bus_t {
/**
* Send a log message to the bus.
*
* The signal specifies the type of the event occured. The format string
* The signal specifies the type of the event occurred. The format string
* specifies an additional informational or error message with a
* printf() like variable argument list.
* Use the DBG() macros.
+1 -1
View File
@@ -84,7 +84,7 @@ struct listener_t {
/**
* Hook called for received/sent messages of an IKE_SA.
*
* @param ike_sa IKE_SA sending/receving a message
* @param ike_sa IKE_SA sending/receiving a message
* @param message message object
* @param incoming TRUE for incoming messages, FALSE for outgoing
* @return TRUE to stay registered, FALSE to unregister
+2 -2
View File
@@ -73,7 +73,7 @@ struct child_cfg_t {
* Add a proposal to the list.
*
* The proposals are stored by priority, first added
* is the most prefered.
* is the most preferred.
* After add, proposal is owned by child_cfg.
*
* @param proposal proposal to add
@@ -95,7 +95,7 @@ struct child_cfg_t {
*
* Returned propsal is newly created and must be destroyed after usage.
*
* @param proposals list from from wich proposals are selected
* @param proposals list from which proposals are selected
* @param strip_dh TRUE strip out diffie hellman groups
* @param private accept algorithms from a private range
* @return selected proposal, or NULL if nothing matches
+1 -1
View File
@@ -110,7 +110,7 @@ struct private_peer_cfg_t {
u_int32_t reauth_time;
/**
* Time, which specifies the range of a random value substracted from above.
* Time, which specifies the range of a random value subtracted from above.
*/
u_int32_t jitter_time;
+3 -3
View File
@@ -110,7 +110,7 @@ extern enum_name_t *unique_policy_names;
* peer. Each config is enforced using the multiple authentication extension
* (RFC4739).
* The remote authentication configs are handled as constraints. The peer has
* to fullfill each of these rules (using multiple authentication, in any order)
* to fulfill each of these rules (using multiple authentication, in any order)
* to gain access to the configuration.
*/
struct peer_cfg_t {
@@ -328,14 +328,14 @@ struct peer_cfg_t {
* (rekeylifetime - random(0, jitter)).
*
* @param name name of the peer_cfg
* @param ike_version which IKE version we sould use for this peer
* @param ike_version which IKE version we should use for this peer
* @param ike_cfg IKE config to use when acting as initiator
* @param cert_policy should we send a certificate payload?
* @param unique uniqueness of an IKE_SA
* @param keyingtries how many keying tries should be done before giving up
* @param rekey_time timeout before starting rekeying
* @param reauth_time timeout before starting reauthentication
* @param jitter_time timerange to randomly substract from rekey/reauth time
* @param jitter_time timerange to randomly subtract from rekey/reauth time
* @param over_time maximum overtime before closing a rekeying/reauth SA
* @param mobike use MOBIKE (RFC4555) if peer supports it
* @param dpd DPD check interval, 0 to disable
+4 -4
View File
@@ -120,7 +120,7 @@ struct proposal_t {
* compared. If they have at least one algorithm of each type
* in common, a resulting proposal of this kind is created.
*
* @param other proposal to compair agains
* @param other proposal to compare against
* @param private accepts algorithms allocated in a private range
* @return selected proposal, NULL if proposals don't match
*/
@@ -180,7 +180,7 @@ struct proposal_t {
*
* @param protocol protocol, such as PROTO_ESP
* @param number proposal number, as encoded in SA payload
* @return proposal_t object
* @return proposal_t object
*/
proposal_t *proposal_create(protocol_id_t protocol, u_int number);
@@ -188,7 +188,7 @@ proposal_t *proposal_create(protocol_id_t protocol, u_int number);
* Create a default proposal if nothing further specified.
*
* @param protocol protocol, such as PROTO_ESP
* @return proposal_t object
* @return proposal_t object
*/
proposal_t *proposal_create_default(protocol_id_t protocol);
@@ -203,7 +203,7 @@ proposal_t *proposal_create_default(protocol_id_t protocol);
*
* @param protocol protocol, such as PROTO_ESP
* @param algs algorithms as string
* @return proposal_t object
* @return proposal_t object
*/
proposal_t *proposal_create_from_string(protocol_id_t protocol, const char *algs);
+2 -2
View File
@@ -334,7 +334,7 @@ METHOD(controller_t, terminate_ike, status_t,
else
{
charon->bus->listen(charon->bus, &job.listener.public, &job.public);
/* checkin of the ike_sa happend in the thread that executed the job */
/* checkin of the ike_sa happened in the thread that executed the job */
charon->bus->set_sa(charon->bus, NULL);
}
return job.listener.status;
@@ -425,7 +425,7 @@ METHOD(controller_t, terminate_child, status_t,
else
{
charon->bus->listen(charon->bus, &job.listener.public, &job.public);
/* checkin of the ike_sa happend in the thread that executed the job */
/* checkin of the ike_sa happened in the thread that executed the job */
charon->bus->set_sa(charon->bus, NULL);
}
return job.listener.status;
+5 -5
View File
@@ -63,13 +63,13 @@
typedef struct {
/* Payload type */
payload_type_t type;
/* Minimal occurence of this payload. */
/* Minimal occurrence of this payload. */
size_t min_occurence;
/* Max occurence of this payload. */
/* Max occurrence of this payload. */
size_t max_occurence;
/* TRUE if payload must be encrypted */
bool encrypted;
/* If payload occurs, the message rule is fullfilled */
/* If payload occurs, the message rule is fulfilled */
bool sufficient;
} payload_rule_t;
@@ -1405,7 +1405,7 @@ static status_t verify(private_message_t *this)
if (found > rule->max_occurence)
{
DBG1(DBG_ENC, "payload of type %N more than %d times (%d) "
"occured in current message", payload_type_names,
"occurred in current message", payload_type_names,
type, rule->max_occurence, found);
enumerator->destroy(enumerator);
return VERIFY_ERROR;
@@ -1416,7 +1416,7 @@ static status_t verify(private_message_t *this)
if (!complete && found < rule->min_occurence)
{
DBG1(DBG_ENC, "payload of type %N not occured %d times (%d)",
DBG1(DBG_ENC, "payload of type %N not occurred %d times (%d)",
payload_type_names, rule->type, rule->min_occurence, found);
return VERIFY_ERROR;
}
+1 -1
View File
@@ -321,7 +321,7 @@ struct message_t {
/**
* Find a payload of a specific type.
*
* Returns the first occurance.
* Returns the first occurrence.
*
* @param type type of the payload to find
* @return payload, or NULL if no such payload found
@@ -142,7 +142,7 @@ METHOD(payload_t, set_next_type, void,
}
/**
* Compute the lenght of the whole payload
* Compute the length of the whole payload
*/
static void compute_length(private_encryption_payload_t *this)
{
@@ -407,7 +407,7 @@ proposal_substructure_t *proposal_substructure_create_from_proposal(
this = (private_proposal_substructure_t*)proposal_substructure_create();
/* encryption algorithm is only availble in ESP */
/* encryption algorithm is only available in ESP */
enumerator = proposal->create_enumerator(proposal, ENCRYPTION_ALGORITHM);
while (enumerator->enumerate(enumerator, &alg, &key_size))
{
@@ -84,7 +84,7 @@ encoding_rule_t transform_substructure_encodings[] = {
{ U_INT_8, offsetof(private_transform_substructure_t, transform_type) },
/* 1 Reserved Byte */
{ RESERVED_BYTE, offsetof(private_transform_substructure_t, reserved[1]) },
/* tranform ID is a number of 8 bit */
/* transform ID is a number of 8 bit */
{ U_INT_16, offsetof(private_transform_substructure_t, transform_id) },
/* Attributes are stored in a transform attribute,
offset points to a linked_list_t pointer */
@@ -118,7 +118,7 @@ transform_substructure_t *transform_substructure_create(void);
*
* @param type type of transform to create
* @param id transform id specifc for the transform type
* @param key_length key length for key lenght attribute, 0 to omit
* @param key_length key length for key length attribute, 0 to omit
* @return transform_substructure_t object
*/
transform_substructure_t *transform_substructure_create_type(
+2 -2
View File
@@ -30,7 +30,7 @@ typedef struct receiver_t receiver_t;
/**
* Receives packets from the socket and adds them to the job queue.
*
* The receiver starts a thread, wich reads on the blocking socket. A received
* The receiver starts a thread, which reads on the blocking socket. A received
* packet is preparsed and a process_message_job is queued in the job queue.
*
* To endure DoS attacks, cookies are enabled when to many IKE_SAs are half
@@ -38,7 +38,7 @@ typedef struct receiver_t receiver_t;
* method in RFC4306. We do not include a nonce, because we think the advantage
* we gain does not justify the overhead to parse the whole message.
* Instead of VersionIdOfSecret, we include a timestamp. This allows us to
* find out wich key was used for cookie creation. Further, we can set a
* find out which key was used for cookie creation. Further, we can set a
* lifetime for the cookie, which allows us to reuse the secret for a longer
* time.
* COOKIE = time | sha1( IPi | SPIi | time | secret )
@@ -52,7 +52,7 @@ METHOD(listener_t, log_, bool,
snprintf(sgroup, sizeof(sgroup), "%N", debug_names, group);
vsnprintf(buffer, sizeof(buffer), format, args);
while (current)
{ /* log each line seperately */
{ /* log each line separately */
next = strchr(current, '\n');
if (next)
{
@@ -68,7 +68,7 @@ struct private_load_tester_plugin_t {
int initiators;
/**
* currenly running initiators
* currently running initiators
*/
int running;
+1 -1
View File
@@ -345,7 +345,7 @@ static job_requeue_t initiate_config(peer_cfg_t *peer_cfg)
}
/**
* schedule initation of all "active" connections
* schedule initiation of all "active" connections
*/
static void schedule_autoinit(private_medcli_config_t *this)
{
+1 -1
View File
@@ -1,6 +1,6 @@
<?xml version="1.0" encoding="UTF-8"?>
<!-- strongSwan Managment Protocol (SMP) V1.0 -->
<!-- strongSwan Management Protocol (SMP) V1.0 -->
<!--
Copyright (C) 2007 Martin Willi
+1 -1
View File
@@ -871,7 +871,7 @@ METHOD(ike_sa_t, update_hosts, void,
if (!other->equals(other, this->other_host))
{
/* update others adress if we are NOT NATed */
/* update others address if we are NOT NATed */
if (force || !has_condition(this, COND_NAT_HERE))
{
set_other_host(this, other->clone(other));
+1 -1
View File
@@ -689,7 +689,7 @@ struct ike_sa_t {
*
* Message processing may fail. If a critical failure occurs,
* process_message() return DESTROY_ME. Then the caller must
* destroy the IKE_SA immediatly, as it is unusable.
* destroy the IKE_SA immediately, as it is unusable.
*
* @param message message to process
* @return
+11 -11
View File
@@ -30,7 +30,7 @@ typedef struct ike_sa_id_t ike_sa_id_t;
* An object of type ike_sa_id_t is used to identify an IKE_SA.
*
* An IKE_SA is identified by its initiator and responder spi's.
* Additionaly it contains the role of the actual running IKEv2-Daemon
* Additionally it contains the role of the actual running IKEv2-Daemon
* for the specific IKE_SA (original initiator or responder).
*/
struct ike_sa_id_t {
@@ -40,28 +40,28 @@ struct ike_sa_id_t {
*
* This function is called when a request or reply of a IKE_SA_INIT is received.
*
* @param responder_spi SPI of responder to set
* @param responder_spi SPI of responder to set
*/
void (*set_responder_spi) (ike_sa_id_t *this, u_int64_t responder_spi);
/**
* Set the SPI of the initiator.
*
* @param initiator_spi SPI to set
* @param initiator_spi SPI to set
*/
void (*set_initiator_spi) (ike_sa_id_t *this, u_int64_t initiator_spi);
/**
* Get the initiator SPI.
*
* @return SPI of the initiator
* @return SPI of the initiator
*/
u_int64_t (*get_initiator_spi) (ike_sa_id_t *this);
/**
* Get the responder SPI.
*
* @return SPI of the responder
* @return SPI of the responder
*/
u_int64_t (*get_responder_spi) (ike_sa_id_t *this);
@@ -70,8 +70,8 @@ struct ike_sa_id_t {
*
* Two ike_sa_id_t objects are equal if both SPI values and the role matches.
*
* @param other ike_sa_id_t object to check if equal
* @return TRUE if given ike_sa_id_t are equal, FALSE otherwise
* @param other ike_sa_id_t object to check if equal
* @return TRUE if given ike_sa_id_t are equal, FALSE otherwise
*/
bool (*equals) (ike_sa_id_t *this, ike_sa_id_t *other);
@@ -81,28 +81,28 @@ struct ike_sa_id_t {
*
* After calling this function, both objects are equal.
*
* @param other ike_sa_id_t object from which values will be taken
* @param other ike_sa_id_t object from which values will be taken
*/
void (*replace_values) (ike_sa_id_t *this, ike_sa_id_t *other);
/**
* Get the initiator flag.
*
* @return TRUE if we are the original initator
* @return TRUE if we are the original initator
*/
bool (*is_initiator) (ike_sa_id_t *this);
/**
* Switche the original initiator flag.
*
* @return TRUE if we are the original initator after switch, FALSE otherwise
* @return TRUE if we are the original initator after switch, FALSE otherwise
*/
bool (*switch_initiator) (ike_sa_id_t *this);
/**
* Clones a given ike_sa_id_t object.
*
* @return cloned ike_sa_id_t object
* @return cloned ike_sa_id_t object
*/
ike_sa_id_t *(*clone) (ike_sa_id_t *this);
+1 -1
View File
@@ -317,7 +317,7 @@ static status_t process_i(private_child_rekey_t *this, message_t *message)
if (message->get_payload(message, SECURITY_ASSOCIATION) == NULL)
{
/* establishing new child failed, reuse old. but not when we
* recieved a delete in the meantime */
* received a delete in the meantime */
if (!(this->collision &&
this->collision->get_type(this->collision) == CHILD_DELETE))
{
+1 -1
View File
@@ -353,7 +353,7 @@ static status_t build_r(private_ike_natd_t *this, message_t *message)
notify_payload_t *notify;
host_t *me, *other;
/* only add notifies on successfull responses. */
/* only add notifies on successful responses. */
if (message->get_exchange_type(message) == IKE_SA_INIT &&
message->get_payload(message, SECURITY_ASSOCIATION) == NULL)
{
+3 -3
View File
@@ -89,7 +89,7 @@ extern enum_name_t *task_type_names;
* A responder does the opposite; it calls process() first to handle an incoming
* request and secondly calls build() to build an appropriate response.
* Both methods return either SUCCESS, NEED_MORE or FAILED. A SUCCESS indicates
* that the task completed, even when the task completed unsuccesfully. The
* that the task completed, even when the task completed unsuccessfully. The
* manager then removes the task from the list. A NEED_MORE is returned when
* the task needs further build()/process() calls to complete, the manager
* leaves the taks in the queue. A returned FAILED indicates a critical failure.
@@ -102,7 +102,7 @@ struct task_t {
*
* @param message message to add payloads to
* @return
* - FAILED if a critical error occured
* - FAILED if a critical error occurred
* - DESTROY_ME if IKE_SA has been properly deleted
* - NEED_MORE if another call to build/process needed
* - SUCCESS if task completed
@@ -114,7 +114,7 @@ struct task_t {
*
* @param message message to read payloads from
* @return
* - FAILED if a critical error occured
* - FAILED if a critical error occurred
* - DESTROY_ME if IKE_SA has been properly deleted
* - NEED_MORE if another call to build/process needed
* - SUCCESS if task completed