Lines Matching defs:num
172 /* BN_div computes dv := num / divisor, rounding towards zero, and sets up
173 * rm such that dv*divisor + rm = num holds.
175 * dv->neg == num->neg ^ divisor->neg (unless the result is zero)
176 * rm->neg == num->neg (unless the remainder is zero)
179 int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
190 bn_check_top(num);
199 if (BN_ucmp(num,divisor) < 0)
202 { if (BN_copy(rm,num) == NULL) return(0); }
221 if (!(BN_lshift(snum,num,norm_shift))) goto err;
244 res->neg= (num->neg^divisor->neg);
383 /* Keep a copy of the neg flag in num because if rm==num
386 int neg = num->neg;