bitops.h 12.7 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14
/*
 * This file is subject to the terms and conditions of the GNU General Public
 * License.  See the file "COPYING" in the main directory of this archive
 * for more details.
 *
 * Copyright (c) 1994 - 1997, 1999, 2000  Ralf Baechle (ralf@gnu.org)
 * Copyright (c) 1999, 2000  Silicon Graphics, Inc.
 */
#ifndef _ASM_BITOPS_H
#define _ASM_BITOPS_H

#include <linux/config.h>
#include <linux/compiler.h>
#include <linux/types.h>
15
#include <asm/bug.h>
L
Linus Torvalds 已提交
16 17 18 19 20 21
#include <asm/byteorder.h>		/* sigh ... */
#include <asm/cpu-features.h>

#if (_MIPS_SZLONG == 32)
#define SZLONG_LOG 5
#define SZLONG_MASK 31UL
22 23
#define __LL		"ll	"
#define __SC		"sc	"
24
#define cpu_to_lelongp(x) cpu_to_le32p((__u32 *) (x))
L
Linus Torvalds 已提交
25 26 27
#elif (_MIPS_SZLONG == 64)
#define SZLONG_LOG 6
#define SZLONG_MASK 63UL
28 29
#define __LL		"lld	"
#define __SC		"scd	"
30
#define cpu_to_lelongp(x) cpu_to_le64p((__u64 *) (x))
L
Linus Torvalds 已提交
31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75
#endif

#ifdef __KERNEL__

#include <asm/interrupt.h>
#include <asm/sgidefs.h>
#include <asm/war.h>

/*
 * clear_bit() doesn't provide any barrier for the compiler.
 */
#define smp_mb__before_clear_bit()	smp_mb()
#define smp_mb__after_clear_bit()	smp_mb()

/*
 * Only disable interrupt for kernel mode stuff to keep usermode stuff
 * that dares to use kernel include files alive.
 */

#define __bi_flags			unsigned long flags
#define __bi_local_irq_save(x)		local_irq_save(x)
#define __bi_local_irq_restore(x)	local_irq_restore(x)
#else
#define __bi_flags
#define __bi_local_irq_save(x)
#define __bi_local_irq_restore(x)
#endif /* __KERNEL__ */

/*
 * set_bit - Atomically set a bit in memory
 * @nr: the bit to set
 * @addr: the address to start counting from
 *
 * This function is atomic and may not be reordered.  See __set_bit()
 * if you do not require the atomic guarantees.
 * Note that @nr may be almost arbitrarily large; this function is not
 * restricted to acting on a single-word quantity.
 */
static inline void set_bit(unsigned long nr, volatile unsigned long *addr)
{
	unsigned long *m = ((unsigned long *) addr) + (nr >> SZLONG_LOG);
	unsigned long temp;

	if (cpu_has_llsc && R10000_LLSC_WAR) {
		__asm__ __volatile__(
76
		"	.set	mips3					\n"
L
Linus Torvalds 已提交
77 78
		"1:	" __LL "%0, %1			# set_bit	\n"
		"	or	%0, %2					\n"
79
		"	" __SC	"%0, %1					\n"
L
Linus Torvalds 已提交
80
		"	beqzl	%0, 1b					\n"
81
		"	.set	mips0					\n"
L
Linus Torvalds 已提交
82 83 84 85
		: "=&r" (temp), "=m" (*m)
		: "ir" (1UL << (nr & SZLONG_MASK)), "m" (*m));
	} else if (cpu_has_llsc) {
		__asm__ __volatile__(
86
		"	.set	mips3					\n"
L
Linus Torvalds 已提交
87 88
		"1:	" __LL "%0, %1			# set_bit	\n"
		"	or	%0, %2					\n"
89
		"	" __SC	"%0, %1					\n"
L
Linus Torvalds 已提交
90
		"	beqz	%0, 1b					\n"
91
		"	.set	mips0					\n"
L
Linus Torvalds 已提交
92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123
		: "=&r" (temp), "=m" (*m)
		: "ir" (1UL << (nr & SZLONG_MASK)), "m" (*m));
	} else {
		volatile unsigned long *a = addr;
		unsigned long mask;
		__bi_flags;

		a += nr >> SZLONG_LOG;
		mask = 1UL << (nr & SZLONG_MASK);
		__bi_local_irq_save(flags);
		*a |= mask;
		__bi_local_irq_restore(flags);
	}
}

