Spelling fixes

* accumulating
* acquire
* alignment
* appropriate
* argument
* assign
* attribute
* authenticate
* authentication
* authenticator
* authority
* auxiliary
* brackets
* callback
* camellia
* can't
* cancelability
* certificate
* choinyambuu
* chunk
* collector
* collision
* communicating
* compares
* compatibility
* compressed
* confidentiality
* configuration
* connection
* consistency
* constraint
* construction
* constructor
* database
* decapsulated
* declaration
* decrypt
* derivative
* destination
* destroyed
* details
* devised
* dynamic
* ecapsulation
* encoded
* encoding
* encrypted
* enforcing
* enumerator
* establishment
* excluded
* exclusively
* exited
* expecting
* expire
* extension
* filter
* firewall
* foundation
* fulfillment
* gateways
* hashing
* hashtable
* heartbeats
* identifier
* identifiers
* identities
* identity
* implementers
* indicating
* initialize
* initiate
* initiation
* initiator
* inner
* instantiate
* legitimate
* libraries
* libstrongswan
* logger
* malloc
* manager
* manually
* measurement
* mechanism
* message
* network
* nonexistent
* object
* occurrence
* optional
* outgoing
* packages
* packets
* padding
* particular
* passphrase
* payload
* periodically
* policies
* possible
* previously
* priority
* proposal
* protocol
* provide
* provider
* pseudo
* pseudonym
* public
* qualifier
* quantum
* quintuplets
* reached
* reading
* recommendation to
* recommendation
* recursive
* reestablish
* referencing
* registered
* rekeying
* reliable
* replacing
* representing
* represents
* request
* request
* resolver
* result
* resulting
* resynchronization
* retriable
* revocation
* right
* rollback
* rule
* rules
* runtime
* scenario
* scheduled
* security
* segment
* service
* setting
* signature
* specific
* specified
* speed
* started
* steffen
* strongswan
* subjectaltname
* supported
* threadsafe
* traffic
* tremendously
* treshold
* unique
* uniqueness
* unknown
* until
* upper
* using
* validator
* verification
* version
* version
* warrior

