-
Notifications
You must be signed in to change notification settings - Fork 389
Expand file tree
/
Copy pathbitops.hpp
More file actions
258 lines (216 loc) · 6.37 KB
/
bitops.hpp
File metadata and controls
258 lines (216 loc) · 6.37 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
// -*- C++ -*-
// This file is a part of the IncludeOS unikernel - www.includeos.org
//
// Copyright 2017 Oslo and Akershus University College of Applied Sciences
// and Alfred Bratterud
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef UTIL_BITOPS_HPP
#define UTIL_BITOPS_HPP
#include <type_traits>
#include <cstdint>
namespace util {
inline namespace bitops {
/**
* Utilities for enabling bitmask ops for enum class etc.
*
* Usage:
* For a an enum class of flags F, enable bitwise operators with:
*
* namespace util {
* inline namespace bitops {
*
* template <>
* struct enable_bitmask_ops<F> {
* using type = std::underlying_type<F>::type;
* static constexpr bool enable = true;
* }
*
* }
* }
*
* After which the operations can be enabled with
* using namespace util:bitops
* inside the namespace they are used.
*/
template<typename E>
struct enable_bitmask_ops{
using type = typename std::underlying_type<E>::type;
static constexpr bool enable=false;
};
// operator|
template<typename E, typename F>
constexpr typename std::enable_if<enable_bitmask_ops<E>::enable,E>::type
operator|(E lhs,F rhs){
using type = typename enable_bitmask_ops<E>::type;
return static_cast<E>(static_cast<type>(lhs) | static_cast<type>(rhs));
}
// operator&
template<typename E, typename F>
typename std::enable_if<enable_bitmask_ops<E>::enable,E>::type
constexpr operator&(E lhs,F rhs){
using type = typename enable_bitmask_ops<E>::type;
return static_cast<E>(static_cast<type>(lhs) & static_cast<type>(rhs));
}
// operator^
template<typename E, typename F>
typename std::enable_if<enable_bitmask_ops<E>::enable,E>::type
constexpr operator^(E lhs,F rhs){
using type = typename enable_bitmask_ops<F>::type;
return static_cast<E>(static_cast<type>(lhs) ^ static_cast<type>(rhs));
}
// operator|=
template<typename E, typename F>
constexpr typename std::enable_if<enable_bitmask_ops<E>::enable,E>::type
operator|=(E& lhs,F rhs){
using type = typename enable_bitmask_ops<F>::type;
lhs = static_cast<E>(static_cast<type>(lhs) | static_cast<type>(rhs));
return lhs;
}
// operator&=
template<typename E, typename F>
constexpr typename std::enable_if<enable_bitmask_ops<E>::enable,E>::type&
operator&=(E& lhs,F rhs){
using type = typename enable_bitmask_ops<F>::type;
lhs = static_cast<E>(static_cast<type>(lhs) & static_cast<type>(rhs));
return lhs;
}
// operator^=
template<typename E, typename F>
constexpr typename std::enable_if<enable_bitmask_ops<E>::enable,E>::type&
operator^=(E& lhs,F rhs){
using type = typename enable_bitmask_ops<E>::type;
lhs = static_cast<E>(static_cast<type>(lhs) ^ static_cast<type>(rhs));
return lhs;
}
// operator~
template<typename E>
typename std::enable_if<enable_bitmask_ops<E>::enable, E>::type
constexpr operator~(E flag){
using base_type = typename enable_bitmask_ops<E>::type;
return static_cast<E>(~static_cast<base_type>(flag));
}
// bool has_flag(flag)
template<typename E>
constexpr typename std::enable_if<enable_bitmask_ops<E>::enable, bool>::type
has_flag(E flag){
using base_type = typename std::underlying_type<E>::type;
return static_cast<base_type>(flag);
}
// bool has_flag(field, flags)
template<typename E>
constexpr typename std::enable_if<enable_bitmask_ops<E>::enable, bool>::type
has_flag(E field, E flags){
return (field & flags) == flags ;
}
// Enable for uint8_t
template<>
struct enable_bitmask_ops<uint8_t> {
using type = uint8_t;
static constexpr bool enable = true;
};
// Enable for uint16_t
template<>
struct enable_bitmask_ops<uint16_t> {
using type = uint16_t;
static constexpr bool enable = true;
};
// Enable for uint32_t
template<>
struct enable_bitmask_ops<uint32_t> {
using type = uint32_t;
static constexpr bool enable = true;
};
// Enable for uint64_t
template<>
struct enable_bitmask_ops<uint64_t> {
using type = uint64_t;
static constexpr bool enable = true;
};
}
/**
* Various bit operations
*/
namespace bits {
// Number of bits per word
constexpr int bitcnt()
{ return sizeof(uintptr_t) * 8; }
// Count leading zeroes
inline uintptr_t clz(uintptr_t n){
return __builtin_clzl(n);
}
// Count trailing zeroes
inline uintptr_t ctz(uintptr_t n){
return __builtin_ctzl(n);
}
// Find first bit set.
inline uintptr_t ffs(uintptr_t n){
return __builtin_ffsl(n);
}
// Find last bit set. The integral part of log2(n).
inline uintptr_t fls(uintptr_t n){
return (uintptr_t) bitcnt() - clz(n);
}
// Keep last set bit, clear the rest.
inline uintptr_t keeplast(uintptr_t n)
{ return 1LU << (fls(n) - 1); }
// Keep first set bit, clear the rest.
inline uintptr_t keepfirst(uintptr_t n)
{ return 1LU << (ffs(n) - 1); }
// Number of bits set in n
inline uintptr_t popcount(uintptr_t n)
{ return __builtin_popcountl(n); }
// Check for power of two
inline constexpr bool is_pow2(uintptr_t i)
{ return i && !(i & (i - 1)); }
inline uintptr_t next_pow2(uintptr_t i)
{
auto lastbit = keeplast(i);
return i == lastbit ? i : lastbit * 2;
}
// Multiples of M required to cover x
template <uintptr_t M>
inline uintptr_t multip(uintptr_t x)
{ return (M - 1 + x) / M; }
inline constexpr uintptr_t multip(uintptr_t M, uintptr_t x)
{return (M - 1 + x) / M; }
// Round up to nearest multiple of M
template <uintptr_t M>
inline uintptr_t roundto(uintptr_t x)
{ return multip<M>(x) * M; }
inline constexpr uintptr_t roundto(uintptr_t M, uintptr_t x)
{ return multip(M,x) * M; }
inline constexpr uintptr_t align(uintptr_t M, uintptr_t x)
{ return roundto(M, x); }
// Determine if ptr is A-aligned
template <uintptr_t A>
bool is_aligned(uintptr_t ptr) noexcept
{
return (ptr & (A - 1)) == 0;
}
template <uintptr_t A>
bool is_aligned(void* ptr) noexcept
{
return is_aligned<A>(reinterpret_cast<uintptr_t>(ptr));
}
inline bool is_aligned(uintptr_t A, uintptr_t ptr) noexcept
{
return (ptr & (A - 1)) == 0;
}
inline std::size_t upercent(std::size_t a, std::size_t b) noexcept
{
return (100 * a + b / 2) / b;
}
} // ns bitops
} // ns util
#endif