Searched refs:divisor (Results 1 – 7 of 7) sorted by relevance
| /lib/math/ |
| A D | div64.c | 75 if (divisor > 0) in div_s64_rem()
79 if (divisor < 0) in div_s64_rem()
101 u32 high = divisor >> 32; in div64_u64_rem()
116 if (*remainder >= divisor) { in div64_u64_rem()
118 *remainder -= divisor; in div64_u64_rem()
139 u64 div64_u64(u64 dividend, u64 divisor) in div64_u64() argument
141 u32 high = divisor >> 32; in div64_u64()
145 quot = div_u64(dividend, divisor); in div64_u64()
152 if ((dividend - quot * divisor) >= divisor) in div64_u64()
162 s64 div64_s64(s64 dividend, s64 divisor) in div64_s64() argument
[all …]
|
| A D | test_div64.c | 238 #define test_div64_one(dividend, divisor, i, j) ({ \ argument
244 remainder = do_div(quotient, divisor); \
247 dividend, divisor, quotient, remainder); \
|
| /lib/crypto/mpi/ |
| A D | mpi-div.c | 19 int mpi_fdiv_r(MPI rem, MPI dividend, MPI divisor) in mpi_fdiv_r() argument
21 int divisor_sign = divisor->sign; in mpi_fdiv_r()
29 if (rem == divisor) { in mpi_fdiv_r()
30 temp_divisor = mpi_copy(divisor); in mpi_fdiv_r()
33 divisor = temp_divisor; in mpi_fdiv_r()
36 err = mpi_tdiv_r(rem, dividend, divisor); in mpi_fdiv_r()
41 err = mpi_add(rem, rem, divisor); in mpi_fdiv_r()
|
| 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()
|
| /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()
|
| /lib/ |
| A D | string_helpers.c | 53 static const unsigned int divisor[] = { in string_get_size() local
82 do_div(blk_size, divisor[units_base]); in string_get_size()
87 do_div(size, divisor[units_base]); in string_get_size()
96 while (size >= divisor[units_base]) { in string_get_size()
97 remainder = do_div(size, divisor[units_base]); in string_get_size()
|
| A D | Kconfig.debug | 3291 tristate "Greatest common divisor test" if !KUNIT_ALL_TESTS
3296 which computes the greatest common divisor of two numbers.
|
Completed in 22 milliseconds