/*
 * clear_bit - Clears a bit in memory
 * @nr: Bit to clear
 * @addr: Address to start counting from
 *
 * clear_bit() is atomic and may not be reordered.  However, it does
 * not contain a memory barrier, so if it is used for locking purposes,
 * you should call smp_mb__before_clear_bit() and/or smp_mb__after_clear_bit()
 * in order to ensure changes are visible on other processors.
 */
static inline void clear_bit(unsigned long nr, volatile unsigned long *addr)
{
	unsigned long *m = ((unsigned long *) addr) + (nr >> SZLONG_LOG);
	unsigned long temp;

	if (cpu_has_llsc && R10000_LLSC_WAR) {
		__asm__ __volatile__(
124
		"	.set	mips3					\n"
L
Linus Torvalds 已提交
125 126 127 128
		"1:	" __LL "%0, %1			# clear_bit	\n"
		"	and	%0, %2					\n"
		"	" __SC "%0, %1					\n"
		"	beqzl	%0, 1b					\n"
129
		"	.set	mips0					\n"
L
Linus Torvalds 已提交
130 131 132 133
		: "=&r" (temp), "=m" (*m)
		: "ir" (~(1UL << (nr & SZLONG_MASK))), "m" (*m));
	} else if (cpu_has_llsc) {
		__asm__ __volatile__(
134
		"	.set	mips3					\n"
L
Linus Torvalds 已提交
135 136 137 138
		"1:	" __LL "%0, %1			# clear_bit	\n"
		"	and	%0, %2					\n"
		"	" __SC "%0, %1					\n"
		"	beqz	%0, 1b					\n"
139
		"	.set	mips0					\n"
L
Linus Torvalds 已提交
140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170
		: "=&r" (temp), "=m" (*m)
		: "ir" (~(1UL << (nr & SZLONG_MASK))), "m" (*m));
	} else {
		volatile unsigned long *a = addr;
		unsigned long mask;
		__bi_flags;

		a += nr >> SZLONG_LOG;
		mask = 1UL << (nr & SZLONG_MASK);
		__bi_local_irq_save(flags);
		*a &= ~mask;
		__bi_local_irq_restore(flags);
	}
}

/*
 * change_bit - Toggle a bit in memory
 * @nr: Bit to change
 * @addr: Address to start counting from
 *
 * change_bit() is atomic and may not be reordered.
 * Note that @nr may be almost arbitrarily large; this function is not
 * restricted to acting on a single-word quantity.
 */
static inline void change_bit(unsigned long nr, volatile unsigned long *addr)
{
	if (cpu_has_llsc && R10000_LLSC_WAR) {
		unsigned long *m = ((unsigned long *) addr) + (nr >> SZLONG_LOG);
		unsigned long temp;

		__asm__ __volatile__(
171
		"	.set	mips3				\n"
L
Linus Torvalds 已提交
172 173
		"1:	" __LL "%0, %1		# change_bit	\n"
		"	xor	%0, %2				\n"
174
		"	" __SC	"%0, %1				\n"
L
Linus Torvalds 已提交
175
		"	beqzl	%0, 1b				\n"
176
		"	.set	mips0				\n"
L
Linus Torvalds 已提交
177 178 179 180 181 182 183
		: "=&r" (temp), "=m" (*m)
		: "ir" (1UL << (nr & SZLONG_MASK)), "m" (*m));
	} else if (cpu_has_llsc) {
		unsigned long *m = ((unsigned long *) addr) + (nr >> SZLONG_LOG);
		unsigned long temp;

		__asm__ __volatile__(
184
		"	.set	mips3				\n"
L
Linus Torvalds 已提交
185 186
		"1:	" __LL "%0, %1		# change_bit	\n"
		"	xor	%0, %2				\n"
187
		"	" __SC	"%0, %1				\n"
L
Linus Torvalds 已提交
188
		"	beqz	%0, 1b				\n"
189
		"	.set	mips0				\n"
L
Linus Torvalds 已提交
190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220
		: "=&r" (temp), "=m" (*m)
		: "ir" (1UL << (nr & SZLONG_MASK)), "m" (*m));
	} else {
		volatile unsigned long *a = addr;
		unsigned long mask;
		__bi_flags;

		a += nr >> SZLONG_LOG;
		mask = 1UL << (nr & SZLONG_MASK);
		__bi_local_irq_save(flags);
		*a ^= mask;
		__bi_local_irq_restore(flags);
	}
}

