2018-05-03 22:01:45 +00:00
|
|
|
#include "tommath_private.h"
|
|
|
|
#ifdef BN_MP_GET_BIT_C
|
|
|
|
|
2019-04-07 13:29:11 +00:00
|
|
|
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
|
|
|
|
/* SPDX-License-Identifier: Unlicense */
|
2018-05-03 22:01:45 +00:00
|
|
|
|
|
|
|
/* Checks the bit at position b and returns MP_YES
|
|
|
|
if the bit is 1, MP_NO if it is 0 and MP_VAL
|
|
|
|
in case of error */
|
|
|
|
int mp_get_bit(const mp_int *a, int b)
|
|
|
|
{
|
|
|
|
int limb;
|
|
|
|
mp_digit bit, isset;
|
|
|
|
|
|
|
|
if (b < 0) {
|
|
|
|
return MP_VAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
limb = b / DIGIT_BIT;
|
2018-05-21 20:17:48 +00:00
|
|
|
|
|
|
|
if (limb >= a->used) {
|
2019-03-26 10:20:31 +00:00
|
|
|
return MP_NO;
|
2018-05-21 20:17:48 +00:00
|
|
|
}
|
|
|
|
|
2018-05-25 23:39:03 +00:00
|
|
|
bit = (mp_digit)(1) << (b % DIGIT_BIT);
|
|
|
|
|
2018-05-03 22:01:45 +00:00
|
|
|
isset = a->dp[limb] & bit;
|
2018-12-26 07:21:51 +00:00
|
|
|
return (isset != 0u) ? MP_YES : MP_NO;
|
2018-05-03 22:01:45 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|