BN_BITS2
b = BN_BITS2;
if (b == BN_BITS2) {
if (b == BN_BITS2 || CBS_len(cbs) == 0) {
for (j = BN_BITS2 - 8; j >= 0; j -= 8) {
if (b == BN_BITS2 || digits == 0) {
norm_shift = BN_BITS2 - BN_num_bits(divisor) % BN_BITS2;
norm_shift += BN_BITS2;
assert((i == BN_BITS2) || (h <= (BN_ULONG)1 << i));
i = BN_BITS2 - i;
h = (h << i) | (l >> (BN_BITS2 - i));
*out_r1 = r >> BN_BITS2;
*out_r1 = r >> BN_BITS2;
*out_r1 = r >> BN_BITS2;
*out_r1 = r >> BN_BITS2;
*out_r1 = r >> BN_BITS2;
r1 = ((c1 & ~r0) | c2) >> (BN_BITS2 - 1); /* carry */
borrow = ((r0 | (b & ~a)) & (b | ~a)) >> (BN_BITS2 - 1);
return (w | ~(w - 1)) >> (BN_BITS2 - 1);
return BN_BITS2 - bn_clzw(w);
if (words > INT_MAX / (4 * BN_BITS2)) {
if (bits > (INT_MAX - BN_BITS2 + 1))
words = (bits + BN_BITS2 - 1) / BN_BITS2;
i = n / BN_BITS2;
j = n % BN_BITS2;
i = n / BN_BITS2;
j = n % BN_BITS2;
i = n / BN_BITS2;
j = n % BN_BITS2;
w = n / BN_BITS2;
b = n % BN_BITS2;
condition = ((condition - 1) >> (BN_BITS2 - 1)) - 1;
condition = ((~condition & (condition - 1)) >> (BN_BITS2 - 1)) - 1;
mont->ri = ((BN_num_bits(mod) + BN_BITS2 - 1) / BN_BITS2) * BN_BITS2;
#if BN_BITS2 == 32
#if BN_BITS2 == 32
bits = shift = BN_BITS2;
return BN_BITS2 - bits;
return (n + 1) * BN_BITS2 - bn_clzw(x);
shift_words = shift_bits / BN_BITS2;
rshift = shift_bits % BN_BITS2;
lshift = (BN_BITS2 - rshift) % BN_BITS2;
lstride = (lshift + rshift) / BN_BITS2;
shift_words = shift_bits / BN_BITS2;
lshift = shift_bits % BN_BITS2;
rshift = (BN_BITS2 - lshift) % BN_BITS2;
rstride = 0 - (lshift + rshift) / BN_BITS2;
j = BN_BITS2 - BN_num_bits_word(w);
ret = (BN_ULLONG)(((ret << (BN_ULLONG)BN_BITS2) |
fm->n = (BN_num_bits(bn) + BN_BITS2 - 1) / BN_BITS2;
if (!BN_lshift(bn1, bn1, BN_BITS2 + 1)) {
if (!BN_rshift(bn2, bn1, BN_BITS2 + 1)) {
if (!BN_lshift(bn1, bn1, BN_BITS2)) {
if (!BN_rshift(bn2, bn1, BN_BITS2 * 2)) {
if (!BN_rshift(bn2, bn1, BN_BITS2 + 16)) {
!BN_bntest_rand(b, BN_BITS2, -1, 0))
for (i = 0; i < BN_BITS2; i++) {
for (i = 0; i <= 5 * BN_BITS2; i++) {