Lines Matching refs:top
106 dv->top=1;
193 if (num->top > 0 && num->d[num->top - 1] == 0)
242 div_n=sdiv->top;
243 num_n=snum->top;
250 wnum.top = div_n;
251 /* only needed when BN_ucmp messes up the values between top and max */
254 /* Get the top 2 words of sdiv */
255 /* div_n=sdiv->top; */
259 /* pointer to the 'top' of snum */
265 res->top=loop;
275 * clean the values between top and max again */
281 res->top--;
282 /* if res->top == 0 then clear the neg value otherwise decrease
284 if (res->top == 0)
292 /* the first part of the loop uses the top two words of
383 /* ingore top values of the bignums just sub the two
467 if (snum->top <= sdiv->top+1)
469 if (bn_wexpand(snum, sdiv->top + 2) == NULL) goto err;
470 for (i = snum->top; i < sdiv->top + 2; i++) snum->d[i] = 0;
471 snum->top = sdiv->top + 2;
475 if (bn_wexpand(snum, snum->top + 1) == NULL) goto err;
476 snum->d[snum->top] = 0;
477 snum->top ++;
480 div_n=sdiv->top;
481 num_n=snum->top;
488 wnum.top = div_n;
489 /* only needed when BN_ucmp messes up the values between top and max */
492 /* Get the top 2 words of sdiv */
493 /* div_n=sdiv->top; */
497 /* pointer to the 'top' of snum */
503 res->top=loop-1;
509 /* if res->top == 0 then clear the neg value otherwise decrease
511 if (res->top == 0)
519 /* the first part of the loop uses the top two words of
610 /* ingore top values of the bignums just sub the two