Closes strongswan/strongswan#164.
This commit is contained in:
Josh Soref
2020-02-11 18:23:07 +01:00
committed by Tobias Brunner
parent baf29263d5
commit b3ab7a48cc
200 changed files with 281 additions and 281 deletions
+1 -1
View File
@@ -87,7 +87,7 @@ void array_compress(array_t *array);
/**
* Create an enumerator over an array.
*
* The enumerater enumerates directly over the array element (pass a pointer to
* The enumerator enumerates directly over the array element (pass a pointer to
* element types), unless the array is pointer based. If zero is passed as
* element size during construction, the enumerator enumerates over the
* dereferenced pointer values.
+1 -1
View File
@@ -173,7 +173,7 @@ enumerator_t* enumerator_create_token(const char *string, const char *sep,
* Creates an enumerator which enumerates over enumerated enumerators :-).
*
* The outer enumerator is expected to return objects that, when passed to
* inner_contructor, will create a new enumerator that will be enumerated until
* inner_constructor, will create a new enumerator that will be enumerated until
* completion (to this enumerator will the pointer arguments that are passed to
* this enumerator be forwarded) at which point a new element from the outer
* enumerator is requested to create a new inner enumerator.
+1 -1
View File
@@ -116,7 +116,7 @@ struct hashtable_t {
* entry, otherwise NULL is returned.
*
* Compared to get() the given match function is used to compare the keys
* for equality. The hash function does have to be deviced properly in
* for equality. The hash function does have to be devised properly in
* order to make this work if the match function compares keys differently
* than the equals function provided to the constructor. This basically
* allows to enumerate all entries with the same hash value.
@@ -39,7 +39,7 @@ struct cert_validator_t {
*
* If this function returns SUCCESS or FAILED, the certificate lifetime is
* considered definitely (in-)valid, without asking other validators.
* If all registered validaters return NEED_MORE, the default
* If all registered validators return NEED_MORE, the default
* lifetime check is performed.
*
* @param cert certificate to check lifetime
@@ -73,7 +73,7 @@ enum cert_validation_t {
VALIDATION_STALE,
/** validation failed due to a processing error */
VALIDATION_FAILED,
/** certificate is on hold (i.e. temporary revokation) */
/** certificate is on hold (i.e. temporary revocation) */
VALIDATION_ON_HOLD,
/** certificate has been revoked */
VALIDATION_REVOKED,
@@ -87,7 +87,7 @@ struct container_t {
* Get the encoding of the full signed/encrypted container.
*
* @param data allocated container encoding
* @return TRUE if encodign successful
* @return TRUE if encoding successful
*/
bool (*get_encoding)(container_t *this, chunk_t *encoding);
@@ -274,7 +274,7 @@ METHOD(credential_manager_t, get_cert, certificate_t*,
enumerator = create_cert_enumerator(this, cert, key, id, trusted);
if (enumerator->enumerate(enumerator, &current))
{
/* TODO: best match? order by keyid, subject, sualtname */
/* TODO: best match? order by keyid, subject, subjectAltName */
found = current->get_ref(current);
}
enumerator->destroy(enumerator);
@@ -146,7 +146,7 @@ struct private_key_t {
};
/**
* Generic private key equals() implementation, usable by implementors.
* Generic private key equals() implementation, usable by implementers.
*
* @param private private key to check
* @param other key to compare
@@ -155,7 +155,7 @@ struct private_key_t {
bool private_key_equals(private_key_t *private, private_key_t *other);
/**
* Generic private key belongs_to() implementation, usable by implementors.
* Generic private key belongs_to() implementation, usable by implementers.
*
* @param private private key to check
* @param public public key to compare
@@ -164,7 +164,7 @@ bool private_key_equals(private_key_t *private, private_key_t *other);
bool private_key_belongs_to(private_key_t *private, public_key_t *public);
/**
* Generic private key has_fingerprint() implementation, usable by implementors.
* Generic private key has_fingerprint() implementation, usable by implementers.
*
* @param private private key to check
* @param fingerprint fingerprint to check
@@ -246,7 +246,7 @@ struct public_key_t {
};
/**
* Generic public key equals() implementation, usable by implementors.
* Generic public key equals() implementation, usable by implementers.
*
* @param public public key to check
* @param other key to compare
@@ -255,7 +255,7 @@ struct public_key_t {
bool public_key_equals(public_key_t *public, public_key_t *other);
/**
* Generic public key has_fingerprint() implementation, usable by implementors.
* Generic public key has_fingerprint() implementation, usable by implementers.
*
* @param public public key to check
* @param fingerprint fingerprint to check
@@ -40,7 +40,7 @@ typedef shared_key_t* (*callback_cred_shared_cb_t)(
id_match_t *match_me, id_match_t *match_other);
/**
* Generic callbcack using user specified callback functions.
* Generic callback using user specified callback functions.
*/
struct callback_cred_t {
+1 -1
View File
@@ -113,7 +113,7 @@ struct crypter_t {
*
* The length of the iv must equal to get_iv_size(), while the length
* of data must be a multiple of get_block_size().
* If decrpyted is NULL, the encryption is done in-place (overwriting data).
* If decrypted is NULL, the encryption is done in-place (overwriting data).
*
* @param data data to decrypt
* @param iv initializing vector
+1 -1
View File
@@ -283,7 +283,7 @@ struct crypto_tester_t {
*
* @param group group to test
* @param create constructor function for the DH backend
* @param speed speeed test result, NULL to omit
* @param speed speed test result, NULL to omit
* @return TRUE if test passed
*/
bool (*test_dh)(crypto_tester_t *this, diffie_hellman_group_t group,
+1 -1
View File
@@ -4,7 +4,7 @@
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the "GNU General Public License as published by the
* Free Software Foundatio"n; either version 2 of the License, or (at your
* Free Software Foundation; either version 2 of the License, or (at your
* option) any later version". See <http://www.fsf.org/copyleft/gpl.txt>.
*
* This program is distributed in the hope that it will be useful, but
+1 -1
View File
@@ -60,7 +60,7 @@ struct prf_plus_t {
/**
* Creates a new prf_plus_t object.
*
* @param prf prf object to use, must be destroyd after prf+.
* @param prf prf object to use, must be destroyed after prf+.
* @param counter use an appending counter byte (for IKEv2 variant)
* @param seed input seed for prf
* @return prf_plus_t object, NULL on failure
+2 -2
View File
@@ -15,7 +15,7 @@
*/
/**
* @defgroup databasei database
* @defgroup database_t database
* @{ @ingroup database
*/
@@ -121,7 +121,7 @@ struct database_t {
*
* @note Either commit() or rollback() has to be called to end the
* transaction.
* @note Transactions are thread-specific. So commit()/rollbak() has to be
* @note Transactions are thread-specific. So commit()/rollback() has to be
* called from the same thread.
* @note While this method can be called multiple times (commit/rollback
* have to be called an equal number of times) real nested transactions are
+1 -1
View File
@@ -72,7 +72,7 @@ struct private_library_t {
#define MAX_NAMESPACES 5
/**
* Additional namespaces registered using __atrribute__((constructor))
* Additional namespaces registered using __attribute__((constructor))
*/
static char *namespaces[MAX_NAMESPACES];
static int ns_count;
+1 -1
View File
@@ -35,7 +35,7 @@ typedef struct host_t host_t;
#include <sys/types.h>
/**
* Representates a Host
* Represents a Host
*
* Host object, identifies a address:port pair and defines some
* useful functions on it.
+1 -1
View File
@@ -516,7 +516,7 @@ static const uint32_t im_tab[4][256] =
#define nc (AES_BLOCK_SIZE/4)
// Initialise the key schedule from the user supplied key. The key
// Initialize the key schedule from the user supplied key. The key
// length is now specified in bytes - 16, 24 or 32 as appropriate.
// This corresponds to bit lengths of 128, 192 and 256 bits, and
// to Nk values of 4, 6 and 8 respectively.
@@ -29,7 +29,7 @@
typedef struct bliss_plugin_t bliss_plugin_t;
/**
* Plugin implementing the BLISS post-quantu authentication algorithm
* Plugin implementing the BLISS post-quantum authentication algorithm
*/
struct bliss_plugin_t {
@@ -1071,7 +1071,7 @@ bliss_private_key_t *bliss_private_key_gen(key_type_t type, va_list args)
/* We derive the public key from the private key using the FFT */
fft = ntt_fft_create(set->fft_params);
/* Some vectors needed to derive the publi key */
/* Some vectors needed to derive the public key */
S1 = malloc(n * sizeof(uint32_t));
S2 = malloc(n * sizeof(uint32_t));
a = malloc(n * sizeof(uint32_t));
@@ -40,7 +40,7 @@ struct bliss_signature_t {
chunk_t (*get_encoding)(bliss_signature_t *this);
/**
* Get signature parameters extracted from compressd binary encoding
* Get signature parameters extracted from compressed binary encoding
*
* @param z1 signature vector z1 of size n
* @param z2d signature vector z2d of size n
+1 -1
View File
@@ -29,7 +29,7 @@
typedef struct hmac_plugin_t hmac_plugin_t;
/**
* Plugin implementing HMAC algorithm to prvoide hash based PRF and signers.
* Plugin implementing HMAC algorithm to provide hash based PRF and signers.
*/
struct hmac_plugin_t {
+1 -1
View File
@@ -76,7 +76,7 @@ static uint8_t PADDING[64] = {
typedef struct private_md4_hasher_t private_md4_hasher_t;
/**
* Private data structure with hasing context.
* Private data structure with hashing context.
*/
struct private_md4_hasher_t {
/**
+1 -1
View File
@@ -91,7 +91,7 @@ Rotation is separate from addition to prevent recomputation.
typedef struct private_md5_hasher_t private_md5_hasher_t;
/**
* Private data structure with hasing context.
* Private data structure with hashing context.
*/
struct private_md5_hasher_t {
/**
@@ -27,7 +27,7 @@
typedef struct mysql_database_t mysql_database_t;
/**
* MySQL databse_t implementation.
* MySQL database_t implementation.
*/
struct mysql_database_t {
@@ -36,7 +36,7 @@ struct newhope_noise_t {
*
* @param nonce Nonce determining the pseudo random stream
* @param n Number of pseudo random bytes to be returned
* @return Return array with n peudo random bytes
* @return Return array with n pseudo random bytes
*/
uint8_t* (*get_uniform_bytes)(newhope_noise_t *this, uint8_t nonce,
uint16_t n);
@@ -141,7 +141,7 @@ static const ntru_param_set_t ntru_param_sets[] = {
0x27, /* DER id */
10, /* no. of bits in N (i.e., in an index) */
613, /* N */
16, /* securuity strength in octets */
16, /* security strength in octets */
2048, /* q */
11, /* no. of bits in q (i.e., in a coeff) */
FALSE, /* product form */
@@ -49,7 +49,7 @@
bool openssl_hash_chunk(int hash_type, chunk_t data, chunk_t *hash);
/**
* Concatenates two bignums into a chunk, thereby enfocing the length of
* Concatenates two bignums into a chunk, thereby enforcing the length of
* a single BIGNUM, if necessary, by pre-pending it with zeros.
*
* Note: this function allocates memory for the chunk
@@ -606,7 +606,7 @@ static private_openssl_x509_t *create_empty()
}
/**
* parse an extionsion containing GENERAL_NAMES into a list
* parse an extension containing GENERAL_NAMES into a list
*/
static bool parse_generalNames_ext(linked_list_t *list,
X509_EXTENSION *ext)
@@ -698,7 +698,7 @@ static bool parse_keyUsage_ext(private_openssl_x509_t *this,
}
if (flags & X509v3_KU_KEY_CERT_SIGN)
{
/* we use the caBasicContraint, MUST be set */
/* we use the caBasicConstraint, MUST be set */
}
}
ASN1_BIT_STRING_free(usage);
@@ -24,7 +24,7 @@
typedef struct private_padlock_sha1_hasher_t private_padlock_sha1_hasher_t;
/**
* Private data structure with hasing context.
* Private data structure with hashing context.
*/
struct private_padlock_sha1_hasher_t {
/**
+1 -1
View File
@@ -120,7 +120,7 @@ bool pem_encoder_encode(cred_encoding_type_t type, chunk_t *encoding,
}
if (cred_encoding_args(args, CRED_PART_PKCS10_ASN1_DER,
&asn1, CRED_PART_END))
{ /* PEM encode PKCS10 certificate reqeuest */
{ /* PEM encode PKCS10 certificate request */
label = "CERTIFICATE REQUEST";
break;
}
+1 -1
View File
@@ -112,7 +112,7 @@ bool pgp_read_mpi(chunk_t *blob, chunk_t *mpi);
*
* @param blob blob to read from, gets advanced
* @param bytes number of bytes the scalar uses for encoding
* @param scalar resultin scalar
* @param scalar resulting scalar
* @return TRUE if scalar parsed successfully
*/
bool pgp_read_scalar(chunk_t *blob, size_t bytes, uint32_t *scalar);
+1 -1
View File
@@ -782,7 +782,7 @@ _CK_DECLARE_FUNCTION (C_SetOperationState,
unsigned char *operation_state,
unsigned long operation_state_len,
ck_object_handle_t encryption_key,
ck_object_handle_t authentiation_key));
ck_object_handle_t authentication_key));
_CK_DECLARE_FUNCTION (C_Login,
(ck_session_handle_t session, ck_user_type_t user_type,
unsigned char *pin, unsigned long pin_len));
+1 -1
View File
@@ -40,7 +40,7 @@ struct private_pkcs11_dh_t {
pkcs11_library_t *lib;
/**
* Session handle for this objct
* Session handle for this object
*/
CK_SESSION_HANDLE session;
@@ -643,7 +643,7 @@ static void free_attrs(object_enumerator_t *this)
}
/**
* CKA_EC_POINT is encodeed as ASN.1 octet string, we can't handle that and
* CKA_EC_POINT is encoded as ASN.1 octet string, we can't handle that and
* some tokens actually return them even unwrapped.
*
* Because ASN1_OCTET_STRING is 0x04 and uncompressed EC_POINTs also begin with
+1 -1
View File
@@ -52,7 +52,7 @@ struct plugin_t {
/**
* Try to reload plugin configuration.
*
* @return TRUE if reloaded, FALSE if reloading not supporty by plugin
* @return TRUE if reloaded, FALSE if reloading not supported by plugin
*/
bool (*reload)(plugin_t *this);
+1 -1
View File
@@ -48,7 +48,7 @@
typedef struct private_sha1_hasher_t private_sha1_hasher_t;
/**
* Private data structure with hasing context.
* Private data structure with hashing context.
*/
struct private_sha1_hasher_t {
/**
+1 -1
View File
@@ -22,7 +22,7 @@ typedef struct private_sha1_prf_t private_sha1_prf_t;
typedef struct private_sha1_hasher_t private_sha1_hasher_t;
/**
* Private data structure with hasing context.
* Private data structure with hashing context.
*/
struct private_sha1_hasher_t {
/**
+2 -2
View File
@@ -24,7 +24,7 @@
typedef struct private_sha512_hasher_t private_sha512_hasher_t;
/**
* Private data structure with hasing context for SHA384 and SHA512
* Private data structure with hashing context for SHA384 and SHA512
*/
struct private_sha512_hasher_t {
/**
@@ -43,7 +43,7 @@ struct private_sha512_hasher_t {
typedef struct private_sha256_hasher_t private_sha256_hasher_t;
/**
* Private data structure with hasing context for SHA256
* Private data structure with hashing context for SHA256
*/
struct private_sha256_hasher_t {
/**
@@ -71,7 +71,7 @@ typedef struct {
/**
* Check if the SQLite library is thread safe
*/
static bool is_threadsave()
static bool is_threadsafe()
{
#if SQLITE_VERSION_NUMBER >= 3005000
return sqlite3_threadsafe() > 0;
@@ -178,7 +178,7 @@ METHOD(enumerator_t, sqlite_enumerator_destroy, void,
sqlite_enumerator_t *this)
{
sqlite3_finalize(this->stmt);
if (!is_threadsave())
if (!is_threadsafe())
{
this->database->mutex->unlock(this->database->mutex);
}
@@ -254,7 +254,7 @@ METHOD(database_t, query, enumerator_t*,
sqlite_enumerator_t *enumerator = NULL;
int i;
if (!is_threadsave())
if (!is_threadsafe())
{
this->mutex->lock(this->mutex);
}
@@ -26,7 +26,7 @@
typedef struct sqlite_database_t sqlite_database_t;
/**
* sqlite databse_t implementation.
* sqlite database_t implementation.
*/
struct sqlite_database_t {
@@ -64,7 +64,7 @@ bool wolfssl_mp2chunk(mp_int *mp, chunk_t *chunk);
bool wolfssl_mp_split(chunk_t chunk, mp_int *a, mp_int *b);
/**
* Concatenates two integers into a chunk, thereby enfocing the length of
* Concatenates two integers into a chunk, thereby enforcing the length of
* a single integer, if necessary, by pre-pending it with zeros.
*
* Note: this function allocates memory for the chunk
+1 -1
View File
@@ -137,7 +137,7 @@ struct private_x509_cert_t {
linked_list_t *permitted_names;
/**
* List of exluced name constraints
* List of excluded name constraints
*/
linked_list_t *excluded_names;
@@ -59,7 +59,7 @@ struct private_x509_ocsp_response_t {
chunk_t encoding;
/**
* data for signature verficiation
* data for signature verification
*/
chunk_t tbsResponseData;
+1 -1
View File
@@ -94,7 +94,7 @@ struct private_scheduler_t {
};
/**
* Comparse two timevals, return >0 if a > b, <0 if a < b and =0 if equal
* Compares two timevals, return >0 if a > b, <0 if a < b and =0 if equal
*/
static int timeval_cmp(timeval_t *a, timeval_t *b)
{
+1 -1
View File
@@ -14,7 +14,7 @@
*/
/**
* @defgroup resolveri resolver
* @defgroup resolver_t resolver
* @{ @ingroup resolver
*/
@@ -62,7 +62,7 @@ static void check_sig_constraints(auth_cfg_t *cfg, auth_rule_t type,
ck_assert(!expected[i]);
}
START_TEST(test_sig_contraints)
START_TEST(test_sig_constraints)
{
auth_cfg_t *cfg;
signature_scheme_t none[] = {0};
@@ -84,7 +84,7 @@ START_TEST(test_sig_contraints)
}
END_TEST
START_TEST(test_ike_contraints_fallback)
START_TEST(test_ike_constraints_fallback)
{
auth_cfg_t *cfg;
@@ -163,7 +163,7 @@ static void check_sig_constraints_params(auth_cfg_t *cfg, auth_rule_t type,
ck_assert(!scheme[i]);
}
START_TEST(test_sig_contraints_params)
START_TEST(test_sig_constraints_params)
{
auth_cfg_t *cfg;
@@ -187,7 +187,7 @@ struct {
{ .pss = { .hash = HASH_SHA256, .mgf1_hash = HASH_SHA256, .salt_len = HASH_SIZE_SHA256, }}, {}}},
};
START_TEST(test_sig_contraints_rsa_pss)
START_TEST(test_sig_constraints_rsa_pss)
{
auth_cfg_t *cfg;
@@ -210,13 +210,13 @@ Suite *auth_cfg_suite_create()
s = suite_create("auth_cfg");
tc = tcase_create("add_pubkey_constraints");
tcase_add_loop_test(tc, test_sig_contraints, 0, countof(sig_constraints_tests));
tcase_add_loop_test(tc, test_ike_contraints_fallback, 0, countof(sig_constraints_tests));
tcase_add_loop_test(tc, test_sig_constraints, 0, countof(sig_constraints_tests));
tcase_add_loop_test(tc, test_ike_constraints_fallback, 0, countof(sig_constraints_tests));
suite_add_tcase(s, tc);
tc = tcase_create("add_pubkey_constraints parameters");
tcase_add_loop_test(tc, test_sig_contraints_params, 0, countof(sig_constraints_params_tests));
tcase_add_loop_test(tc, test_sig_contraints_rsa_pss, 0, countof(sig_constraints_rsa_pss_tests));
tcase_add_loop_test(tc, test_sig_constraints_params, 0, countof(sig_constraints_params_tests));
tcase_add_loop_test(tc, test_sig_constraints_rsa_pss, 0, countof(sig_constraints_rsa_pss_tests));
suite_add_tcase(s, tc);
return s;
@@ -1090,7 +1090,7 @@ END_TEST
static void *cancel_run(void *data)
{
/* default cancellability should be TRUE, so don't change it */
/* default cancelability should be TRUE, so don't change it */
while (TRUE)
{
sleep(10);
@@ -1152,7 +1152,7 @@ START_TEST(test_cancel_onoff)
}
for (i = 0; i < THREADS; i++)
{
/* wait until thread has cleared its cancellability */
/* wait until thread has cleared its cancelability */
while (cancellable[i])
{
sched_yield();
@@ -1172,7 +1172,7 @@ static void *cancel_point_run(void *data)
thread_cancelability(FALSE);
while (TRUE)
{
/* implicitly enables cancellability */
/* implicitly enables cancelability */
thread_cancellation_point();
}
return NULL;
+1 -1
View File
@@ -353,7 +353,7 @@ START_TEST(test_strpfx)
END_TEST
/*******************************************************************************
* mallac_align/free_align
* malloc_align/free_align
*/
START_TEST(test_malloc_align)
+4 -4
View File
@@ -24,12 +24,12 @@
/**
* Do not report mutexes with an overall waiting time smaller than this (in us)
*/
#define PROFILE_WAIT_TRESHHOLD 10000
#define PROFILE_WAIT_TRESHOLD 10000
/**
* Do not report mutexes with an overall lock count smaller than this
*/
#define PROFILE_LOCK_TRESHHOLD 1000
#define PROFILE_LOCK_TRESHOLD 1000
#include <utils/backtrace.h>
@@ -58,8 +58,8 @@ struct lock_profile_t {
static inline void profiler_cleanup(lock_profile_t *profile)
{
if (profile->waited.tv_sec > 0 ||
profile->waited.tv_usec > PROFILE_WAIT_TRESHHOLD ||
profile->locked > PROFILE_LOCK_TRESHHOLD)
profile->waited.tv_usec > PROFILE_WAIT_TRESHOLD ||
profile->locked > PROFILE_LOCK_TRESHOLD)
{
fprintf(stderr, "%d.%03ds / %d times in lock created at:",
profile->waited.tv_sec, profile->waited.tv_usec, profile->locked);
+1 -1
View File
@@ -48,7 +48,7 @@ struct private_mutex_t {
pthread_mutex_t mutex;
/**
* is this a recursiv emutex, implementing private_r_mutex_t?
* is this a recursive mutex, implementing private_r_mutex_t?
*/
bool recursive;
+1 -1
View File
@@ -48,7 +48,7 @@ struct private_thread_t {
thread_t public;
/**
* Identificator of this thread (human-readable/thread ID).
* Identifier of this thread (human-readable/thread ID).
*/
u_int id;
+1 -1
View File
@@ -357,7 +357,7 @@ bool chunk_increment(chunk_t chunk);
*
* @param chunk chunk to check for printability
* @param sane pointer where sane version is allocated, or NULL
* @param replace character to use for replaceing unprintable characters
* @param replace character to use for replacing unprintable characters
* @return TRUE if all characters in chunk are printable
*/
bool chunk_printable(chunk_t chunk, chunk_t *sane, char replace);
+1 -1
View File
@@ -84,7 +84,7 @@ struct enum_name_t {
NULL, { __VA_ARGS__ }}
/**
* Continue a enum name list startetd with ENUM_BEGIN.
* Continue a enum name list started with ENUM_BEGIN.
*
* @param name name of the enum_name list
* @param first enum value of the first enum string
+1 -1
View File
@@ -315,7 +315,7 @@ struct identification_t {
* is interpreted as hex encoded binary data for that ID, otherwise the raw
* string following the prefix is used as identity data, without conversion.
* To specify a non-standard ID type, the numerical type may be prefixed
* between curly backets, building a prefix. For instance the "{1}:" prefix
* between curly brackets, building a prefix. For instance the "{1}:" prefix
* defines an ID_IPV4_ADDR type.
*
* This constructor never returns NULL. If it does not find a suitable