2003-02-28 11:08:34 -05:00
|
|
|
/* LibTomMath, multiple-precision integer library -- Tom St Denis
|
|
|
|
*
|
|
|
|
* LibTomMath is library that provides for multiple-precision
|
|
|
|
* integer arithmetic as well as number theoretic functionality.
|
|
|
|
*
|
|
|
|
* The library is designed directly after the MPI library by
|
|
|
|
* Michael Fromberger but has been written from scratch with
|
|
|
|
* additional optimizations in place.
|
|
|
|
*
|
|
|
|
* The library is free for all purposes without any express
|
|
|
|
* guarantee it works.
|
|
|
|
*
|
2003-03-12 21:11:11 -05:00
|
|
|
* Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org
|
2003-02-28 11:08:34 -05:00
|
|
|
*/
|
|
|
|
#include <tommath.h>
|
|
|
|
|
2003-02-28 11:09:08 -05:00
|
|
|
/* trim unused digits
|
|
|
|
*
|
|
|
|
* This is used to ensure that leading zero digits are
|
|
|
|
* trimed and the leading "used" digit will be non-zero
|
|
|
|
* Typically very fast. Also fixes the sign if there
|
|
|
|
* are no more leading digits
|
|
|
|
*/
|
2003-02-28 11:08:34 -05:00
|
|
|
void
|
|
|
|
mp_clamp (mp_int * a)
|
|
|
|
{
|
2003-03-29 13:16:01 -05:00
|
|
|
while (a->used > 0 && a->dp[a->used - 1] == 0) {
|
2003-02-28 11:08:34 -05:00
|
|
|
--(a->used);
|
2003-03-29 13:16:01 -05:00
|
|
|
}
|
2003-02-28 11:08:34 -05:00
|
|
|
if (a->used == 0) {
|
|
|
|
a->sign = MP_ZPOS;
|
|
|
|
}
|
|
|
|
}
|