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
|
use crate::*;
pub struct PackedBinaryLiteral {
pub source: SourceSpan,
pub value: usize,
pub bits: usize,
pub fields: Vec<BitField>,
pub errors: Vec<PackedBinaryLiteralParseError>,
}
pub struct BitField {
pub name: char,
pub source: SourceSpan,
/// Length of field in bits
pub bits: usize,
/// Distance to left-shift field in value
pub shift: usize,
}
pub struct PackedBinaryLiteralParseError {
pub source: SourceSpan,
pub variant: PackedBinaryLiteralParseErrorVariant,
}
pub enum PackedBinaryLiteralParseErrorVariant {
DuplicateFieldName(char),
InvalidCharacter(char),
}
impl std::fmt::Display for PackedBinaryLiteral {
fn fmt(&self, f: &mut std::fmt::Formatter) -> Result<(), std::fmt::Error> {
if self.value == 0 {
write!(f, "0")?;
} else {
let bitcount = (self.value.ilog2() + 1) as usize;
'bit: for i in (0..bitcount).rev() {
let is_first_bit = i+1 == bitcount;
if !is_first_bit && (i+1) % 4 == 0 {
write!(f, "_")?;
}
for field in &self.fields {
if i <= field.bits + field.shift - 1 && i >= field.shift {
write!(f, "{}", field.name)?;
continue 'bit;
}
}
match (self.value >> i) & 1 {
0 => write!(f, "0")?,
_ => write!(f, "1")?,
}
}
}
return Ok(());
}
}
|
