Remove redundant bn->top computation.
One less to worry about. Bug: 232 Change-Id: Ib7d38e18fee02590088d76363e17f774cfefa59b Reviewed-on: https://boringssl-review.googlesource.com/25252 Reviewed-by: Adam Langley <agl@google.com>
This commit is contained in:
parent
7979dbede2
commit
6c41465548
@ -199,7 +199,6 @@ int BN_add_word(BIGNUM *a, BN_ULONG w) {
|
||||
}
|
||||
|
||||
int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b) {
|
||||
int max;
|
||||
int add = 0, neg = 0;
|
||||
const BIGNUM *tmp;
|
||||
|
||||
@ -232,13 +231,6 @@ int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b) {
|
||||
return 1;
|
||||
}
|
||||
|
||||
// We are actually doing a - b :-)
|
||||
|
||||
max = (a->top > b->top) ? a->top : b->top;
|
||||
if (!bn_wexpand(r, max)) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
if (BN_ucmp(a, b) < 0) {
|
||||
if (!BN_usub(r, b, a)) {
|
||||
return 0;
|
||||
|
Loading…
Reference in New Issue
Block a user