1FFS(3P)                    POSIX Programmer's Manual                   FFS(3P)
2
3
4

PROLOG

6       This  manual  page is part of the POSIX Programmer's Manual.  The Linux
7       implementation of this interface may differ (consult the  corresponding
8       Linux  manual page for details of Linux behavior), or the interface may
9       not be implemented on Linux.
10

NAME

12       ffs - find first set bit
13

SYNOPSIS

15       #include <strings.h>
16
17       int ffs(int i);
18
19

DESCRIPTION

21       The ffs() function shall find the first bit  set  (beginning  with  the
22       least significant bit) in i, and return the index of that bit. Bits are
23       numbered starting at one (the least significant bit).
24

RETURN VALUE

26       The ffs() function shall return the index of the first bit set.   If  i
27       is 0, then ffs() shall return 0.
28

ERRORS

30       No errors are defined.
31
32       The following sections are informative.
33

EXAMPLES

35       None.
36

APPLICATION USAGE

38       None.
39

RATIONALE

41       None.
42

FUTURE DIRECTIONS

44       None.
45

SEE ALSO

47       The Base Definitions volume of IEEE Std 1003.1-2001, <strings.h>
48

50       Portions  of  this text are reprinted and reproduced in electronic form
51       from IEEE Std 1003.1, 2003 Edition, Standard for Information Technology
52       --  Portable  Operating  System  Interface (POSIX), The Open Group Base
53       Specifications Issue 6, Copyright (C) 2001-2003  by  the  Institute  of
54       Electrical  and  Electronics  Engineers, Inc and The Open Group. In the
55       event of any discrepancy between this version and the original IEEE and
56       The  Open Group Standard, the original IEEE and The Open Group Standard
57       is the referee document. The original Standard can be  obtained  online
58       at http://www.opengroup.org/unix/online.html .
59
60
61
62IEEE/The Open Group                  2003                              FFS(3P)
Impressum