kshift
be = bits + (((unsigned int)nbits - 1) >> kshift);
n0 = n = (unsigned int)nbits >> kshift;
for(k = 0; n > (1 << (kshift-2)) - 1; n = (unsigned int)n >> 1)
if (x[(unsigned int)k>>kshift] & 1 << (k & kmask)) {
if (x[(unsigned int)k>>kshift] & 1 << (k & kmask))
&& x[(unsigned int)nbits >> kshift] & 1 << (nbits & kmask))
n = (unsigned int)k >> kshift;
x = x0 + ((unsigned int)nbits >> kshift);
n = (unsigned int)k >> kshift;
ce = c + ((unsigned int)(n-1) >> kshift) + 1;
n = (unsigned int)k >> kshift;
xe = x + ((unsigned int)n >> kshift);
k = (unsigned int)(n + ((1 << kshift) - 1)) >> kshift;
k = (unsigned int)n >> kshift;
if (b->x[(unsigned int)k>>kshift] & ((ULong)1 << (k & kmask)))
carry = b->x[(unsigned int)k1>>kshift] &