Lines Matching defs:divisor
181 * BN_div[_no_branch] computes dv := num / divisor, rounding towards
182 * zero, and sets up rm such that dv*divisor + rm = num holds.
184 * dv->neg == num->neg ^ divisor->neg (unless the result is zero)
189 const BIGNUM *divisor, BN_CTX *ctx);
190 int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
212 || (BN_get_flags(divisor, BN_FLG_CONSTTIME) != 0)) {
213 return BN_div_no_branch(dv, rm, num, divisor, ctx);
221 bn_check_top(divisor);
223 if (BN_is_zero(divisor)) {
228 if (BN_ucmp(num, divisor) < 0) {
250 norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
251 if (!(BN_lshift(sdiv, divisor, norm_shift)))
282 res->neg = (num->neg ^ divisor->neg);
453 const BIGNUM *divisor, BN_CTX *ctx)
466 bn_check_top(divisor);
468 if (BN_is_zero(divisor)) {
485 norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
486 if (!(BN_lshift(sdiv, divisor, norm_shift)))
535 res->neg = (num->neg ^ divisor->neg);