aboutsummaryrefslogtreecommitdiffstats
path: root/arch/x86_64/lib/bitstr.c
diff options
context:
space:
mode:
authorThomas Gleixner <tglx@linutronix.de>2007-10-11 05:15:33 -0400
committerThomas Gleixner <tglx@linutronix.de>2007-10-11 05:15:33 -0400
commit3b405f4ed4df8f9c9ff765c9e81996ba46e79844 (patch)
tree664fa033e164412349097c3ccb18db2df7ac1d81 /arch/x86_64/lib/bitstr.c
parent7d96027379c0f43f7169019c814cadca7487d507 (diff)
x86_64: prepare shared lib/bitstr.c
Signed-off-by: Thomas Gleixner <tglx@linutronix.de> Signed-off-by: Ingo Molnar <mingo@elte.hu>
Diffstat (limited to 'arch/x86_64/lib/bitstr.c')
-rw-r--r--arch/x86_64/lib/bitstr.c28
1 files changed, 0 insertions, 28 deletions
diff --git a/arch/x86_64/lib/bitstr.c b/arch/x86_64/lib/bitstr.c
deleted file mode 100644
index 24676609a6ac..000000000000
--- a/arch/x86_64/lib/bitstr.c
+++ /dev/null
@@ -1,28 +0,0 @@
1#include <linux/module.h>
2#include <linux/bitops.h>
3
4/* Find string of zero bits in a bitmap */
5unsigned long
6find_next_zero_string(unsigned long *bitmap, long start, long nbits, int len)
7{
8 unsigned long n, end, i;
9
10 again:
11 n = find_next_zero_bit(bitmap, nbits, start);
12 if (n == -1)
13 return -1;
14
15 /* could test bitsliced, but it's hardly worth it */
16 end = n+len;
17 if (end >= nbits)
18 return -1;
19 for (i = n+1; i < end; i++) {
20 if (test_bit(i, bitmap)) {
21 start = i+1;
22 goto again;
23 }
24 }
25 return n;
26}
27
28EXPORT_SYMBOL(find_next_zero_string);