]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blame - arch/mips/lib/delay.c
MIPS: Nuke empty lines at end of files.
[mirror_ubuntu-artful-kernel.git] / arch / mips / lib / delay.c
CommitLineData
5636919b
RB
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
15#include <asm/compiler.h>
16#include <asm/war.h>
17
5210edcd 18void __delay(unsigned long loops)
5636919b
RB
19{
20 __asm__ __volatile__ (
21 " .set noreorder \n"
22 " .align 3 \n"
23 "1: bnez %0, 1b \n"
4ea494b5 24#if BITS_PER_LONG == 32
5636919b 25 " subu %0, 1 \n"
5210edcd
DD
26#else
27 " dsubu %0, 1 \n"
28#endif
5636919b
RB
29 " .set reorder \n"
30 : "=r" (loops)
31 : "0" (loops));
32}
33EXPORT_SYMBOL(__delay);
34
35/*
36 * Division by multiplication: you don't have to worry about
37 * loss of precision.
38 *
39 * Use only for very small delays ( < 1 msec). Should probably use a
40 * lookup table, really, as the multiplications take much too long with
41 * short delays. This is a "reasonable" implementation, though (and the
42 * first constant multiplications gets optimized away if the delay is
43 * a constant)
44 */
45
46void __udelay(unsigned long us)
47{
abe5b417 48 unsigned int lpj = raw_current_cpu_data.udelay_val;
5636919b 49
3cb3a66c 50 __delay((us * 0x000010c7ull * HZ * lpj) >> 32);
5636919b
RB
51}
52EXPORT_SYMBOL(__udelay);
53
54void __ndelay(unsigned long ns)
55{
abe5b417 56 unsigned int lpj = raw_current_cpu_data.udelay_val;
5636919b 57
3cb3a66c 58 __delay((ns * 0x00000005ull * HZ * lpj) >> 32);
5636919b
RB
59}
60EXPORT_SYMBOL(__ndelay);