Lines Matching refs:top
42 int num = mont->N.top; in bn_mul_mont_fixed_top()
45 if (num > 1 && num <= BN_SOFT_LIMIT && a->top == num && b->top == num) { in bn_mul_mont_fixed_top()
50 r->top = num; in bn_mul_mont_fixed_top()
57 if ((a->top + b->top) > 2 * num) in bn_mul_mont_fixed_top()
96 nl = n->top; in bn_from_montgomery_word()
98 ret->top = 0; in bn_from_montgomery_word()
111 for (rtop = r->top, i = 0; i < max; i++) { in bn_from_montgomery_word()
116 r->top = max; in bn_from_montgomery_word()
135 ret->top = nl; in bn_from_montgomery_word()
306 tmod.top = 0; in BN_MONT_CTX_set()
308 tmod.top = 1; in BN_MONT_CTX_set()
309 if ((buf[1] = mod->top > 1 ? mod->d[1] : 0)) in BN_MONT_CTX_set()
310 tmod.top = 2; in BN_MONT_CTX_set()
329 Ri->top = 2; in BN_MONT_CTX_set()
336 mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0; in BN_MONT_CTX_set()
337 mont->n0[1] = (Ri->top > 1) ? Ri->d[1] : 0; in BN_MONT_CTX_set()
345 tmod.top = buf[0] != 0 ? 1 : 0; in BN_MONT_CTX_set()
366 mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0; in BN_MONT_CTX_set()
398 for (i = mont->RR.top, ret = mont->N.top; i < ret; i++) in BN_MONT_CTX_set()
400 mont->RR.top = ret; in BN_MONT_CTX_set()
