2 * Utility compute operations used by translated code.
4 * Copyright (c) 2007 Thiemo Seufer
5 * Copyright (c) 2007 Jocelyn Mayer
7 * Permission is hereby granted, free of charge, to any person obtaining a copy
8 * of this software and associated documentation files (the "Software"), to deal
9 * in the Software without restriction, including without limitation the rights
10 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
11 * copies of the Software, and to permit persons to whom the Software is
12 * furnished to do so, subject to the following conditions:
14 * The above copyright notice and this permission notice shall be included in
15 * all copies or substantial portions of the Software.
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
18 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
20 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
21 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
22 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
26 #define HOST_UTILS_H 1
28 #include "qemu/compiler.h" /* QEMU_GNUC_PREREQ */
32 static inline void mulu64(uint64_t *plow
, uint64_t *phigh
,
33 uint64_t a
, uint64_t b
)
35 __uint128_t r
= (__uint128_t
)a
* b
;
40 static inline void muls64(uint64_t *plow
, uint64_t *phigh
,
43 __int128_t r
= (__int128_t
)a
* b
;
48 static inline int divu128(uint64_t *plow
, uint64_t *phigh
, uint64_t divisor
)
53 __uint128_t dividend
= ((__uint128_t
)*phigh
<< 64) | *plow
;
54 __uint128_t result
= dividend
/ divisor
;
56 *phigh
= dividend
% divisor
;
57 return result
> UINT64_MAX
;
61 static inline int divs128(int64_t *plow
, int64_t *phigh
, int64_t divisor
)
66 __int128_t dividend
= ((__int128_t
)*phigh
<< 64) | *plow
;
67 __int128_t result
= dividend
/ divisor
;
69 *phigh
= dividend
% divisor
;
70 return result
!= *plow
;
74 void muls64(uint64_t *phigh
, uint64_t *plow
, int64_t a
, int64_t b
);
75 void mulu64(uint64_t *phigh
, uint64_t *plow
, uint64_t a
, uint64_t b
);
76 int divu128(uint64_t *plow
, uint64_t *phigh
, uint64_t divisor
);
77 int divs128(int64_t *plow
, int64_t *phigh
, int64_t divisor
);
81 * clz32 - count leading zeros in a 32-bit value.
82 * @val: The value to search
84 * Returns 32 if the value is zero. Note that the GCC builtin is
85 * undefined if the value is zero.
87 static inline int clz32(uint32_t val
)
89 #if QEMU_GNUC_PREREQ(3, 4)
90 return val
? __builtin_clz(val
) : 32;
92 /* Binary search for the leading one bit. */
95 if (!(val
& 0xFFFF0000U
)) {
99 if (!(val
& 0xFF000000U
)) {
103 if (!(val
& 0xF0000000U
)) {
107 if (!(val
& 0xC0000000U
)) {
111 if (!(val
& 0x80000000U
)) {
115 if (!(val
& 0x80000000U
)) {
123 * clo32 - count leading ones in a 32-bit value.
124 * @val: The value to search
126 * Returns 32 if the value is -1.
128 static inline int clo32(uint32_t val
)
134 * clz64 - count leading zeros in a 64-bit value.
135 * @val: The value to search
137 * Returns 64 if the value is zero. Note that the GCC builtin is
138 * undefined if the value is zero.
140 static inline int clz64(uint64_t val
)
142 #if QEMU_GNUC_PREREQ(3, 4)
143 return val
? __builtin_clzll(val
) : 64;
153 return cnt
+ clz32(val
);
158 * clo64 - count leading ones in a 64-bit value.
159 * @val: The value to search
161 * Returns 64 if the value is -1.
163 static inline int clo64(uint64_t val
)
169 * ctz32 - count trailing zeros in a 32-bit value.
170 * @val: The value to search
172 * Returns 32 if the value is zero. Note that the GCC builtin is
173 * undefined if the value is zero.
175 static inline int ctz32(uint32_t val
)
177 #if QEMU_GNUC_PREREQ(3, 4)
178 return val
? __builtin_ctz(val
) : 32;
180 /* Binary search for the trailing one bit. */
184 if (!(val
& 0x0000FFFFUL
)) {
188 if (!(val
& 0x000000FFUL
)) {
192 if (!(val
& 0x0000000FUL
)) {
196 if (!(val
& 0x00000003UL
)) {
200 if (!(val
& 0x00000001UL
)) {
204 if (!(val
& 0x00000001UL
)) {
213 * cto32 - count trailing ones in a 32-bit value.
214 * @val: The value to search
216 * Returns 32 if the value is -1.
218 static inline int cto32(uint32_t val
)
224 * ctz64 - count trailing zeros in a 64-bit value.
225 * @val: The value to search
227 * Returns 64 if the value is zero. Note that the GCC builtin is
228 * undefined if the value is zero.
230 static inline int ctz64(uint64_t val
)
232 #if QEMU_GNUC_PREREQ(3, 4)
233 return val
? __builtin_ctzll(val
) : 64;
238 if (!((uint32_t)val
)) {
243 return cnt
+ ctz32(val
);
248 * cto64 - count trailing ones in a 64-bit value.
249 * @val: The value to search
251 * Returns 64 if the value is -1.
253 static inline int cto64(uint64_t val
)
259 * clrsb32 - count leading redundant sign bits in a 32-bit value.
260 * @val: The value to search
262 * Returns the number of bits following the sign bit that are equal to it.
263 * No special cases; output range is [0-31].
265 static inline int clrsb32(uint32_t val
)
267 #if QEMU_GNUC_PREREQ(4, 7)
268 return __builtin_clrsb(val
);
270 return clz32(val
^ ((int32_t)val
>> 1)) - 1;
275 * clrsb64 - count leading redundant sign bits in a 64-bit value.
276 * @val: The value to search
278 * Returns the number of bits following the sign bit that are equal to it.
279 * No special cases; output range is [0-63].
281 static inline int clrsb64(uint64_t val
)
283 #if QEMU_GNUC_PREREQ(4, 7)
284 return __builtin_clrsbll(val
);
286 return clz64(val
^ ((int64_t)val
>> 1)) - 1;
291 * ctpop8 - count the population of one bits in an 8-bit value.
292 * @val: The value to search
294 static inline int ctpop8(uint8_t val
)
296 #if QEMU_GNUC_PREREQ(3, 4)
297 return __builtin_popcount(val
);
299 val
= (val
& 0x55) + ((val
>> 1) & 0x55);
300 val
= (val
& 0x33) + ((val
>> 2) & 0x33);
301 val
= (val
& 0x0f) + ((val
>> 4) & 0x0f);
308 * ctpop16 - count the population of one bits in a 16-bit value.
309 * @val: The value to search
311 static inline int ctpop16(uint16_t val
)
313 #if QEMU_GNUC_PREREQ(3, 4)
314 return __builtin_popcount(val
);
316 val
= (val
& 0x5555) + ((val
>> 1) & 0x5555);
317 val
= (val
& 0x3333) + ((val
>> 2) & 0x3333);
318 val
= (val
& 0x0f0f) + ((val
>> 4) & 0x0f0f);
319 val
= (val
& 0x00ff) + ((val
>> 8) & 0x00ff);
326 * ctpop32 - count the population of one bits in a 32-bit value.
327 * @val: The value to search
329 static inline int ctpop32(uint32_t val
)
331 #if QEMU_GNUC_PREREQ(3, 4)
332 return __builtin_popcount(val
);
334 val
= (val
& 0x55555555) + ((val
>> 1) & 0x55555555);
335 val
= (val
& 0x33333333) + ((val
>> 2) & 0x33333333);
336 val
= (val
& 0x0f0f0f0f) + ((val
>> 4) & 0x0f0f0f0f);
337 val
= (val
& 0x00ff00ff) + ((val
>> 8) & 0x00ff00ff);
338 val
= (val
& 0x0000ffff) + ((val
>> 16) & 0x0000ffff);
345 * ctpop64 - count the population of one bits in a 64-bit value.
346 * @val: The value to search
348 static inline int ctpop64(uint64_t val
)
350 #if QEMU_GNUC_PREREQ(3, 4)
351 return __builtin_popcountll(val
);
353 val
= (val
& 0x5555555555555555ULL
) + ((val
>> 1) & 0x5555555555555555ULL
);
354 val
= (val
& 0x3333333333333333ULL
) + ((val
>> 2) & 0x3333333333333333ULL
);
355 val
= (val
& 0x0f0f0f0f0f0f0f0fULL
) + ((val
>> 4) & 0x0f0f0f0f0f0f0f0fULL
);
356 val
= (val
& 0x00ff00ff00ff00ffULL
) + ((val
>> 8) & 0x00ff00ff00ff00ffULL
);
357 val
= (val
& 0x0000ffff0000ffffULL
) + ((val
>> 16) & 0x0000ffff0000ffffULL
);
358 val
= (val
& 0x00000000ffffffffULL
) + ((val
>> 32) & 0x00000000ffffffffULL
);
364 /* Host type specific sizes of these routines. */
366 #if ULONG_MAX == UINT32_MAX
371 # define ctpopl ctpop32
372 #elif ULONG_MAX == UINT64_MAX
377 # define ctpopl ctpop64
379 # error Unknown sizeof long