11  * 64bit result and 32bit remainder.
68 s64 div_s64_rem(s64 dividend, s32 divisor, s32 *remainder)  in div_s64_rem()  argument
73 		quotient = div_u64_rem(-dividend, abs(divisor), (u32 *)remainder);  in div_s64_rem()
74 		*remainder = -*remainder;  in div_s64_rem()
78 		quotient = div_u64_rem(dividend, abs(divisor), (u32 *)remainder);  in div_s64_rem()
88  * div64_u64_rem - unsigned 64bit divide with 64bit divisor and remainder
91  * @remainder:  64bit remainder
94  * But this operation, which includes math for calculating the remainder,
99 u64 div64_u64_rem(u64 dividend, u64 divisor, u64 *remainder)  in div64_u64_rem()  argument
107 		*remainder = rem32;  in div64_u64_rem()
115 		*remainder = dividend - quot * divisor;  in div64_u64_rem()
116 		if (*remainder >= divisor) {  in div64_u64_rem()
118 			*remainder -= divisor;  in div64_u64_rem()
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()
230 		 * The remainder value if needed would be:  in mul_u64_u64_div_u64()
264 	/* The remainder value if needed would be n_hi << p */  in mul_u64_u64_div_u64()