1 .\" Copyright (c) 1989, 1991, 1993
2 .\" The Regents of the University of California. All rights reserved.
4 .\" This code is derived from software contributed to Berkeley by
6 .\" Redistribution and use in source and binary forms, with or without
7 .\" modification, are permitted provided that the following conditions
9 .\" 1. Redistributions of source code must retain the above copyright
10 .\" notice, this list of conditions and the following disclaimer.
11 .\" 2. Redistributions in binary form must reproduce the above copyright
12 .\" notice, this list of conditions and the following disclaimer in the
13 .\" documentation and/or other materials provided with the distribution.
14 .\" 3. Neither the name of the University nor the names of its contributors
15 .\" may be used to endorse or promote products derived from this software
16 .\" without specific prior written permission.
18 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
19 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
22 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
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
30 .\" Copyright (c) 2014,2016 Spectra Logic Corporation
31 .\" All rights reserved.
33 .\" Redistribution and use in source and binary forms, with or without
34 .\" modification, are permitted provided that the following conditions
36 .\" 1. Redistributions of source code must retain the above copyright
37 .\" notice, this list of conditions, and the following disclaimer,
38 .\" without modification.
39 .\" 2. Redistributions in binary form must reproduce at minimum a disclaimer
40 .\" substantially similar to the "NO WARRANTY" disclaimer below
41 .\" ("Disclaimer") and any redistribution must be conditioned upon
42 .\" including a substantially similar Disclaimer requirement for further
43 .\" binary redistribution.
46 .\" THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
47 .\" "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
48 .\" LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR
49 .\" A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
50 .\" HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
51 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
52 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
53 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
54 .\" STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
55 .\" IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
56 .\" POSSIBILITY OF SUCH DAMAGES.
58 .\" @(#)bitstring.3 8.1 (Berkeley) 7/19/93
82 .Nd bit-string manipulation functions and macros
86 .Fn bit_alloc "int nbits"
88 .Fn bit_decl "bitstr_t *name" "int nbits"
90 .Fn bit_clear "bitstr_t *name" "int bit"
92 .Fn bit_count "bitstr_t *name" "int count" "int nbits" "int *value"
94 .Fn bit_ffc "bitstr_t *name" "int nbits" "int *value"
96 .Fn bit_ffs "bitstr_t *name" "int nbits" "int *value"
98 .Fn bit_ffc_at "bitstr_t *name" "int start" "int nbits" "int *value"
100 .Fn bit_ffs_at "bitstr_t *name" "int start" "int nbits" "int *value"
102 .Fn bit_ffc_area "bitstr_t *name" "int nbits" "int size" "int *value"
104 .Fn bit_ffs_area "bitstr_t *name" "int nbits" "int size" "int *value"
106 .Fn bit_ffc_area_at "bitstr_t *name" "int start" "int nbits" "int size" "int *value"
108 .Fn bit_ffs_area_at "bitstr_t *name" "int start" "int nbits" "int size" "int *value"
110 .Fn bit_nclear "bitstr_t *name" "int start" "int stop"
112 .Fn bit_nset "bitstr_t *name" "int start" "int stop"
114 .Fn bit_set "bitstr_t *name" "int bit"
116 .Fn bitstr_size "int nbits"
118 .Fn bit_test "bitstr_t *name" "int bit"
120 These macros operate on strings of bits.
124 returns a pointer of type
126 to sufficient space to store
130 if no space is available.
131 If successful, the returned bit string is initialized with all bits cleared.
135 declares a bit string with sufficient space to store
139 may be used to include statically sized bit strings in structure
140 definitions or to create bit strings on the stack.
141 Users of this macro are responsible for initialization of the bit string,
142 typically via a global initialization of the containing struct or use of the
150 returns the number of bytes necessary to store
153 This is useful for copying bit strings.
159 clear or set the zero-based numbered bit
169 set or clear the zero-based numbered bits from
179 evaluates to non-zero if the zero-based numbered bit
183 is set, and zero otherwise.
187 stores in the location referenced by
189 the zero-based number of the first bit not set in the array of
193 If all bits are set, the location referenced by
200 stores in the location referenced by
202 the zero-based number of the first bit set in the array of
206 If no bits are set, the location referenced by
212 stores in the location referenced by
214 the zero-based number of the first bit not set in the array of
218 at or after the zero-based bit index
220 If all bits at or after
222 are set, the location referenced by
229 stores in the location referenced by
231 the zero-based number of the first bit set in the array of
235 at or after the zero-based bit index
237 If no bits are set after
239 the location referenced by
245 function stores in the location referenced by
247 the zero-based number of the first bit beginning a sequence of unset bits of
250 unset bits in the array of
254 If no sequence of contiguous unset bits of the specified
256 can be found, the location referenced by
262 function stores in the location referenced by
264 the zero-based number of the first bit beginning a sequence of set bits of
267 set bits in the array of
271 If no sequence of contiguous set bits of the specified
273 can be found, the location referenced by
279 function stores in the location referenced by
281 the zero-based number of the first bit beginning a sequence of unset bits of
284 unset bits in the array of
288 at or after the zero-based bit index
290 If no sequence of contiguous unset bits of the specified
292 can be found at or after
294 the location referenced by
300 function stores in the location referenced by
302 the zero-based number of the first bit beginning a sequence of set bits of
305 set bits in the array of
309 at or after the zero-based bit index
311 If no sequence of contiguous set bits of the specified
313 can be found at or after
315 the location referenced by
321 function stores in the location referenced by
323 the number of bits set in the array of
327 at or after the zero-based bit index
330 The arguments in bit string macros are evaluated only once and may safely
333 .Bd -literal -offset indent
335 #include <bitstring.h>
338 #define LPR_BUSY_BIT 0
339 #define LPR_FORMAT_BIT 1
340 #define LPR_DOWNLOAD_BIT 2
342 #define LPR_AVAILABLE_BIT 9
343 #define LPR_MAX_BITS 10
347 bitstr_t bit_decl(bitlist, LPR_MAX_BITS);
349 bit_nclear(bitlist, 0, LPR_MAX_BITS - 1);
351 if (!bit_test(bitlist, LPR_BUSY_BIT)) {
352 bit_clear(bitlist, LPR_FORMAT_BIT);
353 bit_clear(bitlist, LPR_DOWNLOAD_BIT);
354 bit_set(bitlist, LPR_AVAILABLE_BIT);
364 functions first appeared in