s/comparision/comparison/.

I typoed this word and then auto-complete duplicated it all over the
place. This change fixes all the comments.

This change has no semantic effect (comment only).

Change-Id: I8952e9e71302043574757cd74a05e66500008432
This commit is contained in:
Adam Langley 2015-01-06 10:49:48 -08:00
parent 46a7ca0fa3
commit 0ed0cf6f38
4 changed files with 9 additions and 9 deletions

View File

@ -1102,7 +1102,7 @@ static int aead_aes_key_wrap_seal(const EVP_AEAD_CTX *ctx, uint8_t *out,
/* The code below only handles a 32-bit |t| thus 6*|n| must be less than /* The code below only handles a 32-bit |t| thus 6*|n| must be less than
* 2^32, where |n| is |in_len| / 8. So in_len < 4/3 * 2^32 and we * 2^32, where |n| is |in_len| / 8. So in_len < 4/3 * 2^32 and we
* conservatively cap it to 2^32-16 to stop 32-bit platforms complaining that * conservatively cap it to 2^32-16 to stop 32-bit platforms complaining that
* a comparision is always true. */ * a comparison is always true. */
if (in_len > 0xfffffff0) { if (in_len > 0xfffffff0) {
OPENSSL_PUT_ERROR(CIPHER, aead_aes_key_wrap_seal, CIPHER_R_TOO_LARGE); OPENSSL_PUT_ERROR(CIPHER, aead_aes_key_wrap_seal, CIPHER_R_TOO_LARGE);
return 0; return 0;
@ -1197,7 +1197,7 @@ static int aead_aes_key_wrap_open(const EVP_AEAD_CTX *ctx, uint8_t *out,
/* The code below only handles a 32-bit |t| thus 6*|n| must be less than /* The code below only handles a 32-bit |t| thus 6*|n| must be less than
* 2^32, where |n| is |in_len| / 8. So in_len < 4/3 * 2^32 and we * 2^32, where |n| is |in_len| / 8. So in_len < 4/3 * 2^32 and we
* conservatively cap it to 2^32-8 to stop 32-bit platforms complaining that * conservatively cap it to 2^32-8 to stop 32-bit platforms complaining that
* a comparision is always true. */ * a comparison is always true. */
if (in_len > 0xfffffff8) { if (in_len > 0xfffffff8) {
OPENSSL_PUT_ERROR(CIPHER, aead_aes_key_wrap_open, CIPHER_R_TOO_LARGE); OPENSSL_PUT_ERROR(CIPHER, aead_aes_key_wrap_open, CIPHER_R_TOO_LARGE);
return 0; return 0;

View File

@ -151,7 +151,7 @@ static uint32_t class_hash(const EX_CLASS_ITEM *a) {
return a->class_value; return a->class_value;
} }
/* class_cmp is a comparision function for an LHASH of |EX_CLASS_ITEM| /* class_cmp is a comparison function for an LHASH of |EX_CLASS_ITEM|
* structures. */ * structures. */
static int class_cmp(const EX_CLASS_ITEM *a, const EX_CLASS_ITEM *b) { static int class_cmp(const EX_CLASS_ITEM *a, const EX_CLASS_ITEM *b) {
return a->class_value - b->class_value; return a->class_value - b->class_value;

View File

@ -116,7 +116,7 @@ typedef struct lhash_item_st {
uint32_t hash; uint32_t hash;
} LHASH_ITEM; } LHASH_ITEM;
/* lhash_cmp_func is a comparision function that returns a value equal, or not /* lhash_cmp_func is a comparison function that returns a value equal, or not
* equal, to zero depending on whether |*a| is equal, or not equal to |*b|, * equal, to zero depending on whether |*a| is equal, or not equal to |*b|,
* respectively. Note the difference between this and |stack_cmp_func| in that * respectively. Note the difference between this and |stack_cmp_func| in that
* this takes pointers to the objects directly. */ * this takes pointers to the objects directly. */

View File

@ -86,10 +86,10 @@ extern "C" {
* STACK_OF(foo), the macros would be sk_foo_new, sk_foo_pop etc. */ * STACK_OF(foo), the macros would be sk_foo_new, sk_foo_pop etc. */
/* stack_cmp_func is a comparision function that returns a value < 0, 0 or > 0 /* stack_cmp_func is a comparison function that returns a value < 0, 0 or > 0
* if |*a| is less than, equal to or greater than |*b|, respectively. Note the * if |*a| is less than, equal to or greater than |*b|, respectively. Note the
* extra indirection - the function is given a pointer to a pointer to the * extra indirection - the function is given a pointer to a pointer to the
* element. This differs from the usual qsort/bsearch comparision function. */ * element. This differs from the usual qsort/bsearch comparison function. */
typedef int (*stack_cmp_func)(const void **a, const void **b); typedef int (*stack_cmp_func)(const void **a, const void **b);
/* stack_st contains an array of pointers. It is not designed to be used /* stack_st contains an array of pointers. It is not designed to be used
@ -104,7 +104,7 @@ typedef struct stack_st {
/* num_alloc contains the number of pointers allocated in the buffer pointed /* num_alloc contains the number of pointers allocated in the buffer pointed
* to by |data|, which may be larger than |num|. */ * to by |data|, which may be larger than |num|. */
size_t num_alloc; size_t num_alloc;
/* comp is an optional comparision function. */ /* comp is an optional comparison function. */
stack_cmp_func comp; stack_cmp_func comp;
} _STACK; } _STACK;
@ -203,7 +203,7 @@ DEFINE_SPECIAL_STACK_OF(OPENSSL_BLOCK, uint8_t)
/* These are the raw stack functions, you shouldn't be using them. Rather you /* These are the raw stack functions, you shouldn't be using them. Rather you
* should be using the type stack macros implemented above. */ * should be using the type stack macros implemented above. */
/* sk_new creates a new, empty stack with the given comparision function, which /* sk_new creates a new, empty stack with the given comparison function, which
* may be zero. It returns the new stack or NULL on allocation failure. */ * may be zero. It returns the new stack or NULL on allocation failure. */
OPENSSL_EXPORT _STACK *sk_new(stack_cmp_func comp); OPENSSL_EXPORT _STACK *sk_new(stack_cmp_func comp);
@ -249,7 +249,7 @@ OPENSSL_EXPORT void *sk_delete(_STACK *sk, size_t where);
* otherwise it returns NULL. */ * otherwise it returns NULL. */
OPENSSL_EXPORT void *sk_delete_ptr(_STACK *sk, void *p); OPENSSL_EXPORT void *sk_delete_ptr(_STACK *sk, void *p);
/* sk_find returns the first value in the stack equal to |p|. If a comparision /* sk_find returns the first value in the stack equal to |p|. If a comparison
* function has been set on the stack, then equality is defined by it and the * function has been set on the stack, then equality is defined by it and the
* stack will be sorted if need be so that a binary search can be used. * stack will be sorted if need be so that a binary search can be used.
* Otherwise pointer equality is used. If a matching element is found, its * Otherwise pointer equality is used. If a matching element is found, its