Annotated edit history of
ffs(3) version 1, including all changes.
View license author blame.
Rev |
Author |
# |
Line |
1 |
perry |
1 |
FFS |
|
|
2 |
!!!FFS |
|
|
3 |
NAME |
|
|
4 |
SYNOPSIS |
|
|
5 |
DESCRIPTION |
|
|
6 |
RETURN VALUE |
|
|
7 |
CONFORMING TO |
|
|
8 |
---- |
|
|
9 |
!!NAME |
|
|
10 |
|
|
|
11 |
|
|
|
12 |
ffs - find first bit set in a word |
|
|
13 |
!!SYNOPSIS |
|
|
14 |
|
|
|
15 |
|
|
|
16 |
__#include |
|
|
17 |
__ ''i''__); |
|
|
18 |
__ |
|
|
19 |
!!DESCRIPTION |
|
|
20 |
|
|
|
21 |
|
|
|
22 |
The __ffs()__ function returns the position of the first |
|
|
23 |
bit set in the word ''i''. The least significant bit is |
|
|
24 |
position 1 and the most significant position |
|
|
25 |
32. |
|
|
26 |
!!RETURN VALUE |
|
|
27 |
|
|
|
28 |
|
|
|
29 |
The __ffs()__ function returns the position of the first |
|
|
30 |
bit set, or 0 if no bits are set. |
|
|
31 |
!!CONFORMING TO |
|
|
32 |
|
|
|
33 |
|
|
|
34 |
BSD 4.3, SUSv2 |
|
|
35 |
|
|
|
36 |
|
|
|
37 |
According to SUSv2, this function is defined in |
|
|
38 |
---- |
This page is a man page (or other imported legacy content). We are unable to automatically determine the license status of this page.