| H. Peter Anvin | 1965aae | 2008-10-22 22:26:29 -0700 | [diff] [blame] | 1 | #ifndef _ASM_X86_DIV64_H | 
|  | 2 | #define _ASM_X86_DIV64_H | 
| Chris Snook | 428c5a2 | 2007-10-20 07:51:29 -0400 | [diff] [blame] | 3 |  | 
| Thomas Gleixner | 96a388d | 2007-10-11 11:20:03 +0200 | [diff] [blame] | 4 | #ifdef CONFIG_X86_32 | 
| Chris Snook | 428c5a2 | 2007-10-20 07:51:29 -0400 | [diff] [blame] | 5 |  | 
|  | 6 | #include <linux/types.h> | 
| Sebastian Andrzej Siewior | 668b448 | 2011-11-30 11:43:34 +0100 | [diff] [blame] | 7 | #include <linux/log2.h> | 
| Chris Snook | 428c5a2 | 2007-10-20 07:51:29 -0400 | [diff] [blame] | 8 |  | 
|  | 9 | /* | 
|  | 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 | 
|  | 13 | * does is: | 
|  | 14 | * | 
|  | 15 | * - modifies the 64-bit dividend _in_place_ | 
|  | 16 | * - returns the 32-bit remainder | 
|  | 17 | * | 
|  | 18 | * This ends up being the most efficient "calling | 
|  | 19 | * convention" on x86. | 
|  | 20 | */ | 
| Joe Perches | 925a09b | 2008-03-23 01:01:59 -0700 | [diff] [blame] | 21 | #define do_div(n, base)						\ | 
|  | 22 | ({								\ | 
|  | 23 | unsigned long __upper, __low, __high, __mod, __base;	\ | 
|  | 24 | __base = (base);					\ | 
| Sebastian Andrzej Siewior | 668b448 | 2011-11-30 11:43:34 +0100 | [diff] [blame] | 25 | if (__builtin_constant_p(__base) && is_power_of_2(__base)) { \ | 
|  | 26 | __mod = n & (__base - 1);			\ | 
|  | 27 | n >>= ilog2(__base);				\ | 
|  | 28 | } else {						\ | 
|  | 29 | asm("" : "=a" (__low), "=d" (__high) : "A" (n));\ | 
|  | 30 | __upper = __high;				\ | 
|  | 31 | if (__high) {					\ | 
|  | 32 | __upper = __high % (__base);		\ | 
|  | 33 | __high = __high / (__base);		\ | 
|  | 34 | }						\ | 
|  | 35 | asm("divl %2" : "=a" (__low), "=d" (__mod)	\ | 
|  | 36 | : "rm" (__base), "0" (__low), "1" (__upper));	\ | 
|  | 37 | asm("" : "=A" (n) : "a" (__low), "d" (__high));	\ | 
| Joe Perches | 925a09b | 2008-03-23 01:01:59 -0700 | [diff] [blame] | 38 | }							\ | 
| Joe Perches | 925a09b | 2008-03-23 01:01:59 -0700 | [diff] [blame] | 39 | __mod;							\ | 
| Chris Snook | 428c5a2 | 2007-10-20 07:51:29 -0400 | [diff] [blame] | 40 | }) | 
|  | 41 |  | 
| Roman Zippel | 2418f4f | 2008-05-01 04:34:25 -0700 | [diff] [blame] | 42 | static inline u64 div_u64_rem(u64 dividend, u32 divisor, u32 *remainder) | 
|  | 43 | { | 
|  | 44 | union { | 
|  | 45 | u64 v64; | 
|  | 46 | u32 v32[2]; | 
|  | 47 | } d = { dividend }; | 
|  | 48 | u32 upper; | 
|  | 49 |  | 
|  | 50 | upper = d.v32[1]; | 
|  | 51 | d.v32[1] = 0; | 
|  | 52 | if (upper >= divisor) { | 
|  | 53 | d.v32[1] = upper / divisor; | 
|  | 54 | upper %= divisor; | 
|  | 55 | } | 
|  | 56 | asm ("divl %2" : "=a" (d.v32[0]), "=d" (*remainder) : | 
|  | 57 | "rm" (divisor), "0" (d.v32[0]), "1" (upper)); | 
|  | 58 | return d.v64; | 
|  | 59 | } | 
|  | 60 | #define div_u64_rem	div_u64_rem | 
|  | 61 |  | 
| Thomas Gleixner | 96a388d | 2007-10-11 11:20:03 +0200 | [diff] [blame] | 62 | #else | 
| Chris Snook | 428c5a2 | 2007-10-20 07:51:29 -0400 | [diff] [blame] | 63 | # include <asm-generic/div64.h> | 
|  | 64 | #endif /* CONFIG_X86_32 */ | 
|  | 65 |  | 
| H. Peter Anvin | 1965aae | 2008-10-22 22:26:29 -0700 | [diff] [blame] | 66 | #endif /* _ASM_X86_DIV64_H */ |