4.3BSD-Reno/src/lib/libc/string/ffs.3

Compare this file to the similar file:
Show the results in this format:
.\" Copyright (c) 1990 The Regents of the University of California.
.\" All rights reserved.
.\"
.\" This code is derived from software contributed to Berkeley by
.\" Chris Torek.
.\"
.\" Redistribution and use in source and binary forms are permitted
.\" provided that: (1) source distributions retain this entire copyright
.\" notice and comment, and (2) distributions including binaries display
.\" the following acknowledgement:  ``This product includes software
.\" developed by the University of California, Berkeley and its contributors''
.\" in the documentation or other materials provided with the distribution
.\" and in all advertising materials mentioning features or use of this
.\" software. Neither the name of the University nor the names of its
.\" contributors may be used to endorse or promote products derived
.\" from this software without specific prior written permission.
.\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
.\" IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
.\" WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
.\"
.\"	@(#)ffs.3	5.1 (Berkeley) 5/15/90
.\"
.TH FFS 3  "May 15, 1990"
.UC 7
.SH NAME
ffs \- find first bit set in a bit string
.SH SYNOPSIS
.nf
.ft B
#include <string.h>

int
ffs(int value);
.ft R
.fi
.SH DESCRIPTION
.B Ffs
finds the first bit set in
.I value
and returns the index of that bit.
Bits are numbered starting from 1, starting at the right-most
bit.
A return value of 0 means that the argument was zero.
.SH SEE\ ALSO
bitstring(3)