/src/dropbear/libtommath/bn_mp_clamp.c
Line | Count | Source |
1 | | #include "tommath_private.h" |
2 | | #ifdef BN_MP_CLAMP_C |
3 | | /* LibTomMath, multiple-precision integer library -- Tom St Denis */ |
4 | | /* SPDX-License-Identifier: Unlicense */ |
5 | | |
6 | | /* trim unused digits |
7 | | * |
8 | | * This is used to ensure that leading zero digits are |
9 | | * trimed and the leading "used" digit will be non-zero |
10 | | * Typically very fast. Also fixes the sign if there |
11 | | * are no more leading digits |
12 | | */ |
13 | | void mp_clamp(mp_int *a) |
14 | 21.3M | { |
15 | | /* decrease used while the most significant digit is |
16 | | * zero. |
17 | | */ |
18 | 57.2M | while ((a->used > 0) && (a->dp[a->used - 1] == 0u)) { |
19 | 35.9M | --(a->used); |
20 | 35.9M | } |
21 | | |
22 | | /* reset the sign flag if used == 0 */ |
23 | 21.3M | if (a->used == 0) { |
24 | 164k | a->sign = MP_ZPOS; |
25 | 164k | } |
26 | 21.3M | } |
27 | | #endif |