| ffs.3 (d1d015864103b253b3fcb2f72a0da5b0cfeb31b6) | ffs.3 (7ebf41220caedbe6d2e62f043b0f6f7837d83036) |
|---|---|
| 1.\" Copyright (c) 1990, 1991, 1993 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" This code is derived from software contributed to Berkeley by 5.\" Chris Torek. 6.\" Redistribution and use in source and binary forms, with or without 7.\" modification, are permitted provided that the following conditions 8.\" are met: --- 16 unchanged lines hidden (view full) --- 25.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 26.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 27.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 28.\" SUCH DAMAGE. 29.\" 30.\" @(#)ffs.3 8.2 (Berkeley) 4/19/94 31.\" $FreeBSD$ 32.\" | 1.\" Copyright (c) 1990, 1991, 1993 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" This code is derived from software contributed to Berkeley by 5.\" Chris Torek. 6.\" Redistribution and use in source and binary forms, with or without 7.\" modification, are permitted provided that the following conditions 8.\" are met: --- 16 unchanged lines hidden (view full) --- 25.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 26.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 27.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 28.\" SUCH DAMAGE. 29.\" 30.\" @(#)ffs.3 8.2 (Berkeley) 4/19/94 31.\" $FreeBSD$ 32.\" |
| 33.Dd September 29, 2012 | 33.Dd October 17, 2015 |
| 34.Dt FFS 3 35.Os 36.Sh NAME 37.Nm ffs , 38.Nm ffsl , 39.Nm ffsll , 40.Nm fls , 41.Nm flsl , --- 34 unchanged lines hidden (view full) --- 76functions find the last (most significant) bit set in 77.Fa value 78and return the index of that bit. 79.Pp 80Bits are numbered starting at 1, the least significant bit. 81A return value of zero from any of these functions means that the 82argument was zero. 83.Sh SEE ALSO | 34.Dt FFS 3 35.Os 36.Sh NAME 37.Nm ffs , 38.Nm ffsl , 39.Nm ffsll , 40.Nm fls , 41.Nm flsl , --- 34 unchanged lines hidden (view full) --- 76functions find the last (most significant) bit set in 77.Fa value 78and return the index of that bit. 79.Pp 80Bits are numbered starting at 1, the least significant bit. 81A return value of zero from any of these functions means that the 82argument was zero. 83.Sh SEE ALSO |
| 84.Xr bitstring 3 | 84.Xr bitstring 3 , 85.Xr bitset 9 |
| 85.Sh HISTORY 86The 87.Fn ffs 88function appeared in 89.Bx 4.3 . 90Its prototype existed previously in 91.In string.h 92before it was moved to --- 18 unchanged lines hidden --- | 86.Sh HISTORY 87The 88.Fn ffs 89function appeared in 90.Bx 4.3 . 91Its prototype existed previously in 92.In string.h 93before it was moved to --- 18 unchanged lines hidden --- |