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
use awint_internals::*;
use const_fn::const_fn;
use crate::Bits;
// TODO these could probably be optimized, check assembly
macro_rules! bits_ {
($($unsigned_name:ident, $uX:ident, $signed_name:ident, $iX:ident);*;) => {
$(
#[const_fn(cfg(feature = "const_support"))]
pub const fn $unsigned_name(&mut self, x: $uX) {
const BW: usize = $uX::BITS as usize;
const LEN: usize = BW / BITS;
if LEN <= 1 {
*self.first_mut() = x as Digit;
if self.total_digits() > 1 {
unsafe {self.digit_set(false, 1..self.total_digits(), false);}
}
} else if self.bw() > BW {
// Safety: there are at least `LEN` digits in `self`
unsafe {
const_for!(i in {0..LEN} {
*self.get_unchecked_mut(i) = (x >> (i * BITS)) as Digit;
});
self.digit_set(false, LEN..self.total_digits(), false);
}
} else {
unsafe {
const_for!(i in {0..self.total_digits()} {
*self.get_unchecked_mut(i) = (x >> (i * BITS)) as Digit;
});
}
}
self.clear_unused_bits();
}
#[const_fn(cfg(feature = "const_support"))]
pub const fn $signed_name(&mut self, x: $iX) {
const BW: usize = $iX::BITS as usize;
const LEN: usize = BW / BITS;
if LEN <= 1 {
*self.first_mut() = x as IDigit as Digit;
if self.total_digits() >= 1 {
// Safety: there is at least 1 digit in `self`
unsafe {
self.digit_set(x < 0, 1..self.total_digits(), true);
}
}
} else if self.bw() >= BW {
// Safety: there are at least `LEN` digits in `self`
unsafe {
let sign = x < 0;
const_for!(i in {0..LEN} {
*self.get_unchecked_mut(i) = (x >> (i * BITS)) as IDigit as Digit;
});
self.digit_set(sign, LEN..self.total_digits(), true);
}
} else {
unsafe {
const_for!(i in {0..self.total_digits()} {
*self.get_unchecked_mut(i) = (x >> (i * BITS)) as IDigit as Digit;
});
}
self.clear_unused_bits();
}
}
)*
};
}
/// # Primitive assignment
///
/// If `self.bw()` is smaller than the primitive bitwidth, truncation will be
/// used when copying bits from `x` to `self`. If the primitive is unsigned (or
/// is a boolean), then zero extension will be used if `self.bw()` is larger
/// than the primitive bitwidth. If the primitive is signed, then sign extension
/// will be used if `self.bw()` is larger than the primitive bitwidth.
impl Bits {
bits_!(
u8_, u8, i8_, i8;
u16_, u16, i16_, i16;
u32_, u32, i32_, i32;
u64_, u64, i64_, i64;
u128_, u128, i128_, i128;
usize_, usize, isize_, isize;
);
#[const_fn(cfg(feature = "const_support"))]
pub const fn bool_(&mut self, x: bool) {
self.zero_();
*self.first_mut() = x as Digit;
}
#[const_fn(cfg(feature = "const_support"))]
pub const fn digit_(&mut self, x: Digit) {
self.zero_();
*self.first_mut() = x;
}
}
macro_rules! bits_convert {
($($unsigned_name:ident, $uX:ident, $signed_name:ident, $iX:ident);*;) => {
$(
#[const_fn(cfg(feature = "const_support"))]
#[must_use]
pub const fn $unsigned_name(&self) -> $uX {
const BW: usize = $uX::BITS as usize;
const LEN: usize = BW / BITS;
if LEN <= 1 {
self.first() as $uX
} else if self.bw() >= BW {
// Safety: there are at least `LEN` digits in `self`
let mut tmp = 0;
unsafe {
const_for!(i in {0..LEN} {
tmp |= (self.get_unchecked(i) as $uX) << (i * BITS);
});
}
tmp
} else {
let mut tmp = 0;
unsafe {
const_for!(i in {0..self.total_digits()} {
tmp |= (self.get_unchecked(i) as $uX) << (i * BITS);
});
}
tmp
}
}
#[const_fn(cfg(feature = "const_support"))]
#[must_use]
pub const fn $signed_name(&self) -> $iX {
const BW: usize = $uX::BITS as usize;
const LEN: usize = BW / BITS;
if LEN <= 1 && self.total_digits() == 1 {
let sign_bit: Digit = 1 << (self.bw() - 1);
let extension = $uX::MIN.wrapping_sub((self.first() & sign_bit) as $uX);
((self.first() as $uX) | extension) as $iX
} else {
let mut tmp = self.$unsigned_name() as $iX;
if self.bw() < BW {
if self.msb() {
let extension = $uX::MIN.wrapping_sub(1 << (self.bw() - 1)) as $iX;
tmp |= extension;
}
}
tmp
}
}
)*
};
}
/// # Primitive conversion
///
/// If `self.bw()` is larger than the primitive bitwidth, truncation will be
/// used when copying the bits of `self` and returning them. If the primitive is
/// unsigned, then zero extension will be used if `self.bw()` is smaller than
/// the primitive bitwidth. If the primitive is signed, then sign extension will
/// be used if `self.bw()` is smaller than the primitive bitwidth.
impl Bits {
bits_convert!(
to_u8, u8, to_i8, i8;
to_u16, u16, to_i16, i16;
to_u32, u32, to_i32, i32;
to_u64, u64, to_i64, i64;
to_u128, u128, to_i128, i128;
to_usize, usize, to_isize, isize;
);
#[const_fn(cfg(feature = "const_support"))]
#[must_use]
pub const fn to_bool(&self) -> bool {
(self.first() & 1) != 0
}
#[const_fn(cfg(feature = "const_support"))]
#[must_use]
pub const fn to_digit(&self) -> Digit {
self.first()
}
}
impl From<&Bits> for bool {
/// Returns the least significant bit
fn from(x: &Bits) -> bool {
x.to_bool()
}
}
macro_rules! from_bits {
($($uX:ident, $to_u:ident, $iX:ident, $to_i:ident);*;) => {
$(
impl From<&Bits> for $uX {
/// Zero-resizes the `Bits` to this integer
fn from(x: &Bits) -> Self {
x.$to_u()
}
}
impl From<&Bits> for $iX {
/// Sign-resizes the `Bits` to this integer
fn from(x: &Bits) -> Self {
x.$to_i()
}
}
)*
};
}
from_bits!(
u8, to_u8, i8, to_i8;
u16, to_u16, i16, to_i16;
u32, to_u32, i32, to_i32;
u64, to_u64, i64, to_i64;
u128, to_u128, i128, to_i128;
usize, to_usize, isize, to_isize;
);