From 657e60fa00ddde3618600d6306be913214d30457 Mon Sep 17 00:00:00 2001 From: Ulf Möller Date: Thu, 3 Feb 2000 23:23:24 +0000 Subject: ispell (and minor modifications) --- crypto/bf/bf_ecb.c | 4 ++-- crypto/bf/bf_enc.c | 2 +- crypto/bf/bf_locl.h | 6 +++--- crypto/bf/bf_opts.c | 2 +- crypto/bf/bfspeed.c | 2 +- 5 files changed, 8 insertions(+), 8 deletions(-) (limited to 'crypto/bf') diff --git a/crypto/bf/bf_ecb.c b/crypto/bf/bf_ecb.c index 9f8a24cdff..d8d6fff0ff 100644 --- a/crypto/bf/bf_ecb.c +++ b/crypto/bf/bf_ecb.c @@ -61,11 +61,11 @@ #include /* Blowfish as implemented from 'Blowfish: Springer-Verlag paper' - * (From LECTURE NOTES IN COIMPUTER SCIENCE 809, FAST SOFTWARE ENCRYPTION, + * (From LECTURE NOTES IN COMPUTER SCIENCE 809, FAST SOFTWARE ENCRYPTION, * CAMBRIDGE SECURITY WORKSHOP, CAMBRIDGE, U.K., DECEMBER 9-11, 1993) */ -const char *BF_version="BlowFish" OPENSSL_VERSION_PTEXT; +const char *BF_version="Blowfish" OPENSSL_VERSION_PTEXT; const char *BF_options(void) { diff --git a/crypto/bf/bf_enc.c b/crypto/bf/bf_enc.c index ee01834561..3d805759b5 100644 --- a/crypto/bf/bf_enc.c +++ b/crypto/bf/bf_enc.c @@ -60,7 +60,7 @@ #include "bf_locl.h" /* Blowfish as implemented from 'Blowfish: Springer-Verlag paper' - * (From LECTURE NOTES IN COIMPUTER SCIENCE 809, FAST SOFTWARE ENCRYPTION, + * (From LECTURE NOTES IN COMPUTER SCIENCE 809, FAST SOFTWARE ENCRYPTION, * CAMBRIDGE SECURITY WORKSHOP, CAMBRIDGE, U.K., DECEMBER 9-11, 1993) */ diff --git a/crypto/bf/bf_locl.h b/crypto/bf/bf_locl.h index 05756b5d3b..cc7c3ec992 100644 --- a/crypto/bf/bf_locl.h +++ b/crypto/bf/bf_locl.h @@ -148,7 +148,7 @@ *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ *((c)++)=(unsigned char)(((l) )&0xff)) -/* This is actually a big endian algorithm, the most significate byte +/* This is actually a big endian algorithm, the most significant byte * is used to lookup array 0 */ #if defined(BF_PTR2) @@ -183,8 +183,8 @@ /* * This is normally very good on RISC platforms where normally you - * have to explicitely "multiplicate" array index by sizeof(BF_LONG) - * in order to caclulate the effective address. This implementation + * have to explicitly "multiply" array index by sizeof(BF_LONG) + * in order to calculate the effective address. This implementation * excuses CPU from this extra work. Power[PC] uses should have most * fun as (R>>BF_i)&BF_M gets folded into a single instruction, namely * rlwinm. So let'em double-check if their compiler does it. diff --git a/crypto/bf/bf_opts.c b/crypto/bf/bf_opts.c index 5f330cc53c..bbe32b28c9 100644 --- a/crypto/bf/bf_opts.c +++ b/crypto/bf/bf_opts.c @@ -242,7 +242,7 @@ int main(int argc, char **argv) } #ifndef TIMES - fprintf(stderr,"To get the most acurate results, try to run this\n"); + fprintf(stderr,"To get the most accurate results, try to run this\n"); fprintf(stderr,"program when this computer is idle.\n"); #endif diff --git a/crypto/bf/bfspeed.c b/crypto/bf/bfspeed.c index 9b893e92cc..ecc9dff4e4 100644 --- a/crypto/bf/bfspeed.c +++ b/crypto/bf/bfspeed.c @@ -183,7 +183,7 @@ int main(int argc, char **argv) #endif #ifndef TIMES - printf("To get the most acurate results, try to run this\n"); + printf("To get the most accurate results, try to run this\n"); printf("program when this computer is idle.\n"); #endif -- cgit v1.2.3