aboutsummaryrefslogtreecommitdiffstats
path: root/include/linux/math64.h
diff options
context:
space:
mode:
authorJeremy Fitzhardinge <jeremy.fitzhardinge@citrix.com>2008-06-12 04:47:56 -0400
committerIngo Molnar <mingo@elte.hu>2008-06-12 04:47:56 -0400
commitf595ec964daf7f99668039d7303ddedd09a75142 (patch)
tree4ee6679105f0437995ff200f10885598921ae1cd /include/linux/math64.h
parent5e70b7f3c24468bb1635b295945edb48ecd9656a (diff)
common implementation of iterative div/mod
We have a few instances of the open-coded iterative div/mod loop, used when we don't expcet the dividend to be much bigger than the divisor. Unfortunately modern gcc's have the tendency to strength "reduce" this into a full mod operation, which isn't necessarily any faster, and even if it were, doesn't exist if gcc implements it in libgcc. The workaround is to put a dummy asm statement in the loop to prevent gcc from performing the transformation. This patch creates a single implementation of this loop, and uses it to replace the open-coded versions I know about. Signed-off-by: Jeremy Fitzhardinge <jeremy.fitzhardinge@citrix.com> Cc: Andrew Morton <akpm@linux-foundation.org> Cc: john stultz <johnstul@us.ibm.com> Cc: Segher Boessenkool <segher@kernel.crashing.org> Cc: Christian Kujau <lists@nerdbynature.de> Cc: Robert Hancock <hancockr@shaw.ca> Signed-off-by: Ingo Molnar <mingo@elte.hu>
Diffstat (limited to 'include/linux/math64.h')
-rw-r--r--include/linux/math64.h2
1 files changed, 2 insertions, 0 deletions
diff --git a/include/linux/math64.h b/include/linux/math64.h
index c1a5f81501ff..177785e1e4a3 100644
--- a/include/linux/math64.h
+++ b/include/linux/math64.h
@@ -81,4 +81,6 @@ static inline s64 div_s64(s64 dividend, s32 divisor)
81} 81}
82#endif 82#endif
83 83
84u32 iter_div_u64_rem(u64 dividend, u32 divisor, u64 *remainder);
85
84#endif /* _LINUX_MATH64_H */ 86#endif /* _LINUX_MATH64_H */