ffs(3p)

ffs3p

Find first set bit

Usage

#include <strings.h>

int ffs(int i);

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.

Overview

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.

From man-pages 6.19-1 in Arch Linux 2026-11-01. Parsed by carta from the page's man source.