Statistiques
| Révision :

root / man / man3 / HPL_lmul.3 @ 1

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

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