diff options
| author | Werner Koch <wk@gnupg.org> | 2010-04-12 21:00:13 +0000 |
|---|---|---|
| committer | Werner Koch <wk@gnupg.org> | 2010-04-12 21:00:13 +0000 |
| commit | b27adc0e2c1a785e11ad2cb3e7ae06ebfffc4659 (patch) | |
| tree | d4328e71da78835577378bd593b55107ae12e59b /cipher/primegen.c | |
| parent | 0af2459c2da81c3e346b145948c1b94d49105b52 (diff) | |
| download | libgcrypt-b27adc0e2c1a785e11ad2cb3e7ae06ebfffc4659.tar.gz | |
Applied spelling fixes and more verbose test diagnositcs by Brad Hards.
Diffstat (limited to 'cipher/primegen.c')
| -rw-r--r-- | cipher/primegen.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/cipher/primegen.c b/cipher/primegen.c index b869bee8..f0727754 100644 --- a/cipher/primegen.c +++ b/cipher/primegen.c @@ -988,7 +988,7 @@ is_prime (gcry_mpi_t n, int steps, unsigned int *count) /* Given ARRAY of size N with M elements set to true produce a modified array with the next permutation of M elements. Note, that ARRAY is used in a one-bit-per-byte approach. To detected the last - permutation it is useful to intialize the array with the first M + permutation it is useful to initialize the array with the first M element set to true and use this test: m_out_of_n (array, m, n); for (i = j = 0; i < n && j < m; i++) @@ -1170,7 +1170,7 @@ gcry_prime_generate (gcry_mpi_t *prime, unsigned int prime_bits, return gcry_error (err); } -/* Check wether the number X is prime. */ +/* Check whether the number X is prime. */ gcry_error_t gcry_prime_check (gcry_mpi_t x, unsigned int flags) { |