/*
 * test_and_set_bit - Set a bit and return its old value
 * @nr: Bit to set
 * @addr: Address to count from
 *
 * This operation is atomic and cannot be reordered.
 * It also implies a memory barrier.
 */
static inline int test_and_set_bit(unsigned long nr,
	volatile unsigned long *addr)
{
	if (cpu_has_llsc && R10000_LLSC_WAR) {
		unsigned long *m = ((unsigned long *) addr) + (nr >> SZLONG_LOG);
		unsigned long temp, res;

		__asm__ __volatile__(
221
		"	.set	mips3					\n"
L
Linus Torvalds 已提交
222 223 224 225 226 227
		"1:	" __LL "%0, %1		# test_and_set_bit	\n"
		"	or	%2, %0, %3				\n"
		"	" __SC	"%2, %1					\n"
		"	beqzl	%2, 1b					\n"
		"	and	%2, %0, %3				\n"
#ifdef CONFIG_SMP
228
		"	sync						\n"
L
Linus Torvalds 已提交
229
#endif
230
		"	.set	mips0					\n"
L
Linus Torvalds 已提交
231 232 233 234 235 236 237 238 239 240
		: "=&r" (temp), "=m" (*m), "=&r" (res)
		: "r" (1UL << (nr & SZLONG_MASK)), "m" (*m)
		: "memory");

		return res != 0;
	} else if (cpu_has_llsc) {
		unsigned long *m = ((unsigned long *) addr) + (nr >> SZLONG_LOG);
		unsigned long temp, res;

		__asm__ __volatile__(
241 242
		"	.set	push					\n"
		"	.set	noreorder				\n"
243
		"	.set	mips3					\n"
244
		"1:	" __LL "%0, %1		# test_and_set_bit	\n"
L
Linus Torvalds 已提交
245 246 247 248 249
		"	or	%2, %0, %3				\n"
		"	" __SC	"%2, %1					\n"
		"	beqz	%2, 1b					\n"
		"	 and	%2, %0, %3				\n"
#ifdef CONFIG_SMP
250
		"	sync						\n"
L
Linus Torvalds 已提交
251
#endif
252
		"	.set	pop					\n"
L
Linus Torvalds 已提交
253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290
		: "=&r" (temp), "=m" (*m), "=&r" (res)
		: "r" (1UL << (nr & SZLONG_MASK)), "m" (*m)
		: "memory");

		return res != 0;
	} else {
		volatile unsigned long *a = addr;
		unsigned long mask;
		int retval;
		__bi_flags;

		a += nr >> SZLONG_LOG;
		mask = 1UL << (nr & SZLONG_MASK);
		__bi_local_irq_save(flags);
		retval = (mask & *a) != 0;
		*a |= mask;
		__bi_local_irq_restore(flags);

		return retval;
	}
}

/*
 * test_and_clear_bit - Clear a bit and return its old value
 * @nr: Bit to clear
 * @addr: Address to count from
 *
 * This operation is atomic and cannot be reordered.
 * It also implies a memory barrier.
 */
