blob: 98511e4d28cbe54c1c43f466eed1edba870a8361 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001#ifndef __ASM_SH_BITOPS_H
2#define __ASM_SH_BITOPS_H
3
4#ifdef __KERNEL__
Jiri Slaby06245172007-10-18 23:40:26 -07005
6#ifndef _LINUX_BITOPS_H
7#error only <linux/bitops.h> can be included directly
8#endif
9
Linus Torvalds1da177e2005-04-16 15:20:36 -070010#include <asm/system.h>
11/* For __swab32 */
12#include <asm/byteorder.h>
13
Stuart Menefy1efe4ce2007-11-30 16:12:36 +090014#ifdef CONFIG_GUSA_RB
15#include <asm/bitops-grb.h>
Paul Mundt0d5bbe02008-11-25 21:22:02 +090016#elif defined(CONFIG_CPU_SH2A)
17#include <asm-generic/bitops/atomic.h>
18#include <asm/bitops-op32.h>
Paul Mundt742fd1b2008-08-07 17:36:12 +090019#elif defined(CONFIG_CPU_SH4A)
20#include <asm/bitops-llsc.h>
Stuart Menefy1efe4ce2007-11-30 16:12:36 +090021#else
Paul Mundt16b529d2008-11-20 15:25:22 +090022#include <asm-generic/bitops/atomic.h>
23#include <asm-generic/bitops/non-atomic.h>
Stuart Menefy1efe4ce2007-11-30 16:12:36 +090024#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -070025
Linus Torvalds1da177e2005-04-16 15:20:36 -070026/*
27 * clear_bit() doesn't provide any barrier for the compiler.
28 */
Paul Mundt1c8db712009-10-18 15:36:02 +090029#define smp_mb__before_clear_bit() smp_mb()
30#define smp_mb__after_clear_bit() smp_mb()
Linus Torvalds1da177e2005-04-16 15:20:36 -070031
Paul Mundt63e2c802007-11-11 17:28:18 +090032#ifdef CONFIG_SUPERH32
Paul Mundte4c2cfe2006-09-27 12:31:01 +090033static inline unsigned long ffz(unsigned long word)
Linus Torvalds1da177e2005-04-16 15:20:36 -070034{
35 unsigned long result;
36
37 __asm__("1:\n\t"
38 "shlr %1\n\t"
39 "bt/s 1b\n\t"
40 " add #1, %0"
41 : "=r" (result), "=r" (word)
42 : "0" (~0L), "1" (word)
43 : "t");
44 return result;
45}
46
47/**
48 * __ffs - find first bit in word.
49 * @word: The word to search
50 *
51 * Undefined if no bit exists, so code should check against 0 first.
52 */
Paul Mundte4c2cfe2006-09-27 12:31:01 +090053static inline unsigned long __ffs(unsigned long word)
Linus Torvalds1da177e2005-04-16 15:20:36 -070054{
55 unsigned long result;
56
57 __asm__("1:\n\t"
58 "shlr %1\n\t"
59 "bf/s 1b\n\t"
60 " add #1, %0"
61 : "=r" (result), "=r" (word)
62 : "0" (~0L), "1" (word)
63 : "t");
64 return result;
65}
Paul Mundt63e2c802007-11-11 17:28:18 +090066#else
67static inline unsigned long ffz(unsigned long word)
68{
69 unsigned long result, __d2, __d3;
70
71 __asm__("gettr tr0, %2\n\t"
72 "pta $+32, tr0\n\t"
73 "andi %1, 1, %3\n\t"
74 "beq %3, r63, tr0\n\t"
75 "pta $+4, tr0\n"
76 "0:\n\t"
77 "shlri.l %1, 1, %1\n\t"
78 "addi %0, 1, %0\n\t"
79 "andi %1, 1, %3\n\t"
80 "beqi %3, 1, tr0\n"
81 "1:\n\t"
82 "ptabs %2, tr0\n\t"
83 : "=r" (result), "=r" (word), "=r" (__d2), "=r" (__d3)
84 : "0" (0L), "1" (word));
85
86 return result;
87}
88
89#include <asm-generic/bitops/__ffs.h>
90#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -070091
Akinobu Mitae2268c72006-03-26 01:39:35 -080092#include <asm-generic/bitops/find.h>
93#include <asm-generic/bitops/ffs.h>
94#include <asm-generic/bitops/hweight.h>
Nick Piggin26333572007-10-18 03:06:39 -070095#include <asm-generic/bitops/lock.h>
Akinobu Mitae2268c72006-03-26 01:39:35 -080096#include <asm-generic/bitops/sched.h>
97#include <asm-generic/bitops/ext2-non-atomic.h>
98#include <asm-generic/bitops/ext2-atomic.h>
99#include <asm-generic/bitops/minix.h>
100#include <asm-generic/bitops/fls.h>
Alexander van Heukelum56a6b1e2008-03-15 18:31:49 +0100101#include <asm-generic/bitops/__fls.h>
Akinobu Mitae2268c72006-03-26 01:39:35 -0800102#include <asm-generic/bitops/fls64.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103
104#endif /* __KERNEL__ */
105
106#endif /* __ASM_SH_BITOPS_H */