Searched refs:divisor (Results 1 – 6 of 6) sorted by relevance
| /openssl/crypto/bn/ |
| H A D | bn_div.c | 209 int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor, in BN_div() argument
214 if (BN_is_zero(divisor)) { in BN_div()
224 if (divisor->d[divisor->top - 1] == 0) { in BN_div()
229 ret = bn_div_fixed_top(dv, rm, num, divisor, ctx); in BN_div()
265 const BIGNUM *divisor, BN_CTX *ctx) in bn_div_fixed_top() argument
273 assert(divisor->top > 0 && divisor->d[divisor->top - 1] != 0); in bn_div_fixed_top()
276 bn_check_top(divisor); in bn_div_fixed_top()
289 if (!BN_copy(sdiv, divisor)) in bn_div_fixed_top()
330 res->neg = (num_neg ^ divisor->neg); in bn_div_fixed_top()
|
| /openssl/doc/internal/man3/ |
| H A D | OSSL_TIME.pod | 130 divisor returning ⌊I<a> ÷ I<b>⌋.
180 integral divisor.
|
| /openssl/doc/man1/ |
| H A D | openssl-speed.pod.in | 56 instead of CPU user time as divisor. It can be useful when testing speed
|
| /openssl/doc/man3/ |
| H A D | BN_add.pod | 107 BN_gcd() computes the greatest common divisor of I<a> and I<b> and
|
| /openssl/test/ |
| H A D | bntest.c | 323 int n, divisor, result, remainder; member
351 || !TEST_ptr(b = set_signed_bn(signed_mod_tests[n].divisor)) in test_signed_mod_replace_ab()
374 || !TEST_ptr(b = set_signed_bn(signed_mod_tests[n].divisor)) in test_signed_mod_replace_ba()
|
| /openssl/ |
| H A D | CHANGES.md | 17910 * Bug fix for BN_div() when the first words of num and divisor are
|
Completed in 57 milliseconds
