2019-09-16 13:50:38 +00:00
|
|
|
#include "tommath_private.h"
|
2006-03-08 13:16:18 +00:00
|
|
|
#ifdef BN_MP_CLAMP_C
|
|
|
|
/* LibTomMath, multiple-precision integer library -- Tom St Denis
|
|
|
|
*
|
|
|
|
* LibTomMath is a library that provides multiple-precision
|
|
|
|
* integer arithmetic as well as number theoretic functionality.
|
|
|
|
*
|
|
|
|
* The library was designed directly after the MPI library by
|
|
|
|
* Michael Fromberger but has been written from scratch with
|
|
|
|
* additional optimizations in place.
|
|
|
|
*
|
2019-09-16 13:50:38 +00:00
|
|
|
* SPDX-License-Identifier: Unlicense
|
2006-03-08 13:16:18 +00:00
|
|
|
*/
|
|
|
|
|
2019-09-16 13:50:38 +00:00
|
|
|
/* trim unused digits
|
2006-03-08 13:16:18 +00: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
|
|
|
|
*/
|
2019-09-16 13:50:38 +00:00
|
|
|
void mp_clamp(mp_int *a)
|
2006-03-08 13:16:18 +00:00
|
|
|
{
|
2019-09-16 13:50:38 +00:00
|
|
|
/* decrease used while the most significant digit is
|
|
|
|
* zero.
|
|
|
|
*/
|
|
|
|
while ((a->used > 0) && (a->dp[a->used - 1] == 0u)) {
|
|
|
|
--(a->used);
|
|
|
|
}
|
2006-03-08 13:16:18 +00:00
|
|
|
|
2019-09-16 13:50:38 +00:00
|
|
|
/* reset the sign flag if used == 0 */
|
|
|
|
if (a->used == 0) {
|
|
|
|
a->sign = MP_ZPOS;
|
|
|
|
}
|
2006-03-08 13:16:18 +00:00
|
|
|
}
|
|
|
|
#endif
|
2007-01-11 03:11:15 +00:00
|
|
|
|
2019-09-16 13:50:38 +00:00
|
|
|
/* ref: HEAD -> master, tag: v1.1.0 */
|
|
|
|
/* git commit: 08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */
|
|
|
|
/* commit time: 2019-01-28 20:32:32 +0100 */
|