HomeSort by relevance Sort by last modified time
    Searched defs:ffs (Results 1 - 9 of 9) sorted by null

  /bionic/libc/arch-arm/bionic/
ffs.S 1 /* $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/arch-x86/string/
fss.S 1 /* $OpenBSD: ffs.S,v 1.3 2005/08/07 11:30:38 espie Exp $ */
9 ENTRY(ffs) function
  /bionic/libc/arch-sh/bionic/
ffs.S 1 /* $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
  /external/libpcap/
ffs.h 8 inline int ffs(int x) function
optimize.c 53 #define ffs _w32_ffs macro
1363 #include "ffs.h"
1396 k = ffs(x) - 1;
    [all...]
  /external/qemu/
osdep.c 297 int ffs(int val) function
monitor.c 2761 DIR *ffs; local
    [all...]
  /external/kernel-headers/original/asm-x86/
bitops_32.h 418 * ffs - find first bit set
422 * the libc and compiler builtin ffs routines, therefore
423 * differs in spirit from the above ffz() (man ffs).
425 static inline int ffs(int x) function
440 * This is defined the same way as ffs().
  /external/kernel-headers/original/asm-arm/
bitops.h 238 #include <asm-generic/bitops/ffs.h>
279 #define ffs(x) ({ unsigned long __t = (x); fls(__t & -__t); }) macro
280 #define __ffs(x) (ffs(x) - 1)

Completed in 237 milliseconds