logo
Free, unlimited AI code reviews that run on commit
git-lrc git-lrc GitHub Install Now We'd appreciate a star git-lrc - Free, unlimited AI code reviews that run on commit | Product Hunt git-lrc - Free, unlimited AI code reviews that run on commit | Product Hunt

This manual page is part of the POSIX Programmer's Manual. The Linux implementation of this interface

Application Usage

       None.

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).

Errors

       No errors are defined.

       Thefollowingsectionsareinformative.

Examples

       None.

Future Directions

       None.

Name

       ffs — find first set bit

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.

Rationale

       None.

Return Value

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

See Also

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

Synopsis

       #include <strings.h>

       int ffs(int i);

See Also