Searched refs:calculates (Results 1 - 4 of 4) sorted by relevance

/netbsd-6-1-5-RELEASE/lib/libm/arch/vax/
H A Dn_cabs.S92 # calculates a scaled (factor in %r6)
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/demos/perl/
H A DGMP.pm277 C<inv> calculates 1/q, as per the corresponding GMP function. C<num> and
/netbsd-6-1-5-RELEASE/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/
H A Dtommath.tex2064 obtain what will be the carry for the next iteration. Step 6.2 calculates the $n$'th digit of the result as single precision shift of $a_n$ plus
2315 After the digits have been shifted appropriately at most $lg(\beta) - 1$ shifts are left to perform. Step 5 calculates the number of remaining shifts
3863 This simple routine calculates the reciprocal $\mu$ required by Barrett reduction. Note the extended usage of algorithm mp\_div where the variable
4108 calculates $x + \mu n \beta^{ix}$ by multiplying $\mu n$ and adding the result to $x$ shifted by $ix$ digits. Both the addition and
4132 technique. The Montgomery reduction algorithm cannot directly use the Comba technique to any significant advantage since the inner loop calculates
4574 The algorithm mp\_count\_bits calculates the number of bits in an mp\_int which is used to find the initial value of $p$. The call to mp\_div\_2d
4575 on line 31 calculates both the quotient $q$ and the remainder $a$ required. By doing both in a single function call the code size
4693 & calculates the correct value of $\rho$. \\
H A Dbn.tex1408 Which calculates $a = R$ for the odd moduli $b$ without using multiplication or division.

Completed in 212 milliseconds