68 s64 div_s64_rem(s64 dividend, s32 divisor, s32 *remainder)  in div_s64_rem()  argument
72 	if (dividend < 0) {  in div_s64_rem()
73 		quotient = div_u64_rem(-dividend, abs(divisor), (u32 *)remainder);  in div_s64_rem()
78 		quotient = div_u64_rem(dividend, abs(divisor), (u32 *)remainder);  in div_s64_rem()
89  * @dividend:	64bit dividend
99 u64 div64_u64_rem(u64 dividend, u64 divisor, u64 *remainder)  in div64_u64_rem()  argument
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()
129  * @dividend:	64bit dividend
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()
167 	t = (dividend ^ divisor) >> 63;  in div64_s64()
177  * Iterative div/mod for use when dividend is not expected to be much
180 u32 iter_div_u64_rem(u64 dividend, u32 divisor, u64 *remainder)  in iter_div_u64_rem()  argument
182 	return __iter_div_u64_rem(dividend, divisor, remainder);  in iter_div_u64_rem()
224 	/* try reducing the fraction in case the dividend becomes <= 64 bits */  in mul_u64_u64_div_u64()