ffs (3p)

PROLOG

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

NAME

ffs — find first set bit

SYNOPSIS

#include <strings.h>
int ffs(int i);

DESCRIPTION

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

RETURN VALUE

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

ERRORS

No errors are defined.
The following sections are informative.

EXAMPLES

None.

APPLICATION USAGE

None.

RATIONALE

None.

FUTURE DIRECTIONS

None.

SEE ALSO

The Base Definitions volume of POSIX.1‐2008, <strings.h>

Information

Source
POSIX
OS/version
IEEE/The Open Group
Source updated
January 1, 2013
Page created
March 3, 2018
Page generated
March 4, 2018