GSP
Quick Navigator

Search Site

Unix VPS
A - Starter
B - Basic
C - Preferred
D - Commercial
MPS - Dedicated
Previous VPSs
* Sign Up! *

Support
Contact Us
Online Help
Handbooks
Domain Status
Man Pages

FAQ
Virtual Servers
Pricing
Billing
Technical

Network
Facilities
Connectivity
Topology Map

Miscellaneous
Server Agreement
Year 2038
Credits
 

USA Flag

 

 

Man Pages


Manual Reference Pages  -  HPL_LMUL (3)

NAME

HPL_lmul - multiplies 2 long positive integers.

CONTENTS

Synopsis
Description
Arguments
See Also

SYNOPSIS

#include "hpl.h"

void HPL_lmul( int * K, int * J, int * I );

DESCRIPTION

HPL_lmul multiplies without carry two long positive integers K and J and puts the result into I. The long integers I, J, K are encoded on 64 bits using an array of 2 integers. The 32-lower bits are stored in the first entry of each array, the 32-higher bits in the second entry of each array. For efficiency purposes, the intrisic modulo function is inlined.

ARGUMENTS

K (local input) int *
  On entry, K is an integer array of dimension 2 containing the encoded long integer K.
J (local input) int *
  On entry, J is an integer array of dimension 2 containing the encoded long integer J.
I (local output) int *
  On entry, I is an integer array of dimension 2. On exit, this array contains the encoded long integer result.

SEE ALSO

HPL_ladd (3), HPL_setran (3), HPL_xjumpm (3), HPL_jumpit (3), HPL_rand (3).
Search for    or go to Top of page |  Section 3 |  Main Index


HPL 2.1 HPL_LMUL (3) October 26, 2012

Powered by GSP Visit the GSP FreeBSD Man Page Interface.
Output converted with manServer 1.07.