36 lines
788 B
C
36 lines
788 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@gmail.com
|
||
|
|
*/
|
||
|
|
#include "bignum_fast.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;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
/* $Source: /cvs/libtom/tomsfastmath/src/addsub/fp_cmp_mag.c,v $ */
|
||
|
|
/* $Revision: 1.1 $ */
|
||
|
|
/* $Date: 2006/12/31 21:25:53 $ */
|