Lines Matching full:divisor
109 /* BN_div computes dv := num / divisor, rounding towards
110 * zero, and sets up rm such that dv*divisor + rm = num holds.
112 * dv->neg == num->neg ^ divisor->neg (unless the result is zero)
115 int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
127 (divisor->top > 0 && divisor->d[divisor->top - 1] == 0)) {
133 (divisor->flags & BN_FLG_CONSTTIME) != 0) {
137 if (BN_is_zero(divisor)) {
142 if (!no_branch && BN_ucmp(num, divisor) < 0) {
168 norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
169 if (!(BN_lshift(sdiv, divisor, norm_shift))) {
222 res->neg = (num->neg ^ divisor->neg);
