Lines Matching refs:top
42 int num = mont->N.top;
45 if (num > 1 && num <= BN_SOFT_LIMIT && a->top == num && b->top == num) {
50 r->top = num;
57 if ((a->top + b->top) > 2 * num)
96 nl = n->top;
98 ret->top = 0;
110 /* clear the top words of T */
111 for (rtop = r->top, i = 0; i < max; i++) {
116 r->top = max;
135 ret->top = nl;
308 tmod.top = 0;
310 tmod.top = 1;
311 if ((buf[1] = mod->top > 1 ? mod->d[1] : 0))
312 tmod.top = 2;
331 Ri->top = 2;
338 mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0;
339 mont->n0[1] = (Ri->top > 1) ? Ri->d[1] : 0;
347 tmod.top = buf[0] != 0 ? 1 : 0;
368 mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0;
400 for (i = mont->RR.top, ret = mont->N.top; i < ret; i++)
402 mont->RR.top = ret;