summaryrefslogtreecommitdiffstats
path: root/mpi
diff options
context:
space:
mode:
authorWerner Koch <wk@gnupg.org>1998-04-14 19:51:16 +0200
committerWerner Koch <wk@gnupg.org>1998-04-14 19:51:16 +0200
commit700c438def7defcdda1e806f4652b89987485882 (patch)
tree4bcf95b64e4e012351d8a837e329249a2963a397 /mpi
parentnew release (diff)
downloadgnupg2-700c438def7defcdda1e806f4652b89987485882.tar.xz
gnupg2-700c438def7defcdda1e806f4652b89987485882.zip
applied Mathews typo and grammar fixes
Diffstat (limited to 'mpi')
-rw-r--r--mpi/mpi-bit.c2
-rw-r--r--mpi/mpi-div.c2
-rw-r--r--mpi/mpicoder.c12
-rw-r--r--mpi/mpih-mul.c4
4 files changed, 10 insertions, 10 deletions
diff --git a/mpi/mpi-bit.c b/mpi/mpi-bit.c
index cae29d225..d74abbf6d 100644
--- a/mpi/mpi-bit.c
+++ b/mpi/mpi-bit.c
@@ -75,7 +75,7 @@ mpi_get_nbits( MPI a )
/****************
- * Test wether bit N is set.
+ * Test whether bit N is set.
*/
int
mpi_test_bit( MPI a, unsigned n )
diff --git a/mpi/mpi-div.c b/mpi/mpi-div.c
index b00b45425..f057232a2 100644
--- a/mpi/mpi-div.c
+++ b/mpi/mpi-div.c
@@ -311,7 +311,7 @@ mpi_tdiv_q_2exp( MPI w, MPI u, unsigned count )
}
/****************
- * Check wether dividend is divisible by divisor
+ * Check whether dividend is divisible by divisor
* (note: divisor must fit into a limb)
*/
int
diff --git a/mpi/mpicoder.c b/mpi/mpicoder.c
index a4b1c2095..a868923fe 100644
--- a/mpi/mpicoder.c
+++ b/mpi/mpicoder.c
@@ -125,7 +125,7 @@ mpi_read(IOBUF inp, unsigned *ret_nread, int secure)
/****************
- * Make a mpi from a character string.
+ * Make an mpi from a character string.
*/
int
mpi_fromstr(MPI val, const char *str)
@@ -200,7 +200,7 @@ mpi_fromstr(MPI val, const char *str)
/****************
- * print an MPI to the give stream and return the number of characters
+ * print an MPI to the given stream and return the number of characters
* printed.
*/
int
@@ -236,9 +236,9 @@ mpi_print( FILE *fp, MPI a, int mode )
/****************
- * Special function to get the low 8 bytes from a mpi,
- * this can be used as a keyid, KEYID is an 2 element array.
- * Does return the low 4 bytes.
+ * Special function to get the low 8 bytes from an mpi.
+ * This can be used as a keyid; KEYID is an 2 element array.
+ * Return the low 4 bytes.
*/
u32
mpi_get_keyid( MPI a, u32 *keyid )
@@ -262,7 +262,7 @@ mpi_get_keyid( MPI a, u32 *keyid )
/****************
- * Return a m_alloced buffer with the MPI (msb first).
+ * Return an m_alloced buffer with the MPI (msb first).
* NBYTES receives the length of this buffer. Caller must free the
* return string (This function does return a 0 byte buffer with NBYTES
* set to zero if the value of A is zero. If sign is not NULL, it will
diff --git a/mpi/mpih-mul.c b/mpi/mpih-mul.c
index b02664695..f402f4ae7 100644
--- a/mpi/mpih-mul.c
+++ b/mpi/mpih-mul.c
@@ -120,7 +120,7 @@ mul_n( mpi_ptr_t prodp, mpi_ptr_t up, mpi_ptr_t vp,
mpi_size_t size, mpi_ptr_t tspace )
{
if( size & 1 ) {
- /* The size is odd, the code code below doesn't handle that.
+ /* The size is odd, and the code below doesn't handle that.
* Multiply the least significant (size - 1) limbs with a recursive
* call, and handle the most significant limb of S1 and S2
* separately.
@@ -269,7 +269,7 @@ void
mpih_sqr_n( mpi_ptr_t prodp, mpi_ptr_t up, mpi_size_t size, mpi_ptr_t tspace)
{
if( size & 1 ) {
- /* The size is odd, the code code below doesn't handle that.
+ /* The size is odd, and the code below doesn't handle that.
* Multiply the least significant (size - 1) limbs with a recursive
* call, and handle the most significant limb of S1 and S2
* separately.