Statistiques
| Révision :

root / man / man3 / HPL_ladd.3

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

1 1 equemene
.TH HPL_ladd 3 "September 10, 2008" "HPL 2.0" "HPL Library Functions"
2 1 equemene
.SH NAME
3 1 equemene
HPL_ladd \- Adds two 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_ladd(\fR
9 1 equemene
\fB\&int *\fR
10 1 equemene
\fI\&J\fR,
11 1 equemene
\fB\&int *\fR
12 1 equemene
\fI\&K\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_ladd\fR
18 1 equemene
adds  without carry two long positive integers  K and J  an
19 1 equemene
put the result into I.  The long integers  I, J, K are encoded on 31
20 1 equemene
bits using an array of 2 integers.  The 16-lower bits  are stored  i
21 1 equemene
the  first  entry  of each array,  the 15-higher bits  in the second
22 1 equemene
entry.
23 1 equemene
.SH ARGUMENTS
24 1 equemene
.TP 8
25 1 equemene
J       (local input)           int *
26 1 equemene
On entry, J is an integer array of dimension 2 containing the
27 1 equemene
encoded long integer J.
28 1 equemene
.TP 8
29 1 equemene
K       (local input)           int *
30 1 equemene
On entry, K is an integer array of dimension 2 containing the
31 1 equemene
encoded long integer K.
32 1 equemene
.TP 8
33 1 equemene
I       (local output)          int *
34 1 equemene
On entry, I is an integer array of dimension 2. On exit, this
35 1 equemene
array contains the encoded long integer result.
36 1 equemene
.SH SEE ALSO
37 1 equemene
.BR HPL_lmul \ (3),
38 1 equemene
.BR HPL_setran \ (3),
39 1 equemene
.BR HPL_xjumpm \ (3),
40 1 equemene
.BR HPL_jumpit \ (3),
41 1 equemene
.BR HPL_rand \ (3).