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
|
Index: mpi-1.8.6/mpi.c
===================================================================
--- mpi-1.8.6.orig/mpi.c 2011-12-11 19:52:15.000000000 -0800
+++ mpi-1.8.6/mpi.c 2011-12-11 19:53:09.000000000 -0800
@@ -764,7 +764,7 @@
if((pow = s_mp_ispow2d(d)) >= 0) {
mp_digit mask;
- mask = (1 << pow) - 1;
+ mask = ((mp_digit) 1 << pow) - 1;
rem = DIGIT(a, 0) & mask;
if(q) {
@@ -3068,7 +3068,7 @@
return;
/* Flush all the bits above 2^d in its digit */
- dmask = (1 << nbit) - 1;
+ dmask = ((mp_digit) 1 << nbit) - 1;
dp[ndig] &= dmask;
/* Flush all digits above the one with 2^d in it */
@@ -3101,7 +3101,7 @@
dp = DIGITS(mp); used = USED(mp);
d %= DIGIT_BIT;
- mask = (1 << d) - 1;
+ mask = ((mp_digit) 1 << d) - 1;
/* If the shift requires another digit, make sure we've got one to
work with */
@@ -3149,7 +3149,7 @@
s_mp_rshd(mp, d / DIGIT_BIT);
d %= DIGIT_BIT;
- mask = (1 << d) - 1;
+ mask = ((mp_digit) 1 << d) - 1;
save = 0;
for(ix = USED(mp) - 1; ix >= 0; ix--) {
@@ -3829,7 +3829,7 @@
if((res = s_mp_pad(a, dig + 1)) != MP_OKAY)
return res;
- DIGIT(a, dig) |= (1 << bit);
+ DIGIT(a, dig) |= ((mp_digit) 1 << bit);
return MP_OKAY;
|
