1 files changed, 26 insertions, 28 deletions
diff --git a/secure/lib/libcrypto/man/bn_internal.3 b/secure/lib/libcrypto/man/bn_internal.3
index 6bfd50f..dfaae53 100644
--- a/secure/lib/libcrypto/man/bn_internal.3
+++ b/secure/lib/libcrypto/man/bn_internal.3
@@ -1,8 +1,7 @@
-.\" Automatically generated by Pod::Man version 1.15
-.\" Wed Mar 17 09:38:41 2004
+.\" Automatically generated by Pod::Man v1.37, Pod::Parser v1.14
 .\"
 .\" Standard preamble:
-.\" ======================================================================
+.\" ========================================================================
 .de Sh \" Subsection heading
 .br
 .if t .Sp
@@ -15,12 +14,6 @@
 .if t .sp .5v
 .if n .sp
 ..
-.de Ip \" List item
-.br
-.ie \\n(.$>=3 .ne \\$3
-.el .ne 3
-.IP "\\$1" \\$2
-..
 .de Vb \" Begin verbatim text
 .ft CW
 .nf
@@ -28,15 +21,14 @@
 ..
 .de Ve \" End verbatim text
 .ft R
-
 .fi
 ..
 .\" Set up some character translations and predefined strings.  \*(-- will
 .\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
 .\" double quote, and \*(R" will give a right double quote.  | will give a
-.\" real vertical bar.  \*(C+ will give a nicer C++.  Capital omega is used
-.\" to do unbreakable dashes and therefore won't be available.  \*(C` and
-.\" \*(C' expand to `' in nroff, nothing in troff, for use with C<>
+.\" real vertical bar.  \*(C+ will give a nicer C++.  Capital omega is used to
+.\" do unbreakable dashes and therefore won't be available.  \*(C` and \*(C'
+.\" expand to `' in nroff, nothing in troff, for use with C<>.
 .tr \(*W-|\(bv\*(Tr
 .ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
 .ie n \{\
@@ -56,10 +48,10 @@
 .    ds R" ''
 'br\}
 .\"
-.\" If the F register is turned on, we'll generate index entries on stderr
-.\" for titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and
-.\" index entries marked with X<> in POD.  Of course, you'll have to process
-.\" the output yourself in some meaningful fashion.
+.\" If the F register is turned on, we'll generate index entries on stderr for
+.\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
+.\" entries marked with X<> in POD.  Of course, you'll have to process the
+.\" output yourself in some meaningful fashion.
 .if \nF \{\
 .    de IX
 .    tm Index:\\$1\t\\n%\t"\\$2"
@@ -68,14 +60,13 @@
 .    rr F
 .\}
 .\"
-.\" For nroff, turn off justification.  Always turn off hyphenation; it
-.\" makes way too many mistakes in technical documents.
+.\" For nroff, turn off justification.  Always turn off hyphenation; it makes
+.\" way too many mistakes in technical documents.
 .hy 0
 .if n .na
 .\"
 .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
 .\" Fear.  Run.  Save yourself.  No user-serviceable parts.
-.bd B 3
 .    \" fudge factors for nroff and troff
 .if n \{\
 .    ds #H 0
@@ -135,11 +126,10 @@
 .    ds Ae AE
 .\}
 .rm #[ #] #H #V #F C
-.\" ======================================================================
+.\" ========================================================================
 .\"
 .IX Title "bn_internal 3"
-.TH bn_internal 3 "0.9.7d" "2004-03-17" "OpenSSL"
-.UC
+.TH bn_internal 3 "2005-02-24" "0.9.7d" "OpenSSL"
 .SH "NAME"
 bn_mul_words, bn_mul_add_words, bn_sqr_words, bn_div_words,
 bn_add_words, bn_sub_words, bn_mul_comba4, bn_mul_comba8,
@@ -147,7 +137,7 @@ bn_sqr_comba4, bn_sqr_comba8, bn_cmp_words, bn_mul_normal,
 bn_mul_low_normal, bn_mul_recursive, bn_mul_part_recursive,
 bn_mul_low_recursive, bn_mul_high, bn_sqr_normal, bn_sqr_recursive,
 bn_expand, bn_wexpand, bn_expand2, bn_fix_top, bn_check_top,
-bn_print, bn_dump, bn_set_max, bn_set_high, bn_set_low \- \s-1BIGNUM\s0
+bn_print, bn_dump, bn_set_max, bn_set_high, bn_set_low \- BIGNUM
 library internal functions
 .SH "SYNOPSIS"
 .IX Header "SYNOPSIS"
@@ -162,15 +152,18 @@ library internal functions
 \& BN_ULONG bn_sub_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,
 \&   int num);
 .Ve
+.PP
 .Vb 4
 \& void bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b);
 \& void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b);
 \& void bn_sqr_comba4(BN_ULONG *r, BN_ULONG *a);
 \& void bn_sqr_comba8(BN_ULONG *r, BN_ULONG *a);
 .Ve
+.PP
 .Vb 1
 \& int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n);
 .Ve
+.PP
 .Vb 11
 \& void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b,
 \&   int nb);
