4 #include <linux/types.h>
7 * do_div() is NOT a C function. It wants to return
8 * two values (the quotient and the remainder), but
9 * since that doesn't work very well in C, what it
12 * - modifies the 64-bit dividend _in_place_
13 * - returns the 32-bit remainder
15 * This ends up being the most efficient "calling
18 #define do_div(n,base) ({ \
19 unsigned long __upper, __low, __high, __mod, __base; \
21 asm("":"=a" (__low), "=d" (__high):"A" (n)); \
24 __upper = __high % (__base); \
25 __high = __high / (__base); \
27 asm("divl %2":"=a" (__low), "=d" (__mod):"rm" (__base), "0" (__low), "1" (__upper)); \
28 asm("":"=A" (n):"a" (__low),"d" (__high)); \
33 * (long)X = ((long long)divs) / (long)div
34 * (long)rem = ((long long)divs) % (long)div
36 * Warning, this will do an exception if X overflows.
38 #define div_long_long_rem(a,b,c) div_ll_X_l_rem(a,b,c)
41 div_ll_X_l_rem(long long divs
, long div
, long *rem
)
44 __asm__("divl %2":"=a"(dum2
), "=d"(*rem
)
45 : "rm"(div
), "A"(divs
));
51 extern uint64_t div64_64(uint64_t dividend
, uint64_t divisor
);