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
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).
29 set_bit(unsigned long nr
, volatile void * addr
)
32 int *m
= ((int *) addr
) + (nr
>> 5);
42 :"=&r" (temp
), "=m" (*m
)
43 :"Ir" (1UL << (nr
& 31)), "m" (*m
));
47 * WARNING: non atomic version.
50 __set_bit(unsigned long nr
, volatile void * addr
)
52 int *m
= ((int *) addr
) + (nr
>> 5);
58 clear_bit(unsigned long nr
, volatile void * addr
)
61 int *m
= ((int *) addr
) + (nr
>> 5);
71 :"=&r" (temp
), "=m" (*m
)
72 :"Ir" (1UL << (nr
& 31)), "m" (*m
));
76 clear_bit_unlock(unsigned long nr
, volatile void * 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));
94 __clear_bit_unlock(unsigned long nr
, volatile void * addr
)
97 __clear_bit(nr
, addr
);
101 change_bit(unsigned long nr
, volatile void * addr
)
104 int *m
= ((int *) addr
) + (nr
>> 5);
106 __asm__
__volatile__(
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);
130 test_and_set_bit(unsigned long nr
, volatile void *addr
)
132 unsigned long oldbit
;
134 int *m
= ((int *) addr
) + (nr
>> 5);
136 __asm__
__volatile__(
153 :"=&r" (temp
), "=m" (*m
), "=&r" (oldbit
)
154 :"Ir" (1UL << (nr
& 31)), "m" (*m
) : "memory");
160 test_and_set_bit_lock(unsigned long nr
, volatile void *addr
)
162 unsigned long oldbit
;
164 int *m
= ((int *) addr
) + (nr
>> 5);
166 __asm__
__volatile__(
180 :"=&r" (temp
), "=m" (*m
), "=&r" (oldbit
)
181 :"Ir" (1UL << (nr
& 31)), "m" (*m
) : "memory");
187 * WARNING: non atomic version.
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);
197 return (old
& mask
) != 0;
201 test_and_clear_bit(unsigned long nr
, volatile void * addr
)
203 unsigned long oldbit
;
205 int *m
= ((int *) addr
) + (nr
>> 5);
207 __asm__
__volatile__(
224 :"=&r" (temp
), "=m" (*m
), "=&r" (oldbit
)
225 :"Ir" (1UL << (nr
& 31)), "m" (*m
) : "memory");
231 * WARNING: non atomic version.
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);
241 return (old
& mask
) != 0;
245 test_and_change_bit(unsigned long nr
, volatile void * addr
)
247 unsigned long oldbit
;
249 int *m
= ((int *) addr
) + (nr
>> 5);
251 __asm__
__volatile__(
266 :"=&r" (temp
), "=m" (*m
), "=&r" (oldbit
)
267 :"Ir" (1UL << (nr
& 31)), "m" (*m
) : "memory");
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);
283 return (old
& mask
) != 0;
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 */
308 sum
+= (x4
!= 0) * 4;
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
);
320 unsigned long bits
, qofs
, bofs
;
322 bits
= __kernel_cmpbge(word
, ~0UL);
324 bits
= __kernel_extbl(word
, qofs
);
327 return qofs
*8 + bofs
;
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
);
340 unsigned long bits
, qofs
, bofs
;
342 bits
= __kernel_cmpbge(0, word
);
344 bits
= __kernel_extbl(word
, qofs
);
347 return qofs
*8 + bofs
;
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
);
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
);
382 t
= __kernel_extbl (x
, a
);
383 r
= a
*8 + __flsm1_tab
[t
] + (x
!= 0);
389 static inline unsigned long __fls(unsigned long x
)
394 static inline int fls(unsigned int 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);
426 #include <asm-generic/bitops/arch_hweight.h>
429 #include <asm-generic/bitops/const_hweight.h>
431 #endif /* __KERNEL__ */
433 #include <asm-generic/bitops/find.h>
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
;
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 */