1 #ifndef _LINUX_MATH64_H
2 #define _LINUX_MATH64_H
4 #include <linux/types.h>
7 #if BITS_PER_LONG == 64
10 * div_u64_rem - unsigned 64bit divide with 32bit divisor with remainder
12 * This is commonly provided by 32bit archs to provide an optimized 64bit
15 static inline u64 div_u64_rem(u64 dividend, u32 divisor, u32 *remainder)
17 *remainder = dividend % divisor;
18 return dividend / divisor;
22 * div_s64_rem - signed 64bit divide with 32bit divisor with remainder
24 static inline s64 div_s64_rem(s64 dividend, s32 divisor, s32 *remainder)
26 *remainder = dividend % divisor;
27 return dividend / divisor;
31 * div64_u64 - unsigned 64bit divide with 64bit divisor
33 static inline u64 div64_u64(u64 dividend, u64 divisor)
35 return dividend / divisor;
38 #elif BITS_PER_LONG == 32
41 static inline u64 div_u64_rem(u64 dividend, u32 divisor, u32 *remainder)
43 *remainder = do_div(dividend, divisor);
49 extern s64 div_s64_rem(s64 dividend, s32 divisor, s32 *remainder);
53 extern u64 div64_u64(u64 dividend, u64 divisor);
56 #endif /* BITS_PER_LONG */
59 * div_u64 - unsigned 64bit divide with 32bit divisor
61 * This is the most common 64bit divide and should be used if possible,
62 * as many 32bit archs can optimize this variant better than a full 64bit
66 static inline u64 div_u64(u64 dividend, u32 divisor)
69 return div_u64_rem(dividend, divisor, &remainder);
74 * div_s64 - signed 64bit divide with 32bit divisor
77 static inline s64 div_s64(s64 dividend, s32 divisor)
80 return div_s64_rem(dividend, divisor, &remainder);
84 u32 iter_div_u64_rem(u64 dividend, u32 divisor, u64 *remainder);
86 static __always_inline u32
87 __iter_div_u64_rem(u64 dividend, u32 divisor, u64 *remainder)
91 while (dividend >= divisor) {
92 /* The following asm() prevents the compiler from
93 optimising this loop into a modulo operation. */
94 asm("" : "+rm"(dividend));
100 *remainder = dividend;
105 #endif /* _LINUX_MATH64_H */