Mercurial > dropbear
comparison libtommath/bn_mp_reduce_is_2k_l.c @ 1739:13d834efc376 fuzz
merge from main
author | Matt Johnston <matt@ucc.asn.au> |
---|---|
date | Thu, 15 Oct 2020 19:55:15 +0800 |
parents | 1051e4eea25a |
children |
comparison
equal
deleted
inserted
replaced
1562:768ebf737aa0 | 1739:13d834efc376 |
---|---|
1 #include <tommath_private.h> | 1 #include "tommath_private.h" |
2 #ifdef BN_MP_REDUCE_IS_2K_L_C | 2 #ifdef BN_MP_REDUCE_IS_2K_L_C |
3 /* LibTomMath, multiple-precision integer library -- Tom St Denis | 3 /* LibTomMath, multiple-precision integer library -- Tom St Denis */ |
4 * | 4 /* SPDX-License-Identifier: Unlicense */ |
5 * LibTomMath is a library that provides multiple-precision | |
6 * integer arithmetic as well as number theoretic functionality. | |
7 * | |
8 * The library was designed directly after the MPI library by | |
9 * Michael Fromberger but has been written from scratch with | |
10 * additional optimizations in place. | |
11 * | |
12 * The library is free for all purposes without any express | |
13 * guarantee it works. | |
14 * | |
15 * Tom St Denis, [email protected], http://libtom.org | |
16 */ | |
17 | 5 |
18 /* determines if reduce_2k_l can be used */ | 6 /* determines if reduce_2k_l can be used */ |
19 int mp_reduce_is_2k_l(mp_int *a) | 7 mp_bool mp_reduce_is_2k_l(const mp_int *a) |
20 { | 8 { |
21 int ix, iy; | 9 int ix, iy; |
22 | 10 |
23 if (a->used == 0) { | 11 if (a->used == 0) { |
24 return MP_NO; | 12 return MP_NO; |
25 } else if (a->used == 1) { | 13 } else if (a->used == 1) { |
26 return MP_YES; | 14 return MP_YES; |
27 } else if (a->used > 1) { | 15 } else if (a->used > 1) { |
28 /* if more than half of the digits are -1 we're sold */ | 16 /* if more than half of the digits are -1 we're sold */ |
29 for (iy = ix = 0; ix < a->used; ix++) { | 17 for (iy = ix = 0; ix < a->used; ix++) { |
30 if (a->dp[ix] == MP_MASK) { | 18 if (a->dp[ix] == MP_DIGIT_MAX) { |
31 ++iy; | 19 ++iy; |
32 } | 20 } |
33 } | 21 } |
34 return (iy >= (a->used/2)) ? MP_YES : MP_NO; | 22 return (iy >= (a->used/2)) ? MP_YES : MP_NO; |
35 | 23 } else { |
24 return MP_NO; | |
36 } | 25 } |
37 return MP_NO; | |
38 } | 26 } |
39 | 27 |
40 #endif | 28 #endif |
41 | |
42 /* ref: $Format:%D$ */ | |
43 /* git commit: $Format:%H$ */ | |
44 /* commit time: $Format:%ai$ */ |