BN_mod_word
if ((mod = BN_mod_word(n, primes[i])) == (BN_ULONG)-1)
if ((r = BN_mod_word(n, 11 * 63 * 65)) == (BN_ULONG)-1)
BN_ULONG mod = BN_mod_word(a, primes[i]);
BN_ULONG mod = BN_mod_word(rnd, (BN_ULONG)primes[i]);
BN_LONG mod = BN_mod_word(rnd, (BN_ULONG)primes[i]);
BN_ULONG pmod = BN_mod_word(p, (BN_ULONG)primes[i]);
BN_ULONG qmod = BN_mod_word(q, (BN_ULONG)primes[i]);
BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);
r = BN_mod_word(largebase, s32);
if (BN_mod_word(p, 24) == 11)
u_int32_t r = BN_mod_word(p, 10);
if (BN_mod_word(val, (BN_ULONG)*fact) == 0)
} while (BN_mod_word(val, (BN_ULONG)*fact) == 0);