Fix typos in modules/icp/

Reviewed-by: Ryan Moeller <ryan@ixsystems.com>
Reviewed-by: Richard Laager <rlaager@wiktel.com>
Reviewed-by: Brian Behlendorf <behlendorf1@llnl.gov>
Signed-off-by: Andrea Gelmini <andrea.gelmini@gelma.net>
Closes #9239
This commit is contained in:
Andrea Gelmini 2019-08-30 23:26:07 +02:00 committed by Tony Hutter
parent bcfa65802c
commit 8c01eb1c4a
12 changed files with 22 additions and 22 deletions

View File

@ -159,7 +159,7 @@ Skein_256_Process_Block(Skein_256_Ctxt_t *ctx, const uint8_t *blkPtr,
ts[r + (R) + 2] = ts[r + (R) - 1]; \ ts[r + (R) + 2] = ts[r + (R) - 1]; \
Skein_Show_R_Ptr(BLK_BITS, &ctx->h, SKEIN_RND_KEY_INJECT, Xptr); Skein_Show_R_Ptr(BLK_BITS, &ctx->h, SKEIN_RND_KEY_INJECT, Xptr);
/* loop thru it */ /* loop through it */
for (r = 1; r < 2 * RCNT; r += 2 * SKEIN_UNROLL_256) for (r = 1; r < 2 * RCNT; r += 2 * SKEIN_UNROLL_256)
#endif #endif
{ {
@ -385,7 +385,7 @@ Skein_512_Process_Block(Skein_512_Ctxt_t *ctx, const uint8_t *blkPtr,
ts[r + (R)+2] = ts[r + (R) - 1]; \ ts[r + (R)+2] = ts[r + (R) - 1]; \
Skein_Show_R_Ptr(BLK_BITS, &ctx->h, SKEIN_RND_KEY_INJECT, Xptr); Skein_Show_R_Ptr(BLK_BITS, &ctx->h, SKEIN_RND_KEY_INJECT, Xptr);
/* loop thru it */ /* loop through it */
for (r = 1; r < 2 * RCNT; r += 2 * SKEIN_UNROLL_512) for (r = 1; r < 2 * RCNT; r += 2 * SKEIN_UNROLL_512)
#endif /* end of looped code definitions */ #endif /* end of looped code definitions */
{ {
@ -667,7 +667,7 @@ Skein1024_Process_Block(Skein1024_Ctxt_t *ctx, const uint8_t *blkPtr,
ts[r + (R) + 2] = ts[r + (R) - 1]; \ ts[r + (R) + 2] = ts[r + (R) - 1]; \
Skein_Show_R_Ptr(BLK_BITS, &ctx->h, SKEIN_RND_KEY_INJECT, Xptr); Skein_Show_R_Ptr(BLK_BITS, &ctx->h, SKEIN_RND_KEY_INJECT, Xptr);
/* loop thru it */ /* loop through it */
for (r = 1; r <= 2 * RCNT; r += 2 * SKEIN_UNROLL_1024) for (r = 1; r <= 2 * RCNT; r += 2 * SKEIN_UNROLL_1024)
#endif #endif
{ {

View File

@ -63,7 +63,7 @@
* *
* Returns: * Returns:
* CRYPTO_SUCCESS when the context template is successfully created. * CRYPTO_SUCCESS when the context template is successfully created.
* CRYPTO_HOST_MEMEORY: mem alloc failure * CRYPTO_HOST_MEMORY: mem alloc failure
* CRYPTO_ARGUMENTS_BAD: NULL storage for the ctx template. * CRYPTO_ARGUMENTS_BAD: NULL storage for the ctx template.
* RYPTO_MECHANISM_INVALID: invalid mechanism 'mech'. * RYPTO_MECHANISM_INVALID: invalid mechanism 'mech'.
*/ */
@ -123,7 +123,7 @@ crypto_create_ctx_template(crypto_mechanism_t *mech, crypto_key_t *key,
* crypto_create_ctx_template() * crypto_create_ctx_template()
* *
* Description: * Description:
* Frees the inbedded crypto_spi_ctx_template_t, then the * Frees the embedded crypto_spi_ctx_template_t, then the
* kcf_ctx_template_t. * kcf_ctx_template_t.
* *
* Context: * Context:

View File

@ -101,7 +101,7 @@
* must display the following acknowledgement: * must display the following acknowledgement:
* "This product includes cryptographic software written by * "This product includes cryptographic software written by
* Eric Young (eay@cryptsoft.com)" * Eric Young (eay@cryptsoft.com)"
* The word 'cryptographic' can be left out if the rouines from the library * The word 'cryptographic' can be left out if the routines from the library
* being used are not cryptographic related :-). * being used are not cryptographic related :-).
* 4. If you include any Windows specific code (or a derivative thereof) from * 4. If you include any Windows specific code (or a derivative thereof) from
* the apps directory (application code) you must include an acknowledgement: * the apps directory (application code) you must include an acknowledgement:

View File

@ -327,7 +327,7 @@ extern "C" {
* On some systems speed will be improved by aligning the AES large lookup * On some systems speed will be improved by aligning the AES large lookup
* tables on particular boundaries. This define should be set to a power of * tables on particular boundaries. This define should be set to a power of
* two giving the desired alignment. It can be left undefined if alignment * two giving the desired alignment. It can be left undefined if alignment
* is not needed. This option is specific to the Micrsoft VC++ compiler - * is not needed. This option is specific to the Microsoft VC++ compiler -
* it seems to sometimes cause trouble for the VC++ version 6 compiler. * it seems to sometimes cause trouble for the VC++ version 6 compiler.
*/ */

View File

@ -103,7 +103,7 @@ kcf_mech_entry_tab_t kcf_mech_tabs_tab[KCF_LAST_OPSCLASS + 1] = {
* Per-algorithm internal thresholds for the minimum input size of before * Per-algorithm internal thresholds for the minimum input size of before
* offloading to hardware provider. * offloading to hardware provider.
* Dispatching a crypto operation to a hardware provider entails paying the * Dispatching a crypto operation to a hardware provider entails paying the
* cost of an additional context switch. Measurments with Sun Accelerator 4000 * cost of an additional context switch. Measurements with Sun Accelerator 4000
* shows that 512-byte jobs or smaller are better handled in software. * shows that 512-byte jobs or smaller are better handled in software.
* There is room for refinement here. * There is room for refinement here.
* *

View File

@ -182,7 +182,7 @@ kcf_areqnode_alloc(kcf_provider_desc_t *pd, kcf_context_t *ictx,
* reached, signal the creator thread for more threads. * reached, signal the creator thread for more threads.
* *
* If the two conditions above are not met, we don't need to do * If the two conditions above are not met, we don't need to do
* any thing. The request will be picked up by one of the * anything. The request will be picked up by one of the
* worker threads when it becomes available. * worker threads when it becomes available.
*/ */
static int static int
@ -1182,7 +1182,7 @@ kcf_aop_done(kcf_areq_node_t *areq, int error)
/* /*
* Handle recoverable errors. This has to be done first * Handle recoverable errors. This has to be done first
* before doing any thing else in this routine so that * before doing anything else in this routine so that
* we do not change the state of the request. * we do not change the state of the request.
*/ */
if (error != CRYPTO_SUCCESS && IS_RECOVERABLE(error)) { if (error != CRYPTO_SUCCESS && IS_RECOVERABLE(error)) {
@ -1432,7 +1432,7 @@ crypto_cancel_req(crypto_req_id_t id)
/* /*
* There is no interface to remove an entry * There is no interface to remove an entry
* once it is on the taskq. So, we do not do * once it is on the taskq. So, we do not do
* any thing for a hardware provider. * anything for a hardware provider.
*/ */
break; break;
default: default:
@ -1535,7 +1535,7 @@ kcf_misc_kstat_update(kstat_t *ksp, int rw)
} }
/* /*
* Allocate and initiatize a kcf_dual_req, used for saving the arguments of * Allocate and initialize a kcf_dual_req, used for saving the arguments of
* a dual operation or an atomic operation that has to be internally * a dual operation or an atomic operation that has to be internally
* simulated with multiple single steps. * simulated with multiple single steps.
* crq determines the memory allocation flags. * crq determines the memory allocation flags.
@ -1551,7 +1551,7 @@ kcf_alloc_req(crypto_call_req_t *crq)
if (kcr == NULL) if (kcr == NULL)
return (NULL); return (NULL);
/* Copy the whole crypto_call_req struct, as it isn't persistant */ /* Copy the whole crypto_call_req struct, as it isn't persistent */
if (crq != NULL) if (crq != NULL)
kcr->kr_callreq = *crq; kcr->kr_callreq = *crq;
else else
@ -1579,7 +1579,7 @@ kcf_next_req(void *next_req_arg, int status)
kcf_provider_desc_t *pd = NULL; kcf_provider_desc_t *pd = NULL;
crypto_dual_data_t *ct = NULL; crypto_dual_data_t *ct = NULL;
/* Stop the processing if an error occured at this step */ /* Stop the processing if an error occurred at this step */
if (error != CRYPTO_SUCCESS) { if (error != CRYPTO_SUCCESS) {
out: out:
areq->an_reqarg = next_req->kr_callreq; areq->an_reqarg = next_req->kr_callreq;

View File

@ -93,7 +93,7 @@
* will use the generic implementation. * will use the generic implementation.
* *
* 7) Removing sha384 and sha512 code: The sha code was actually very * 7) Removing sha384 and sha512 code: The sha code was actually very
* wasy to port. However, the generic sha384 and sha512 code actually * easy to port. However, the generic sha384 and sha512 code actually
* exceeds the stack size on arm and powerpc architectures. In an effort * exceeds the stack size on arm and powerpc architectures. In an effort
* to remove warnings, this code was removed. * to remove warnings, this code was removed.
* *

View File

@ -237,7 +237,7 @@ typedef struct kcf_provider_list {
struct kcf_provider_desc *pl_provider; struct kcf_provider_desc *pl_provider;
} kcf_provider_list_t; } kcf_provider_list_t;
/* atomic operations in linux implictly form a memory barrier */ /* atomic operations in linux implicitly form a memory barrier */
#define membar_exit() #define membar_exit()
/* /*

View File

@ -381,7 +381,7 @@ typedef struct kcf_pool {
/* /*
* cv & lock for the condition where more threads need to be * cv & lock for the condition where more threads need to be
* created. kp_user_lock also protects the three fileds above. * created. kp_user_lock also protects the three fields above.
*/ */
kcondvar_t kp_user_cv; /* Creator cond. variable */ kcondvar_t kp_user_cv; /* Creator cond. variable */
kmutex_t kp_user_lock; /* Creator lock */ kmutex_t kp_user_lock; /* Creator lock */
@ -448,13 +448,13 @@ typedef struct kcf_ntfy_elem {
* The following values are based on the assumption that it would * The following values are based on the assumption that it would
* take around eight cpus to load a hardware provider (This is true for * take around eight cpus to load a hardware provider (This is true for
* at least one product) and a kernel client may come from different * at least one product) and a kernel client may come from different
* low-priority interrupt levels. We will have CYRPTO_TASKQ_MIN number * low-priority interrupt levels. We will have CRYPTO_TASKQ_MIN number
* of cached taskq entries. The CRYPTO_TASKQ_MAX number is based on * of cached taskq entries. The CRYPTO_TASKQ_MAX number is based on
* a throughput of 1GB/s using 512-byte buffers. These are just * a throughput of 1GB/s using 512-byte buffers. These are just
* reasonable estimates and might need to change in future. * reasonable estimates and might need to change in future.
*/ */
#define CRYPTO_TASKQ_THREADS 8 #define CRYPTO_TASKQ_THREADS 8
#define CYRPTO_TASKQ_MIN 64 #define CRYPTO_TASKQ_MIN 64
#define CRYPTO_TASKQ_MAX 2 * 1024 * 1024 #define CRYPTO_TASKQ_MAX 2 * 1024 * 1024
extern int crypto_taskq_threads; extern int crypto_taskq_threads;

View File

@ -699,7 +699,7 @@ typedef struct crypto_provider_info {
/* /*
* Provider status passed by a provider to crypto_provider_notification(9F) * Provider status passed by a provider to crypto_provider_notification(9F)
* and returned by the provider_stauts(9E) entry point. * and returned by the provider_status(9E) entry point.
*/ */
#define CRYPTO_PROVIDER_READY 0 #define CRYPTO_PROVIDER_READY 0
#define CRYPTO_PROVIDER_BUSY 1 #define CRYPTO_PROVIDER_BUSY 1

View File

@ -48,7 +48,7 @@
* The number returned need _not_ be between 0 and nchains. The mod_hash * The number returned need _not_ be between 0 and nchains. The mod_hash
* code will take care of doing that. The second argument (after the * code will take care of doing that. The second argument (after the
* key) to the hashing function is a void * that represents * key) to the hashing function is a void * that represents
* hash_alg_data-- this is provided so that the hashing algrorithm can * hash_alg_data-- this is provided so that the hashing algorithm can
* maintain some state across calls, or keep algorithm-specific * maintain some state across calls, or keep algorithm-specific
* constants associated with the hash table. * constants associated with the hash table.
* *

View File

@ -40,7 +40,7 @@
* minalloc and maxalloc values to be used for taskq_create(). * minalloc and maxalloc values to be used for taskq_create().
*/ */
int crypto_taskq_threads = CRYPTO_TASKQ_THREADS; int crypto_taskq_threads = CRYPTO_TASKQ_THREADS;
int crypto_taskq_minalloc = CYRPTO_TASKQ_MIN; int crypto_taskq_minalloc = CRYPTO_TASKQ_MIN;
int crypto_taskq_maxalloc = CRYPTO_TASKQ_MAX; int crypto_taskq_maxalloc = CRYPTO_TASKQ_MAX;
static void remove_provider(kcf_provider_desc_t *); static void remove_provider(kcf_provider_desc_t *);