summaryrefslogtreecommitdiffstats
path: root/libtommath/bn_mp_rshd.c
blob: e799a4c91f9f7778f62e6cbe4307cfda6375c53a (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include <tommath.h>
#ifdef BN_MP_RSHD_C
/* LibTomMath, multiple-precision integer library -- Tom St Denis
 *
 * LibTomMath is a library that provides multiple-precision
 * integer arithmetic as well as number theoretic functionality.
 *
 * The library was designed directly after the MPI library by
 * 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.
 *
 * Tom St Denis, tomstdenis@gmail.com, http://libtom.org
 */

/* shift right a certain amount of digits */
void mp_rshd(mp_int * a, int b)
{
	int x;

	/* if b <= 0 then ignore it */
	if (b <= 0) {
		return;
	}

	/* if b > used then simply zero it and return */
	if (a->used <= b) {
		mp_zero(a);
		return;
	}

	{
		register mp_digit *bottom, *top;

		/* shift the digits down */

		/* bottom */
		bottom = a->dp;

		/* top [offset into digits] */
		top = a->dp + b;

		/* this is implemented as a sliding window where 
		 * the window is b-digits long and digits from 
		 * the top of the window are copied to the bottom
		 *
		 * e.g.

		 b-2 | b-1 | b0 | b1 | b2 | ... | bb |   ---->
		 /\                   |      ---->
		 \-------------------/      ---->
		 */
		for (x = 0; x < (a->used - b); x++) {
			*bottom++ = *top++;
		}

		/* zero the top digits */
		for (; x < a->used; x++) {
			*bottom++ = 0;
		}
	}

	/* remove excess digits */
	a->used -= b;
}
#endif

/* $Source: /cvs/libtom/libtommath/bn_mp_rshd.c,v $ */
/* $Revision: 1.4 $ */
/* $Date: 2006/12/28 01:25:13 $ */