Ticket #3281: ffs_posix_x86_opt.patch

src/system/libroot/posix/string/Jamfile

@@ -4 +4 @@
     bcmp.c
     bcopy.c
     bzero.c
-    ffs.cpp
     memccpy.c
     memchr.c
     memcmp.c

src/system/libroot/posix/string/arch/ppc/Jamfile

@@ -7 +7 @@
 MergeObject posix_string_arch_$(TARGET_ARCH).o :
     memcpy.c
     memset.c
+    ffs.c
 ;

src/system/libroot/posix/string/arch/m68k/Jamfile

@@ -7 +7 @@
 MergeObject posix_string_arch_$(TARGET_ARCH).o :
     arch_string.S
     memset.c
+    ffs.c
 ;

src/system/libroot/posix/string/arch/x86/arch_string.S

@@ -16 +16 @@
 FUNCTION(memset):
     jmp *(USER_COMMPAGE_ADDR + COMMPAGE_ENTRY_X86_MEMSET * 4)
 FUNCTION_END(memset)
+
+FUNCTION(ffs):
+    bsf     4(%esp), %eax
+    ret 
+FUNCTION_END(ffs)

src/system/libroot/posix/string/arch/generic/ffs.c

@@ +1 @@
+/*
+ * Copyright 2005, Ingo Weinhold, bonefish@users.sf.net.
+ * Distributed under the terms of the MIT License.
+ */
+
+#include <strings.h>
+
+// find first (least significant) set bit
+int
+ffs(int value)
+{
+    if (!value)
+        return 0;
+
+    // ToDo: This can certainly be optimized (e.g. by binary search). Or not
+    // unlikely there's a single assembler instruction...
+    for (int i = 1; i <= (int)sizeof(value) * 8; i++, value >>= 1) {
+        if (value & 1)
+            return i;
+    }
+
+    // never gets here
+    return 0;
+}

src/system/libroot/posix/string/ffs.cpp

@@ -1 @@
-/*
- * Copyright 2005, Ingo Weinhold, bonefish@users.sf.net.
- * Distributed under the terms of the MIT License.
- */
-
-#include <strings.h>
-
-// find first (least significant) set bit
-int
-ffs(int value)
-{
-    if (!value)
-        return 0;
-
-    // ToDo: This can certainly be optimized (e.g. by binary search). Or not
-    // unlikely there's a single assembler instruction...
-    for (int i = 1; i <= (int)sizeof(value) * 8; i++, value >>= 1) {
-        if (value & 1)
-            return i;
-    }
-
-    // never gets here
-    return 0;
-}