libtommath/mp_lshd.c

43 lines
983 B
C
Raw Normal View History

#include "tommath_private.h"
#ifdef MP_LSHD_C
2019-04-07 13:29:11 +00:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
/* SPDX-License-Identifier: Unlicense */
2003-02-28 16:08:34 +00:00
/* shift left a certain amount of digits */
mp_err mp_lshd(mp_int *a, int b)
2003-02-28 16:08:34 +00:00
{
mp_err err;
int x;
2003-02-28 16:08:34 +00:00
2017-08-30 17:11:35 +00:00
/* if its less than zero return */
if (b <= 0) {
return MP_OKAY;
}
2017-08-29 21:53:02 +00:00
/* no need to shift 0 around */
2019-10-24 15:43:31 +00:00
if (mp_iszero(a)) {
2017-08-29 21:53:02 +00:00
return MP_OKAY;
}
2003-02-28 16:08:34 +00:00
2017-08-30 17:11:35 +00:00
/* grow to fit the new digits */
if ((err = mp_grow(a, a->used + b)) != MP_OKAY) {
return err;
2017-08-30 17:11:35 +00:00
}
2003-02-28 16:08:34 +00:00
2019-05-19 12:56:04 +00:00
/* increment the used by the shift amount then copy upwards */
a->used += b;
2003-03-13 02:11:11 +00:00
2019-05-19 12:56:04 +00:00
/* much like mp_rshd this is implemented using a sliding window
* except the window goes the otherway around. Copying from
* the bottom to the top. see mp_rshd.c for more info.
2019-05-19 12:56:04 +00:00
*/
2019-10-29 17:41:25 +00:00
for (x = a->used; x --> b;) {
a->dp[x] = a->dp[x - b];
2019-05-19 12:56:04 +00:00
}
2003-02-28 16:08:34 +00:00
2019-05-19 12:56:04 +00:00
/* zero the lower digits */
s_mp_zero_digs(a->dp, b);
2019-05-19 12:56:04 +00:00
2017-08-30 17:11:35 +00:00
return MP_OKAY;
2003-02-28 16:08:34 +00:00
}
2004-10-29 22:07:18 +00:00
#endif