Home | History | Annotate | Download | only in libtommath

Lines Matching defs:two

286 not normally significantly slower.  On x86 machines the difference is normally a factor of two when performing modular
321 The last two codes listed are not actually ``return'ed'' by a function. They are placed in an integer (the caller must
594 Within the mp\_int structure are two parameters which control the limitations of the array of digits that represent
641 Setting mp\_ints to small constants is a relatively common operation. To accomodate these instances there are two
739 To both initialize and set small constants the following two functions are available.
804 In figure \ref{fig:CMP} two integers $a$ and $b$ are being compared. In this case $a$ is said to be ``to the left'' of
810 mp\_int structures. This is analogous to an absolute comparison. The function mp\_cmp\_mag() will compare two
867 To compare two mp\_int variables based on their signed value the mp\_cmp() function is provided.
874 This will compare $a$ to the left of $b$. It will first compare the signs of the two mp\_int variables. If they
975 \subsection{Multiplication by two}
977 Multiplications and divisions by any power of two can be performed with quick logical shifts either left or
980 When multiplying or dividing by two a special case routine can be used which are as follows.
1005 /* multiply by two */
1017 /* now divide by two */
1043 Since $10 > 7$ and $5 < 7$. To multiply by a power of two the following function can be used.
1053 To divide by a power of two use the following.
1104 To compute an addition or subtraction the following two functions can be used.
1566 This function is actually a shell around the two internal exponentiation functions. This routine will automatically
1569 and the other two algorithms.