Lines Matching refs:top
64 dv->top = 1;
144 int top = num->top;
145 int rshift = BN_num_bits_word(d[top - 1]), lshift, i;
152 for (i = 0, m = 0; i < top; i++) {
224 if (divisor->d[divisor->top - 1] == 0) {
273 assert(divisor->top > 0 && divisor->d[divisor->top - 1] != 0);
303 div_n = sdiv->top;
304 num_n = snum->top;
311 snum->top = num_n = div_n + 1;
322 /* Get the top 2 words of sdiv */
331 res->top = loop;
342 * the first part of the loop uses the top two words of snum and sdiv
426 * ignore top values of the bignums just sub the two BN_ULONG arrays
447 snum->top = div_n;