From e6e81c589487cadab8882e4a81609d9c95bba62e Mon Sep 17 00:00:00 2001 From: =?utf8?q?Ulf=20M=C3=B6ller?= Date: Fri, 7 Nov 2003 00:07:28 +0000 Subject: [PATCH] oops... the description of ->top was inaccurate (the example is correct though) --- doc/crypto/bn_internal.pod | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/doc/crypto/bn_internal.pod b/doc/crypto/bn_internal.pod index 9805a7c9f2..46abb0547f 100644 --- a/doc/crypto/bn_internal.pod +++ b/doc/crypto/bn_internal.pod @@ -72,7 +72,7 @@ applications. typedef struct bignum_st { - int top; /* index of last used d (most significant word) */ + int top; /* index of last used d (most significant word) + 1 */ BN_ULONG *d; /* pointer to an array of 'BITS2' bit chunks */ int max; /* size of the d array */ int neg; /* sign */ @@ -84,7 +84,7 @@ in size (B), depending on the 'number of bits' specified in C. B is the size of the B array that has been allocated. B -is the 'last' entry being used, so for a value of 4, bn.d[0]=4 and +is the 'last' entry being used plus one, so for a value of 4, bn.d[0]=4 and bn.top=1. B is 1 if the number is negative. When a B is B<0>, the B field can be B and B == B<0>. @@ -202,7 +202,7 @@ call bn_expand2(), which allocates a new B array and copies the data. They return B on error, B otherwise. The bn_fix_top() macro reduces Btop> to point to the most -significant non-zero word when B has shrunk. +significant non-zero word plus one when B has shrunk. =head2 Debugging -- 2.25.1