.\" 2. Redistributions in binary form must reproduce the above copyright
.\" notice, this list of conditions and the following disclaimer in the
.\" documentation and/or other materials provided with the distribution.
-.\" 3. All advertising materials mentioning features or use of this software
-.\" must display the following acknowledgement:
-.\" This product includes software developed by the University of
-.\" California, Berkeley and its contributors.
.\" 4. 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.
.\" SUCH DAMAGE.
.\"
.\" @(#)ffs.3 8.2 (Berkeley) 4/19/94
-.\" $FreeBSD: src/lib/libc/string/ffs.3,v 1.9 2004/06/30 20:09:09 ru Exp $
+.\" $FreeBSD: src/lib/libc/string/ffs.3,v 1.13 2009/01/13 13:19:42 kib Exp $
.\"
-.Dd January 13, 2004
+.Dd October 26, 2008
.Dt FFS 3
.Os
.Sh NAME
.Fn ffs
and
.Fn ffsl
-functions find the first bit set in
+functions find the first bit set
+(beginning with the least significant bit)
+in
.Fa i
and return the index of that bit.
.Pp
.Fa i
and return the index of that bit.
.Pp
-Bits are numbered starting from 1, starting at the right-most
-(least significant) bit.
+Bits are numbered starting at 1 (the least significant bit).
A return value of zero from any of these functions means that the
argument was zero.
.Sh SEE ALSO