use crate::{instrs, EncodedInstr}; const fn ascii_mask(chars: &[u8]) -> u128 { let mut eq = 0; let mut i = 0; while i < chars.len() { let b = chars[i]; eq |= 1 << b; i += 1; } eq } #[derive(Debug, PartialEq, Eq, Clone, Copy)] pub struct Token { pub kind: TokenKind, pub start: u32, pub end: u32, } impl Token { pub fn range(&self) -> core::ops::Range { self.start as usize..self.end as usize } } macro_rules! gen_token_kind { ($( #[$atts:meta])* $vis:vis enum $name:ident { #[patterns] $( $pattern:ident, )* #[keywords] $( $keyword:ident = $keyword_lit:literal, )* #[punkt] $( $punkt:ident = $punkt_lit:literal, )* #[ops] $( #[$prec:ident] $( $op:ident = $op_lit:literal $(=> $assign:ident)?, )* )* } ) => { impl core::fmt::Display for $name { fn fmt(&self, f: &mut core::fmt::Formatter) -> core::fmt::Result { f.write_str(self.name()) } } impl $name { pub fn name(&self) -> &str { let sf = unsafe { &*(self as *const _ as *const u8) } ; match *self { $( Self::$pattern => concat!('<', stringify!($pattern), '>'), )* $( Self::$keyword => stringify!($keyword_lit), )* $( Self::$punkt => stringify!($punkt_lit), )* $($( Self::$op => $op_lit, $(Self::$assign => concat!($op_lit, "="),)?)*)* _ => unsafe { core::str::from_utf8_unchecked(core::slice::from_ref(&sf)) }, } } #[inline(always)] pub fn precedence(&self) -> Option { Some(match self { $($(Self::$op => ${ignore($prec)} ${index(1)}, $(Self::$assign => 0,)?)*)* _ => return None, } + 1) } #[inline(always)] fn from_ident(ident: &[u8]) -> Self { match ident { $($keyword_lit => Self::$keyword,)* _ => Self::Ident, } } } }; } #[derive(Debug, PartialEq, Eq, Clone, Copy, Hash, PartialOrd, Ord)] #[repr(u8)] pub enum TokenKind { Not = b'!', DQuote = b'"', Pound = b'#', CtIdent = b'$', Mod = b'%', Band = b'&', Quote = b'\'', LParen = b'(', RParen = b')', Mul = b'*', Add = b'+', Comma = b',', Sub = b'-', Dot = b'.', Div = b'/', // Unused = 2-6 Shl = b'<' - 5, // Unused = 8 Shr = b'>' - 5, Colon = b':', Semi = b';', Lt = b'<', Assign = b'=', Gt = b'>', Que = b'?', Directive = b'@', Comment, Ident, Number, Eof, Ct, Return, If, Else, Loop, Break, Continue, Fn, Struct, Packed, True, False, Idk, Ctor, Tupl, Or, And, // Unused = R-Z LBrack = b'[', BSlash = b'\\', RBrack = b']', Xor = b'^', Tick = b'`', // Unused = a-z LBrace = b'{', Bor = b'|', RBrace = b'}', Tilde = b'~', Decl = b':' + 128, Eq = b'=' + 128, Ne = b'!' + 128, Le = b'<' + 128, Ge = b'>' + 128, BorAss = b'|' + 128, AddAss = b'+' + 128, SubAss = b'-' + 128, MulAss = b'*' + 128, DivAss = b'/' + 128, ModAss = b'%' + 128, XorAss = b'^' + 128, BandAss = b'&' + 128, ShrAss = b'>' - 5 + 128, ShlAss = b'<' - 5 + 128, } impl TokenKind { #[allow(clippy::type_complexity)] pub fn cond_op(self, signed: bool) -> Option<(fn(u8, u8, i16) -> EncodedInstr, bool)> { Some(( match self { Self::Le if signed => instrs::jgts, Self::Le => instrs::jgtu, Self::Lt if signed => instrs::jlts, Self::Lt => instrs::jltu, Self::Ge if signed => instrs::jlts, Self::Ge => instrs::jltu, Self::Gt if signed => instrs::jgts, Self::Gt => instrs::jgtu, Self::Eq => instrs::jne, Self::Ne => instrs::jeq, _ => return None, }, matches!(self, Self::Lt | TokenKind::Gt), )) } pub fn binop(self, signed: bool, size: u32) -> Option EncodedInstr> { use instrs::*; macro_rules! div { ($($op:ident),*) => {[$(|a, b, c| $op(a, 0, b, c)),*]}; } macro_rules! rem { ($($op:ident),*) => {[$(|a, b, c| $op(0, a, b, c)),*]}; } let ops = match self { Self::Add => [add8, add16, add32, add64], Self::Sub => [sub8, sub16, sub32, sub64], Self::Mul => [mul8, mul16, mul32, mul64], Self::Div if signed => div!(dirs8, dirs16, dirs32, dirs64), Self::Div => div!(diru8, diru16, diru32, diru64), Self::Mod if signed => rem!(dirs8, dirs16, dirs32, dirs64), Self::Mod => rem!(diru8, diru16, diru32, diru64), Self::Band => return Some(and), Self::Bor => return Some(or), Self::Xor => return Some(xor), Self::Shl => [slu8, slu16, slu32, slu64], Self::Shr if signed => [srs8, srs16, srs32, srs64], Self::Shr => [sru8, sru16, sru32, sru64], _ => return None, }; Some(ops[size.ilog2() as usize]) } #[allow(clippy::type_complexity)] pub fn imm_binop(self, signed: bool, size: u32) -> Option EncodedInstr> { use instrs::*; macro_rules! def_op { ($name:ident |$a:ident, $b:ident, $c:ident| $($tt:tt)*) => { macro_rules! $name { ($$($$op:ident),*) => { [$$( |$a, $b, $c: u64| $$op($($tt)*), )*] } } }; } def_op!(basic_op | a, b, c | a, b, c as _); def_op!(sub_op | a, b, c | a, b, c.wrapping_neg() as _); let ops = match self { Self::Add => basic_op!(addi8, addi16, addi32, addi64), Self::Sub => sub_op!(addi8, addi16, addi32, addi64), Self::Mul => basic_op!(muli8, muli16, muli32, muli64), Self::Band => return Some(andi), Self::Bor => return Some(ori), Self::Xor => return Some(xori), Self::Shr if signed => basic_op!(srui8, srui16, srui32, srui64), Self::Shr => basic_op!(srui8, srui16, srui32, srui64), Self::Shl => basic_op!(slui8, slui16, slui32, slui64), _ => return None, }; Some(ops[size.ilog2() as usize]) } pub fn ass_op(self) -> Option { let id = (self as u8).saturating_sub(128); if ascii_mask(b"|+-*/%^&79") & (1u128 << id) == 0 { return None; } Some(unsafe { core::mem::transmute::(id) }) } pub fn is_comutative(self) -> bool { use TokenKind as S; matches!(self, S::Eq | S::Ne | S::Bor | S::Xor | S::Band | S::Add | S::Mul) } pub fn apply_binop(self, a: i64, b: i64) -> i64 { match self { Self::Add => a.wrapping_add(b), Self::Sub => a.wrapping_sub(b), Self::Mul => a.wrapping_mul(b), Self::Div => a.wrapping_div(b), Self::Shl => a.wrapping_shl(b as _), Self::Eq => (a == b) as i64, Self::Ne => (a != b) as i64, Self::Band => a & b, s => todo!("{s}"), } } pub fn is_homogenous(&self) -> bool { self.precedence() != Self::Eq.precedence() && self.precedence() != Self::Gt.precedence() && self.precedence() != Self::Eof.precedence() } pub fn unop(&self) -> Option EncodedInstr> { Some(match self { Self::Sub => instrs::neg, _ => return None, }) } pub fn apply_unop(&self, value: i64) -> i64 { match self { Self::Sub => value.wrapping_neg(), s => todo!("{s}"), } } } gen_token_kind! { pub enum TokenKind { #[patterns] CtIdent, Ident, Number, Eof, Directive, #[keywords] Return = b"return", If = b"if", Else = b"else", Loop = b"loop", Break = b"break", Continue = b"continue", Fn = b"fn", Struct = b"struct", Packed = b"packed", True = b"true", False = b"false", Idk = b"idk", #[punkt] Ctor = ".{", Tupl = ".(", // #define OP: each `#[prec]` delimeters a level of precedence from lowest to highest #[ops] #[prec] // this also includess all `=` tokens Decl = ":=", Assign = "=", #[prec] Or = "||", #[prec] And = "&&", #[prec] Bor = "|" => BorAss, #[prec] Xor = "^" => XorAss, #[prec] Band = "&" => BandAss, #[prec] Eq = "==", Ne = "!=", #[prec] Le = "<=", Ge = ">=", Lt = "<", Gt = ">", #[prec] Shl = "<<" => ShlAss, Shr = ">>" => ShrAss, #[prec] Add = "+" => AddAss, Sub = "-" => SubAss, #[prec] Mul = "*" => MulAss, Div = "/" => DivAss, Mod = "%" => ModAss, } } pub struct Lexer<'a> { pos: u32, bytes: &'a [u8], } impl<'a> Lexer<'a> { pub fn new(input: &'a str) -> Self { Self::restore(input, 0) } pub fn restore(input: &'a str, pos: u32) -> Self { Self { pos, bytes: input.as_bytes() } } pub fn source(&self) -> &'a str { unsafe { core::str::from_utf8_unchecked(self.bytes) } } pub fn slice(&self, tok: core::ops::Range) -> &'a str { unsafe { core::str::from_utf8_unchecked(&self.bytes[tok]) } } fn peek(&self) -> Option { if core::intrinsics::unlikely(self.pos >= self.bytes.len() as u32) { None } else { Some(unsafe { *self.bytes.get_unchecked(self.pos as usize) }) } } fn advance(&mut self) -> Option { let c = self.peek()?; self.pos += 1; Some(c) } pub fn last(&mut self) -> Token { let mut token = self.next(); loop { let next = self.next(); if next.kind == TokenKind::Eof { break; } token = next; } token } pub fn next(&mut self) -> Token { use TokenKind as T; loop { let mut start = self.pos; let Some(c) = self.advance() else { return Token { kind: T::Eof, start, end: self.pos }; }; let advance_ident = |s: &mut Self| { while let Some(b'a'..=b'z' | b'A'..=b'Z' | b'0'..=b'9' | b'_' | 127..) = s.peek() { s.advance(); } }; let identity = |s: u8| unsafe { core::mem::transmute::(s) }; let kind = match c { ..=b' ' => continue, b'0' if self.advance_if(b'x') => { while let Some(b'0'..=b'9' | b'A'..=b'F' | b'a'..=b'f') = self.peek() { self.advance(); } T::Number } b'0' if self.advance_if(b'b') => { while let Some(b'0' | b'1') = self.peek() { self.advance(); } T::Number } b'0' if self.advance_if(b'o') => { while let Some(b'0'..=b'7') = self.peek() { self.advance(); } T::Number } b'0'..=b'9' => { while let Some(b'0'..=b'9') = self.peek() { self.advance(); } T::Number } b'a'..=b'z' | b'A'..=b'Z' | b'_' | 127.. => { advance_ident(self); let ident = &self.bytes[start as usize..self.pos as usize]; T::from_ident(ident) } b'"' | b'\'' => loop { match self.advance() { Some(b'\\') => _ = self.advance(), Some(nc) if nc == c => break identity(c), Some(_) => {} None => break T::Eof, } }, b'/' if self.advance_if(b'/') => { while let Some(l) = self.advance() && l != b'\n' {} T::Comment } b'/' if self.advance_if(b'*') => { let mut depth = 1; while let Some(l) = self.advance() { match l { b'/' if self.advance_if(b'*') => depth += 1, b'*' if self.advance_if(b'/') => match depth { 1 => break, _ => depth -= 1, }, _ => {} } } T::Comment } b'.' if self.advance_if(b'{') => T::Ctor, b'.' if self.advance_if(b'(') => T::Tupl, b'&' if self.advance_if(b'&') => T::And, b'|' if self.advance_if(b'|') => T::Or, b'$' if self.advance_if(b':') => T::Ct, b'@' | b'$' => { start += 1; advance_ident(self); identity(c) } b'<' | b'>' if self.advance_if(c) => { identity(c - 5 + 128 * self.advance_if(b'=') as u8) } b':' | b'=' | b'!' | b'<' | b'>' | b'|' | b'+' | b'-' | b'*' | b'/' | b'%' | b'^' | b'&' if self.advance_if(b'=') => { identity(c + 128) } _ => identity(c), }; return Token { kind, start, end: self.pos }; } } fn advance_if(&mut self, arg: u8) -> bool { if self.peek() == Some(arg) { self.advance(); true } else { false } } } pub fn line_col(bytes: &[u8], pos: u32) -> (usize, usize) { bytes[..pos as usize] .split(|&b| b == b'\n') .map(<[u8]>::len) .enumerate() .last() .map(|(line, col)| (line + 1, col + 1)) .unwrap_or((1, 1)) }