1 #ifndef _ASM_X86_DIV64_H
2 #define _ASM_X86_DIV64_H
6 #include <linux/types.h>
7 #include <linux/log2.h>
10 * do_div() is NOT a C function. It wants to return
11 * two values (the quotient and the remainder), but
12 * since that doesn't work very well in C, what it
15 * - modifies the 64-bit dividend _in_place_
16 * - returns the 32-bit remainder
18 * This ends up being the most efficient "calling
21 #define do_div(n, base) \
23 unsigned long __upper, __low, __high, __mod, __base; \
25 if (__builtin_constant_p(__base) && is_power_of_2(__base)) { \
26 __mod = n & (__base - 1); \
27 n >>= ilog2(__base); \
29 asm("" : "=a" (__low), "=d" (__high) : "A" (n));\
32 __upper = __high % (__base); \
33 __high = __high / (__base); \
35 asm("divl %2" : "=a" (__low), "=d" (__mod) \
36 : "rm" (__base), "0" (__low), "1" (__upper)); \
37 asm("" : "=A" (n) : "a" (__low), "d" (__high)); \
42 static inline u64
div_u64_rem(u64 dividend
, u32 divisor
, u32
*remainder
)
52 if (upper
>= divisor
) {
53 d
.v32
[1] = upper
/ divisor
;
56 asm ("divl %2" : "=a" (d
.v32
[0]), "=d" (*remainder
) :
57 "rm" (divisor
), "0" (d
.v32
[0]), "1" (upper
));
60 #define div_u64_rem div_u64_rem
62 static inline u64
mul_u32_u32(u32 a
, u32 b
)
66 asm ("mull %[b]" : "=a" (low
), "=d" (high
)
67 : [a
] "a" (a
), [b
] "rm" (b
) );
69 return low
| ((u64
)high
) << 32;
71 #define mul_u32_u32 mul_u32_u32
74 # include <asm-generic/div64.h>
75 #endif /* CONFIG_X86_32 */
77 #endif /* _ASM_X86_DIV64_H */