static inline int test_and_clear_bit(unsigned long nr,
	volatile unsigned long *addr)
{
	if (cpu_has_llsc && R10000_LLSC_WAR) {
		unsigned long *m = ((unsigned long *) addr) + (nr >> SZLONG_LOG);
		unsigned long temp, res;

		__asm__ __volatile__(
291
		"	.set	mips3					\n"
L
Linus Torvalds 已提交
292 293 294
		"1:	" __LL	"%0, %1		# test_and_clear_bit	\n"
		"	or	%2, %0, %3				\n"
		"	xor	%2, %3					\n"
295
		"	" __SC 	"%2, %1					\n"
L
Linus Torvalds 已提交
296 297 298 299 300
		"	beqzl	%2, 1b					\n"
		"	and	%2, %0, %3				\n"
#ifdef CONFIG_SMP
		"	sync						\n"
#endif
301
		"	.set	mips0					\n"
L
Linus Torvalds 已提交
302 303 304 305 306 307 308 309 310 311
		: "=&r" (temp), "=m" (*m), "=&r" (res)
		: "r" (1UL << (nr & SZLONG_MASK)), "m" (*m)
		: "memory");

		return res != 0;
	} else if (cpu_has_llsc) {
		unsigned long *m = ((unsigned long *) addr) + (nr >> SZLONG_LOG);
		unsigned long temp, res;

		__asm__ __volatile__(
312 313
		"	.set	push					\n"
		"	.set	noreorder				\n"
314
		"	.set	mips3					\n"
315
		"1:	" __LL	"%0, %1		# test_and_clear_bit	\n"
L
Linus Torvalds 已提交
316 317
		"	or	%2, %0, %3				\n"
		"	xor	%2, %3					\n"
318
		"	" __SC 	"%2, %1					\n"
L
Linus Torvalds 已提交
319 320 321 322 323
		"	beqz	%2, 1b					\n"
		"	 and	%2, %0, %3				\n"
#ifdef CONFIG_SMP
		"	sync						\n"
#endif
324
		"	.set	pop					\n"
L
Linus Torvalds 已提交
325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362
		: "=&r" (temp), "=m" (*m), "=&r" (res)
		: "r" (1UL << (nr & SZLONG_MASK)), "m" (*m)
		: "memory");

		return res != 0;
	} else {
		volatile unsigned long *a = addr;
		unsigned long mask;
		int retval;
		__bi_flags;

		a += nr >> SZLONG_LOG;
		mask = 1UL << (nr & SZLONG_MASK);
		__bi_local_irq_save(flags);
		retval = (mask & *a) != 0;
		*a &= ~mask;
		__bi_local_irq_restore(flags);

		return retval;
	}
}

/*
 * test_and_change_bit - Change a bit and return its old value
 * @nr: Bit to change
 * @addr: Address to count from
 *
 * This operation is atomic and cannot be reordered.
 * It also implies a memory barrier.
 */
static inline int test_and_change_bit(unsigned long nr,
	volatile unsigned long *addr)
{
	if (cpu_has_llsc && R10000_LLSC_WAR) {
		unsigned long *m = ((unsigned long *) addr) + (nr >> SZLONG_LOG);
		unsigned long temp, res;

		__asm__ __volatile__(
363
		"	.set	mips3					\n"
364
		"1:	" __LL	"%0, %1		# test_and_change_bit	\n"
L
Linus Torvalds 已提交
365
		"	xor	%2, %0, %3				\n"
366
		"	" __SC	"%2, %1					\n"
L
Linus Torvalds 已提交
367 368 369 370 371
		"	beqzl	%2, 1b					\n"
		"	and	%2, %0, %3				\n"
#ifdef CONFIG_SMP
		"	sync						\n"
#endif
372
		"	.set	mips0					\n"
L
Linus Torvalds 已提交
373 374 375 376 377 378 379 380 381 382
		: "=&r" (temp), "=m" (*m), "=&r" (res)
		: "r" (1UL << (nr & SZLONG_MASK)), "m" (*m)
		: "memory");

		return res != 0;
	} else if (cpu_has_llsc) {
		unsigned long *m = ((unsigned long *) addr) + (nr >> SZLONG_LOG);
		unsigned long temp, res;

		__asm__ __volatile__(
383 384
		"	.set	push					\n"
		"	.set	noreorder				\n"
385
		"	.set	mips3					\n"
386
		"1:	" __LL	"%0, %1		# test_and_change_bit	\n"
L
Linus Torvalds 已提交
387
		"	xor	%2, %0, %3				\n"
388
		"	" __SC	"\t%2, %1				\n"
L
Linus Torvalds 已提交
389 390 391 392 393
		"	beqz	%2, 1b					\n"
		"	 and	%2, %0, %3				\n"
#ifdef CONFIG_SMP
		"	sync						\n"
#endif
394
		"	.set	pop					\n"
L
Linus Torvalds 已提交
395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419
		: "=&r" (temp), "=m" (*m), "=&r" (res)
		: "r" (1UL << (nr & SZLONG_MASK)), "m" (*m)
		: "memory");

		return res != 0;
	} else {
		volatile unsigned long *a = addr;
		unsigned long mask, retval;
		__bi_flags;

		a += nr >> SZLONG_LOG;
		mask = 1UL << (nr & SZLONG_MASK);
		__bi_local_irq_save(flags);
		retval = (mask & *a) != 0;
		*a ^= mask;
		__bi_local_irq_restore(flags);

		return retval;
	}
}

