x86_64: prepare shared lib/bitstr.c
authorThomas Gleixner <tglx@linutronix.de>
Thu, 11 Oct 2007 09:15:33 +0000 (11:15 +0200)
committerThomas Gleixner <tglx@linutronix.de>
Thu, 11 Oct 2007 09:15:33 +0000 (11:15 +0200)
Signed-off-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
arch/x86_64/lib/Makefile
arch/x86_64/lib/bitstr.c [deleted file]
arch/x86_64/lib/bitstr_64.c [new file with mode: 0644]

index c22087f66d5f5f055a4a0c910589e5a1be8b0ce5..30eede7e18fd552c91e6ec51f429f9a83d1aefe5 100644 (file)
@@ -9,5 +9,5 @@ obj-$(CONFIG_SMP)       += msr-on-cpu.o
 
 lib-y := csum-partial.o csum-copy.o csum-wrappers.o delay.o \
        usercopy.o getuser.o putuser.o  \
-       thunk_64.o clear_page.o copy_page_64.o bitstr.o bitops.o
+       thunk_64.o clear_page.o copy_page_64.o bitstr_64.o bitops.o
 lib-y += memcpy.o memmove.o memset.o copy_user.o rwlock.o copy_user_nocache.o
diff --git a/arch/x86_64/lib/bitstr.c b/arch/x86_64/lib/bitstr.c
deleted file mode 100644 (file)
index 2467660..0000000
+++ /dev/null
@@ -1,28 +0,0 @@
-#include <linux/module.h>
-#include <linux/bitops.h>
-
-/* Find string of zero bits in a bitmap */ 
-unsigned long 
-find_next_zero_string(unsigned long *bitmap, long start, long nbits, int len)
-{ 
-       unsigned long n, end, i;        
-
- again:
-       n = find_next_zero_bit(bitmap, nbits, start);
-       if (n == -1) 
-               return -1;
-       
-       /* could test bitsliced, but it's hardly worth it */
-       end = n+len;
-       if (end >= nbits) 
-               return -1; 
-       for (i = n+1; i < end; i++) { 
-               if (test_bit(i, bitmap)) {  
-                       start = i+1; 
-                       goto again; 
-               } 
-       }
-       return n;
-}
-
-EXPORT_SYMBOL(find_next_zero_string);
diff --git a/arch/x86_64/lib/bitstr_64.c b/arch/x86_64/lib/bitstr_64.c
new file mode 100644 (file)
index 0000000..2467660
--- /dev/null
@@ -0,0 +1,28 @@
+#include <linux/module.h>
+#include <linux/bitops.h>
+
+/* Find string of zero bits in a bitmap */ 
+unsigned long 
+find_next_zero_string(unsigned long *bitmap, long start, long nbits, int len)
+{ 
+       unsigned long n, end, i;        
+
+ again:
+       n = find_next_zero_bit(bitmap, nbits, start);
+       if (n == -1) 
+               return -1;
+       
+       /* could test bitsliced, but it's hardly worth it */
+       end = n+len;
+       if (end >= nbits) 
+               return -1; 
+       for (i = n+1; i < end; i++) { 
+               if (test_bit(i, bitmap)) {  
+                       start = i+1; 
+                       goto again; 
+               } 
+       }
+       return n;
+}
+
+EXPORT_SYMBOL(find_next_zero_string);