|
ffs, ffsl, ffsll — find first bit set in a word
#include <strings.h>
int
ffs( |
int i) ; |
#include <string.h>
int
ffsl( |
long int i) ; |
int
ffsll( |
long long int i) ; |
Note | ||||||||
---|---|---|---|---|---|---|---|---|
|
The ffs
() function returns
the position of the first (least significant) bit set in the
word i
. The least
significant bit is position 1 and the most significant
position is, for example, 32 or 64. The functions
ffsll
() and ffsl
() do the same but take arguments of
possibly different size.
These functions return the position of the first bit set,
or 0 if no bits are set in i
.
This page is part of release 3.52 of the Linux man-pages
project. A
description of the project, and information about reporting
bugs, can be found at
http://www.kernel.org/doc/man−pages/.
Copyright 1993 David Metcalfe (davidprism.demon.co.uk) %%%LICENSE_START(VERBATIM) Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Since the Linux kernel and libraries are constantly changing, this manual page may be incorrect or out-of-date. The author(s) assume no responsibility for errors or omissions, or for damages resulting from the use of the information contained herein. The author(s) may not have taken the same level of care in the production of this manual, which is licensed free of charge, as they might when working professionally. Formatted or processed versions of this manual, if unaccompanied by the source, must acknowledge the copyright and authors of this work. %%%LICENSE_END References consulted: Linux libc source code Lewine's _POSIX Programmer's Guide_ (O'Reilly & Associates, 1991) 386BSD man pages Modified Sat Jul 24 19:39:35 1993 by Rik Faith (faithcs.unc.edu) Modified 2003 Walter Harms (walter.harmsinformatik.uni-oldenburg.de) |