@@ -184,21 +177,25 @@ library internal functions
 \& void bn_mul_high(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, BN_ULONG *l,
 \&   int n2, BN_ULONG *tmp);
 .Ve
+.PP
 .Vb 2
 \& void bn_sqr_normal(BN_ULONG *r, BN_ULONG *a, int n, BN_ULONG *tmp);
 \& void bn_sqr_recursive(BN_ULONG *r, BN_ULONG *a, int n2, BN_ULONG *tmp);
 .Ve
+.PP
 .Vb 3
 \& void mul(BN_ULONG r, BN_ULONG a, BN_ULONG w, BN_ULONG c);
 \& void mul_add(BN_ULONG r, BN_ULONG a, BN_ULONG w, BN_ULONG c);
 \& void sqr(BN_ULONG r0, BN_ULONG r1, BN_ULONG a);
 .Ve
+.PP
 .Vb 4
 \& BIGNUM *bn_expand(BIGNUM *a, int bits);
 \& BIGNUM *bn_wexpand(BIGNUM *a, int n);
 \& BIGNUM *bn_expand2(BIGNUM *a, int n);
 \& void bn_fix_top(BIGNUM *a);
 .Ve
+.PP
 .Vb 6
 \& void bn_check_top(BIGNUM *a);
 \& void bn_print(BIGNUM *a);
@@ -224,6 +221,7 @@ applications.
 \&        int neg;      /* sign */
 \&        } BIGNUM;
 .Ve
+.PP
 The big number is stored in \fBd\fR, a \fImalloc()\fRed array of \fB\s-1BN_ULONG\s0\fRs,
 least significant first. A \fB\s-1BN_ULONG\s0\fR can be either 16, 32 or 64 bits
 in size (\fB\s-1BITS2\s0\fR), depending on the 'number of bits' specified in
@@ -239,7 +237,7 @@ Various routines in this library require the use of temporary
 allocation to create \fB\s-1BIGNUM\s0\fRs is rather expensive when used in
 conjunction with repeated subroutine calls, the \fB\s-1BN_CTX\s0\fR structure is
 used.  This structure contains \fB\s-1BN_CTX_NUM\s0\fR \fB\s-1BIGNUM\s0\fRs, see
-BN_CTX_start(3).
+\&\fIBN_CTX_start\fR\|(3).
 .Sh "Low-level arithmetic operations"
 .IX Subsection "Low-level arithmetic operations"
 These functions are implemented in C and for several platforms in
@@ -255,7 +253,7 @@ the result in \fBrp\fR, and returns the high word (carry).
 .PP
 bn_sqr_words(\fBrp\fR, \fBap\fR, \fBn\fR) operates on the \fBnum\fR word array
 \&\fBap\fR and the 2*\fBnum\fR word array \fBap\fR.  It computes \fBap\fR * \fBap\fR
-word-wise, and places the low and high bytes of the result in \fBrp\fR.
+word\-wise, and places the low and high bytes of the result in \fBrp\fR.
 .PP
 bn_div_words(\fBh\fR, \fBl\fR, \fBd\fR) divides the two word number (\fBh\fR,\fBl\fR)
 by \fBd\fR and returns the result.
@@ -345,7 +343,7 @@ number.  \fIbn_wexpand()\fR ensures that \fBb\fR has enough space for an
 call \fIbn_expand2()\fR, which allocates a new \fBd\fR array and copies the
 data.  They return \fB\s-1NULL\s0\fR on error, \fBb\fR otherwise.
 .PP
-The \fIbn_fix_top()\fR macro reduces \fBa->top\fR to point to the most
+The \fIbn_fix_top()\fR macro reduces \fBa\->top\fR to point to the most
 significant non-zero word when \fBa\fR has shrunk.
 .Sh "Debugging"
 .IX Subsection "Debugging"
@@ -363,4 +361,4 @@ If \fB\s-1BN_DEBUG\s0\fR is not defined, \fIbn_check_top()\fR, \fIbn_print()\fR,
 and \fIbn_set_max()\fR are defined as empty macros.
 .SH "SEE ALSO"
 .IX Header "SEE ALSO"
-bn(3)
+\&\fIbn\fR\|(3)