Searched refs:ffs (Results 1 - 6 of 6) sorted by relevance

/bionic/libc/arch-x86/string/
H A Dfss.S1 /* $OpenBSD: ffs.S,v 1.3 2005/08/07 11:30:38 espie Exp $ */
9 ENTRY(ffs) function
/bionic/libc/include/
H A Dstrings.h49 int ffs(int);
/bionic/libc/arch-sh/bionic/
H A Dffs.S1 /* $NetBSD: ffs.S,v 1.1 2005/12/20 19:28:50 christos Exp $ */
42 RCSID("$NetBSD: ffs.S,v 1.1 2005/12/20 19:28:50 christos Exp $")
46 * ffs - find first bit set
52 ENTRY(ffs) function
58 tst r0,r0 ! ffs(0) is 0
/bionic/libc/arch-arm/bionic/
H A Dffs.S1 /* $NetBSD: ffs.S,v 1.5 2003/04/05 23:08:52 bjh21 Exp $ */
34 * ffs - find first set bit, this algorithm isolates the first set
42 * This is the ffs algorithm devised by d.seal and posted to comp.sys.arm on
46 ENTRY(ffs) function
/bionic/libc/
H A DAndroid.mk346 arch-arm/bionic/ffs.S \
438 arch-sh/bionic/ffs.S \
/bionic/libc/bionic/
H A Ddlmalloc.c364 Causes malloc to use the builtin ffs() function to compute indices.
365 Some compilers may recognize and intrinsify ffs to be faster than the
1285 #include <strings.h> /* for ffs */
2398 #define compute_bit2idx(X, I) I = ffs(X)-1

Completed in 208 milliseconds