blob: a163b6caef73fdc26e19f8d18ef66604a03b1cf8 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * Copyright (C) 2003 Bernardo Innocenti <bernie@develer.com>
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 <davidm@hpl.hp.com>
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
16 * assembly versions such as arch/ppc/lib/div64.S and arch/sh/lib/div64.S.
17 */
18
Paul Gortmaker8bc3bcc2011-11-16 21:29:17 -050019#include <linux/export.h>
20#include <linux/kernel.h>
Roman Zippel2418f4f2008-05-01 04:34:25 -070021#include <linux/math64.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070022
23/* Not needed on 64bit architectures */
24#if BITS_PER_LONG == 32
25
David S. Millercb8c1812007-04-10 22:10:39 -070026uint32_t __attribute__((weak)) __div64_32(uint64_t *n, uint32_t base)
Linus Torvalds1da177e2005-04-16 15:20:36 -070027{
28 uint64_t rem = *n;
29 uint64_t b = base;
30 uint64_t res, d = 1;
31 uint32_t high = rem >> 32;
32
33 /* Reduce the thing a bit first */
34 res = 0;
35 if (high >= base) {
36 high /= base;
37 res = (uint64_t) high << 32;
38 rem -= (uint64_t) (high*base) << 32;
39 }
40
41 while ((int64_t)b > 0 && b < rem) {
42 b = b+b;
43 d = d+d;
44 }
45
46 do {
47 if (rem >= b) {
48 rem -= b;
49 res += d;
50 }
51 b >>= 1;
52 d >>= 1;
53 } while (d);
54
55 *n = res;
56 return rem;
57}
58
59EXPORT_SYMBOL(__div64_32);
60
Roman Zippel2418f4f2008-05-01 04:34:25 -070061#ifndef div_s64_rem
62s64 div_s64_rem(s64 dividend, s32 divisor, s32 *remainder)
63{
64 u64 quotient;
65
66 if (dividend < 0) {
67 quotient = div_u64_rem(-dividend, abs(divisor), (u32 *)remainder);
68 *remainder = -*remainder;
69 if (divisor > 0)
70 quotient = -quotient;
71 } else {
72 quotient = div_u64_rem(dividend, abs(divisor), (u32 *)remainder);
73 if (divisor < 0)
74 quotient = -quotient;
75 }
76 return quotient;
77}
78EXPORT_SYMBOL(div_s64_rem);
79#endif
80
Brian Behlendorf658716d2010-10-26 14:23:10 -070081/**
Stanislaw Gruszkaf3002132013-04-30 11:35:07 +020082 * div64_u64 - unsigned 64bit divide with 64bit divisor
Brian Behlendorf658716d2010-10-26 14:23:10 -070083 * @dividend: 64bit dividend
84 * @divisor: 64bit divisor
85 *
86 * This implementation is a modified version of the algorithm proposed
87 * by the book 'Hacker's Delight'. The original source and full proof
88 * can be found here and is available for use without restriction.
89 *
Akinobu Mita422aa272012-06-09 11:22:47 +090090 * 'http://www.hackersdelight.org/HDcode/newCode/divDouble.c.txt'
Brian Behlendorf658716d2010-10-26 14:23:10 -070091 */
Stanislaw Gruszkaf3002132013-04-30 11:35:07 +020092#ifndef div64_u64
93u64 div64_u64(u64 dividend, u64 divisor)
Stephen Hemminger3927f2e2007-03-25 19:54:23 -070094{
Brian Behlendorf658716d2010-10-26 14:23:10 -070095 u32 high = divisor >> 32;
96 u64 quot;
Stephen Hemminger3927f2e2007-03-25 19:54:23 -070097
Brian Behlendorf658716d2010-10-26 14:23:10 -070098 if (high == 0) {
Stanislaw Gruszkaf3002132013-04-30 11:35:07 +020099 quot = div_u64(dividend, divisor);
Brian Behlendorf658716d2010-10-26 14:23:10 -0700100 } else {
101 int n = 1 + fls(high);
102 quot = div_u64(dividend >> n, divisor >> n);
Stephen Hemminger3927f2e2007-03-25 19:54:23 -0700103
Brian Behlendorf658716d2010-10-26 14:23:10 -0700104 if (quot != 0)
105 quot--;
Stanislaw Gruszkaf3002132013-04-30 11:35:07 +0200106 if ((dividend - quot * divisor) >= divisor)
Brian Behlendorf658716d2010-10-26 14:23:10 -0700107 quot++;
108 }
Stephen Hemminger3927f2e2007-03-25 19:54:23 -0700109
Brian Behlendorf658716d2010-10-26 14:23:10 -0700110 return quot;
Stephen Hemminger3927f2e2007-03-25 19:54:23 -0700111}
Stanislaw Gruszkaf3002132013-04-30 11:35:07 +0200112EXPORT_SYMBOL(div64_u64);
Roman Zippel6f6d6a12008-05-01 04:34:28 -0700113#endif
Stephen Hemminger3927f2e2007-03-25 19:54:23 -0700114
Brian Behlendorf658716d2010-10-26 14:23:10 -0700115/**
116 * div64_s64 - signed 64bit divide with 64bit divisor
117 * @dividend: 64bit dividend
118 * @divisor: 64bit divisor
119 */
120#ifndef div64_s64
121s64 div64_s64(s64 dividend, s64 divisor)
122{
123 s64 quot, t;
124
125 quot = div64_u64(abs64(dividend), abs64(divisor));
126 t = (dividend ^ divisor) >> 63;
127
128 return (quot ^ t) - t;
129}
130EXPORT_SYMBOL(div64_s64);
131#endif
132
Linus Torvalds1da177e2005-04-16 15:20:36 -0700133#endif /* BITS_PER_LONG == 32 */
Jeremy Fitzhardingef595ec92008-06-12 10:47:56 +0200134
135/*
136 * Iterative div/mod for use when dividend is not expected to be much
137 * bigger than divisor.
138 */
139u32 iter_div_u64_rem(u64 dividend, u32 divisor, u64 *remainder)
140{
Jeremy Fitzhardinged5e181f2008-06-12 10:47:58 +0200141 return __iter_div_u64_rem(dividend, divisor, remainder);
Jeremy Fitzhardingef595ec92008-06-12 10:47:56 +0200142}
143EXPORT_SYMBOL(iter_div_u64_rem);