Lines Matching defs:divisor
183 * BN_div computes dv := num / divisor, rounding towards
184 * zero, and sets up rm such that dv*divisor + rm = num holds.
186 * dv->neg == num->neg ^ divisor->neg (unless the result is zero)
190 int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
206 (divisor->top > 0 && divisor->d[divisor->top - 1] == 0)) {
212 bn_check_top(divisor);
215 || (BN_get_flags(divisor, BN_FLG_CONSTTIME) != 0)) {
224 /*- bn_check_top(divisor); *//*
225 * 'divisor' has been checked already
228 if (BN_is_zero(divisor)) {
233 if (!no_branch && BN_ucmp(num, divisor) < 0) {
255 norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
256 if (!(BN_lshift(sdiv, divisor, norm_shift)))
308 res->neg = (num->neg ^ divisor->neg);