root / www / HPL_ladd.html
Historique | Voir | Annoter | Télécharger (1,51 ko)
| 1 |
<HTML>
|
|---|---|
| 2 |
<HEAD>
|
| 3 |
<TITLE>HPL_ladd HPL 2.0 Library Functions September 10, 2008</TITLE> |
| 4 |
</HEAD>
|
| 5 |
|
| 6 |
<BODY BGCOLOR="WHITE" TEXT = "#000000" LINK = "#0000ff" VLINK = "#000099" |
| 7 |
ALINK = "#ffff00"> |
| 8 |
|
| 9 |
<H1>Name</H1> |
| 10 |
<B>HPL_ladd</B> Adds two long positive integers. |
| 11 |
|
| 12 |
<H1>Synopsis</H1> |
| 13 |
<CODE>#include "hpl.h"</CODE><BR><BR> |
| 14 |
<CODE>void</CODE> |
| 15 |
<CODE>HPL_ladd(</CODE> |
| 16 |
<CODE>int *</CODE> |
| 17 |
<CODE>J</CODE>, |
| 18 |
<CODE>int *</CODE> |
| 19 |
<CODE>K</CODE>, |
| 20 |
<CODE>int *</CODE> |
| 21 |
<CODE>I</CODE> |
| 22 |
<CODE>);</CODE> |
| 23 |
|
| 24 |
<H1>Description</H1> |
| 25 |
<B>HPL_ladd</B> |
| 26 |
adds without carry two long positive integers K and J an |
| 27 |
put the result into I. The long integers I, J, K are encoded on 31 |
| 28 |
bits using an array of 2 integers. The 16-lower bits are stored i |
| 29 |
the first entry of each array, the 15-higher bits in the second |
| 30 |
entry. |
| 31 |
|
| 32 |
<H1>Arguments</H1> |
| 33 |
<PRE>
|
| 34 |
J (local input) int * |
| 35 |
On entry, J is an integer array of dimension 2 containing the |
| 36 |
encoded long integer J. |
| 37 |
</PRE>
|
| 38 |
<PRE>
|
| 39 |
K (local input) int * |
| 40 |
On entry, K is an integer array of dimension 2 containing the |
| 41 |
encoded long integer K. |
| 42 |
</PRE>
|
| 43 |
<PRE>
|
| 44 |
I (local output) int * |
| 45 |
On entry, I is an integer array of dimension 2. On exit, this |
| 46 |
array contains the encoded long integer result. |
| 47 |
</PRE>
|
| 48 |
|
| 49 |
<H1>See Also</H1> |
| 50 |
<A HREF="HPL_lmul.html">HPL_lmul</A>, |
| 51 |
<A HREF="HPL_setran.html">HPL_setran</A>, |
| 52 |
<A HREF="HPL_xjumpm.html">HPL_xjumpm</A>, |
| 53 |
<A HREF="HPL_jumpit.html">HPL_jumpit</A>, |
| 54 |
<A HREF="HPL_rand.html">HPL_rand</A>. |
| 55 |
|
| 56 |
</BODY>
|
| 57 |
</HTML>
|