libtommath/bn_mp_lshd.c

62 lines
1.5 KiB
C
Raw Normal View History

2003-02-28 16:08:34 +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-02-28 16:08:34 +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-02-28 16:08:34 +00:00
* 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.
*
2003-03-13 02:11:11 +00:00
* Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org
2003-02-28 16:08:34 +00:00
*/
#include <tommath.h>
/* shift left a certain amount of digits */
2003-12-24 18:59:22 +00:00
int mp_lshd (mp_int * a, int b)
2003-02-28 16:08:34 +00:00
{
2003-02-28 16:09:08 +00:00
int x, res;
2003-02-28 16:08:34 +00:00
/* if its less than zero return */
if (b <= 0) {
return MP_OKAY;
}
/* grow to fit the new digits */
2003-05-17 12:33:54 +00:00
if (a->alloc < a->used + b) {
if ((res = mp_grow (a, a->used + b)) != MP_OKAY) {
return res;
}
2003-02-28 16:08:34 +00:00
}
2003-03-13 02:11:11 +00:00
{
2003-05-29 13:35:26 +00:00
register mp_digit *top, *bottom;
2003-03-13 02:11:11 +00:00
2003-05-29 13:35:26 +00:00
/* increment the used by the shift amount then copy upwards */
2003-03-13 02:11:11 +00:00
a->used += b;
2003-03-22 15:10:20 +00:00
2003-03-13 02:11:11 +00:00
/* top */
2003-05-29 13:35:26 +00:00
top = a->dp + a->used - 1;
2003-03-22 15:10:20 +00:00
2003-03-13 02:11:11 +00:00
/* base */
2003-05-29 13:35:26 +00:00
bottom = a->dp + a->used - 1 - b;
2003-03-13 02:11:11 +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 bn_mp_rshd.c for more info.
*/
for (x = a->used - 1; x >= b; x--) {
2003-05-29 13:35:26 +00:00
*top-- = *bottom--;
2003-03-13 02:11:11 +00:00
}
2003-02-28 16:08:34 +00:00
2003-03-13 02:11:11 +00:00
/* zero the lower digits */
2003-05-29 13:35:26 +00:00
top = a->dp;
2003-03-13 02:11:11 +00:00
for (x = 0; x < b; x++) {
2003-05-29 13:35:26 +00:00
*top++ = 0;
2003-03-13 02:11:11 +00:00
}
2003-02-28 16:08:34 +00:00
}
return MP_OKAY;
}