1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _ASM_X86_DIV64_H
3 #define _ASM_X86_DIV64_H
7 #include <linux/types.h>
8 #include <linux/log2.h>
11 * do_div() is NOT a C function. It wants to return
12 * two values (the quotient and the remainder), but
13 * since that doesn't work very well in C, what it
16 * - modifies the 64-bit dividend _in_place_
17 * - returns the 32-bit remainder
19 * This ends up being the most efficient "calling
22 #define do_div(n, base) \
24 unsigned long __upper, __low, __high, __mod, __base; \
26 if (__builtin_constant_p(__base) && is_power_of_2(__base)) { \
27 __mod = n & (__base - 1); \
28 n >>= ilog2(__base); \
30 asm("" : "=a" (__low), "=d" (__high) : "A" (n));\
33 __upper = __high % (__base); \
34 __high = __high / (__base); \
36 asm("divl %2" : "=a" (__low), "=d" (__mod) \
37 : "rm" (__base), "0" (__low), "1" (__upper)); \
38 asm("" : "=A" (n) : "a" (__low), "d" (__high)); \
43 static inline u64
div_u64_rem(u64 dividend
, u32 divisor
, u32
*remainder
)
53 if (upper
>= divisor
) {
54 d
.v32
[1] = upper
/ divisor
;
57 asm ("divl %2" : "=a" (d
.v32
[0]), "=d" (*remainder
) :
58 "rm" (divisor
), "0" (d
.v32
[0]), "1" (upper
));
61 #define div_u64_rem div_u64_rem
63 static inline u64
mul_u32_u32(u32 a
, u32 b
)
67 asm ("mull %[b]" : "=a" (low
), "=d" (high
)
68 : [a
] "a" (a
), [b
] "rm" (b
) );
70 return low
| ((u64
)high
) << 32;
72 #define mul_u32_u32 mul_u32_u32
75 # include <asm-generic/div64.h>
76 #endif /* CONFIG_X86_32 */
78 #endif /* _ASM_X86_DIV64_H */