tommath/bn_mp_clamp.c

44 lines
1.1 KiB
C
Raw Normal View History

#include <tommath_private.h>
2004-10-29 18:07:18 -04:00
#ifdef BN_MP_CLAMP_C
2003-02-28 11:08:34 -05:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
2003-08-04 21:24:44 -04:00
* LibTomMath is a library that provides multiple-precision
2003-02-28 11:08:34 -05:00
* integer arithmetic as well as number theoretic functionality.
*
2003-08-04 21:24:44 -04:00
* The library was designed directly after the MPI library by
2003-02-28 11:08:34 -05:00
* 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.
*
* Tom St Denis, tstdenis82@gmail.com, http://libtom.org
2003-02-28 11:08:34 -05:00
*/
2017-08-29 23:51:11 -04:00
/* trim unused digits
2003-02-28 11:09:08 -05:00
*
* 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
*/
2017-08-30 13:07:12 -04:00
void mp_clamp(mp_int *a)
2003-02-28 11:08:34 -05:00
{
2017-08-29 16:23:48 -04:00
/* decrease used while the most significant digit is
* zero.
*/
2017-10-15 13:57:12 -04:00
while ((a->used > 0) && (a->dp[a->used - 1] == 0u)) {
2017-08-29 16:23:48 -04:00
--(a->used);
}
2003-08-04 21:24:44 -04:00
2017-08-29 16:23:48 -04:00
/* reset the sign flag if used == 0 */
if (a->used == 0) {
a->sign = MP_ZPOS;
}
2003-02-28 11:08:34 -05:00
}
2004-10-29 18:07:18 -04:00
#endif
2005-08-01 12:37:28 -04:00
2017-08-28 10:27:26 -04:00
/* ref: $Format:%D$ */
/* git commit: $Format:%H$ */
/* commit time: $Format:%ai$ */