aboutsummaryrefslogtreecommitdiffstats
path: root/arch
diff options
context:
space:
mode:
authorMichael Hennerich <michael.hennerich@analog.com>2009-02-04 03:49:45 -0500
committerBryan Wu <cooloney@kernel.org>2009-02-04 03:49:45 -0500
commit4e653e04cc1c3553af539ffc81fb56d83d83c733 (patch)
tree6d5ab0a6e8033901ccb6c193daa15f0c20e008ab /arch
parent972de7d9292439c9429c301cf377fbf56b6e654e (diff)
Blackfin arch: Fix udelay implementation
Avoid possible overflow during 32*32->32 multiplies. Reported-by: Marco Reppenhagen <marco.reppenhagen@auerswald.de> Signed-off-by: Michael Hennerich <michael.hennerich@analog.com> Signed-off-by: Bryan Wu <cooloney@kernel.org>
Diffstat (limited to 'arch')
-rw-r--r--arch/blackfin/include/asm/delay.h11
1 files changed, 5 insertions, 6 deletions
diff --git a/arch/blackfin/include/asm/delay.h b/arch/blackfin/include/asm/delay.h
index 0889c3abb593..47f98c5067b5 100644
--- a/arch/blackfin/include/asm/delay.h
+++ b/arch/blackfin/include/asm/delay.h
@@ -47,16 +47,15 @@ static inline void __delay(unsigned long loops)
47#include <linux/param.h> /* needed for HZ */ 47#include <linux/param.h> /* needed for HZ */
48 48
49/* 49/*
50 * Use only for very small delays ( < 1 msec). Should probably use a 50 * close approximation borrowed from m68knommu to avoid 64-bit math
51 * lookup table, really, as the multiplications take much too long with
52 * short delays. This is a "reasonable" implementation, though (and the
53 * first constant multiplications gets optimized away if the delay is
54 * a constant)
55 */ 51 */
52
53#define HZSCALE (268435456 / (1000000/HZ))
54
56static inline void udelay(unsigned long usecs) 55static inline void udelay(unsigned long usecs)
57{ 56{
58 extern unsigned long loops_per_jiffy; 57 extern unsigned long loops_per_jiffy;
59 __delay(usecs * loops_per_jiffy / (1000000 / HZ)); 58 __delay((((usecs * HZSCALE) >> 11) * (loops_per_jiffy >> 11)) >> 6);
60} 59}
61 60
62#endif 61#endif