Mercurial > dropbear

comparison libtommath/bn_mp_clamp.c @ 1655:f52919ffd3b1

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
update ltm to 1.1.0 and enable FIPS 186.4 compliant key-generation (#79) * make key-generation compliant to FIPS 186.4 * fix includes in tommath_class.h * update fuzzcorpus instead of error-out * fixup fuzzing make-targets * update Makefile.in * apply necessary patches to ltm sources * clean-up not required ltm files * update to vanilla ltm 1.1.0 this already only contains the required files * remove set/get double
author Steffen Jaeckel <s_jaeckel@gmx.de>
date Mon, 16 Sep 2019 15:50:38 +0200
parents 8bba51a55704
children 1051e4eea25a
comparison
equal deleted inserted replaced
1654:cc0fc5131c5c 1655:f52919ffd3b1
1 #include <tommath_private.h> 1 #include "tommath_private.h"
2 #ifdef BN_MP_CLAMP_C 2 #ifdef BN_MP_CLAMP_C
3 /* LibTomMath, multiple-precision integer library -- Tom St Denis 3 /* LibTomMath, multiple-precision integer library -- Tom St Denis
4 * 4 *
5 * LibTomMath is a library that provides multiple-precision 5 * LibTomMath is a library that provides multiple-precision
6 * integer arithmetic as well as number theoretic functionality. 6 * integer arithmetic as well as number theoretic functionality.
7 * 7 *
8 * The library was designed directly after the MPI library by 8 * The library was designed directly after the MPI library by
9 * Michael Fromberger but has been written from scratch with 9 * Michael Fromberger but has been written from scratch with
10 * additional optimizations in place. 10 * additional optimizations in place.
11 * 11 *
12 * The library is free for all purposes without any express 12 * SPDX-License-Identifier: Unlicense
13 * guarantee it works.
14 *
15 * Tom St Denis, [email protected], http://libtom.org
16 */ 13 */
17 14
18 /* trim unused digits 15 /* trim unused digits
19 * 16 *
20 * This is used to ensure that leading zero digits are 17 * This is used to ensure that leading zero digits are
21 * trimed and the leading "used" digit will be non-zero 18 * trimed and the leading "used" digit will be non-zero
22 * Typically very fast. Also fixes the sign if there 19 * Typically very fast. Also fixes the sign if there
23 * are no more leading digits 20 * are no more leading digits
24 */ 21 */
25 void 22 void mp_clamp(mp_int *a)
26 mp_clamp (mp_int * a)
27 { 23 {
28 /* decrease used while the most significant digit is 24 /* decrease used while the most significant digit is
29 * zero. 25 * zero.
30 */ 26 */
31 while ((a->used > 0) && (a->dp[a->used - 1] == 0)) { 27 while ((a->used > 0) && (a->dp[a->used - 1] == 0u)) {
32 --(a->used); 28 --(a->used);
33 } 29 }
34 30
35 /* reset the sign flag if used == 0 */ 31 /* reset the sign flag if used == 0 */
36 if (a->used == 0) { 32 if (a->used == 0) {
37 a->sign = MP_ZPOS; 33 a->sign = MP_ZPOS;
38 } 34 }
39 } 35 }
40 #endif 36 #endif
41 37
42 /* ref: $Format:%D$ */ 38 /* ref: HEAD -> master, tag: v1.1.0 */
43 /* git commit: $Format:%H$ */ 39 /* git commit: 08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */
44 /* commit time: $Format:%ai$ */ 40 /* commit time: 2019-01-28 20:32:32 +0100 */