Loading crypto/bn/bn_exp.c +11 −11 Original line number Diff line number Diff line Loading @@ -188,8 +188,8 @@ int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, bits = BN_num_bits(p); if (bits == 0) { /* x**0 mod 1 is still zero. */ if (BN_is_one(m)) { /* x**0 mod 1, or x**0 mod -1 is still zero. */ if (BN_abs_is_word(m, 1)) { ret = 1; BN_zero(r); } else { Loading Loading @@ -330,8 +330,8 @@ int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p, } bits = BN_num_bits(p); if (bits == 0) { /* x**0 mod 1 is still zero. */ if (BN_is_one(m)) { /* x**0 mod 1, or x**0 mod -1 is still zero. */ if (BN_abs_is_word(m, 1)) { ret = 1; BN_zero(rr); } else { Loading Loading @@ -639,8 +639,8 @@ int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p, */ bits = p->top * BN_BITS2; if (bits == 0) { /* x**0 mod 1 is still zero. */ if (BN_is_one(m)) { /* x**0 mod 1, or x**0 mod -1 is still zero. */ if (BN_abs_is_word(m, 1)) { ret = 1; BN_zero(rr); } else { Loading Loading @@ -1151,8 +1151,8 @@ int BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p, bits = BN_num_bits(p); if (bits == 0) { /* x**0 mod 1 is still zero. */ if (BN_is_one(m)) { /* x**0 mod 1, or x**0 mod -1 is still zero. */ if (BN_abs_is_word(m, 1)) { ret = 1; BN_zero(rr); } else { Loading Loading @@ -1274,8 +1274,8 @@ int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, bits = BN_num_bits(p); if (bits == 0) { /* x**0 mod 1 is still zero. */ if (BN_is_one(m)) { /* x**0 mod 1, or x**0 mod -1 is still zero. */ if (BN_abs_is_word(m, 1)) { ret = 1; BN_zero(r); } else { Loading Loading
crypto/bn/bn_exp.c +11 −11 Original line number Diff line number Diff line Loading @@ -188,8 +188,8 @@ int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, bits = BN_num_bits(p); if (bits == 0) { /* x**0 mod 1 is still zero. */ if (BN_is_one(m)) { /* x**0 mod 1, or x**0 mod -1 is still zero. */ if (BN_abs_is_word(m, 1)) { ret = 1; BN_zero(r); } else { Loading Loading @@ -330,8 +330,8 @@ int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p, } bits = BN_num_bits(p); if (bits == 0) { /* x**0 mod 1 is still zero. */ if (BN_is_one(m)) { /* x**0 mod 1, or x**0 mod -1 is still zero. */ if (BN_abs_is_word(m, 1)) { ret = 1; BN_zero(rr); } else { Loading Loading @@ -639,8 +639,8 @@ int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p, */ bits = p->top * BN_BITS2; if (bits == 0) { /* x**0 mod 1 is still zero. */ if (BN_is_one(m)) { /* x**0 mod 1, or x**0 mod -1 is still zero. */ if (BN_abs_is_word(m, 1)) { ret = 1; BN_zero(rr); } else { Loading Loading @@ -1151,8 +1151,8 @@ int BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p, bits = BN_num_bits(p); if (bits == 0) { /* x**0 mod 1 is still zero. */ if (BN_is_one(m)) { /* x**0 mod 1, or x**0 mod -1 is still zero. */ if (BN_abs_is_word(m, 1)) { ret = 1; BN_zero(rr); } else { Loading Loading @@ -1274,8 +1274,8 @@ int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, bits = BN_num_bits(p); if (bits == 0) { /* x**0 mod 1 is still zero. */ if (BN_is_one(m)) { /* x**0 mod 1, or x**0 mod -1 is still zero. */ if (BN_abs_is_word(m, 1)) { ret = 1; BN_zero(r); } else { Loading