]>
Commit | Line | Data |
---|---|---|
7b64fef3 WD |
1 | /* |
2 | * Copyright (C) 2003 Bernardo Innocenti <[email protected]> | |
3 | * | |
4 | * Based on former do_div() implementation from asm-parisc/div64.h: | |
5 | * Copyright (C) 1999 Hewlett-Packard Co | |
6 | * Copyright (C) 1999 David Mosberger-Tang <[email protected]> | |
7 | * | |
8 | * | |
9 | * Generic C version of 64bit/32bit division and modulo, with | |
10 | * 64bit result and 32bit remainder. | |
11 | * | |
12 | * The fast case for (n>>32 == 0) is handled inline by do_div(). | |
13 | * | |
14 | * Code generated for this function might be very inefficient | |
15 | * for some CPUs. __div64_32() can be overridden by linking arch-specific | |
a47a12be | 16 | * assembly versions such as arch/powerpc/lib/div64.S and arch/sh/lib/div64.S. |
7b64fef3 WD |
17 | */ |
18 | ||
e259d6a3 | 19 | #include <div64.h> |
7b64fef3 WD |
20 | #include <linux/types.h> |
21 | ||
7b64fef3 WD |
22 | uint32_t __div64_32(uint64_t *n, uint32_t base) |
23 | { | |
24 | uint64_t rem = *n; | |
25 | uint64_t b = base; | |
26 | uint64_t res, d = 1; | |
27 | uint32_t high = rem >> 32; | |
28 | ||
29 | /* Reduce the thing a bit first */ | |
30 | res = 0; | |
31 | if (high >= base) { | |
32 | high /= base; | |
33 | res = (uint64_t) high << 32; | |
34 | rem -= (uint64_t) (high*base) << 32; | |
35 | } | |
36 | ||
37 | while ((int64_t)b > 0 && b < rem) { | |
38 | b = b+b; | |
39 | d = d+d; | |
40 | } | |
41 | ||
42 | do { | |
43 | if (rem >= b) { | |
44 | rem -= b; | |
45 | res += d; | |
46 | } | |
47 | b >>= 1; | |
48 | d >>= 1; | |
49 | } while (d); | |
50 | ||
51 | *n = res; | |
52 | return rem; | |
53 | } |