#undef __bi_flags
#undef __bi_local_irq_save
#undef __bi_local_irq_restore

420
#include <asm-generic/bitops/non-atomic.h>
L
Linus Torvalds 已提交
421 422

/*
423
 * Return the bit position (0..63) of the most significant 1 bit in a word
424 425
 * Returns -1 if no 1 bit exists
 */
426
static inline int __ilog2(unsigned long x)
427 428 429
{
	int lz;

430 431 432 433 434 435 436 437
	if (sizeof(x) == 4) {
		__asm__ (
		"	.set	push					\n"
		"	.set	mips32					\n"
		"	clz	%0, %1					\n"
		"	.set	pop					\n"
		: "=r" (lz)
		: "r" (x));
438

439 440 441 442
		return 31 - lz;
	}

	BUG_ON(sizeof(x) != 8);
443 444 445 446 447 448 449 450 451 452 453 454

	__asm__ (
	"	.set	push						\n"
	"	.set	mips64						\n"
	"	dclz	%0, %1						\n"
	"	.set	pop						\n"
	: "=r" (lz)
	: "r" (x));

	return 63 - lz;
}

455 456
#if defined(CONFIG_CPU_MIPS32) || defined(CONFIG_CPU_MIPS64)

457 458
/*
 * __ffs - find first bit in word.
L
Linus Torvalds 已提交
459 460
 * @word: The word to search
 *
461 462
 * Returns 0..SZLONG-1
 * Undefined if no bit exists, so code should check against 0 first.
L
Linus Torvalds 已提交
463
 */
464
static inline unsigned long __ffs(unsigned long word)
L
Linus Torvalds 已提交
465
{
466
	return __ilog2(word & -word);
L
Linus Torvalds 已提交
467 468 469
}

/*
470
 * ffs - find first bit set.
L
Linus Torvalds 已提交
471 472
 * @word: The word to search
 *
473 474
 * Returns 1..SZLONG
 * Returns 0 if no bit exists
L
Linus Torvalds 已提交
475
 */
476 477

static inline unsigned long ffs(unsigned long word)
L
Linus Torvalds 已提交
478
{
479 480 481 482
	if (!word)
		return 0;

	return __ffs(word) + 1;
L
Linus Torvalds 已提交
483 484 485
}

/*
486 487 488 489
 * ffz - find first zero in word.
 * @word: The word to search
 *
 * Undefined if no zero exists, so code should check against ~0UL first.
L
Linus Torvalds 已提交
490
 */
491 492 493 494 495 496
static inline unsigned long ffz(unsigned long word)
{
	return __ffs (~word);
}

/*
497
 * fls - find last bit set.
498 499
 * @word: The word to search
 *
500 501
 * Returns 1..SZLONG
 * Returns 0 if no bit exists
502
 */
503
static inline unsigned long fls(unsigned long word)
504
{
505 506 507 508
#ifdef CONFIG_CPU_MIPS32
	__asm__ ("clz %0, %1" : "=r" (word) : "r" (word));

	return 32 - word;
509
#endif
510 511 512 513 514

#ifdef CONFIG_CPU_MIPS64
	__asm__ ("dclz %0, %1" : "=r" (word) : "r" (word));

	return 64 - word;
515 516 517
#endif
}

518
#else
L
Linus Torvalds 已提交
519

520 521 522 523
#include <asm-generic/bitops/__ffs.h>
#include <asm-generic/bitops/ffs.h>
#include <asm-generic/bitops/ffz.h>
#include <asm-generic/bitops/fls.h>
L
Linus Torvalds 已提交
524

525
#endif /*defined(CONFIG_CPU_MIPS32) || defined(CONFIG_CPU_MIPS64) */
L
Linus Torvalds 已提交
526

527 528
#include <asm-generic/bitops/fls64.h>
#include <asm-generic/bitops/find.h>
L
Linus Torvalds 已提交
529 530 531

#ifdef __KERNEL__

532 533 534 535 536
#include <asm-generic/bitops/sched.h>
#include <asm-generic/bitops/hweight.h>
#include <asm-generic/bitops/ext2-non-atomic.h>
#include <asm-generic/bitops/ext2-atomic.h>
#include <asm-generic/bitops/minix.h>
L
Linus Torvalds 已提交
537 538 539 540

#endif /* __KERNEL__ */

#endif /* _ASM_BITOPS_H */