Lines Matching refs:top
113 /* compensate for the top two bits of a */
206 /* compensate for the top three bits of a */
260 if (a->top < b->top) {
268 if (bn_wexpand(r, at->top) == NULL)
271 for (i = 0; i < bt->top; i++) {
274 for (; i < at->top; i++) {
278 r->top = at->top;
311 if (!bn_wexpand(r, a->top))
313 for (j = 0; j < a->top; j++) {
316 r->top = a->top;
322 for (j = r->top - 1; j > dN;) {
359 /* clear up the top d1 bits */
428 zlen = a->top + b->top + 4;
431 s->top = zlen;
436 for (j = 0; j < b->top; j += 2) {
438 y1 = ((j + 1) == b->top) ? 0 : b->d[j + 1];
439 for (i = 0; i < a->top; i += 2) {
441 x1 = ((i + 1) == a->top) ? 0 : a->d[i + 1];
499 if (!bn_wexpand(s, 2 * a->top))
502 for (i = a->top - 1; i >= 0; i--) {
507 s->top = 2 * a->top;
617 int top = p->top;
620 if (!bn_wexpand(u, top))
623 for (i = u->top; i < top; i++)
625 u->top = top;
626 if (!bn_wexpand(b, top))
630 for (i = 1; i < top; i++)
632 b->top = top;
633 if (!bn_wexpand(c, top))
636 for (i = 0; i < top; i++)
638 c->top = top;
651 for (i = 0; i < top - 1; i++) {
686 for (i = 0; i < top; i++) {
1124 for (i = a->top - 1; i >= 0; i--) {