Statistiques
| Révision :

root / man / man3 / HPL_lmul.3 @ 1

Historique | Voir | Annoter | Télécharger (1,19 ko)

1 1 equemene
.TH HPL_lmul 3 "September 10, 2008" "HPL 2.0" "HPL Library Functions"
2 1 equemene
.SH NAME
3 1 equemene
HPL_lmul \- multiplies 2 long positive integers.
4 1 equemene
.SH SYNOPSIS
5 1 equemene
\fB\&#include "hpl.h"\fR
6 1 equemene
7 1 equemene
\fB\&void\fR
8 1 equemene
\fB\&HPL_lmul(\fR
9 1 equemene
\fB\&int *\fR
10 1 equemene
\fI\&K\fR,
11 1 equemene
\fB\&int *\fR
12 1 equemene
\fI\&J\fR,
13 1 equemene
\fB\&int *\fR
14 1 equemene
\fI\&I\fR
15 1 equemene
\fB\&);\fR
16 1 equemene
.SH DESCRIPTION
17 1 equemene
\fB\&HPL_lmul\fR
18 1 equemene
multiplies  without carry two long positive integers K and J
19 1 equemene
and put the result into I.  The long integers  I, J, K are encoded on
20 1 equemene
31 bits using an array of 2 integers. The 16-lower bits are stored in
21 1 equemene
the first entry of each array, the 15-higher bits in the second entry
22 1 equemene
of each array. For efficiency purposes, the  intrisic modulo function
23 1 equemene
is inlined.
24 1 equemene
.SH ARGUMENTS
25 1 equemene
.TP 8
26 1 equemene
K       (local input)           int *
27 1 equemene
On entry, K is an integer array of dimension 2 containing the
28 1 equemene
encoded long integer K.
29 1 equemene
.TP 8
30 1 equemene
J       (local input)           int *
31 1 equemene
On entry, J is an integer array of dimension 2 containing the
32 1 equemene
encoded long integer J.
33 1 equemene
.TP 8
34 1 equemene
I       (local output)          int *
35 1 equemene
On entry, I is an integer array of dimension 2. On exit, this
36 1 equemene
array contains the encoded long integer result.
37 1 equemene
.SH SEE ALSO
38 1 equemene
.BR HPL_ladd \ (3),
39 1 equemene
.BR HPL_setran \ (3),
40 1 equemene
.BR HPL_xjumpm \ (3),
41 1 equemene
.BR HPL_jumpit \ (3),
42 1 equemene
.BR HPL_rand \ (3).