root / www / HPL_lmul.html @ 7
Historique | Voir | Annoter | Télécharger (1,59 ko)
1 |
<HTML>
|
---|---|
2 |
<HEAD>
|
3 |
<TITLE>HPL_lmul 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_lmul</B> multiplies 2 long positive integers. |
11 |
|
12 |
<H1>Synopsis</H1> |
13 |
<CODE>#include "hpl.h"</CODE><BR><BR> |
14 |
<CODE>void</CODE> |
15 |
<CODE>HPL_lmul(</CODE> |
16 |
<CODE>int *</CODE> |
17 |
<CODE>K</CODE>, |
18 |
<CODE>int *</CODE> |
19 |
<CODE>J</CODE>, |
20 |
<CODE>int *</CODE> |
21 |
<CODE>I</CODE> |
22 |
<CODE>);</CODE> |
23 |
|
24 |
<H1>Description</H1> |
25 |
<B>HPL_lmul</B> |
26 |
multiplies without carry two long positive integers K and J |
27 |
and put the result into I. The long integers I, J, K are encoded on |
28 |
31 bits using an array of 2 integers. The 16-lower bits are stored in |
29 |
the first entry of each array, the 15-higher bits in the second entry |
30 |
of each array. For efficiency purposes, the intrisic modulo function |
31 |
is inlined. |
32 |
|
33 |
<H1>Arguments</H1> |
34 |
<PRE>
|
35 |
K (local input) int * |
36 |
On entry, K is an integer array of dimension 2 containing the |
37 |
encoded long integer K. |
38 |
</PRE>
|
39 |
<PRE>
|
40 |
J (local input) int * |
41 |
On entry, J is an integer array of dimension 2 containing the |
42 |
encoded long integer J. |
43 |
</PRE>
|
44 |
<PRE>
|
45 |
I (local output) int * |
46 |
On entry, I is an integer array of dimension 2. On exit, this |
47 |
array contains the encoded long integer result. |
48 |
</PRE>
|
49 |
|
50 |
<H1>See Also</H1> |
51 |
<A HREF="HPL_ladd.html">HPL_ladd</A>, |
52 |
<A HREF="HPL_setran.html">HPL_setran</A>, |
53 |
<A HREF="HPL_xjumpm.html">HPL_xjumpm</A>, |
54 |
<A HREF="HPL_jumpit.html">HPL_jumpit</A>, |
55 |
<A HREF="HPL_rand.html">HPL_rand</A>. |
56 |
|
57 |
</BODY>
|
58 |
</HTML>
|