AuroraMiddleware/libtommath
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Eliminate unneeded static function: Since b==0 and b==1 are already checked for earlier, it can be simplified and inlined.

Browse Source
This commit is contained in:
nijtmans 2019-05-29 13:47:40 +02:00 committed by Steffen Jaeckel
parent 34f2ddbc91
commit f2d6f52bb9
1 changed files with 5 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
bn_mp_div_d.c
View File

@ -3,24 +3,6 @@
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
/* SPDX-License-Identifier: Unlicense */
static int s_is_power_of_two(mp_digit b, int *p)
{
int x;
/* fast return if no power of two */
if ((b == 0u) || ((b & (b-1u)) != 0u)) {
return 0;
}
for (x = 0; x < MP_DIGIT_BIT; x++) {
if (b == ((mp_digit)1<<(mp_digit)x)) {
*p = x;
return 1;
}
}
return 0;
}
/* single digit division (based on routine from MPI) */
mp_err mp_div_d(const mp_int *a, mp_digit b, mp_int *c, mp_digit *d)
{
@ -47,7 +29,11 @@ mp_err mp_div_d(const mp_int *a, mp_digit b, mp_int *c, mp_digit *d)
}
/* power of two ? */
if (s_is_power_of_two(b, &ix) == 1) {
if ((b & (b-1)) == 0u) {
ix = 1;
while ((ix < MP_DIGIT_BIT) && (b != (((mp_digit)1)<<ix))) {
ix++;
}
if (d != NULL) {
*d = a->dp[0] & (((mp_digit)1<<(mp_digit)ix) - 1uL);
}