Lines Matching defs:div_n
271 int num_n, div_n, num_neg;
303 div_n = sdiv->top;
306 if (num_n <= div_n) {
308 if (bn_wexpand(snum, div_n + 1) == NULL)
310 memset(&(snum->d[num_n]), 0, (div_n - num_n + 1) * sizeof(BN_ULONG));
311 snum->top = num_n = div_n + 1;
314 loop = num_n - div_n;
323 d0 = sdiv->d[div_n - 1];
324 d1 = (div_n == 1) ? 0 : sdiv->d[div_n - 2];
336 if (!bn_wexpand(tmp, (div_n + 1)))
422 l0 = bn_mul_words(tmp->d, sdiv->d, div_n, q);
423 tmp->d[div_n] = l0;
429 l0 = bn_sub_words(wnum, wnum, tmp->d, div_n + 1);
436 for (l0 = 0 - l0, j = 0; j < div_n; j++)
438 l0 = bn_add_words(wnum, wnum, tmp->d, div_n);
447 snum->top = div_n;