1 .\" Copyright 1993 David Metcalfe (david@prism.demon.co.uk)
3 .\" %%%LICENSE_START(VERBATIM)
4 .\" Permission is granted to make and distribute verbatim copies of this
5 .\" manual provided the copyright notice and this permission notice are
6 .\" preserved on all copies.
8 .\" Permission is granted to copy and distribute modified versions of this
9 .\" manual under the conditions for verbatim copying, provided that the
10 .\" entire resulting derived work is distributed under the terms of a
11 .\" permission notice identical to this one.
13 .\" Since the Linux kernel and libraries are constantly changing, this
14 .\" manual page may be incorrect or out-of-date. The author(s) assume no
15 .\" responsibility for errors or omissions, or for damages resulting from
16 .\" the use of the information contained herein. The author(s) may not
17 .\" have taken the same level of care in the production of this manual,
18 .\" which is licensed free of charge, as they might when working
21 .\" Formatted or processed versions of this manual, if unaccompanied by
22 .\" the source, must acknowledge the copyright and authors of this work.
25 .\" References consulted:
26 .\" Linux libc source code
27 .\" Lewine's _POSIX Programmer's Guide_ (O'Reilly & Associates, 1991)
29 .\" Modified Sat Jul 24 19:39:35 1993 by Rik Faith (faith@cs.unc.edu)
31 .\" Modified 2003 Walter Harms (walter.harms@informatik.uni-oldenburg.de)
33 .TH FFS 3 2021-03-22 "GNU" "Linux Programmer's Manual"
35 ffs, ffsl, ffsll \- find first bit set in a word
38 .B #include <strings.h>
40 .BI "int ffs(int " i );
42 .B #include <string.h>
44 .BI "int ffsl(long " i );
45 .BI "int ffsll(long long " i );
49 Feature Test Macro Requirements for glibc (see
50 .BR feature_test_macros (7)):
57 || ! (_POSIX_C_SOURCE >= 200809L)
58 || /* Glibc since 2.19: */ _DEFAULT_SOURCE
59 || /* Glibc <= 2.19: */ _BSD_SOURCE || _SVID_SOURCE
68 .\" glibc commit 68fe16dd327c895c08b9ee443b234c49c13b36e9
76 function returns the position of the first
77 (least significant) bit set in the word \fIi\fP.
78 The least significant bit is position 1 and the
79 most significant position is, for example, 32 or 64.
85 arguments of possibly different size.
87 These functions return the position of the first bit set,
88 or 0 if no bits are set in
91 For an explanation of the terms used in this section, see
99 Interface Attribute Value
104 T} Thread safety MT-Safe
111 POSIX.1-2001, POSIX.1-2008, 4.3BSD.
117 functions are glibc extensions.
119 BSD systems have a prototype in