mirror of
https://git.tartarus.org/simon/putty.git
synced 2025-01-10 01:48:00 +00:00
Fix Windows compile warnings by adding explicit casts.
[originally from svn r9200]
This commit is contained in:
parent
b642aa086a
commit
1fda4423e0
10
sshbn.c
10
sshbn.c
@ -419,7 +419,7 @@ static void internal_mul(const BignumInt *a, const BignumInt *b,
|
|||||||
for (cp = cps, bp = b + len; cp--, bp-- > b ;) {
|
for (cp = cps, bp = b + len; cp--, bp-- > b ;) {
|
||||||
t = (MUL_WORD(*ap, *bp) + carry) + *cp;
|
t = (MUL_WORD(*ap, *bp) + carry) + *cp;
|
||||||
*cp = (BignumInt) t;
|
*cp = (BignumInt) t;
|
||||||
carry = t >> BIGNUM_INT_BITS;
|
carry = (BignumInt)(t >> BIGNUM_INT_BITS);
|
||||||
}
|
}
|
||||||
*cp = carry;
|
*cp = carry;
|
||||||
}
|
}
|
||||||
@ -521,7 +521,7 @@ static void internal_mul_low(const BignumInt *a, const BignumInt *b,
|
|||||||
for (cp = cps, bp = b + len; bp--, cp-- > c ;) {
|
for (cp = cps, bp = b + len; bp--, cp-- > c ;) {
|
||||||
t = (MUL_WORD(*ap, *bp) + carry) + *cp;
|
t = (MUL_WORD(*ap, *bp) + carry) + *cp;
|
||||||
*cp = (BignumInt) t;
|
*cp = (BignumInt) t;
|
||||||
carry = t >> BIGNUM_INT_BITS;
|
carry = (BignumInt)(t >> BIGNUM_INT_BITS);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@ -897,7 +897,7 @@ Bignum modpow(Bignum base_in, Bignum exp, Bignum mod)
|
|||||||
|
|
||||||
mninv = snewn(len, BignumInt);
|
mninv = snewn(len, BignumInt);
|
||||||
for (j = 0; j < len; j++)
|
for (j = 0; j < len; j++)
|
||||||
mninv[len - 1 - j] = (j < inv[0] ? inv[j + 1] : 0);
|
mninv[len - 1 - j] = (j < (int)inv[0] ? inv[j + 1] : 0);
|
||||||
freebn(inv); /* we don't need this copy of it any more */
|
freebn(inv); /* we don't need this copy of it any more */
|
||||||
/* Now negate mninv mod r, so it's the inverse of -n rather than +n. */
|
/* Now negate mninv mod r, so it's the inverse of -n rather than +n. */
|
||||||
x = snewn(len, BignumInt);
|
x = snewn(len, BignumInt);
|
||||||
@ -907,13 +907,13 @@ Bignum modpow(Bignum base_in, Bignum exp, Bignum mod)
|
|||||||
|
|
||||||
/* x = snewn(len, BignumInt); */ /* already done above */
|
/* x = snewn(len, BignumInt); */ /* already done above */
|
||||||
for (j = 0; j < len; j++)
|
for (j = 0; j < len; j++)
|
||||||
x[len - 1 - j] = (j < base[0] ? base[j + 1] : 0);
|
x[len - 1 - j] = (j < (int)base[0] ? base[j + 1] : 0);
|
||||||
freebn(base); /* we don't need this copy of it any more */
|
freebn(base); /* we don't need this copy of it any more */
|
||||||
|
|
||||||
a = snewn(2*len, BignumInt);
|
a = snewn(2*len, BignumInt);
|
||||||
b = snewn(2*len, BignumInt);
|
b = snewn(2*len, BignumInt);
|
||||||
for (j = 0; j < len; j++)
|
for (j = 0; j < len; j++)
|
||||||
a[2*len - 1 - j] = (j < rn[0] ? rn[j + 1] : 0);
|
a[2*len - 1 - j] = (j < (int)rn[0] ? rn[j + 1] : 0);
|
||||||
freebn(rn);
|
freebn(rn);
|
||||||
|
|
||||||
/* Scratch space for multiplies */
|
/* Scratch space for multiplies */
|
||||||
|
Loading…
Reference in New Issue
Block a user