blob: 71b05685f3a7860a54737892f422da3d1f5c1c30 [file] [log] [blame]
David Gibsona0e60b22005-11-01 17:28:10 +11001/*
2 * PowerPC atomic bit operations.
3 *
4 * Merged version by David Gibson <david@gibson.dropbear.id.au>.
5 * Based on ppc64 versions by: Dave Engebretsen, Todd Inglett, Don
6 * Reed, Pat McCarthy, Peter Bergner, Anton Blanchard. They
7 * originally took it from the ppc32 code.
8 *
9 * Within a word, bits are numbered LSB first. Lot's of places make
10 * this assumption by directly testing bits with (val & (1<<nr)).
11 * This can cause confusion for large (> 1 word) bitmaps on a
12 * big-endian system because, unlike little endian, the number of each
13 * bit depends on the word size.
14 *
15 * The bitop functions are defined to work on unsigned longs, so for a
16 * ppc64 system the bits end up numbered:
Boqun Fenge7a7a652014-11-11 12:50:22 +080017 * |63..............0|127............64|191...........128|255...........192|
David Gibsona0e60b22005-11-01 17:28:10 +110018 * and on ppc32:
Boqun Fenge7a7a652014-11-11 12:50:22 +080019 * |31.....0|63....32|95....64|127...96|159..128|191..160|223..192|255..224|
David Gibsona0e60b22005-11-01 17:28:10 +110020 *
21 * There are a few little-endian macros used mostly for filesystem
22 * bitmaps, these work on similar bit arrays layouts, but
23 * byte-oriented:
24 * |7...0|15...8|23...16|31...24|39...32|47...40|55...48|63...56|
25 *
26 * The main difference is that bit 3-5 (64b) or 3-4 (32b) in the bit
27 * number field needs to be reversed compared to the big-endian bit
28 * fields. This can be achieved by XOR with 0x38 (64b) or 0x18 (32b).
29 *
30 * This program is free software; you can redistribute it and/or
31 * modify it under the terms of the GNU General Public License
32 * as published by the Free Software Foundation; either version
33 * 2 of the License, or (at your option) any later version.
34 */
35
36#ifndef _ASM_POWERPC_BITOPS_H
37#define _ASM_POWERPC_BITOPS_H
38
39#ifdef __KERNEL__
40
Jiri Slaby06245172007-10-18 23:40:26 -070041#ifndef _LINUX_BITOPS_H
42#error only <linux/bitops.h> can be included directly
43#endif
44
David Gibsona0e60b22005-11-01 17:28:10 +110045#include <linux/compiler.h>
David Gibson3ddfbcf2005-11-10 12:56:55 +110046#include <asm/asm-compat.h>
David Gibsona0e60b22005-11-01 17:28:10 +110047#include <asm/synch.h>
48
Mahesh Salgaonkare22a2272013-10-30 20:05:11 +053049/* PPC bit number conversion */
50#define PPC_BITLSHIFT(be) (BITS_PER_LONG - 1 - (be))
51#define PPC_BIT(bit) (1UL << PPC_BITLSHIFT(bit))
52#define PPC_BITMASK(bs, be) ((PPC_BIT(bs) - PPC_BIT(be)) | PPC_BIT(bs))
53
Nicholas Piggin7b9f71f92017-02-28 12:00:48 +100054/* Put a PPC bit into a "normal" bit position */
55#define PPC_BITEXTRACT(bits, ppc_bit, dst_bit) \
56 ((((bits) >> PPC_BITLSHIFT(ppc_bit)) & 1) << (dst_bit))
57
Benjamin Herrenschmidt22bd64a2017-04-05 17:54:47 +100058#define PPC_BITLSHIFT32(be) (32 - 1 - (be))
59#define PPC_BIT32(bit) (1UL << PPC_BITLSHIFT32(bit))
60#define PPC_BITMASK32(bs, be) ((PPC_BIT32(bs) - PPC_BIT32(be))|PPC_BIT32(bs))
61
62#define PPC_BITLSHIFT8(be) (8 - 1 - (be))
63#define PPC_BIT8(bit) (1UL << PPC_BITLSHIFT8(bit))
64#define PPC_BITMASK8(bs, be) ((PPC_BIT8(bs) - PPC_BIT8(be))|PPC_BIT8(bs))
65
Peter Zijlstrac6450732014-03-13 19:00:35 +010066#include <asm/barrier.h>
David Gibsona0e60b22005-11-01 17:28:10 +110067
Geoff Thorpe0d2d3e32009-07-07 15:23:56 +000068/* Macro for generating the ***_bits() functions */
Michael Ellerman576be132013-02-21 17:25:41 +000069#define DEFINE_BITOP(fn, op, prefix) \
Geoff Thorpe0d2d3e32009-07-07 15:23:56 +000070static __inline__ void fn(unsigned long mask, \
71 volatile unsigned long *_p) \
72{ \
73 unsigned long old; \
74 unsigned long *p = (unsigned long *)_p; \
75 __asm__ __volatile__ ( \
76 prefix \
Anton Blanchard864b9e62010-02-10 01:02:36 +000077"1:" PPC_LLARX(%0,0,%3,0) "\n" \
Geoff Thorpe0d2d3e32009-07-07 15:23:56 +000078 stringify_in_c(op) "%0,%0,%2\n" \
79 PPC405_ERR77(0,%3) \
80 PPC_STLCX "%0,0,%3\n" \
81 "bne- 1b\n" \
Geoff Thorpe0d2d3e32009-07-07 15:23:56 +000082 : "=&r" (old), "+m" (*p) \
83 : "r" (mask), "r" (p) \
84 : "cc", "memory"); \
85}
86
Michael Ellerman576be132013-02-21 17:25:41 +000087DEFINE_BITOP(set_bits, or, "")
88DEFINE_BITOP(clear_bits, andc, "")
89DEFINE_BITOP(clear_bits_unlock, andc, PPC_RELEASE_BARRIER)
90DEFINE_BITOP(change_bits, xor, "")
Geoff Thorpe0d2d3e32009-07-07 15:23:56 +000091
David Gibsona0e60b22005-11-01 17:28:10 +110092static __inline__ void set_bit(int nr, volatile unsigned long *addr)
93{
Akinobu Mita2237f4f2012-11-04 02:03:44 +000094 set_bits(BIT_MASK(nr), addr + BIT_WORD(nr));
David Gibsona0e60b22005-11-01 17:28:10 +110095}
96
97static __inline__ void clear_bit(int nr, volatile unsigned long *addr)
98{
Akinobu Mita2237f4f2012-11-04 02:03:44 +000099 clear_bits(BIT_MASK(nr), addr + BIT_WORD(nr));
David Gibsona0e60b22005-11-01 17:28:10 +1100100}
101
Nick Piggin66ffb042007-10-18 03:06:53 -0700102static __inline__ void clear_bit_unlock(int nr, volatile unsigned long *addr)
103{
Akinobu Mita2237f4f2012-11-04 02:03:44 +0000104 clear_bits_unlock(BIT_MASK(nr), addr + BIT_WORD(nr));
Nick Piggin66ffb042007-10-18 03:06:53 -0700105}
106
David Gibsona0e60b22005-11-01 17:28:10 +1100107static __inline__ void change_bit(int nr, volatile unsigned long *addr)
108{
Akinobu Mita2237f4f2012-11-04 02:03:44 +0000109 change_bits(BIT_MASK(nr), addr + BIT_WORD(nr));
David Gibsona0e60b22005-11-01 17:28:10 +1100110}
111
Geoff Thorpe0d2d3e32009-07-07 15:23:56 +0000112/* Like DEFINE_BITOP(), with changes to the arguments to 'op' and the output
113 * operands. */
Anton Blanchard864b9e62010-02-10 01:02:36 +0000114#define DEFINE_TESTOP(fn, op, prefix, postfix, eh) \
115static __inline__ unsigned long fn( \
116 unsigned long mask, \
117 volatile unsigned long *_p) \
118{ \
119 unsigned long old, t; \
120 unsigned long *p = (unsigned long *)_p; \
121 __asm__ __volatile__ ( \
122 prefix \
123"1:" PPC_LLARX(%0,0,%3,eh) "\n" \
124 stringify_in_c(op) "%1,%0,%2\n" \
125 PPC405_ERR77(0,%3) \
126 PPC_STLCX "%1,0,%3\n" \
127 "bne- 1b\n" \
128 postfix \
129 : "=&r" (old), "=&r" (t) \
130 : "r" (mask), "r" (p) \
131 : "cc", "memory"); \
132 return (old & mask); \
Geoff Thorpe0d2d3e32009-07-07 15:23:56 +0000133}
134
Benjamin Herrenschmidtb97021f2011-11-15 17:11:27 +0000135DEFINE_TESTOP(test_and_set_bits, or, PPC_ATOMIC_ENTRY_BARRIER,
136 PPC_ATOMIC_EXIT_BARRIER, 0)
Anton Blanchardf10e2e52010-02-10 01:04:06 +0000137DEFINE_TESTOP(test_and_set_bits_lock, or, "",
138 PPC_ACQUIRE_BARRIER, 1)
Benjamin Herrenschmidtb97021f2011-11-15 17:11:27 +0000139DEFINE_TESTOP(test_and_clear_bits, andc, PPC_ATOMIC_ENTRY_BARRIER,
140 PPC_ATOMIC_EXIT_BARRIER, 0)
141DEFINE_TESTOP(test_and_change_bits, xor, PPC_ATOMIC_ENTRY_BARRIER,
142 PPC_ATOMIC_EXIT_BARRIER, 0)
Geoff Thorpe0d2d3e32009-07-07 15:23:56 +0000143
David Gibsona0e60b22005-11-01 17:28:10 +1100144static __inline__ int test_and_set_bit(unsigned long nr,
145 volatile unsigned long *addr)
146{
Akinobu Mita2237f4f2012-11-04 02:03:44 +0000147 return test_and_set_bits(BIT_MASK(nr), addr + BIT_WORD(nr)) != 0;
David Gibsona0e60b22005-11-01 17:28:10 +1100148}
149
Nick Piggin66ffb042007-10-18 03:06:53 -0700150static __inline__ int test_and_set_bit_lock(unsigned long nr,
151 volatile unsigned long *addr)
152{
Akinobu Mita2237f4f2012-11-04 02:03:44 +0000153 return test_and_set_bits_lock(BIT_MASK(nr),
154 addr + BIT_WORD(nr)) != 0;
Nick Piggin66ffb042007-10-18 03:06:53 -0700155}
156
David Gibsona0e60b22005-11-01 17:28:10 +1100157static __inline__ int test_and_clear_bit(unsigned long nr,
158 volatile unsigned long *addr)
159{
Akinobu Mita2237f4f2012-11-04 02:03:44 +0000160 return test_and_clear_bits(BIT_MASK(nr), addr + BIT_WORD(nr)) != 0;
David Gibsona0e60b22005-11-01 17:28:10 +1100161}
162
163static __inline__ int test_and_change_bit(unsigned long nr,
164 volatile unsigned long *addr)
165{
Akinobu Mita2237f4f2012-11-04 02:03:44 +0000166 return test_and_change_bits(BIT_MASK(nr), addr + BIT_WORD(nr)) != 0;
David Gibsona0e60b22005-11-01 17:28:10 +1100167}
168
Nicholas Piggind11914b2017-01-04 04:58:28 +1000169#ifdef CONFIG_PPC64
170static __inline__ unsigned long clear_bit_unlock_return_word(int nr,
171 volatile unsigned long *addr)
172{
173 unsigned long old, t;
174 unsigned long *p = (unsigned long *)addr + BIT_WORD(nr);
175 unsigned long mask = BIT_MASK(nr);
176
177 __asm__ __volatile__ (
178 PPC_RELEASE_BARRIER
179"1:" PPC_LLARX(%0,0,%3,0) "\n"
180 "andc %1,%0,%2\n"
181 PPC405_ERR77(0,%3)
182 PPC_STLCX "%1,0,%3\n"
183 "bne- 1b\n"
184 : "=&r" (old), "=&r" (t)
185 : "r" (mask), "r" (p)
186 : "cc", "memory");
187
188 return old;
189}
190
191/* This is a special function for mm/filemap.c */
192#define clear_bit_unlock_is_negative_byte(nr, addr) \
193 (clear_bit_unlock_return_word(nr, addr) & BIT_MASK(PG_waiters))
194
195#endif /* CONFIG_PPC64 */
196
Akinobu Mitae779b2f2006-03-26 01:39:33 -0800197#include <asm-generic/bitops/non-atomic.h>
David Gibsona0e60b22005-11-01 17:28:10 +1100198
Nick Piggin66ffb042007-10-18 03:06:53 -0700199static __inline__ void __clear_bit_unlock(int nr, volatile unsigned long *addr)
200{
Anton Blanchardf10e2e52010-02-10 01:04:06 +0000201 __asm__ __volatile__(PPC_RELEASE_BARRIER "" ::: "memory");
Nick Piggin66ffb042007-10-18 03:06:53 -0700202 __clear_bit(nr, addr);
203}
204
David Gibsona0e60b22005-11-01 17:28:10 +1100205/*
206 * Return the zero-based bit position (LE, not IBM bit numbering) of
207 * the most significant 1-bit in a double word.
208 */
David Howellsef55d532006-12-08 02:37:53 -0800209static __inline__ __attribute__((const))
210int __ilog2(unsigned long x)
David Gibsona0e60b22005-11-01 17:28:10 +1100211{
212 int lz;
213
David Gibson3ddfbcf2005-11-10 12:56:55 +1100214 asm (PPC_CNTLZL "%0,%1" : "=r" (lz) : "r" (x));
David Gibsona0e60b22005-11-01 17:28:10 +1100215 return BITS_PER_LONG - 1 - lz;
216}
217
David Howellsef55d532006-12-08 02:37:53 -0800218static inline __attribute__((const))
219int __ilog2_u32(u32 n)
220{
221 int bit;
222 asm ("cntlzw %0,%1" : "=r" (bit) : "r" (n));
223 return 31 - bit;
224}
225
226#ifdef __powerpc64__
227static inline __attribute__((const))
David Howells02241692006-12-11 13:16:05 +0000228int __ilog2_u64(u64 n)
David Howellsef55d532006-12-08 02:37:53 -0800229{
230 int bit;
231 asm ("cntlzd %0,%1" : "=r" (bit) : "r" (n));
232 return 63 - bit;
233}
234#endif
235
David Gibsona0e60b22005-11-01 17:28:10 +1100236/*
237 * Determines the bit position of the least significant 0 bit in the
238 * specified double word. The returned bit position will be
239 * zero-based, starting from the right side (63/31 - 0).
240 */
241static __inline__ unsigned long ffz(unsigned long x)
242{
243 /* no zero exists anywhere in the 8 byte area. */
244 if ((x = ~x) == 0)
245 return BITS_PER_LONG;
246
247 /*
Lucas De Marchi25985ed2011-03-30 22:57:33 -0300248 * Calculate the bit position of the least significant '1' bit in x
249 * (since x has been changed this will actually be the least significant
David Gibsona0e60b22005-11-01 17:28:10 +1100250 * '0' bit in * the original x). Note: (x & -x) gives us a mask that
251 * is the least significant * (RIGHT-most) 1-bit of the value in x.
252 */
253 return __ilog2(x & -x);
254}
255
Christophe Leroyf83647d2017-04-21 13:18:46 +0200256#include <asm-generic/bitops/builtin-__ffs.h>
David Gibsona0e60b22005-11-01 17:28:10 +1100257
Christophe Leroyf83647d2017-04-21 13:18:46 +0200258#include <asm-generic/bitops/builtin-ffs.h>
David Gibsona0e60b22005-11-01 17:28:10 +1100259
260/*
261 * fls: find last (most-significant) bit set.
262 * Note fls(0) = 0, fls(1) = 1, fls(0x80000000) = 32.
263 */
264static __inline__ int fls(unsigned int x)
265{
266 int lz;
267
268 asm ("cntlzw %0,%1" : "=r" (lz) : "r" (x));
269 return 32 - lz;
270}
Paul Mackerras9f264be2008-04-18 14:26:08 +1000271
Alexander van Heukelum56a6b1e2008-03-15 18:31:49 +0100272static __inline__ unsigned long __fls(unsigned long x)
273{
274 return __ilog2(x);
275}
276
Paul Mackerras9f264be2008-04-18 14:26:08 +1000277/*
278 * 64-bit can do this using one cntlzd (count leading zeroes doubleword)
279 * instruction; for 32-bit we use the generic version, which does two
280 * 32-bit fls calls.
281 */
282#ifdef __powerpc64__
283static __inline__ int fls64(__u64 x)
284{
285 int lz;
286
287 asm ("cntlzd %0,%1" : "=r" (lz) : "r" (x));
288 return 64 - lz;
289}
290#else
Akinobu Mitae779b2f2006-03-26 01:39:33 -0800291#include <asm-generic/bitops/fls64.h>
Paul Mackerras9f264be2008-04-18 14:26:08 +1000292#endif /* __powerpc64__ */
293
Anton Blanchard64ff3122010-08-12 16:28:09 +0000294#ifdef CONFIG_PPC64
295unsigned int __arch_hweight8(unsigned int w);
296unsigned int __arch_hweight16(unsigned int w);
297unsigned int __arch_hweight32(unsigned int w);
298unsigned long __arch_hweight64(__u64 w);
299#include <asm-generic/bitops/const_hweight.h>
300#else
Akinobu Mitae779b2f2006-03-26 01:39:33 -0800301#include <asm-generic/bitops/hweight.h>
Anton Blanchard64ff3122010-08-12 16:28:09 +0000302#endif
303
Alexander van Heukelum47b9d9b2008-04-16 15:55:08 +0200304#include <asm-generic/bitops/find.h>
David Gibsona0e60b22005-11-01 17:28:10 +1100305
306/* Little-endian versions */
Akinobu Mita79597be2012-11-04 02:03:45 +0000307#include <asm-generic/bitops/le.h>
David Gibsona0e60b22005-11-01 17:28:10 +1100308
David Gibsona0e60b22005-11-01 17:28:10 +1100309/* Bitmap functions for the ext2 filesystem */
310
Akinobu Mita148817b2011-07-26 16:09:04 -0700311#include <asm-generic/bitops/ext2-atomic-setbit.h>
David Gibsona0e60b22005-11-01 17:28:10 +1100312
Akinobu Mitae779b2f2006-03-26 01:39:33 -0800313#include <asm-generic/bitops/sched.h>
David Gibsona0e60b22005-11-01 17:28:10 +1100314
315#endif /* __KERNEL__ */
316
317#endif /* _ASM_POWERPC_BITOPS_H */