libtommath/bn_mp_cnt_lsb.c

51 lines
1.1 KiB
C
Raw Normal View History

#include "tommath_private.h"
2004-10-29 22:07:18 +00:00
#ifdef BN_MP_CNT_LSB_C
2003-07-02 15:39:39 +00:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
2003-08-05 01:24:44 +00:00
* LibTomMath is a library that provides multiple-precision
2003-07-02 15:39:39 +00:00
* integer arithmetic as well as number theoretic functionality.
*
2003-08-05 01:24:44 +00:00
* The library was designed directly after the MPI library by
2003-07-02 15:39:39 +00:00
* Michael Fromberger but has been written from scratch with
* additional optimizations in place.
*
2018-12-29 16:56:20 +00:00
* SPDX-License-Identifier: Unlicense
2003-07-02 15:39:39 +00:00
*/
2017-08-30 03:51:11 +00:00
static const int lnz[16] = {
2004-04-11 20:46:22 +00:00
4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0
};
2003-07-02 15:39:39 +00:00
/* Counts the number of lsbs which are zero before the first zero bit */
int mp_cnt_lsb(const mp_int *a)
2003-07-02 15:39:39 +00:00
{
int x;
2004-04-11 20:46:22 +00:00
mp_digit q, qq;
2003-07-02 15:39:39 +00:00
2003-08-05 01:24:44 +00:00
/* easy out */
2018-12-31 11:15:44 +00:00
if (IS_ZERO(a)) {
2003-07-02 15:39:39 +00:00
return 0;
}
/* scan lower digits until non-zero */
2017-10-15 17:57:12 +00:00
for (x = 0; (x < a->used) && (a->dp[x] == 0u); x++) {}
2003-07-02 15:39:39 +00:00
q = a->dp[x];
x *= DIGIT_BIT;
/* now scan this digit until a 1 is found */
2017-10-15 17:57:12 +00:00
if ((q & 1u) == 0u) {
2004-04-11 20:46:22 +00:00
do {
2017-10-15 17:57:12 +00:00
qq = q & 15u;
2004-04-11 20:46:22 +00:00
x += lnz[qq];
q >>= 4;
2017-10-15 17:57:12 +00:00
} while (qq == 0u);
2003-07-02 15:39:39 +00:00
}
return x;
}
2004-10-29 22:07:18 +00:00
#endif
2005-08-01 16:37:28 +00:00
2017-08-28 14:27:26 +00:00
/* ref: $Format:%D$ */
/* git commit: $Format:%H$ */
/* commit time: $Format:%ai$ */