X-Git-Url: https://git.librecmc.org/?a=blobdiff_plain;f=doc%2Fcrypto%2FDSA_generate_parameters.pod;h=43f60b0eb955bc4bcb84b8d577855b85cb2cf4fe;hb=3b2cbbcb9ae6093510b00c459e73104095a29ab9;hp=bae4e1b5604facb1805588dda5de44a6c2958b3e;hpb=a87030a1edf0e4c6d601895f810b2d0da84ee10a;p=oweals%2Fopenssl.git

diff --git a/doc/crypto/DSA_generate_parameters.pod b/doc/crypto/DSA_generate_parameters.pod
index bae4e1b560..43f60b0eb9 100644
--- a/doc/crypto/DSA_generate_parameters.pod
+++ b/doc/crypto/DSA_generate_parameters.pod
@@ -2,15 +2,15 @@
 
 =head1 NAME
 
-DSA_generate_parameters - Generate DSA parameters
+DSA_generate_parameters - generate DSA parameters
 
 =head1 SYNOPSIS
 
  #include <openssl/dsa.h>
 
- DSA *	DSA_generate_parameters(int bits, unsigned char *seed,
+ DSA *DSA_generate_parameters(int bits, unsigned char *seed,
                 int seed_len, int *counter_ret, unsigned long *h_ret,
-		void (*callback)(), void *cb_arg);
+		void (*callback)(int, int, void *), void *cb_arg);
 
 =head1 DESCRIPTION
 
@@ -42,9 +42,11 @@ When a candidate for q is generated, B<callback(0, m++, cb_arg)> is called
 
 =item *
 
-While a candidate for q is tested, B<callback(1, i, cb_arg)>
-is called in the outer loop of the Miller-Rabin primality tests
-(once for each witness that confirms that the candidate may be prime).
+When a candidate for q has passed a test by trial division,
+B<callback(1, -1, cb_arg)> is called.
+While a candidate for q is tested by Miller-Rabin primality tests,
+B<callback(1, i, cb_arg)> is called in the outer loop
+(once for each witness that confirms that the candidate may be prime);
 i is the loop counter (starting at 0).
 
 =item *
@@ -59,8 +61,10 @@ B<callback(0, counter, cb_arg)> is called.
 
 =item *
 
-While a candidate for p is tested, B<callback(1, j++, cb_arg)>
-is called in the outer loop of the Miller-Rabin primality test
+When a candidate for p has passed the test by trial division,
+B<callback(1, -1, cb_arg)> is called.
+While it is tested by the Miller-Rabin primality test,
+B<callback(1, i, cb_arg)> is called in the outer loop
 (once for each witness that confirms that the candidate may be prime).
 i is the loop counter (starting at 0).