diff options
author | David Howells <dhowells@redhat.com> | 2005-01-04 05:14:46 -0800 |
---|---|---|
committer | Linus Torvalds <torvalds@ppc970.osdl.org> | 2005-01-04 05:14:46 -0800 |
commit | fc1d4be6b015e2c34847df3994d80f3eec44cc42 (patch) | |
tree | 20f310b831d27ecf30a1a83a8ed4b3f2c272b197 /lib | |
parent | cc07552d93c5faa2fcaae251e61532fdebfff13d (diff) | |
download | history-fc1d4be6b015e2c34847df3994d80f3eec44cc42.tar.gz |
[PATCH] out-of-line implementation of find_next_bit()
The attached patch provides an out-of-line implementation of find_next_bit()
and rearranges linux/bitops.h to avoid a dependency loop between inline
functions in there and in asm/bitops.h trying to include one another.
Signed-Off-By: David Howells <dhowells@redhat.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
Diffstat (limited to 'lib')
-rw-r--r-- | lib/Makefile | 1 | ||||
-rw-r--r-- | lib/find_next_bit.c | 55 |
2 files changed, 56 insertions, 0 deletions
diff --git a/lib/Makefile b/lib/Makefile index 6696c8ff22c6b3..aa25b683ea82ef 100644 --- a/lib/Makefile +++ b/lib/Makefile @@ -14,6 +14,7 @@ endif lib-$(CONFIG_RWSEM_GENERIC_SPINLOCK) += rwsem-spinlock.o lib-$(CONFIG_RWSEM_XCHGADD_ALGORITHM) += rwsem.o +lib-$(CONFIG_GENERIC_FIND_NEXT_BIT) += find_next_bit.o obj-$(CONFIG_LOCK_KERNEL) += kernel_lock.o ifneq ($(CONFIG_HAVE_DEC_LOCK),y) diff --git a/lib/find_next_bit.c b/lib/find_next_bit.c new file mode 100644 index 00000000000000..d08302d2a42cbe --- /dev/null +++ b/lib/find_next_bit.c @@ -0,0 +1,55 @@ +/* find_next_bit.c: fallback find next bit implementation + * + * Copyright (C) 2004 Red Hat, Inc. All Rights Reserved. + * Written by David Howells (dhowells@redhat.com) + * + * This program is free software; you can redistribute it and/or + * modify it under the terms of the GNU General Public License + * as published by the Free Software Foundation; either version + * 2 of the License, or (at your option) any later version. + */ + +#include <linux/bitops.h> + +int find_next_bit(const unsigned long *addr, int size, int offset) +{ + const unsigned long *base; + const int NBITS = sizeof(*addr) * 8; + unsigned long tmp; + + base = addr; + if (offset) { + int suboffset; + + addr += offset / NBITS; + + suboffset = offset % NBITS; + if (suboffset) { + tmp = *addr; + tmp >>= suboffset; + if (tmp) + goto finish; + } + + addr++; + } + + while ((tmp = *addr) == 0) + addr++; + + offset = (addr - base) * NBITS; + + finish: + /* count the remaining bits without using __ffs() since that takes a 32-bit arg */ + while (!(tmp & 0xff)) { + offset += 8; + tmp >>= 8; + } + + while (!(tmp & 1)) { + offset++; + tmp >>= 1; + } + + return offset; +} |