2 * This file is part of cparser.
3 * Copyright (C) 2012 Matthias Braun <matze@braunis.de>
9 * @brief Functions from hackers delight.
10 * @author Sebastian Hack, Matthias Braun
12 #ifndef _FIRM_BITFIDDLE_H_
13 #define _FIRM_BITFIDDLE_H_
20 /* some functions here assume ints are 32 bit wide */
21 #define HACKDEL_WORDSIZE 32
22 COMPILETIME_ASSERT(sizeof(unsigned) == 4, unsignedsize)
23 COMPILETIME_ASSERT(UINT_MAX == 4294967295U, uintmax)
29 * @return x + y or INT_MAX/INT_MIN if an overflow occurred and x,y was positive/negative.
31 * @note See hacker's delight, page 27.
33 static inline __attribute__((const))
34 int add_saturated(int x, int y)
38 An overflow occurs, if the sign of the both summands is equal
39 and the one of the sum is different from the summand's one.
40 The sign bit is 1, if an overflow occurred, 0 otherwise.
41 int overflow = ~(x ^ y) & (sum ^ x);
43 int overflow = (x ^ sum) & (y ^ sum);
47 Make a mask of the sign bit of x and y (they are the same if an
49 INT_MIN == ~INT_MAX, so if the sign was negative, INT_MAX becomes
52 int inf = (x >> (sizeof(x) * 8 - 1)) ^ INT_MAX;
54 return overflow < 0 ? inf : sum;
58 * Compute the count of set bits in a 32-bit word.
59 * @param x A 32-bit word.
60 * @return The number of bits set in x.
62 static inline __attribute__((const))
63 unsigned popcnt(unsigned x) {
64 x -= ((x >> 1) & 0x55555555);
65 x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
66 x = (x + (x >> 4)) & 0x0f0f0f0f;
73 * Compute the number of leading zeros in a word.
75 * @return The number of leading (from the most significant bit) zeros.
77 static inline __attribute__((const))
78 unsigned nlz(unsigned x) {
79 #ifdef USE_X86_ASSEMBLY
99 * Compute the number of trailing zeros in a word.
101 * @return The number of trailing zeros.
103 static inline __attribute__((const))
104 unsigned ntz(unsigned x) {
105 #ifdef USE_X86_ASSEMBLY
115 return HACKDEL_WORDSIZE - nlz(~x & (x - 1));
120 * Compute the greatest power of 2 smaller or equal to a value.
121 * This is also known as the binary logarithm.
122 * @param x The value.
123 * @return The power of two.
125 #define log2_floor(x) (HACKDEL_WORDSIZE - 1 - nlz(x))
128 * Compute the smallest power of 2 greater or equal to a value.
129 * This is also known as the binary logarithm.
130 * @param x The value.
131 * @return The power of two.
133 #define log2_ceil(x) (HACKDEL_WORDSIZE - nlz((x) - 1))
136 * Round up to the next multiple of a power of two.
138 * @param pot A power of two.
139 * @return x rounded up to the next multiple of pot.
141 #define round_up2(x,pot) (((x) + ((pot) - 1)) & (~((pot) - 1)))
144 * Returns the biggest power of 2 that is equal or smaller than @p x
145 * (see hackers delight power-of-2 boundaries, page 48)
147 static inline __attribute__((const))
148 unsigned floor_po2(unsigned x)
150 #ifdef USE_X86_ASSEMBLY // in this case nlz is fast
153 // note that x != 0 here, so nlz(x) < 32!
154 return 0x80000000U >> nlz(x);
166 * Returns the smallest power of 2 that is equal or greater than x
167 * @remark x has to be <= 0x8000000 of course
168 * @note see hackers delight power-of-2 boundaries, page 48
170 static inline __attribute__((const))
171 unsigned ceil_po2(unsigned x)
175 assert(x < (1U << 31));
177 #ifdef USE_X86_ASSEMBLY // in this case nlz is fast
178 // note that x != 0 here!
179 return 0x80000000U >> (nlz(x-1) - 1);
192 * Tests whether @p x is a power of 2
194 static inline __attribute__((const))
195 int is_po2(unsigned x)
197 return (x & (x-1)) == 0;