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

NAME

6       ffs - find first set bit
7

SYNOPSIS

9       #include <strings.h>
10
11       int ffs(int i);
12
13

DESCRIPTION

15       The  ffs()  function  shall  find the first bit set (beginning with the
16       least significant bit) in i, and return the index of that bit. Bits are
17       numbered starting at one (the least significant bit).
18

RETURN VALUE

20       The  ffs()  function shall return the index of the first bit set.  If i
21       is 0, then ffs() shall return 0.
22

ERRORS

24       No errors are defined.
25
26       The following sections are informative.
27

EXAMPLES

29       None.
30

APPLICATION USAGE

32       None.
33

RATIONALE

35       None.
36

FUTURE DIRECTIONS

38       None.
39

SEE ALSO

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

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