delay.c 1.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
  1. /*
  2. * This file is subject to the terms and conditions of the GNU General Public
  3. * License. See the file "COPYING" in the main directory of this archive
  4. * for more details.
  5. *
  6. * Copyright (C) 1994 by Waldorf Electronics
  7. * Copyright (C) 1995 - 2000, 01, 03 by Ralf Baechle
  8. * Copyright (C) 1999, 2000 Silicon Graphics, Inc.
  9. * Copyright (C) 2007 Maciej W. Rozycki
  10. */
  11. #include <linux/module.h>
  12. #include <linux/param.h>
  13. #include <linux/smp.h>
  14. #include <asm/compiler.h>
  15. #include <asm/war.h>
  16. inline void __delay(unsigned int loops)
  17. {
  18. __asm__ __volatile__ (
  19. " .set noreorder \n"
  20. " .align 3 \n"
  21. "1: bnez %0, 1b \n"
  22. " subu %0, 1 \n"
  23. " .set reorder \n"
  24. : "=r" (loops)
  25. : "0" (loops));
  26. }
  27. EXPORT_SYMBOL(__delay);
  28. /*
  29. * Division by multiplication: you don't have to worry about
  30. * loss of precision.
  31. *
  32. * Use only for very small delays ( < 1 msec). Should probably use a
  33. * lookup table, really, as the multiplications take much too long with
  34. * short delays. This is a "reasonable" implementation, though (and the
  35. * first constant multiplications gets optimized away if the delay is
  36. * a constant)
  37. */
  38. void __udelay(unsigned long us)
  39. {
  40. unsigned int lpj = raw_current_cpu_data.udelay_val;
  41. __delay((us * 0x000010c7ull * HZ * lpj) >> 32);
  42. }
  43. EXPORT_SYMBOL(__udelay);
  44. void __ndelay(unsigned long ns)
  45. {
  46. unsigned int lpj = raw_current_cpu_data.udelay_val;
  47. __delay((ns * 0x00000005ull * HZ * lpj) >> 32);
  48. }
  49. EXPORT_SYMBOL(__ndelay);