1*37da2899SCharles.Forsyth #include "os.h"
2*37da2899SCharles.Forsyth #include <mp.h>
3*37da2899SCharles.Forsyth #include "dat.h"
4*37da2899SCharles.Forsyth
5*37da2899SCharles.Forsyth // res = b >> shift
6*37da2899SCharles.Forsyth void
mpright(mpint * b,int shift,mpint * res)7*37da2899SCharles.Forsyth mpright(mpint *b, int shift, mpint *res)
8*37da2899SCharles.Forsyth {
9*37da2899SCharles.Forsyth int d, l, r, i;
10*37da2899SCharles.Forsyth mpdigit this, last;
11*37da2899SCharles.Forsyth
12*37da2899SCharles.Forsyth res->sign = b->sign;
13*37da2899SCharles.Forsyth if(b->top==0){
14*37da2899SCharles.Forsyth res->top = 0;
15*37da2899SCharles.Forsyth return;
16*37da2899SCharles.Forsyth }
17*37da2899SCharles.Forsyth
18*37da2899SCharles.Forsyth // a negative right shift is a left shift
19*37da2899SCharles.Forsyth if(shift < 0){
20*37da2899SCharles.Forsyth mpleft(b, -shift, res);
21*37da2899SCharles.Forsyth return;
22*37da2899SCharles.Forsyth }
23*37da2899SCharles.Forsyth
24*37da2899SCharles.Forsyth if(res != b)
25*37da2899SCharles.Forsyth mpbits(res, b->top*Dbits - shift);
26*37da2899SCharles.Forsyth d = shift/Dbits;
27*37da2899SCharles.Forsyth r = shift - d*Dbits;
28*37da2899SCharles.Forsyth l = Dbits - r;
29*37da2899SCharles.Forsyth
30*37da2899SCharles.Forsyth // shift all the bits out == zero
31*37da2899SCharles.Forsyth if(d>=b->top){
32*37da2899SCharles.Forsyth res->top = 0;
33*37da2899SCharles.Forsyth return;
34*37da2899SCharles.Forsyth }
35*37da2899SCharles.Forsyth
36*37da2899SCharles.Forsyth // special case digit shifts
37*37da2899SCharles.Forsyth if(r == 0){
38*37da2899SCharles.Forsyth for(i = 0; i < b->top-d; i++)
39*37da2899SCharles.Forsyth res->p[i] = b->p[i+d];
40*37da2899SCharles.Forsyth } else {
41*37da2899SCharles.Forsyth last = b->p[d];
42*37da2899SCharles.Forsyth for(i = 0; i < b->top-d-1; i++){
43*37da2899SCharles.Forsyth this = b->p[i+d+1];
44*37da2899SCharles.Forsyth res->p[i] = (this<<l) | (last>>r);
45*37da2899SCharles.Forsyth last = this;
46*37da2899SCharles.Forsyth }
47*37da2899SCharles.Forsyth res->p[i++] = last>>r;
48*37da2899SCharles.Forsyth }
49*37da2899SCharles.Forsyth while(i > 0 && res->p[i-1] == 0)
50*37da2899SCharles.Forsyth i--;
51*37da2899SCharles.Forsyth res->top = i;
52*37da2899SCharles.Forsyth if(i==0)
53*37da2899SCharles.Forsyth res->sign = 1;
54*37da2899SCharles.Forsyth }
55