forked from ibphoenix/tomsfastmath
32 lines
651 B
C
32 lines
651 B
C
/* TomsFastMath, a fast ISO C bignum library.
|
|
*
|
|
* This project is meant to fill in where LibTomMath
|
|
* falls short. That is speed ;-)
|
|
*
|
|
* This project is public domain and free for all purposes.
|
|
*
|
|
* Tom St Denis, tomstdenis@iahu.ca
|
|
*/
|
|
#include <tfm.h>
|
|
|
|
int fp_cmp_mag(fp_int *a, fp_int *b)
|
|
{
|
|
int x;
|
|
|
|
if (a->used > b->used) {
|
|
return FP_GT;
|
|
} else if (a->used < b->used) {
|
|
return FP_LT;
|
|
} else {
|
|
for (x = a->used - 1; x >= 0; x--) {
|
|
if (a->dp[x] > b->dp[x]) {
|
|
return FP_GT;
|
|
} else if (a->dp[x] < b->dp[x]) {
|
|
return FP_LT;
|
|
}
|
|
}
|
|
}
|
|
return FP_EQ;
|
|
}
|
|
|