1 /**************************************************************************
3 * Copyright 2008 VMware, Inc.
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sub license, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial portions
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
19 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
21 * IN NO EVENT SHALL VMWARE AND/OR ITS SUPPLIERS BE LIABLE FOR
22 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
23 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
24 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
26 **************************************************************************/
38 #include "c99_compat.h"
46 * Find first bit set in word. Least significant bit is 1.
47 * Return 0 if no bits set.
49 #ifdef HAVE___BUILTIN_FFS
50 #define ffs __builtin_ffs
51 #elif defined(_MSC_VER) && (_M_IX86 || _M_ARM || _M_AMD64 || _M_IA64)
56 if (_BitScanForward(&index
, i
))
66 #ifdef HAVE___BUILTIN_FFSLL
67 #define ffsll __builtin_ffsll
68 #elif defined(_MSC_VER) && (_M_AMD64 || _M_ARM || _M_IA64)
73 if (_BitScanForward64(&index
, i
))
84 /* Destructively loop over all of the bits in a mask as in:
87 * int i = u_bit_scan(&mymask);
88 * ... process element i
93 u_bit_scan(unsigned *mask
)
95 const int i
= ffs(*mask
) - 1;
101 u_bit_scan64(uint64_t *mask
)
103 const int i
= ffsll(*mask
) - 1;
104 *mask
^= (((uint64_t)1) << i
);
108 /* For looping over a bitmask when you want to loop over consecutive bits
109 * manually, for example:
112 * int start, count, i;
114 * u_bit_scan_consecutive_range(&mask, &start, &count);
116 * for (i = 0; i < count; i++)
117 * ... process element (start+i)
121 u_bit_scan_consecutive_range(unsigned *mask
, int *start
, int *count
)
123 if (*mask
== 0xffffffff) {
129 *start
= ffs(*mask
) - 1;
130 *count
= ffs(~(*mask
>> *start
)) - 1;
131 *mask
&= ~(((1u << *count
) - 1) << *start
);
135 u_bit_scan_consecutive_range64(uint64_t *mask
, int *start
, int *count
)
137 if (*mask
== ~0llu) {
143 *start
= ffsll(*mask
) - 1;
144 *count
= ffsll(~(*mask
>> *start
)) - 1;
145 *mask
&= ~(((((uint64_t)1) << *count
) - 1) << *start
);
153 #endif /* BITSCAN_H */