|
|
1.1 root 1: .\" Copyright (c) 1990 The Regents of the University of California.
2: .\" All rights reserved.
3: .\"
4: .\" This code is derived from software contributed to Berkeley by
5: .\" Chris Torek.
6: .\"
7: .\" Redistribution and use in source and binary forms are permitted
8: .\" provided that: (1) source distributions retain this entire copyright
9: .\" notice and comment, and (2) distributions including binaries display
10: .\" the following acknowledgement: ``This product includes software
11: .\" developed by the University of California, Berkeley and its contributors''
12: .\" in the documentation or other materials provided with the distribution
13: .\" and in all advertising materials mentioning features or use of this
14: .\" software. Neither the name of the University nor the names of its
15: .\" contributors may be used to endorse or promote products derived
16: .\" from this software without specific prior written permission.
17: .\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
18: .\" IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
19: .\" WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
20: .\"
21: .\" @(#)ffs.3 5.1 (Berkeley) 5/15/90
22: .\"
23: .TH FFS 3 "May 15, 1990"
24: .UC 7
25: .SH NAME
26: ffs \- find first bit set in a bit string
27: .SH SYNOPSIS
28: .nf
29: .ft B
30: #include <string.h>
31:
32: int
33: ffs(int value);
34: .ft R
35: .fi
36: .SH DESCRIPTION
37: .B Ffs
38: finds the first bit set in
39: .I value
40: and returns the index of that bit.
41: Bits are numbered starting from 1, starting at the right-most
42: bit.
43: A return value of 0 means that the argument was zero.
44: .SH SEE\ ALSO
45: bitstring(3)
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.