use { crate::{ codegen, ident::{self, Ident}, lexer::{self, Lexer, LineMap, Token, TokenKind}, log, }, std::{ cell::{Cell, UnsafeCell}, io, ops::{Deref, Not}, ptr::NonNull, sync::atomic::AtomicUsize, }, }; pub type Pos = u32; pub type IdentFlags = u32; pub type Symbols = Vec; pub type FileId = u32; pub type IdentIndex = u16; pub type Loader<'a> = &'a (dyn Fn(&str, &str) -> io::Result + 'a); pub mod idfl { use super::*; macro_rules! flags { ($($name:ident,)*) => { $(pub const $name: IdentFlags = 1 << (std::mem::size_of::() * 8 - 1 - ${index(0)});)* pub const ALL: IdentFlags = 0 $(| $name)*; }; } flags! { MUTABLE, REFERENCED, COMPTIME, } pub fn index(i: IdentFlags) -> IdentIndex { (i & !ALL) as _ } } pub fn no_loader(_: &str, _: &str) -> io::Result { Err(io::ErrorKind::NotFound.into()) } #[derive(Debug)] pub struct Symbol { pub name: Ident, pub flags: IdentFlags, } #[derive(Clone, Copy)] struct ScopeIdent { ident: Ident, declared: bool, flags: IdentFlags, } pub struct Parser<'a, 'b> { path: &'b str, loader: Loader<'b>, lexer: Lexer<'b>, arena: &'b Arena<'a>, token: Token, symbols: &'b mut Symbols, ns_bound: usize, trailing_sep: bool, idents: Vec, captured: Vec, } impl<'a, 'b> Parser<'a, 'b> { pub fn new(arena: &'b Arena<'a>, symbols: &'b mut Symbols, loader: Loader<'b>) -> Self { let mut lexer = Lexer::new(""); Self { loader, token: lexer.next(), lexer, path: "", arena, symbols, ns_bound: 0, trailing_sep: false, idents: Vec::new(), captured: Vec::new(), } } pub fn file(&mut self, input: &'b str, path: &'b str) -> &'a [Expr<'a>] { self.path = path; self.lexer = Lexer::new(input); self.token = self.lexer.next(); let f = self.collect_list(TokenKind::Semi, TokenKind::Eof, |s| s.expr_low(true)); self.pop_scope(0); let has_undeclared = !self.idents.is_empty(); for id in self.idents.drain(..) { let (line, col) = self.lexer.line_col(ident::pos(id.ident)); eprintln!( "{}:{}:{} => undeclared identifier: {}", self.path, line, col, self.lexer.slice(ident::range(id.ident)) ); } if has_undeclared { // TODO: we need error recovery unreachable!(); } f } fn next(&mut self) -> Token { std::mem::replace(&mut self.token, self.lexer.next()) } fn ptr_expr(&mut self) -> &'a Expr<'a> { self.arena.alloc(self.expr()) } fn expr_low(&mut self, top_level: bool) -> Expr<'a> { let left = self.unit_expr(); self.bin_expr(left, 0, top_level) } fn expr(&mut self) -> Expr<'a> { self.expr_low(false) } fn bin_expr(&mut self, mut fold: Expr<'a>, min_prec: u8, top_level: bool) -> Expr<'a> { loop { let Some(prec) = self.token.kind.precedence() else { break; }; if prec <= min_prec { break; } let checkpoint = self.token.start; let op = self.next().kind; if op == TokenKind::Decl { self.declare_rec(&fold, top_level); } let op_ass = op.ass_op().map(|op| { // this abomination reparses the left side, so that the desubaring adheres to the // parser invariants. let source = self.lexer.slice(0..checkpoint as usize); let prev_lexer = std::mem::replace(&mut self.lexer, Lexer::restore(source, fold.pos())); let prev_token = std::mem::replace(&mut self.token, self.lexer.next()); let clone = self.expr(); self.lexer = prev_lexer; self.token = prev_token; (op, clone) }); let right = self.unit_expr(); let right = self.bin_expr(right, prec, false); let right = self.arena.alloc(right); let left = self.arena.alloc(fold); if let Some((op, clone)) = op_ass { self.flag_idents(*left, idfl::MUTABLE); let right = Expr::BinOp { left: self.arena.alloc(clone), op, right }; fold = Expr::BinOp { left, op: TokenKind::Assign, right: self.arena.alloc(right) }; } else { fold = Expr::BinOp { left, right, op }; if op == TokenKind::Assign { self.flag_idents(*left, idfl::MUTABLE); } } } fold } fn declare_rec(&mut self, expr: &Expr, top_level: bool) { let idx = |idx| top_level.not().then_some(idx); match *expr { Expr::Ident { pos, id, index, .. } => self.declare(pos, id, idx(index)), Expr::Ctor { fields, .. } => { for CtorField { value, .. } in fields { self.declare_rec(value, top_level) } } _ => self.report_pos(expr.pos(), "cant declare this shit (yet)"), } } fn declare(&mut self, pos: Pos, id: Ident, index_to_check: Option) { if let Some(index) = index_to_check && index != 0 { self.report_pos( pos, format_args!( "out of order declaration not allowed: {}", self.lexer.slice(ident::range(id)) ), ); } let index = self.idents.binary_search_by_key(&id, |s| s.ident).expect("fck up"); if std::mem::replace(&mut self.idents[index].declared, true) { self.report_pos( pos, format_args!("redeclaration of identifier: {}", self.lexer.slice(ident::range(id))), ) } } fn resolve_ident(&mut self, token: Token) -> (Ident, IdentIndex) { let is_ct = token.kind == TokenKind::CtIdent; let name = self.lexer.slice(token.range()); if let Some(builtin) = codegen::ty::from_str(name) { return (builtin, 0); } let (i, id) = match self .idents .iter_mut() .enumerate() .rfind(|(_, elem)| self.lexer.slice(ident::range(elem.ident)) == name) { Some((i, elem)) => { elem.flags += 1; (i, elem) } None => { let id = ident::new(token.start, name.len() as _); self.idents.push(ScopeIdent { ident: id, declared: false, flags: 0 }); (self.idents.len() - 1, self.idents.last_mut().unwrap()) } }; id.flags |= idfl::COMPTIME * is_ct as u32; if id.declared && self.ns_bound > i { id.flags |= idfl::COMPTIME; self.captured.push(id.ident); } (id.ident, idfl::index(id.flags)) } fn move_str(&mut self, range: Token) -> &'a str { self.arena.alloc_str(self.lexer.slice(range.range())) } fn unit_expr(&mut self) -> Expr<'a> { use {Expr as E, TokenKind as T}; let frame = self.idents.len(); let token = self.next(); let prev_boundary = self.ns_bound; let prev_captured = self.captured.len(); let mut expr = match token.kind { T::Ct => E::Ct { pos: token.start, value: self.ptr_expr() }, T::Directive if self.lexer.slice(token.range()) == "use" => { self.expect_advance(TokenKind::LParen); let str = self.expect_advance(TokenKind::DQuote); self.expect_advance(TokenKind::RParen); let path = self.lexer.slice(str.range()).trim_matches('"'); E::Mod { pos: token.start, path: self.arena.alloc_str(path), id: match (self.loader)(path, self.path) { Ok(id) => id, Err(e) => self.report(format_args!("error loading dependency: {e:#}")), }, } } T::Directive => E::Directive { pos: token.start, name: self.move_str(token), args: { self.expect_advance(T::LParen); self.collect_list(T::Comma, T::RParen, Self::expr) }, }, T::True => E::Bool { pos: token.start, value: true }, T::DQuote => E::String { pos: token.start, literal: self.move_str(token) }, T::Struct => E::Struct { fields: { self.ns_bound = self.idents.len(); self.expect_advance(T::LBrace); self.collect_list(T::Comma, T::RBrace, |s| { let name = s.expect_advance(T::Ident); s.expect_advance(T::Colon); (s.move_str(name), s.expr()) }) }, captured: { self.ns_bound = prev_boundary; self.captured[prev_captured..].sort_unstable(); let preserved = self.captured[prev_captured..].partition_dedup().0.len(); self.captured.truncate(prev_captured + preserved); self.arena.alloc_slice(&self.captured[prev_captured..]) }, pos: { if self.ns_bound == 0 { // we might save some memory self.captured.clear(); } token.start }, }, T::Ident | T::CtIdent => { let (id, index) = self.resolve_ident(token); let name = self.move_str(token); E::Ident { pos: token.start, name, id, index } } T::If => E::If { pos: token.start, cond: self.ptr_expr(), then: self.ptr_expr(), else_: self.advance_if(T::Else).then(|| self.ptr_expr()), }, T::Loop => E::Loop { pos: token.start, body: self.ptr_expr() }, T::Break => E::Break { pos: token.start }, T::Continue => E::Continue { pos: token.start }, T::Return => E::Return { pos: token.start, val: (!matches!( self.token.kind, T::Semi | T::RBrace | T::RBrack | T::RParen | T::Comma )) .then(|| self.ptr_expr()), }, T::Fn => E::Closure { pos: token.start, args: { self.expect_advance(T::LParen); self.collect_list(T::Comma, T::RParen, |s| { let name = s.advance_ident(); let (id, index) = s.resolve_ident(name); s.declare(name.start, id, None); s.expect_advance(T::Colon); Arg { name: s.move_str(name), id, index, ty: s.expr() } }) }, ret: { self.expect_advance(T::Colon); self.ptr_expr() }, body: self.ptr_expr(), }, T::Ctor => self.ctor(token.start, None), T::Tupl => self.tupl(token.start, None), T::LBrack => E::Slice { item: self.ptr_unit_expr(), size: self.advance_if(T::Semi).then(|| self.ptr_expr()), pos: { self.expect_advance(T::RBrack); token.start }, }, T::Band | T::Mul | T::Xor => E::UnOp { pos: token.start, op: token.kind, val: { let expr = self.ptr_unit_expr(); if token.kind == T::Band { self.flag_idents(*expr, idfl::REFERENCED); } expr }, }, T::LBrace => E::Block { pos: token.start, stmts: self.collect_list(T::Semi, T::RBrace, Self::expr), }, T::Number => E::Number { pos: token.start, value: match self.lexer.slice(token.range()).parse() { Ok(value) => value, Err(e) => self.report(format_args!("invalid number: {e}")), }, }, T::LParen => { let expr = self.expr(); self.expect_advance(T::RParen); expr } T::Comment => Expr::Comment { pos: token.start, literal: self.move_str(token) }, tok => self.report(format_args!("unexpected token: {tok:?}")), }; loop { let token = self.token; if matches!(token.kind, T::LParen | T::Ctor | T::Dot | T::Tupl | T::LBrack) { self.next(); } expr = match token.kind { T::LParen => Expr::Call { func: self.arena.alloc(expr), args: self.collect_list(T::Comma, T::RParen, Self::expr), trailing_comma: std::mem::take(&mut self.trailing_sep), }, T::Ctor => self.ctor(token.start, Some(expr)), T::Tupl => self.tupl(token.start, Some(expr)), T::LBrack => E::Index { base: self.arena.alloc(expr), index: { let index = self.expr(); self.expect_advance(T::RBrack); self.arena.alloc(index) }, }, T::Dot => E::Field { target: self.arena.alloc(expr), name: { let token = self.expect_advance(T::Ident); self.move_str(token) }, }, _ => break, } } if matches!(token.kind, T::Loop | T::LBrace | T::Fn) { self.pop_scope(frame); } expr } fn tupl(&mut self, pos: Pos, ty: Option>) -> Expr<'a> { Expr::Tupl { pos, ty: ty.map(|ty| self.arena.alloc(ty)), fields: self.collect_list(TokenKind::Comma, TokenKind::RParen, Self::expr), trailing_comma: std::mem::take(&mut self.trailing_sep), } } fn ctor(&mut self, pos: Pos, ty: Option>) -> Expr<'a> { Expr::Ctor { pos, ty: ty.map(|ty| self.arena.alloc(ty)), fields: self.collect_list(TokenKind::Comma, TokenKind::RBrace, |s| { let name_tok = s.advance_ident(); let name = s.move_str(name_tok); CtorField { pos: name_tok.start, name, value: if s.advance_if(TokenKind::Colon) { s.expr() } else { let (id, index) = s.resolve_ident(name_tok); Expr::Ident { pos: name_tok.start, id, name, index } }, } }), trailing_comma: std::mem::take(&mut self.trailing_sep), } } fn advance_ident(&mut self) -> Token { if matches!(self.token.kind, TokenKind::Ident | TokenKind::CtIdent) { self.next() } else { self.report(format_args!("expected identifier, found {:?}", self.token.kind)) } } fn pop_scope(&mut self, frame: usize) { let mut undeclared_count = frame; for i in frame..self.idents.len() { if !&self.idents[i].declared { self.idents.swap(i, undeclared_count); undeclared_count += 1; } } self.idents .drain(undeclared_count..) .map(|ident| Symbol { name: ident.ident, flags: ident.flags }) .collect_into(self.symbols); } fn ptr_unit_expr(&mut self) -> &'a Expr<'a> { self.arena.alloc(self.unit_expr()) } fn collect_list( &mut self, delim: TokenKind, end: TokenKind, mut f: impl FnMut(&mut Self) -> T, ) -> &'a [T] { self.collect(|s| { s.advance_if(end).not().then(|| { let val = f(s); s.trailing_sep = s.advance_if(delim); val }) }) } fn collect(&mut self, mut f: impl FnMut(&mut Self) -> Option) -> &'a [T] { // TODO: avoid this allocation let vec = std::iter::from_fn(|| f(self)).collect::>(); self.arena.alloc_slice(&vec) } fn advance_if(&mut self, kind: TokenKind) -> bool { if self.token.kind == kind { self.next(); true } else { false } } fn expect_advance(&mut self, kind: TokenKind) -> Token { if self.token.kind != kind { self.report(format_args!("expected {:?}, found {:?}", kind, self.token.kind)); } self.next() } #[track_caller] fn report(&self, msg: impl std::fmt::Display) -> ! { self.report_pos(self.token.start, msg) } #[track_caller] fn report_pos(&self, pos: Pos, msg: impl std::fmt::Display) -> ! { let (line, col) = self.lexer.line_col(pos); eprintln!("{}:{}:{} => {}", self.path, line, col, msg); unreachable!(); } fn flag_idents(&mut self, e: Expr<'a>, flags: IdentFlags) { match e { Expr::Ident { id, .. } => find_ident(&mut self.idents, id).flags |= flags, Expr::Field { target, .. } => self.flag_idents(*target, flags), _ => {} } } } fn find_ident(idents: &mut [ScopeIdent], id: Ident) -> &mut ScopeIdent { idents.binary_search_by_key(&id, |si| si.ident).map(|i| &mut idents[i]).unwrap() } pub fn find_symbol(symbols: &[Symbol], id: Ident) -> &Symbol { symbols.binary_search_by_key(&id, |s| s.name).map(|i| &symbols[i]).unwrap() } #[derive(Debug, Clone, Copy, PartialEq, Eq)] pub struct Arg<'a> { pub name: &'a str, pub id: Ident, pub index: IdentIndex, pub ty: Expr<'a>, } macro_rules! generate_expr { ($(#[$meta:meta])* $vis:vis enum $name:ident<$lt:lifetime> {$( $(#[$field_meta:meta])* $variant:ident { $($field:ident: $ty:ty,)* }, )*}) => { #[derive(Debug, Clone, Copy, PartialEq, Eq)] $vis enum $name<$lt> {$( $variant { $($field: $ty,)* }, )*} impl<$lt> $name<$lt> { pub fn pos(&self) -> Pos { #[allow(unused_variables)] match self { $(Self::$variant { $($field),* } => generate_expr!(@first $(($field),)*).posi(),)* } } pub fn used_bytes(&self) -> usize { match self {$( Self::$variant { $($field,)* } => { #[allow(clippy::size_of_ref)] let fields = [$(($field as *const _ as usize - self as *const _ as usize, std::mem::size_of_val($field)),)*]; let (last, size) = fields.iter().copied().max().unwrap(); last + size }, )*} } } }; (@first ($($first:tt)*), $($rest:tt)*) => { $($first)* }; (@last ($($ign:tt)*), $($rest:tt)*) => { $($rest)* }; (@last ($($last:tt)*),) => { $($last)* }; } // it would be real nice if we could use relative pointers and still pattern match easily generate_expr! { #[derive(Debug, Clone, Copy, PartialEq, Eq)] pub enum Expr<'a> { Ct { pos: Pos, value: &'a Expr<'a>, }, String { pos: Pos, literal: &'a str, }, Comment { pos: Pos, literal: &'a str, }, Break { pos: Pos, }, Continue { pos: Pos, }, Closure { pos: Pos, args: &'a [Arg<'a>], ret: &'a Self, body: &'a Self, }, Call { func: &'a Self, args: &'a [Self], trailing_comma: bool, }, Return { pos: Pos, val: Option<&'a Self>, }, Ident { pos: Pos, id: Ident, name: &'a str, index: IdentIndex, }, Block { pos: Pos, stmts: &'a [Self], }, Number { pos: Pos, value: u64, }, BinOp { left: &'a Self, op: TokenKind, right: &'a Self, }, If { pos: Pos, cond: &'a Self, then: &'a Self, else_: Option<&'a Self>, }, Loop { pos: Pos, body: &'a Self, }, UnOp { pos: Pos, op: TokenKind, val: &'a Self, }, Struct { pos: Pos, fields: &'a [(&'a str, Self)], captured: &'a [Ident], }, Ctor { pos: Pos, ty: Option<&'a Self>, fields: &'a [CtorField<'a>], trailing_comma: bool, }, Tupl { pos: Pos, ty: Option<&'a Self>, fields: &'a [Self], trailing_comma: bool, }, Slice { pos: Pos, size: Option<&'a Self>, item: &'a Self, }, Index { base: &'a Self, index: &'a Self, }, Field { target: &'a Self, name: &'a str, }, Bool { pos: Pos, value: bool, }, Directive { pos: u32, name: &'a str, args: &'a [Self], }, Mod { pos: Pos, id: FileId, path: &'a str, }, } } impl<'a> Expr<'a> { pub fn declares(&self, iden: Result) -> Option { match *self { Self::Ident { id, name, .. } if iden == Ok(id) || iden == Err(name) => Some(id), Self::Ctor { fields, .. } => fields.iter().find_map(|f| f.value.declares(iden)), _ => None, } } pub fn has_ct(&self, symbols: &[Symbol]) -> bool { match *self { Self::Ident { id, .. } => find_symbol(symbols, id).flags & idfl::COMPTIME != 0, Self::Ctor { fields, .. } => fields.iter().any(|f| f.value.has_ct(symbols)), _ => false, } } pub fn find_pattern_path( &self, ident: Ident, target: &Expr, mut with_final: F, ) -> Result<(), F> { match *self { Self::Ident { id, .. } if id == ident => { with_final(target); Ok(()) } Self::Ctor { fields, .. } => { for CtorField { name, value, .. } in fields { match value.find_pattern_path(ident, &Expr::Field { target, name }, with_final) { Ok(()) => return Ok(()), Err(e) => with_final = e, } } Err(with_final) } _ => Err(with_final), } } } #[derive(Debug, Clone, Copy, PartialEq, Eq)] pub struct CtorField<'a> { pub pos: Pos, pub name: &'a str, pub value: Expr<'a>, } trait Poser { fn posi(self) -> Pos; } impl Poser for Pos { fn posi(self) -> Pos { self } } impl<'a> Poser for &Expr<'a> { fn posi(self) -> Pos { self.pos() } } thread_local! { static FMT_SOURCE: Cell<*const str> = const { Cell::new("") }; } pub fn with_fmt_source(source: &str, f: impl FnOnce() -> T) -> T { FMT_SOURCE.with(|s| s.set(source)); let r = f(); FMT_SOURCE.with(|s| s.set("")); r } impl<'a> std::fmt::Display for Expr<'a> { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { thread_local! { static INDENT: Cell = const { Cell::new(0) }; } fn fmt_list( f: &mut std::fmt::Formatter, trailing: bool, end: &str, list: &[T], fmt: impl Fn(&T, &mut std::fmt::Formatter) -> std::fmt::Result, ) -> std::fmt::Result { if !trailing { let first = &mut true; for expr in list { if !std::mem::take(first) { write!(f, ", ")?; } fmt(expr, f)?; } return write!(f, "{end}"); } writeln!(f)?; INDENT.with(|i| i.set(i.get() + 1)); let res = (|| { for stmt in list { for _ in 0..INDENT.with(|i| i.get()) { write!(f, "\t")?; } fmt(stmt, f)?; writeln!(f, ",")?; } Ok(()) })(); INDENT.with(|i| i.set(i.get() - 1)); for _ in 0..INDENT.with(|i| i.get()) { write!(f, "\t")?; } write!(f, "{end}")?; res } macro_rules! impl_parenter { ($($name:ident => $pat:pat,)*) => { $( struct $name<'a>(&'a Expr<'a>); impl<'a> std::fmt::Display for $name<'a> { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { if matches!(self.0, $pat) { write!(f, "({})", self.0) } else { write!(f, "{}", self.0) } } } )* }; } impl_parenter! { Unary => Expr::BinOp { .. }, Postfix => Expr::UnOp { .. } | Expr::BinOp { .. }, Consecutive => Expr::UnOp { .. }, } let source = unsafe { &*FMT_SOURCE.with(|s| s.get()) }; { let pos = self.pos(); if let Some(before) = source.get(..pos as usize) { let trailing_whitespace = &before[before.trim_end().len()..]; let ncount = trailing_whitespace.chars().filter(|&c| c == '\n').count(); if ncount > 1 { writeln!(f)?; } } } match *self { Self::Ct { value, .. } => write!(f, "$: {}", value), Self::String { literal, .. } => write!(f, "{}", literal), Self::Comment { literal, .. } => write!(f, "{}", literal.trim_end()), Self::Mod { path, .. } => write!(f, "@use(\"{path}\")"), Self::Field { target, name: field } => write!(f, "{}.{field}", Postfix(target)), Self::Directive { name, args, .. } => { write!(f, "@{name}(")?; fmt_list(f, false, ")", args, std::fmt::Display::fmt) } Self::Struct { fields, .. } => { write!(f, "struct {{")?; fmt_list(f, true, "}", fields, |(name, val), f| write!(f, "{name}: {val}",)) } Self::Ctor { ty, fields, trailing_comma, .. } => { if let Some(ty) = ty { write!(f, "{}", Unary(ty))?; } write!(f, ".{{")?; let fmt_field = |CtorField { name, value, .. }: &_, f: &mut std::fmt::Formatter| { if matches!(value, Expr::Ident { name: n, .. } if name == n) { write!(f, "{name}") } else { write!(f, "{name}: {value}") } }; fmt_list(f, trailing_comma, "}", fields, fmt_field) } Self::Tupl { ty, fields, trailing_comma, .. } => { if let Some(ty) = ty { write!(f, "{}", Unary(ty))?; } write!(f, ".(")?; fmt_list(f, trailing_comma, ")", fields, std::fmt::Display::fmt) } Self::Slice { item, size, .. } => match size { Some(size) => write!(f, "[{size}]{item}"), None => write!(f, "[]{item}"), }, Self::Index { base, index } => write!(f, "{base}[{index}]"), Self::UnOp { op, val, .. } => write!(f, "{op}{}", Unary(val)), Self::Break { .. } => write!(f, "break"), Self::Continue { .. } => write!(f, "continue"), Self::If { cond, then, else_, .. } => { write!(f, "if {cond} {}", Consecutive(then))?; if let Some(else_) = else_ { write!(f, " else {else_}")?; } Ok(()) } Self::Loop { body, .. } => write!(f, "loop {body}"), Self::Closure { ret, body, args, .. } => { write!(f, "fn(")?; fmt_list(f, false, "", args, |arg, f| write!(f, "{}: {}", arg.name, arg.ty))?; write!(f, "): {ret} {body}")?; Ok(()) } Self::Call { func, args, trailing_comma } => { write!(f, "{}(", Postfix(func))?; fmt_list(f, trailing_comma, ")", args, std::fmt::Display::fmt) } Self::Return { val: Some(val), .. } => write!(f, "return {val}"), Self::Return { val: None, .. } => write!(f, "return"), Self::Ident { name, .. } => write!(f, "{name}"), Self::Block { stmts, .. } => { write!(f, "{{")?; writeln!(f)?; INDENT.with(|i| i.set(i.get() + 1)); let res = (|| { for (i, stmt) in stmts.iter().enumerate() { for _ in 0..INDENT.with(|i| i.get()) { write!(f, "\t")?; } write!(f, "{stmt}")?; if let Some(expr) = stmts.get(i + 1) && let Some(rest) = source.get(expr.pos() as usize..) && insert_needed_semicolon(rest) { write!(f, ";")?; } writeln!(f)?; } Ok(()) })(); INDENT.with(|i| i.set(i.get() - 1)); for _ in 0..INDENT.with(|i| i.get()) { write!(f, "\t")?; } write!(f, "}}")?; res } Self::Number { value, .. } => write!(f, "{value}"), Self::Bool { value, .. } => write!(f, "{value}"), Self::BinOp { left: left @ Self::Ident { id, .. }, op: TokenKind::Assign, right: Self::BinOp { left: Self::Ident { id: oid, .. }, op, right }, } if id == oid => { write!(f, "{left} {op}= {right}") } Self::BinOp { left, right, op } => { let display_branch = |f: &mut std::fmt::Formatter, expr: &Self| { if let Self::BinOp { op: lop, .. } = expr && op.precedence() > lop.precedence() { write!(f, "({expr})") } else { write!(f, "{expr}") } }; display_branch(f, left)?; write!(f, " {op} ")?; display_branch(f, right) } } } } pub fn insert_needed_semicolon(source: &str) -> bool { let kind = lexer::Lexer::new(source).next().kind; kind.precedence().is_some() || matches!(kind, TokenKind::Ctor | TokenKind::Tupl) } #[repr(C)] pub struct AstInner { ref_count: AtomicUsize, mem: ArenaChunk, exprs: *const [Expr<'static>], pub path: Box, pub nlines: LineMap, pub symbols: T, } impl AstInner<[Symbol]> { fn layout(syms: usize) -> std::alloc::Layout { std::alloc::Layout::new::>() .extend(std::alloc::Layout::array::(syms).unwrap()) .unwrap() .0 } fn new(content: &str, path: &str, loader: Loader) -> NonNull { let arena = Arena::default(); let mut syms = Vec::new(); let mut parser = Parser::new(&arena, &mut syms, loader); let exprs = parser.file(content, path) as *const [Expr<'static>]; syms.sort_unstable_by_key(|s| s.name); let layout = Self::layout(syms.len()); unsafe { let ptr = std::alloc::alloc(layout); let inner: *mut Self = std::ptr::from_raw_parts_mut(ptr as *mut _, syms.len()); std::ptr::write(inner as *mut AstInner<()>, AstInner { ref_count: AtomicUsize::new(1), mem: arena.chunk.into_inner(), exprs, path: path.into(), nlines: LineMap::new(content), symbols: (), }); std::ptr::addr_of_mut!((*inner).symbols) .as_mut_ptr() .copy_from_nonoverlapping(syms.as_ptr(), syms.len()); NonNull::new_unchecked(inner) } } } #[derive(PartialEq, Eq, Hash)] pub struct Ast(NonNull>); impl Ast { pub fn new(path: &str, content: &str, loader: Loader) -> Self { Self(AstInner::new(content, path, loader)) } pub fn exprs(&self) -> &[Expr] { unsafe { &*self.inner().exprs } } fn inner(&self) -> &AstInner<[Symbol]> { unsafe { self.0.as_ref() } } pub fn find_decl(&self, id: Result) -> Option<(&Expr, Ident)> { self.exprs().iter().find_map(|expr| match expr { Expr::BinOp { left, op: TokenKind::Decl, .. } => left.declares(id).map(|id| (expr, id)), _ => None, }) } } impl std::fmt::Display for Ast { fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { for expr in self.exprs() { writeln!(f, "{expr}\n")?; } Ok(()) } } impl Default for Ast { fn default() -> Self { Self(AstInner::new("", "", &no_loader)) } } #[derive(Clone, Copy)] #[repr(packed)] pub struct ExprRef(NonNull>); impl ExprRef { pub fn new(expr: &Expr) -> Self { Self(NonNull::from(expr).cast()) } pub fn get<'a>(&self, from: &'a Ast) -> Option<&'a Expr<'a>> { ArenaChunk::contains(from.mem.base, self.0.as_ptr() as _).then_some(())?; // SAFETY: the pointer is or was a valid reference in the past, if it points within one of // arenas regions, it muts be walid, since arena does not give invalid pointers to its // allocations Some(unsafe { { self.0 }.as_ref() }) } } unsafe impl Send for Ast {} unsafe impl Sync for Ast {} impl Clone for Ast { fn clone(&self) -> Self { unsafe { self.0.as_ref() }.ref_count.fetch_add(1, std::sync::atomic::Ordering::Relaxed); Self(self.0) } } impl Drop for Ast { fn drop(&mut self) { let inner = unsafe { self.0.as_ref() }; if inner.ref_count.fetch_sub(1, std::sync::atomic::Ordering::Relaxed) == 1 { unsafe { std::ptr::drop_in_place(self.0.as_ptr()) }; let layout = AstInner::layout(inner.symbols.len()); unsafe { std::alloc::dealloc(self.0.as_ptr() as _, layout); } } } } impl Deref for Ast { type Target = AstInner<[Symbol]>; fn deref(&self) -> &Self::Target { self.inner() } } #[derive(Default)] pub struct Arena<'a> { chunk: UnsafeCell, ph: std::marker::PhantomData<&'a ()>, } impl<'a> Arena<'a> { pub fn alloc_str(&self, token: &str) -> &'a str { let ptr = self.alloc_slice(token.as_bytes()); unsafe { std::str::from_utf8_unchecked(ptr) } } pub fn alloc(&self, expr: Expr<'a>) -> &'a Expr<'a> { let align = std::mem::align_of::>(); let size = expr.used_bytes(); let layout = unsafe { std::alloc::Layout::from_size_align_unchecked(size, align) }; let ptr = self.alloc_low(layout); unsafe { ptr.cast::().copy_from_nonoverlapping(NonNull::from(&expr).cast(), size / 8) }; unsafe { ptr.cast::>().as_ref() } } pub fn alloc_slice(&self, slice: &[T]) -> &'a [T] { if slice.is_empty() || std::mem::size_of::() == 0 { return &mut []; } let layout = std::alloc::Layout::array::(slice.len()).unwrap(); let ptr = self.alloc_low(layout); unsafe { ptr.as_ptr().cast::().copy_from_nonoverlapping(slice.as_ptr(), slice.len()) }; unsafe { std::slice::from_raw_parts(ptr.as_ptr() as _, slice.len()) } } fn alloc_low(&self, layout: std::alloc::Layout) -> NonNull { assert!(layout.align() <= ArenaChunk::ALIGN); assert!(layout.size() <= ArenaChunk::CHUNK_SIZE); let chunk = unsafe { &mut *self.chunk.get() }; if let Some(ptr) = chunk.alloc(layout) { return ptr; } unsafe { std::ptr::write(chunk, ArenaChunk::new(chunk.base)); } chunk.alloc(layout).unwrap() } } struct ArenaChunk { base: *mut u8, end: *mut u8, } impl Default for ArenaChunk { fn default() -> Self { Self { base: std::ptr::null_mut(), end: std::ptr::null_mut() } } } impl ArenaChunk { const ALIGN: usize = std::mem::align_of::(); const CHUNK_SIZE: usize = 1 << 16; const LAYOUT: std::alloc::Layout = unsafe { std::alloc::Layout::from_size_align_unchecked(Self::CHUNK_SIZE, Self::ALIGN) }; const NEXT_OFFSET: usize = Self::CHUNK_SIZE - std::mem::size_of::<*mut u8>(); fn new(next: *mut u8) -> Self { let base = unsafe { std::alloc::alloc(Self::LAYOUT) }; let end = unsafe { base.add(Self::NEXT_OFFSET) }; Self::set_next(base, next); Self { base, end } } fn set_next(curr: *mut u8, next: *mut u8) { unsafe { std::ptr::write(curr.add(Self::NEXT_OFFSET) as *mut _, next) }; } fn next(curr: *mut u8) -> *mut u8 { unsafe { std::ptr::read(curr.add(Self::NEXT_OFFSET) as *mut _) } } fn alloc(&mut self, layout: std::alloc::Layout) -> Option> { let padding = self.end as usize - (self.end as usize & !(layout.align() - 1)); let size = layout.size() + padding; if size > self.end as usize - self.base as usize { return None; } unsafe { self.end = self.end.sub(size) }; unsafe { Some(NonNull::new_unchecked(self.end)) } } fn contains(base: *mut u8, arg: *mut u8) -> bool { !base.is_null() && ((unsafe { base.add(Self::CHUNK_SIZE) } > arg && base <= arg) || Self::contains(Self::next(base), arg)) } } impl Drop for ArenaChunk { fn drop(&mut self) { log::inf!( "dropping chunk of size: {}", (Self::LAYOUT.size() - (self.end as usize - self.base as usize)) * !self.end.is_null() as usize ); let mut current = self.base; while !current.is_null() { let next = Self::next(current); unsafe { std::alloc::dealloc(current, Self::LAYOUT) }; current = next; log::dbg!("deallocating full chunk"); } } } #[cfg(test)] mod test { fn format(ident: &str, input: &str) { let ast = super::Ast::new(ident, input, &super::no_loader); let mut output = String::new(); super::with_fmt_source(input, || { for expr in ast.exprs() { use std::fmt::Write; writeln!(output, "{expr}").unwrap(); } }); let input_path = format!("formatter_{ident}.expected"); let output_path = format!("formatter_{ident}.actual"); std::fs::write(&input_path, input).unwrap(); std::fs::write(&output_path, output).unwrap(); let success = std::process::Command::new("diff") .arg("-u") .arg("--color") .arg(&input_path) .arg(&output_path) .status() .unwrap() .success(); std::fs::remove_file(&input_path).unwrap(); std::fs::remove_file(&output_path).unwrap(); assert!(success, "test failed"); } macro_rules! test { ($($name:ident => $input:expr;)*) => {$( #[test] fn $name() { format(stringify!($name), $input); } )*}; } test! { comments => "// comment\n// comment\n\n// comment\n\n\ /* comment */\n/* comment */\n\n/* comment */\n"; some_ordinary_code => "loft := fn(): int return loft(1, 2, 3);\n"; some_arg_per_line_code => "loft := fn(): int return loft(\ \n\t1,\n\t2,\n\t3,\n);\n"; some_ordinary_struct => "loft := fn(): int return loft.{a: 1, b: 2};\n"; some_ordinary_fild_per_lin_struct => "loft := fn(): int return loft.{\ \n\ta: 1,\n\tb: 2,\n};\n"; code_block => "loft := fn(): int {\n\tloft();\n\treturn 1;\n}\n"; } }