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
macro_rules! impl_indv_shift_ops {
($t:ty, $tname:ident, $fname:ident, $w:ident, $ta_name:ident, $fa_name:ident) => (
impl $tname<usize> for $t {
type Output = $t;
#[inline]
fn $fname(self, rhs: usize) -> $t {
Self::from((self.0).$w(rhs as u32))
}
}
impl $ta_name<usize> for $t {
#[inline]
fn $fa_name(&mut self, rhs: usize) {
*self = Self::from((self.0).$w(rhs as u32));
}
}
)
}
macro_rules! impl_indv_bit_ops {
($t:ty, $b:ty, $tname:ident, $fname:ident, $w:ident, $ta_name:ident, $fa_name:ident) => (
impl $tname for $t {
type Output = $t;
#[inline]
fn $fname(self, rhs: $t) -> $t {
Self::from((self.0).$w(rhs.0))
}
}
impl $ta_name for $t {
#[inline]
fn $fa_name(&mut self, rhs: $t) {
*self = Self::from((self.0).$w(rhs.0));
}
}
impl $tname<$b> for $t {
type Output = $t;
#[inline]
fn $fname(self, rhs: $b) -> $t {
Self::from((self.0).$w(rhs))
}
}
impl $ta_name<$b> for $t {
#[inline]
fn $fa_name(&mut self, rhs: $b) {
*self = Self::from((self.0).$w(rhs));
}
}
)
}
macro_rules! impl_bit_ops {
($t:tt, $b:tt) => (
impl From<$b> for $t {
fn from(bit_type: $b) -> Self {
$t(bit_type)
}
}
impl From<$t> for $b {
fn from(it:$t) -> Self {
it.0
}
}
impl_indv_bit_ops!( $t, $b, Rem, rem, rem, RemAssign, rem_assign);
impl_indv_bit_ops!( $t, $b, BitOr, bitor, bitor, BitOrAssign, bitor_assign);
impl_indv_bit_ops!( $t, $b, BitAnd, bitand, bitand, BitAndAssign, bitand_assign);
impl_indv_bit_ops!( $t, $b, BitXor, bitxor, bitxor, BitXorAssign, bitxor_assign);
impl_indv_bit_ops!( $t, $b, Add, add, wrapping_add, AddAssign, add_assign);
impl_indv_bit_ops!( $t, $b, Div, div, wrapping_div, DivAssign, div_assign);
impl_indv_bit_ops!( $t, $b, Mul, mul, wrapping_mul, MulAssign, mul_assign);
impl_indv_bit_ops!( $t, $b, Sub, sub, wrapping_sub, SubAssign, sub_assign);
impl_indv_shift_ops!($t, Shl, shl, wrapping_shl, ShlAssign, shl_assign);
impl_indv_shift_ops!($t, Shr, shr, wrapping_shr, ShrAssign, shr_assign);
impl Not for $t {
type Output = $t;
#[inline]
fn not(self) -> $t {
$t(!self.0)
}
}
)
}
#[cfg(test)]
mod tests {
use std::ops::*;
macro_rules! test_bit_ops_impls {
($t:tt, $int_t:ty, $fi:expr, $si:expr, $opp:tt) => ({
let c_a = $fi $opp $si;
let i_fo = $t::from($fi);
let i_so = $t::from($si);
let c = i_fo $opp i_so;
assert_eq!(c.0, c_a);
});
}
macro_rules! test_math_impls {
($t:tt, $int_t:ty, $fi:expr, $si:expr, $opp:tt, $w_opp:tt) => ({
let c_a = $fi.$w_opp($si);
let i_fo = $t::from($fi);
let i_so = $t::from($si);
let c = i_fo $opp i_so;
assert_eq!(c.0, c_a);
});
}
macro_rules! test_bit_shift_impls {
($t:tt, $int_t:ty, $fi:expr, $si:expr, $opp:tt, $w_opp:tt) => ({
let c_a = $fi.$w_opp($si as u32);
let i_fo = $t::from($fi);
let c = i_fo $opp $si as usize;
assert_eq!(c.0, c_a);
});
}
#[derive(Copy, Clone, Default, Hash, PartialEq, Eq)]
struct DummyBB(pub u64);
#[derive(Copy, Clone, Default, Hash, PartialEq, Eq)]
struct DummySQ(pub u8);
impl_bit_ops!(DummySQ, u8);
impl_bit_ops!(DummyBB, u64);
const SQ_CONSTS: [u8; 18] =
[0xFE, 0xC1, 0x21, 0x9F, 0x44, 0xA0, 0xF7, 0xFF, 0x11, 0x7A,
0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08,];
const BIT_CONSTS: [u64; 18] =
[0xFE00C4D0, 0x12F450012, 0xFFFFFFFF, 0x00000001,
0xA0E34001, 0x9ABBC0AA, 0x412CBFFF, 0x90000C10,
0xC200C4D0, 0xFE00C4D0, 0xFE00C4D0, 0x44FF2221,
0x772C0F64, 0x09F3C833, 0x04444A09, 0x3333FFEE,
0x670FA111, 0x7BBBB005];
#[test]
pub fn macro_imlps_sq() {
for bits in SQ_CONSTS.iter() {
assert_eq!((!DummySQ::from(*bits)).0, !(*bits));
for bits_2 in SQ_CONSTS.iter() {
test_bit_ops_impls!(DummySQ, u8, *bits, *bits_2, % );
test_bit_ops_impls!(DummySQ, u8, *bits, *bits_2, ^ );
test_bit_ops_impls!(DummySQ, u8, *bits, *bits_2, | );
test_bit_ops_impls!(DummySQ, u8, *bits, *bits_2, & );
test_math_impls!(DummySQ, u8, *bits, *bits_2, + , wrapping_add);
test_math_impls!(DummySQ, u8, *bits, *bits_2, * , wrapping_mul);
test_math_impls!(DummySQ, u8, *bits, *bits_2, - , wrapping_sub);
test_math_impls!(DummySQ, u8, *bits, *bits_2, / , wrapping_div);
test_bit_shift_impls!(DummySQ, u8, *bits, *bits_2, << , wrapping_shl);
test_bit_shift_impls!(DummySQ, u8, *bits, *bits_2, >> , wrapping_shr);
}
}
}
#[test]
pub fn macro_imlps_bb() {
for bits in BIT_CONSTS.iter() {
assert_eq!((!DummyBB::from(*bits)).0, !(*bits));
for bits_2 in BIT_CONSTS.iter() {
test_bit_ops_impls!(DummyBB, u8, *bits, *bits_2, % );
test_bit_ops_impls!(DummyBB, u8, *bits, *bits_2, ^ );
test_bit_ops_impls!(DummyBB, u8, *bits, *bits_2, | );
test_bit_ops_impls!(DummyBB, u8, *bits, *bits_2, & );
test_math_impls!(DummyBB, u8, *bits, *bits_2, + , wrapping_add);
test_math_impls!(DummyBB, u8, *bits, *bits_2, * , wrapping_mul);
test_math_impls!(DummyBB, u8, *bits, *bits_2, - , wrapping_sub);
test_math_impls!(DummyBB, u8, *bits, *bits_2, / , wrapping_div);
}
for x in 0..67usize {
test_bit_shift_impls!(DummyBB, u8, *bits, x, << , wrapping_shl);
test_bit_shift_impls!(DummyBB, u8, *bits, x, >> , wrapping_shr);
}
}
}
}