mirror of
https://github.com/strongswan/strongswan.git
synced 2025-10-04 00:00:14 -04:00
Fixed some typos, courtesy of codespell
This commit is contained in:
parent
ba8b28b67f
commit
ef33a4ab82
2
NEWS
2
NEWS
@ -411,7 +411,7 @@ strongswan-4.5.1
|
|||||||
./configure switch.
|
./configure switch.
|
||||||
|
|
||||||
- The new libstrongswan constraints plugin provides advanced X.509 constraint
|
- The new libstrongswan constraints plugin provides advanced X.509 constraint
|
||||||
checking. In additon to X.509 pathLen constraints, the plugin checks for
|
checking. In addition to X.509 pathLen constraints, the plugin checks for
|
||||||
nameConstraints and certificatePolicies, including policyMappings and
|
nameConstraints and certificatePolicies, including policyMappings and
|
||||||
policyConstraints. The x509 certificate plugin and the pki tool have been
|
policyConstraints. The x509 certificate plugin and the pki tool have been
|
||||||
enhanced to support these extensions. The new left/rightcertpolicy ipsec.conf
|
enhanced to support these extensions. The new left/rightcertpolicy ipsec.conf
|
||||||
|
@ -122,7 +122,7 @@ enum alert_t {
|
|||||||
ALERT_INSTALL_CHILD_POLICY_FAILED,
|
ALERT_INSTALL_CHILD_POLICY_FAILED,
|
||||||
/** IKE_SA deleted because of "replace" unique policy, no argument */
|
/** IKE_SA deleted because of "replace" unique policy, no argument */
|
||||||
ALERT_UNIQUE_REPLACE,
|
ALERT_UNIQUE_REPLACE,
|
||||||
/** IKE_SA deleted because of "keep" unique policy, no arguement */
|
/** IKE_SA deleted because of "keep" unique policy, no argument */
|
||||||
ALERT_UNIQUE_KEEP,
|
ALERT_UNIQUE_KEEP,
|
||||||
/** IKE_SA kept on failed child SA establishment, no argument */
|
/** IKE_SA kept on failed child SA establishment, no argument */
|
||||||
ALERT_KEEP_ON_CHILD_SA_FAILURE,
|
ALERT_KEEP_ON_CHILD_SA_FAILURE,
|
||||||
|
@ -72,7 +72,7 @@ enum exchange_type_t{
|
|||||||
AUTH_ONLY = 3,
|
AUTH_ONLY = 3,
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Aggresive (Aggressive mode)
|
* Aggressive (Aggressive mode)
|
||||||
*/
|
*/
|
||||||
AGGRESSIVE = 4,
|
AGGRESSIVE = 4,
|
||||||
|
|
||||||
|
@ -232,7 +232,7 @@ METHOD(listener_t, ike_rekey, bool,
|
|||||||
{
|
{
|
||||||
/* During IKE_SA rekey, the unique identifier changes. Fire update events
|
/* During IKE_SA rekey, the unique identifier changes. Fire update events
|
||||||
* and update the cached entry. During the invocation of this hook, the
|
* and update the cached entry. During the invocation of this hook, the
|
||||||
* virutal IPs have been migrated to new, hence remove that entry. */
|
* virtual IPs have been migrated to new, hence remove that entry. */
|
||||||
remove_entry(this, new);
|
remove_entry(this, new);
|
||||||
add_entry(this, new);
|
add_entry(this, new);
|
||||||
|
|
||||||
|
@ -115,7 +115,7 @@ static bool add_include(private_unity_handler_t *this, chunk_t subnet)
|
|||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Rempve a subnet from the inclusion list for this IKE_SA
|
* Remove a subnet from the inclusion list for this IKE_SA
|
||||||
*/
|
*/
|
||||||
static bool remove_include(private_unity_handler_t *this, chunk_t subnet)
|
static bool remove_include(private_unity_handler_t *this, chunk_t subnet)
|
||||||
{
|
{
|
||||||
|
@ -385,7 +385,7 @@ METHOD(task_t, process_r, status_t,
|
|||||||
switch (message->get_exchange_type(message))
|
switch (message->get_exchange_type(message))
|
||||||
{
|
{
|
||||||
case AGGRESSIVE:
|
case AGGRESSIVE:
|
||||||
{ /* proccess NAT-D payloads in the second request, already added ours
|
{ /* process NAT-D payloads in the second request, already added ours
|
||||||
* in the first response */
|
* in the first response */
|
||||||
result = SUCCESS;
|
result = SUCCESS;
|
||||||
/* fall */
|
/* fall */
|
||||||
|
@ -1163,7 +1163,7 @@ METHOD(task_t, process_i, status_t,
|
|||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
|
|
||||||
/* check for erronous notifies */
|
/* check for erroneous notifies */
|
||||||
enumerator = message->create_payload_enumerator(message);
|
enumerator = message->create_payload_enumerator(message);
|
||||||
while (enumerator->enumerate(enumerator, &payload))
|
while (enumerator->enumerate(enumerator, &payload))
|
||||||
{
|
{
|
||||||
|
@ -426,7 +426,7 @@ METHOD(task_t, process_i, status_t,
|
|||||||
enumerator_t *enumerator;
|
enumerator_t *enumerator;
|
||||||
payload_t *payload;
|
payload_t *payload;
|
||||||
|
|
||||||
/* check for erronous notifies */
|
/* check for erroneous notifies */
|
||||||
enumerator = message->create_payload_enumerator(message);
|
enumerator = message->create_payload_enumerator(message);
|
||||||
while (enumerator->enumerate(enumerator, &payload))
|
while (enumerator->enumerate(enumerator, &payload))
|
||||||
{
|
{
|
||||||
|
@ -35,7 +35,7 @@ struct nonce_gen_t {
|
|||||||
*
|
*
|
||||||
* @param size size of nonce in bytes
|
* @param size size of nonce in bytes
|
||||||
* @param buffer pointer where the generated nonce will be written
|
* @param buffer pointer where the generated nonce will be written
|
||||||
* @return TRUE if nonce allocation was succesful, FALSE otherwise
|
* @return TRUE if nonce allocation was successful, FALSE otherwise
|
||||||
*/
|
*/
|
||||||
bool (*get_nonce)(nonce_gen_t *this, size_t size,
|
bool (*get_nonce)(nonce_gen_t *this, size_t size,
|
||||||
u_int8_t *buffer) __attribute__((warn_unused_result));
|
u_int8_t *buffer) __attribute__((warn_unused_result));
|
||||||
@ -45,7 +45,7 @@ struct nonce_gen_t {
|
|||||||
*
|
*
|
||||||
* @param size size of nonce in bytes
|
* @param size size of nonce in bytes
|
||||||
* @param chunk chunk which will hold the generated nonce
|
* @param chunk chunk which will hold the generated nonce
|
||||||
* @return TRUE if nonce allocation was succesful, FALSE otherwise
|
* @return TRUE if nonce allocation was successful, FALSE otherwise
|
||||||
*/
|
*/
|
||||||
bool (*allocate_nonce)(nonce_gen_t *this, size_t size,
|
bool (*allocate_nonce)(nonce_gen_t *this, size_t size,
|
||||||
chunk_t *chunk) __attribute__((warn_unused_result));
|
chunk_t *chunk) __attribute__((warn_unused_result));
|
||||||
|
@ -211,7 +211,7 @@ static status_t compute_prime(size_t prime_size, bool safe, mpz_t *p, mpz_t *q)
|
|||||||
|
|
||||||
rng->destroy(rng);
|
rng->destroy(rng);
|
||||||
|
|
||||||
/* additonally return p-1 */
|
/* additionally return p-1 */
|
||||||
mpz_sub_ui(*q, *p, 1);
|
mpz_sub_ui(*q, *p, 1);
|
||||||
|
|
||||||
return SUCCESS;
|
return SUCCESS;
|
||||||
|
@ -116,7 +116,7 @@ pkcs7_t *pkcs7_generic_load(container_type_t type, va_list args)
|
|||||||
{
|
{
|
||||||
if (blob.len >= 2 &&
|
if (blob.len >= 2 &&
|
||||||
blob.ptr[0] == ASN1_SEQUENCE && blob.ptr[1] == 0x80)
|
blob.ptr[0] == ASN1_SEQUENCE && blob.ptr[1] == 0x80)
|
||||||
{ /* looks like infinite lenght BER encoding, but we can't handle it.
|
{ /* looks like infinite length BER encoding, but we can't handle it.
|
||||||
* ignore silently, our openssl backend can handle it */
|
* ignore silently, our openssl backend can handle it */
|
||||||
return NULL;
|
return NULL;
|
||||||
}
|
}
|
||||||
|
Loading…
x
Reference in New Issue
Block a user