Lines Matching defs:nl
92 int nl, max, i;
96 nl = n->top;
97 if (nl == 0) {
102 max = (2 * nl); /* carry is stored separately */
121 * Add multiples of |n| to |r| until R = 2^(nl * BN_BITS2) divides it. On
125 for (carry = 0, i = 0; i < nl; i++, rp++) {
126 v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
127 v = (v + carry + rp[nl]) & BN_MASK2;
128 carry |= (v != rp[nl]);
129 carry &= (v <= rp[nl]);
130 rp[nl] = v;
133 if (bn_wexpand(ret, nl) == NULL)
135 ret->top = nl;
142 * Shift |nl| words to divide by R. We have |ap| < 2 * |n|. Note that |ap|
145 ap = &(r->d[nl]);
147 carry -= bn_sub_words(rp, ap, np, nl);
151 * |nl| words, and we know at most one subtraction is needed.
153 for (i = 0; i < nl; i++) {