Lines Matching defs:num
141 static int bn_left_align(BIGNUM *num)
143 BN_ULONG *d = num->d, n, m, rmask;
144 int top = num->top;
202 * BN_div computes dv := num / divisor, rounding towards
203 * zero, and sets up rm such that dv*divisor + rm = num holds.
205 * dv->neg == num->neg ^ divisor->neg (unless the result is zero)
206 * rm->neg == num->neg (unless the remainder is zero)
209 int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
229 ret = bn_div_fixed_top(dv, rm, num, divisor, ctx);
248 * This is because zero-padded dividend, |num|, is tolerated, so that
264 int bn_div_fixed_top(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num,
275 bn_check_top(num);
300 if (!(bn_lshift_fixed_top(snum, num, norm_shift)))
329 num_neg = num->neg;