x86: move mp_irqs to io_apics_32.c
[linux-2.6/mini2440.git] / include / asm-x86 / div64.h
blob0dbf8bf3ef0a8d06308ea3cf8e72612c28c016c2
1 #ifndef _ASM_X86_DIV64_H
2 #define _ASM_X86_DIV64_H
4 #ifdef CONFIG_X86_32
6 #include <linux/types.h>
8 /*
9 * do_div() is NOT a C function. It wants to return
10 * two values (the quotient and the remainder), but
11 * since that doesn't work very well in C, what it
12 * does is:
14 * - modifies the 64-bit dividend _in_place_
15 * - returns the 32-bit remainder
17 * This ends up being the most efficient "calling
18 * convention" on x86.
20 #define do_div(n, base) \
21 ({ \
22 unsigned long __upper, __low, __high, __mod, __base; \
23 __base = (base); \
24 asm("":"=a" (__low), "=d" (__high) : "A" (n)); \
25 __upper = __high; \
26 if (__high) { \
27 __upper = __high % (__base); \
28 __high = __high / (__base); \
29 } \
30 asm("divl %2":"=a" (__low), "=d" (__mod) \
31 : "rm" (__base), "0" (__low), "1" (__upper)); \
32 asm("":"=A" (n) : "a" (__low), "d" (__high)); \
33 __mod; \
37 * (long)X = ((long long)divs) / (long)div
38 * (long)rem = ((long long)divs) % (long)div
40 * Warning, this will do an exception if X overflows.
42 #define div_long_long_rem(a, b, c) div_ll_X_l_rem(a, b, c)
44 static inline long div_ll_X_l_rem(long long divs, long div, long *rem)
46 long dum2;
47 asm("divl %2":"=a"(dum2), "=d"(*rem)
48 : "rm"(div), "A"(divs));
50 return dum2;
54 extern uint64_t div64_64(uint64_t dividend, uint64_t divisor);
56 #else
57 # include <asm-generic/div64.h>
58 #endif /* CONFIG_X86_32 */
60 #endif /* _ASM_X86_DIV64_H */