Linux 5.7.6
[linux/fpc-iii.git] / arch / alpha / include / asm / bitops.h
blob5adca78830b5e9a3349e5fb410188b0eb98e3bd3
1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _ALPHA_BITOPS_H
3 #define _ALPHA_BITOPS_H
5 #ifndef _LINUX_BITOPS_H
6 #error only <linux/bitops.h> can be included directly
7 #endif
9 #include <asm/compiler.h>
10 #include <asm/barrier.h>
13 * Copyright 1994, Linus Torvalds.
17 * These have to be done with inline assembly: that way the bit-setting
18 * is guaranteed to be atomic. All bit operations return 0 if the bit
19 * was cleared before the operation and != 0 if it was not.
21 * To get proper branch prediction for the main line, we must branch
22 * forward to code at the end of this object's .text section, then
23 * branch back to restart the operation.
25 * bit 0 is the LSB of addr; bit 64 is the LSB of (addr+1).
28 static inline void
29 set_bit(unsigned long nr, volatile void * addr)
31 unsigned long temp;
32 int *m = ((int *) addr) + (nr >> 5);
34 __asm__ __volatile__(
35 "1: ldl_l %0,%3\n"
36 " bis %0,%2,%0\n"
37 " stl_c %0,%1\n"
38 " beq %0,2f\n"
39 ".subsection 2\n"
40 "2: br 1b\n"
41 ".previous"
42 :"=&r" (temp), "=m" (*m)
43 :"Ir" (1UL << (nr & 31)), "m" (*m));
47 * WARNING: non atomic version.
49 static inline void
50 __set_bit(unsigned long nr, volatile void * addr)
52 int *m = ((int *) addr) + (nr >> 5);
54 *m |= 1 << (nr & 31);
57 static inline void
58 clear_bit(unsigned long nr, volatile void * addr)
60 unsigned long temp;
61 int *m = ((int *) addr) + (nr >> 5);
63 __asm__ __volatile__(
64 "1: ldl_l %0,%3\n"
65 " bic %0,%2,%0\n"
66 " stl_c %0,%1\n"
67 " beq %0,2f\n"
68 ".subsection 2\n"
69 "2: br 1b\n"
70 ".previous"
71 :"=&r" (temp), "=m" (*m)
72 :"Ir" (1UL << (nr & 31)), "m" (*m));
75 static inline void
76 clear_bit_unlock(unsigned long nr, volatile void * addr)
78 smp_mb();
79 clear_bit(nr, addr);
83 * WARNING: non atomic version.
85 static __inline__ void
86 __clear_bit(unsigned long nr, volatile void * addr)
88 int *m = ((int *) addr) + (nr >> 5);
90 *m &= ~(1 << (nr & 31));
93 static inline void
94 __clear_bit_unlock(unsigned long nr, volatile void * addr)
96 smp_mb();
97 __clear_bit(nr, addr);
100 static inline void
101 change_bit(unsigned long nr, volatile void * addr)
103 unsigned long temp;
104 int *m = ((int *) addr) + (nr >> 5);
106 __asm__ __volatile__(
107 "1: ldl_l %0,%3\n"
108 " xor %0,%2,%0\n"
109 " stl_c %0,%1\n"
110 " beq %0,2f\n"
111 ".subsection 2\n"
112 "2: br 1b\n"
113 ".previous"
114 :"=&r" (temp), "=m" (*m)
115 :"Ir" (1UL << (nr & 31)), "m" (*m));
119 * WARNING: non atomic version.
121 static __inline__ void
122 __change_bit(unsigned long nr, volatile void * addr)
124 int *m = ((int *) addr) + (nr >> 5);
126 *m ^= 1 << (nr & 31);
129 static inline int
130 test_and_set_bit(unsigned long nr, volatile void *addr)
132 unsigned long oldbit;
133 unsigned long temp;
134 int *m = ((int *) addr) + (nr >> 5);
136 __asm__ __volatile__(
137 #ifdef CONFIG_SMP
138 " mb\n"
139 #endif
140 "1: ldl_l %0,%4\n"
141 " and %0,%3,%2\n"
142 " bne %2,2f\n"
143 " xor %0,%3,%0\n"
144 " stl_c %0,%1\n"
145 " beq %0,3f\n"
146 "2:\n"
147 #ifdef CONFIG_SMP
148 " mb\n"
149 #endif
150 ".subsection 2\n"
151 "3: br 1b\n"
152 ".previous"
153 :"=&r" (temp), "=m" (*m), "=&r" (oldbit)
154 :"Ir" (1UL << (nr & 31)), "m" (*m) : "memory");
156 return oldbit != 0;
159 static inline int
160 test_and_set_bit_lock(unsigned long nr, volatile void *addr)
162 unsigned long oldbit;
163 unsigned long temp;
164 int *m = ((int *) addr) + (nr >> 5);
166 __asm__ __volatile__(
167 "1: ldl_l %0,%4\n"
168 " and %0,%3,%2\n"
169 " bne %2,2f\n"
170 " xor %0,%3,%0\n"
171 " stl_c %0,%1\n"
172 " beq %0,3f\n"
173 "2:\n"
174 #ifdef CONFIG_SMP
175 " mb\n"
176 #endif
177 ".subsection 2\n"
178 "3: br 1b\n"
179 ".previous"
180 :"=&r" (temp), "=m" (*m), "=&r" (oldbit)
181 :"Ir" (1UL << (nr & 31)), "m" (*m) : "memory");
183 return oldbit != 0;
187 * WARNING: non atomic version.
189 static inline int
190 __test_and_set_bit(unsigned long nr, volatile void * addr)
192 unsigned long mask = 1 << (nr & 0x1f);
193 int *m = ((int *) addr) + (nr >> 5);
194 int old = *m;
196 *m = old | mask;
197 return (old & mask) != 0;
200 static inline int
201 test_and_clear_bit(unsigned long nr, volatile void * addr)
203 unsigned long oldbit;
204 unsigned long temp;
205 int *m = ((int *) addr) + (nr >> 5);
207 __asm__ __volatile__(
208 #ifdef CONFIG_SMP
209 " mb\n"
210 #endif
211 "1: ldl_l %0,%4\n"
212 " and %0,%3,%2\n"
213 " beq %2,2f\n"
214 " xor %0,%3,%0\n"
215 " stl_c %0,%1\n"
216 " beq %0,3f\n"
217 "2:\n"
218 #ifdef CONFIG_SMP
219 " mb\n"
220 #endif
221 ".subsection 2\n"
222 "3: br 1b\n"
223 ".previous"
224 :"=&r" (temp), "=m" (*m), "=&r" (oldbit)
225 :"Ir" (1UL << (nr & 31)), "m" (*m) : "memory");
227 return oldbit != 0;
231 * WARNING: non atomic version.
233 static inline int
234 __test_and_clear_bit(unsigned long nr, volatile void * addr)
236 unsigned long mask = 1 << (nr & 0x1f);
237 int *m = ((int *) addr) + (nr >> 5);
238 int old = *m;
240 *m = old & ~mask;
241 return (old & mask) != 0;
244 static inline int
245 test_and_change_bit(unsigned long nr, volatile void * addr)
247 unsigned long oldbit;
248 unsigned long temp;
249 int *m = ((int *) addr) + (nr >> 5);
251 __asm__ __volatile__(
252 #ifdef CONFIG_SMP
253 " mb\n"
254 #endif
255 "1: ldl_l %0,%4\n"
256 " and %0,%3,%2\n"
257 " xor %0,%3,%0\n"
258 " stl_c %0,%1\n"
259 " beq %0,3f\n"
260 #ifdef CONFIG_SMP
261 " mb\n"
262 #endif
263 ".subsection 2\n"
264 "3: br 1b\n"
265 ".previous"
266 :"=&r" (temp), "=m" (*m), "=&r" (oldbit)
267 :"Ir" (1UL << (nr & 31)), "m" (*m) : "memory");
269 return oldbit != 0;
273 * WARNING: non atomic version.
275 static __inline__ int
276 __test_and_change_bit(unsigned long nr, volatile void * addr)
278 unsigned long mask = 1 << (nr & 0x1f);
279 int *m = ((int *) addr) + (nr >> 5);
280 int old = *m;
282 *m = old ^ mask;
283 return (old & mask) != 0;
286 static inline int
287 test_bit(int nr, const volatile void * addr)
289 return (1UL & (((const int *) addr)[nr >> 5] >> (nr & 31))) != 0UL;
293 * ffz = Find First Zero in word. Undefined if no zero exists,
294 * so code should check against ~0UL first..
296 * Do a binary search on the bits. Due to the nature of large
297 * constants on the alpha, it is worthwhile to split the search.
299 static inline unsigned long ffz_b(unsigned long x)
301 unsigned long sum, x1, x2, x4;
303 x = ~x & -~x; /* set first 0 bit, clear others */
304 x1 = x & 0xAA;
305 x2 = x & 0xCC;
306 x4 = x & 0xF0;
307 sum = x2 ? 2 : 0;
308 sum += (x4 != 0) * 4;
309 sum += (x1 != 0);
311 return sum;
314 static inline unsigned long ffz(unsigned long word)
316 #if defined(CONFIG_ALPHA_EV6) && defined(CONFIG_ALPHA_EV67)
317 /* Whee. EV67 can calculate it directly. */
318 return __kernel_cttz(~word);
319 #else
320 unsigned long bits, qofs, bofs;
322 bits = __kernel_cmpbge(word, ~0UL);
323 qofs = ffz_b(bits);
324 bits = __kernel_extbl(word, qofs);
325 bofs = ffz_b(bits);
327 return qofs*8 + bofs;
328 #endif
332 * __ffs = Find First set bit in word. Undefined if no set bit exists.
334 static inline unsigned long __ffs(unsigned long word)
336 #if defined(CONFIG_ALPHA_EV6) && defined(CONFIG_ALPHA_EV67)
337 /* Whee. EV67 can calculate it directly. */
338 return __kernel_cttz(word);
339 #else
340 unsigned long bits, qofs, bofs;
342 bits = __kernel_cmpbge(0, word);
343 qofs = ffz_b(bits);
344 bits = __kernel_extbl(word, qofs);
345 bofs = ffz_b(~bits);
347 return qofs*8 + bofs;
348 #endif
351 #ifdef __KERNEL__
354 * ffs: find first bit set. This is defined the same way as
355 * the libc and compiler builtin ffs routines, therefore
356 * differs in spirit from the above __ffs.
359 static inline int ffs(int word)
361 int result = __ffs(word) + 1;
362 return word ? result : 0;
366 * fls: find last bit set.
368 #if defined(CONFIG_ALPHA_EV6) && defined(CONFIG_ALPHA_EV67)
369 static inline int fls64(unsigned long word)
371 return 64 - __kernel_ctlz(word);
373 #else
374 extern const unsigned char __flsm1_tab[256];
376 static inline int fls64(unsigned long x)
378 unsigned long t, a, r;
380 t = __kernel_cmpbge (x, 0x0101010101010101UL);
381 a = __flsm1_tab[t];
382 t = __kernel_extbl (x, a);
383 r = a*8 + __flsm1_tab[t] + (x != 0);
385 return r;
387 #endif
389 static inline unsigned long __fls(unsigned long x)
391 return fls64(x) - 1;
394 static inline int fls(unsigned int x)
396 return fls64(x);
400 * hweightN: returns the hamming weight (i.e. the number
401 * of bits set) of a N-bit word
404 #if defined(CONFIG_ALPHA_EV6) && defined(CONFIG_ALPHA_EV67)
405 /* Whee. EV67 can calculate it directly. */
406 static inline unsigned long __arch_hweight64(unsigned long w)
408 return __kernel_ctpop(w);
411 static inline unsigned int __arch_hweight32(unsigned int w)
413 return __arch_hweight64(w);
416 static inline unsigned int __arch_hweight16(unsigned int w)
418 return __arch_hweight64(w & 0xffff);
421 static inline unsigned int __arch_hweight8(unsigned int w)
423 return __arch_hweight64(w & 0xff);
425 #else
426 #include <asm-generic/bitops/arch_hweight.h>
427 #endif
429 #include <asm-generic/bitops/const_hweight.h>
431 #endif /* __KERNEL__ */
433 #include <asm-generic/bitops/find.h>
435 #ifdef __KERNEL__
438 * Every architecture must define this function. It's the fastest
439 * way of searching a 100-bit bitmap. It's guaranteed that at least
440 * one of the 100 bits is cleared.
442 static inline unsigned long
443 sched_find_first_bit(const unsigned long b[2])
445 unsigned long b0, b1, ofs, tmp;
447 b0 = b[0];
448 b1 = b[1];
449 ofs = (b0 ? 0 : 64);
450 tmp = (b0 ? b0 : b1);
452 return __ffs(tmp) + ofs;
455 #include <asm-generic/bitops/le.h>
457 #include <asm-generic/bitops/ext2-atomic-setbit.h>
459 #endif /* __KERNEL__ */
461 #endif /* _ALPHA_BITOPS_H */