1
0
mirror of http://galexander.org/git/simplesshd.git synced 2024-11-27 09:48:08 +00:00
simplesshd/dropbear/libtommath/bn_mp_cnt_lsb.c

54 lines
1.3 KiB
C
Raw Normal View History

2019-06-09 20:44:26 +00:00
#include <tommath_private.h>
2014-12-10 21:56:49 +00:00
#ifdef BN_MP_CNT_LSB_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.
*
* The library is free for all purposes without any express
* guarantee it works.
*
2019-06-09 20:44:26 +00:00
* Tom St Denis, tstdenis82@gmail.com, http://libtom.org
2014-12-10 21:56:49 +00:00
*/
static const int lnz[16] = {
4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0
};
/* Counts the number of lsbs which are zero before the first zero bit */
int mp_cnt_lsb(mp_int *a)
{
int x;
mp_digit q, qq;
/* easy out */
2019-06-09 20:44:26 +00:00
if (mp_iszero(a) == MP_YES) {
2014-12-10 21:56:49 +00:00
return 0;
}
/* scan lower digits until non-zero */
2019-06-09 20:44:26 +00:00
for (x = 0; (x < a->used) && (a->dp[x] == 0); x++) {}
2014-12-10 21:56:49 +00:00
q = a->dp[x];
x *= DIGIT_BIT;
/* now scan this digit until a 1 is found */
if ((q & 1) == 0) {
do {
qq = q & 15;
x += lnz[qq];
q >>= 4;
} while (qq == 0);
}
return x;
}
#endif
2019-06-09 20:44:26 +00:00
/* ref: $Format:%D$ */
/* git commit: $Format:%H$ */
/* commit time: $Format:%ai$ */