Lines Matching full:divisor

67  * div_s64_rem - signed 64bit divide with 64bit divisor and remainder
69 * @divisor: 64bit divisor
73 s64 div_s64_rem(s64 dividend, s32 divisor, s32 *remainder) in div_s64_rem() argument
78 quotient = div_u64_rem(-dividend, abs(divisor), (u32 *)remainder); in div_s64_rem()
80 if (divisor > 0) in div_s64_rem()
83 quotient = div_u64_rem(dividend, abs(divisor), (u32 *)remainder); in div_s64_rem()
84 if (divisor < 0) in div_s64_rem()
93 * div64_u64_rem - unsigned 64bit divide with 64bit divisor and remainder
95 * @divisor: 64bit divisor
104 u64 div64_u64_rem(u64 dividend, u64 divisor, u64 *remainder) in div64_u64_rem() argument
106 u32 high = divisor >> 32; in div64_u64_rem()
111 quot = div_u64_rem(dividend, divisor, &rem32); in div64_u64_rem()
115 quot = div_u64(dividend >> n, divisor >> n); in div64_u64_rem()
120 *remainder = dividend - quot * divisor; in div64_u64_rem()
121 if (*remainder >= divisor) { in div64_u64_rem()
123 *remainder -= divisor; in div64_u64_rem()
133 * div64_u64 - unsigned 64bit divide with 64bit divisor
135 * @divisor: 64bit divisor
144 u64 div64_u64(u64 dividend, u64 divisor) in div64_u64() argument
146 u32 high = divisor >> 32; in div64_u64()
150 quot = div_u64(dividend, divisor); in div64_u64()
153 quot = div_u64(dividend >> n, divisor >> n); in div64_u64()
157 if ((dividend - quot * divisor) >= divisor) in div64_u64()
167 * div64_s64 - signed 64bit divide with 64bit divisor
169 * @divisor: 64bit divisor
172 s64 div64_s64(s64 dividend, s64 divisor) in div64_s64() argument
176 quot = div64_u64(abs(dividend), abs(divisor)); in div64_s64()
177 t = (dividend ^ divisor) >> 63; in div64_s64()
188 * bigger than divisor.
190 u32 iter_div_u64_rem(u64 dividend, u32 divisor, u64 *remainder) in iter_div_u64_rem() argument
192 return __iter_div_u64_rem(dividend, divisor, remainder); in iter_div_u64_rem()