Searched refs:dividend (Results 1 – 5 of 5) sorted by relevance
| /lib/math/ |
| A D | test_div64.c | 238 #define test_div64_one(dividend, divisor, i, j) ({ \ argument
243 quotient = dividend; \
247 dividend, divisor, quotient, remainder); \
263 u64 dividend; in test_div64() local
267 dividend = test_div64_dividends[i]; in test_div64()
268 if (!test_div64_one(dividend, TEST_DIV64_DIVISOR_0, i, 0)) in test_div64()
270 if (!test_div64_one(dividend, TEST_DIV64_DIVISOR_1, i, 1)) in test_div64()
272 if (!test_div64_one(dividend, TEST_DIV64_DIVISOR_2, i, 2)) in test_div64()
274 if (!test_div64_one(dividend, TEST_DIV64_DIVISOR_3, i, 3)) in test_div64()
276 if (!test_div64_one(dividend, TEST_DIV64_DIVISOR_4, i, 4)) in test_div64()
[all …]
|
| A D | div64.c | 72 if (dividend < 0) { in div_s64_rem()
106 quot = div_u64_rem(dividend, divisor, &rem32); in div64_u64_rem()
110 quot = div_u64(dividend >> n, divisor >> n); in div64_u64_rem()
115 *remainder = dividend - quot * divisor; in div64_u64_rem()
139 u64 div64_u64(u64 dividend, u64 divisor) in div64_u64() argument
145 quot = div_u64(dividend, divisor); in div64_u64()
148 quot = div_u64(dividend >> n, divisor >> n); in div64_u64()
152 if ((dividend - quot * divisor) >= divisor) in div64_u64()
162 s64 div64_s64(s64 dividend, s64 divisor) in div64_s64() argument
166 quot = div64_u64(abs(dividend), abs(divisor)); in div64_s64()
[all …]
|
| /lib/crypto/mpi/ |
| A D | mpi-mod.c | 10 int mpi_mod(MPI rem, MPI dividend, MPI divisor) in mpi_mod() argument
12 return mpi_fdiv_r(rem, dividend, divisor); in mpi_mod()
|
| A D | mpi-div.c | 19 int mpi_fdiv_r(MPI rem, MPI dividend, MPI divisor) in mpi_fdiv_r() argument
36 err = mpi_tdiv_r(rem, dividend, divisor); in mpi_fdiv_r()
40 if (((divisor_sign?1:0) ^ (dividend->sign?1:0)) && rem->nlimbs) in mpi_fdiv_r()
|
| /lib/zstd/common/ |
| A D | zstd_deps.h | 68 static uint64_t ZSTD_div64(uint64_t dividend, uint32_t divisor) { in ZSTD_div64() argument
69 return div_u64(dividend, divisor); in ZSTD_div64()
|
Completed in 8 milliseconds