Hannes Frederic Sowa | 809fa97 | 2014-01-22 02:29:41 +0100 | [diff] [blame] | 1 | #include <linux/kernel.h> |
Eric Dumazet | 6a2d7a9 | 2006-12-13 00:34:27 -0800 | [diff] [blame] | 2 | #include <asm/div64.h> |
| 3 | #include <linux/reciprocal_div.h> |
Eric Dumazet | 8af2a21 | 2011-12-08 06:06:03 +0000 | [diff] [blame] | 4 | #include <linux/export.h> |
Eric Dumazet | 6a2d7a9 | 2006-12-13 00:34:27 -0800 | [diff] [blame] | 5 | |
Hannes Frederic Sowa | 809fa97 | 2014-01-22 02:29:41 +0100 | [diff] [blame] | 6 | /* |
| 7 | * For a description of the algorithm please have a look at |
| 8 | * include/linux/reciprocal_div.h |
| 9 | */ |
| 10 | |
| 11 | struct reciprocal_value reciprocal_value(u32 d) |
Eric Dumazet | 6a2d7a9 | 2006-12-13 00:34:27 -0800 | [diff] [blame] | 12 | { |
Hannes Frederic Sowa | 809fa97 | 2014-01-22 02:29:41 +0100 | [diff] [blame] | 13 | struct reciprocal_value R; |
| 14 | u64 m; |
| 15 | int l; |
| 16 | |
| 17 | l = fls(d - 1); |
| 18 | m = ((1ULL << 32) * ((1ULL << l) - d)); |
| 19 | do_div(m, d); |
| 20 | ++m; |
| 21 | R.m = (u32)m; |
| 22 | R.sh1 = min(l, 1); |
| 23 | R.sh2 = max(l - 1, 0); |
| 24 | |
| 25 | return R; |
Eric Dumazet | 6a2d7a9 | 2006-12-13 00:34:27 -0800 | [diff] [blame] | 26 | } |
Eric Dumazet | 8af2a21 | 2011-12-08 06:06:03 +0000 | [diff] [blame] | 27 | EXPORT_SYMBOL(reciprocal_value); |