BN_BITS2
return ((BN_ULONG)(((((BN_ULLONG)h) << BN_BITS2)|l)/(BN_ULLONG)d));
assert((i == BN_BITS2) || (h <= (BN_ULONG)1 << i));
i = BN_BITS2 - i;
h = (h << i) | (l >> (BN_BITS2 - i));
ll >>= BN_BITS2;
ll >>= BN_BITS2;
ll >>= BN_BITS2;
ll >>= BN_BITS2;
ll >>= BN_BITS2;
norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
norm_shift += BN_BITS2;
q = (BN_ULONG)(((((BN_ULLONG)n0) << BN_BITS2)|n1)/d0);
if (t2 <= ((((BN_ULLONG)rem) << BN_BITS2) |
for (j = BN_BITS2 - 1; j >= 0; j--) {
p[k] = BN_BITS2 * i + j;
dN = p[0] / BN_BITS2;
d0 = n % BN_BITS2;
d1 = BN_BITS2 - d0;
n /= BN_BITS2;
d0 = p[0] % BN_BITS2;
d1 = BN_BITS2 - d0;
d0 = p[0] % BN_BITS2;
d1 = BN_BITS2 - d0;
n = p[k] / BN_BITS2;
d0 = p[k] % BN_BITS2;
d1 = BN_BITS2 - d0;
(u1 << (BN_BITS2 - 1))) & BN_MASK2;
(b1 << (BN_BITS2 - 1))) & BN_MASK2;
if (ubits <= BN_BITS2) {
int utop = (ubits - 1) / BN_BITS2;
ubits = utop*BN_BITS2 + BN_num_bits_word(ul);
#define Hw(t) (((BN_ULONG)((t)>>BN_BITS2))&BN_MASK2)
#define bn_check_size(bn, bits) bn_wcheck_size(bn, ((bits+BN_BITS2-1))/BN_BITS2)
condition = ((~condition & (condition - 1)) >> (BN_BITS2 - 1)) - 1;
mask = ((~x & (x - 1)) >> (BN_BITS2 - 1)) - 1;
return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
if (words > (INT_MAX/(4*BN_BITS2))) {
if (bits > (INT_MAX - BN_BITS2 + 1))
if (((bits + BN_BITS2 - 1) / BN_BITS2) <= a->dmax)
return bn_expand2(a, (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;
(BN_BITS2 - 1)) / BN_BITS2 * BN_BITS2;
#if defined(OPENSSL_BN_ASM_MONT) && (BN_BITS2<=32)
if (!(BN_set_bit(R, 2 * BN_BITS2)))
if (!BN_lshift(Ri, Ri, 2 * BN_BITS2))
if (!(BN_set_bit(R, BN_BITS2)))
if (!BN_lshift(Ri, Ri, BN_BITS2))
carry = (int)bn_add_words(r_d + (128 / BN_BITS2),
r_d + (128 / BN_BITS2), t_d, BN_NIST_256_TOP);
#define BN_NIST_521_RSHIFT (521%BN_BITS2)
#define BN_NIST_521_LSHIFT (BN_BITS2-BN_NIST_521_RSHIFT)
#elif BN_BITS2 == 32
#if BN_BITS2 == 64
#if BN_BITS2==64
#if defined(NIST_INT64) && BN_BITS2!=64
#define BN_NIST_192_TOP (192+BN_BITS2-1)/BN_BITS2
#define BN_NIST_224_TOP (224+BN_BITS2-1)/BN_BITS2
#define BN_NIST_256_TOP (256+BN_BITS2-1)/BN_BITS2
#define BN_NIST_384_TOP (384+BN_BITS2-1)/BN_BITS2
#define BN_NIST_521_TOP (521+BN_BITS2-1)/BN_BITS2
# if BN_BITS2==64
#if BN_BITS2==64
#if BN_BITS2 == 64
#if BN_BITS2==64
for (j = BN_BITS2 - 4; j >= 0; j -= 4) {
for (j = BN_BITS2 - 8; j >= 0; j -= 8) {
nw = n / BN_BITS2;
lb = n % BN_BITS2;
rb = BN_BITS2 - lb;
nw = n / BN_BITS2;
rb = n % BN_BITS2;
lb = BN_BITS2 - rb;
i = (BN_num_bits(a) - n + (BN_BITS2 - 1)) / BN_BITS2;
j = BN_BITS2 - BN_num_bits_word(w);
ret = (BN_ULLONG)(((ret << (BN_ULLONG)BN_BITS2) |
if (bn_wexpand(&dest->a, (int) (dest->poly[0] + BN_BITS2 - 1) / BN_BITS2) == NULL)
if (bn_wexpand(&dest->b, (int) (dest->poly[0] + BN_BITS2 - 1) / BN_BITS2) == NULL)
if (bn_wexpand(&group->a, (int) (group->poly[0] + BN_BITS2 - 1) / BN_BITS2) == NULL)
if (bn_wexpand(&group->b, (int) (group->poly[0] + BN_BITS2 - 1) / BN_BITS2) == NULL)