| //! Transcriber takes a template, like `fn $ident() {}`, a set of bindings like |
| //! `$ident => foo`, interpolates variables in the template, to get `fn foo() {}` |
| |
| use syntax::SmolStr; |
| |
| use crate::{ |
| expander::{Binding, Bindings, Fragment}, |
| parser::{MetaVarKind, Op, RepeatKind, Separator}, |
| tt::{self, Delimiter}, |
| CountError, ExpandError, ExpandResult, MetaTemplate, |
| }; |
| |
| impl Bindings { |
| fn contains(&self, name: &str) -> bool { |
| self.inner.contains_key(name) |
| } |
| |
| fn get(&self, name: &str) -> Result<&Binding, ExpandError> { |
| match self.inner.get(name) { |
| Some(binding) => Ok(binding), |
| None => Err(ExpandError::binding_error(format!("could not find binding `{name}`"))), |
| } |
| } |
| |
| fn get_fragment( |
| &self, |
| name: &str, |
| nesting: &mut [NestingState], |
| ) -> Result<Fragment, ExpandError> { |
| macro_rules! binding_err { |
| ($($arg:tt)*) => { ExpandError::binding_error(format!($($arg)*)) }; |
| } |
| |
| let mut b = self.get(name)?; |
| for nesting_state in nesting.iter_mut() { |
| nesting_state.hit = true; |
| b = match b { |
| Binding::Fragment(_) => break, |
| Binding::Missing(_) => break, |
| Binding::Nested(bs) => bs.get(nesting_state.idx).ok_or_else(|| { |
| nesting_state.at_end = true; |
| binding_err!("could not find nested binding `{name}`") |
| })?, |
| Binding::Empty => { |
| nesting_state.at_end = true; |
| return Err(binding_err!("could not find empty binding `{name}`")); |
| } |
| }; |
| } |
| match b { |
| Binding::Fragment(it) => Ok(it.clone()), |
| // emit some reasonable default expansion for missing bindings, |
| // this gives better recovery than emitting the `$fragment-name` verbatim |
| Binding::Missing(it) => Ok(match it { |
| MetaVarKind::Stmt => { |
| Fragment::Tokens(tt::TokenTree::Leaf(tt::Leaf::Punct(tt::Punct { |
| span: tt::TokenId::unspecified(), |
| char: ';', |
| spacing: tt::Spacing::Alone, |
| }))) |
| } |
| MetaVarKind::Block => Fragment::Tokens(tt::TokenTree::Subtree(tt::Subtree { |
| delimiter: tt::Delimiter { |
| open: tt::TokenId::unspecified(), |
| close: tt::TokenId::unspecified(), |
| kind: tt::DelimiterKind::Brace, |
| }, |
| token_trees: vec![], |
| })), |
| // FIXME: Meta and Item should get proper defaults |
| MetaVarKind::Meta | MetaVarKind::Item | MetaVarKind::Tt | MetaVarKind::Vis => { |
| Fragment::Tokens(tt::TokenTree::Subtree(tt::Subtree { |
| delimiter: tt::Delimiter::UNSPECIFIED, |
| token_trees: vec![], |
| })) |
| } |
| MetaVarKind::Path |
| | MetaVarKind::Ty |
| | MetaVarKind::Pat |
| | MetaVarKind::PatParam |
| | MetaVarKind::Expr |
| | MetaVarKind::Ident => { |
| Fragment::Tokens(tt::TokenTree::Leaf(tt::Leaf::Ident(tt::Ident { |
| text: SmolStr::new_inline("missing"), |
| span: tt::TokenId::unspecified(), |
| }))) |
| } |
| MetaVarKind::Lifetime => { |
| Fragment::Tokens(tt::TokenTree::Leaf(tt::Leaf::Ident(tt::Ident { |
| text: SmolStr::new_inline("'missing"), |
| span: tt::TokenId::unspecified(), |
| }))) |
| } |
| MetaVarKind::Literal => { |
| Fragment::Tokens(tt::TokenTree::Leaf(tt::Leaf::Ident(tt::Ident { |
| text: SmolStr::new_inline("\"missing\""), |
| span: tt::TokenId::unspecified(), |
| }))) |
| } |
| }), |
| Binding::Nested(_) => { |
| Err(binding_err!("expected simple binding, found nested binding `{name}`")) |
| } |
| Binding::Empty => { |
| Err(binding_err!("expected simple binding, found empty binding `{name}`")) |
| } |
| } |
| } |
| } |
| |
| pub(super) fn transcribe( |
| template: &MetaTemplate, |
| bindings: &Bindings, |
| ) -> ExpandResult<tt::Subtree> { |
| let mut ctx = ExpandCtx { bindings, nesting: Vec::new() }; |
| let mut arena: Vec<tt::TokenTree> = Vec::new(); |
| expand_subtree(&mut ctx, template, None, &mut arena) |
| } |
| |
| #[derive(Debug)] |
| struct NestingState { |
| idx: usize, |
| /// `hit` is currently necessary to tell `expand_repeat` if it should stop |
| /// because there is no variable in use by the current repetition |
| hit: bool, |
| /// `at_end` is currently necessary to tell `expand_repeat` if it should stop |
| /// because there is no more value available for the current repetition |
| at_end: bool, |
| } |
| |
| #[derive(Debug)] |
| struct ExpandCtx<'a> { |
| bindings: &'a Bindings, |
| nesting: Vec<NestingState>, |
| } |
| |
| fn expand_subtree( |
| ctx: &mut ExpandCtx<'_>, |
| template: &MetaTemplate, |
| delimiter: Option<Delimiter>, |
| arena: &mut Vec<tt::TokenTree>, |
| ) -> ExpandResult<tt::Subtree> { |
| // remember how many elements are in the arena now - when returning, we want to drain exactly how many elements we added. This way, the recursive uses of the arena get their own "view" of the arena, but will reuse the allocation |
| let start_elements = arena.len(); |
| let mut err = None; |
| 'ops: for op in template.iter() { |
| match op { |
| Op::Literal(it) => arena.push(tt::Leaf::from(it.clone()).into()), |
| Op::Ident(it) => arena.push(tt::Leaf::from(it.clone()).into()), |
| Op::Punct(puncts) => { |
| for punct in puncts { |
| arena.push(tt::Leaf::from(*punct).into()); |
| } |
| } |
| Op::Subtree { tokens, delimiter } => { |
| let ExpandResult { value: tt, err: e } = |
| expand_subtree(ctx, tokens, Some(*delimiter), arena); |
| err = err.or(e); |
| arena.push(tt.into()); |
| } |
| Op::Var { name, id, .. } => { |
| let ExpandResult { value: fragment, err: e } = expand_var(ctx, name, *id); |
| err = err.or(e); |
| push_fragment(arena, fragment); |
| } |
| Op::Repeat { tokens: subtree, kind, separator } => { |
| let ExpandResult { value: fragment, err: e } = |
| expand_repeat(ctx, subtree, *kind, separator, arena); |
| err = err.or(e); |
| push_fragment(arena, fragment) |
| } |
| Op::Ignore { name, id } => { |
| // Expand the variable, but ignore the result. This registers the repetition count. |
| // FIXME: Any emitted errors are dropped. |
| expand_var(ctx, name, *id); |
| } |
| Op::Index { depth } => { |
| let index = |
| ctx.nesting.get(ctx.nesting.len() - 1 - depth).map_or(0, |nest| nest.idx); |
| arena.push( |
| tt::Leaf::Literal(tt::Literal { |
| text: index.to_string().into(), |
| span: tt::TokenId::unspecified(), |
| }) |
| .into(), |
| ); |
| } |
| Op::Count { name, depth } => { |
| let mut binding = match ctx.bindings.get(name.as_str()) { |
| Ok(b) => b, |
| Err(e) => { |
| if err.is_none() { |
| err = Some(e); |
| } |
| continue; |
| } |
| }; |
| for state in ctx.nesting.iter_mut() { |
| state.hit = true; |
| match binding { |
| Binding::Fragment(_) | Binding::Missing(_) => { |
| // `count()` will report an error. |
| break; |
| } |
| Binding::Nested(bs) => { |
| if let Some(b) = bs.get(state.idx) { |
| binding = b; |
| } else { |
| state.at_end = true; |
| continue 'ops; |
| } |
| } |
| Binding::Empty => { |
| state.at_end = true; |
| // FIXME: Breaking here and proceeding to `count()` isn't the most |
| // correct thing to do here. This could be a binding of some named |
| // fragment which we don't know the depth of, so `count()` will just |
| // return 0 for this no matter what `depth` is. See test |
| // `count_interaction_with_empty_binding` for example. |
| break; |
| } |
| } |
| } |
| |
| let c = match count(ctx, binding, 0, *depth) { |
| Ok(c) => c, |
| Err(e) => { |
| // XXX: It *might* make sense to emit a dummy integer value like `0` here. |
| // That would type inference a bit more robust in cases like |
| // `v[${count(t)}]` where index doesn't matter, but also coult also lead to |
| // wrong infefrence for cases like `tup.${count(t)}` where index itself |
| // does matter. |
| if err.is_none() { |
| err = Some(e.into()); |
| } |
| continue; |
| } |
| }; |
| arena.push( |
| tt::Leaf::Literal(tt::Literal { |
| text: c.to_string().into(), |
| span: tt::TokenId::unspecified(), |
| }) |
| .into(), |
| ); |
| } |
| } |
| } |
| // drain the elements added in this instance of expand_subtree |
| let tts = arena.drain(start_elements..).collect(); |
| ExpandResult { |
| value: tt::Subtree { |
| delimiter: delimiter.unwrap_or_else(tt::Delimiter::unspecified), |
| token_trees: tts, |
| }, |
| err, |
| } |
| } |
| |
| fn expand_var(ctx: &mut ExpandCtx<'_>, v: &SmolStr, id: tt::TokenId) -> ExpandResult<Fragment> { |
| // We already handle $crate case in mbe parser |
| debug_assert!(v != "crate"); |
| |
| if !ctx.bindings.contains(v) { |
| // Note that it is possible to have a `$var` inside a macro which is not bound. |
| // For example: |
| // ``` |
| // macro_rules! foo { |
| // ($a:ident, $b:ident, $c:tt) => { |
| // macro_rules! bar { |
| // ($bi:ident) => { |
| // fn $bi() -> u8 {$c} |
| // } |
| // } |
| // } |
| // ``` |
| // We just treat it a normal tokens |
| let tt = tt::Subtree { |
| delimiter: tt::Delimiter::UNSPECIFIED, |
| token_trees: vec![ |
| tt::Leaf::from(tt::Punct { char: '$', spacing: tt::Spacing::Alone, span: id }) |
| .into(), |
| tt::Leaf::from(tt::Ident { text: v.clone(), span: id }).into(), |
| ], |
| } |
| .into(); |
| ExpandResult::ok(Fragment::Tokens(tt)) |
| } else { |
| ctx.bindings.get_fragment(v, &mut ctx.nesting).map_or_else( |
| |e| ExpandResult { |
| value: Fragment::Tokens(tt::TokenTree::Subtree(tt::Subtree::empty())), |
| err: Some(e), |
| }, |
| ExpandResult::ok, |
| ) |
| } |
| } |
| |
| fn expand_repeat( |
| ctx: &mut ExpandCtx<'_>, |
| template: &MetaTemplate, |
| kind: RepeatKind, |
| separator: &Option<Separator>, |
| arena: &mut Vec<tt::TokenTree>, |
| ) -> ExpandResult<Fragment> { |
| let mut buf: Vec<tt::TokenTree> = Vec::new(); |
| ctx.nesting.push(NestingState { idx: 0, at_end: false, hit: false }); |
| // Dirty hack to make macro-expansion terminate. |
| // This should be replaced by a proper macro-by-example implementation |
| let limit = 65536; |
| let mut has_seps = 0; |
| let mut counter = 0; |
| let mut err = None; |
| |
| loop { |
| let ExpandResult { value: mut t, err: e } = expand_subtree(ctx, template, None, arena); |
| let nesting_state = ctx.nesting.last_mut().unwrap(); |
| if nesting_state.at_end || !nesting_state.hit { |
| break; |
| } |
| nesting_state.idx += 1; |
| nesting_state.hit = false; |
| |
| counter += 1; |
| if counter == limit { |
| tracing::warn!( |
| "expand_tt in repeat pattern exceed limit => {:#?}\n{:#?}", |
| template, |
| ctx |
| ); |
| return ExpandResult { |
| value: Fragment::Tokens( |
| tt::Subtree { delimiter: tt::Delimiter::unspecified(), token_trees: vec![] } |
| .into(), |
| ), |
| err: Some(ExpandError::LimitExceeded), |
| }; |
| } |
| |
| if e.is_some() { |
| err = err.or(e); |
| continue; |
| } |
| |
| t.delimiter = tt::Delimiter::unspecified(); |
| push_subtree(&mut buf, t); |
| |
| if let Some(sep) = separator { |
| has_seps = match sep { |
| Separator::Ident(ident) => { |
| buf.push(tt::Leaf::from(ident.clone()).into()); |
| 1 |
| } |
| Separator::Literal(lit) => { |
| buf.push(tt::Leaf::from(lit.clone()).into()); |
| 1 |
| } |
| Separator::Puncts(puncts) => { |
| for &punct in puncts { |
| buf.push(tt::Leaf::from(punct).into()); |
| } |
| puncts.len() |
| } |
| }; |
| } |
| |
| if RepeatKind::ZeroOrOne == kind { |
| break; |
| } |
| } |
| |
| ctx.nesting.pop().unwrap(); |
| for _ in 0..has_seps { |
| buf.pop(); |
| } |
| |
| // Check if it is a single token subtree without any delimiter |
| // e.g {Delimiter:None> ['>'] /Delimiter:None>} |
| let tt = tt::Subtree { delimiter: tt::Delimiter::unspecified(), token_trees: buf }.into(); |
| |
| if RepeatKind::OneOrMore == kind && counter == 0 { |
| return ExpandResult { |
| value: Fragment::Tokens(tt), |
| err: Some(ExpandError::UnexpectedToken), |
| }; |
| } |
| ExpandResult { value: Fragment::Tokens(tt), err } |
| } |
| |
| fn push_fragment(buf: &mut Vec<tt::TokenTree>, fragment: Fragment) { |
| match fragment { |
| Fragment::Tokens(tt::TokenTree::Subtree(tt)) => push_subtree(buf, tt), |
| Fragment::Expr(tt::TokenTree::Subtree(mut tt)) => { |
| if tt.delimiter.kind == tt::DelimiterKind::Invisible { |
| tt.delimiter = tt::Delimiter { |
| open: tt::TokenId::UNSPECIFIED, |
| close: tt::TokenId::UNSPECIFIED, |
| kind: tt::DelimiterKind::Parenthesis, |
| }; |
| } |
| buf.push(tt.into()) |
| } |
| Fragment::Path(tt::TokenTree::Subtree(tt)) => fix_up_and_push_path_tt(buf, tt), |
| Fragment::Tokens(tt) | Fragment::Expr(tt) | Fragment::Path(tt) => buf.push(tt), |
| } |
| } |
| |
| fn push_subtree(buf: &mut Vec<tt::TokenTree>, tt: tt::Subtree) { |
| match tt.delimiter.kind { |
| tt::DelimiterKind::Invisible => buf.extend(tt.token_trees), |
| _ => buf.push(tt.into()), |
| } |
| } |
| |
| /// Inserts the path separator `::` between an identifier and its following generic |
| /// argument list, and then pushes into the buffer. See [`Fragment::Path`] for why |
| /// we need this fixup. |
| fn fix_up_and_push_path_tt(buf: &mut Vec<tt::TokenTree>, subtree: tt::Subtree) { |
| stdx::always!(matches!(subtree.delimiter.kind, tt::DelimiterKind::Invisible)); |
| let mut prev_was_ident = false; |
| // Note that we only need to fix up the top-level `TokenTree`s because the |
| // context of the paths in the descendant `Subtree`s won't be changed by the |
| // mbe transcription. |
| for tt in subtree.token_trees { |
| if prev_was_ident { |
| // Pedantically, `(T) -> U` in `FnOnce(T) -> U` is treated as a generic |
| // argument list and thus needs `::` between it and `FnOnce`. However in |
| // today's Rust this type of path *semantically* cannot appear as a |
| // top-level expression-context path, so we can safely ignore it. |
| if let tt::TokenTree::Leaf(tt::Leaf::Punct(tt::Punct { char: '<', .. })) = tt { |
| buf.push( |
| tt::Leaf::Punct(tt::Punct { |
| char: ':', |
| spacing: tt::Spacing::Joint, |
| span: tt::Span::unspecified(), |
| }) |
| .into(), |
| ); |
| buf.push( |
| tt::Leaf::Punct(tt::Punct { |
| char: ':', |
| spacing: tt::Spacing::Alone, |
| span: tt::Span::unspecified(), |
| }) |
| .into(), |
| ); |
| } |
| } |
| prev_was_ident = matches!(tt, tt::TokenTree::Leaf(tt::Leaf::Ident(_))); |
| buf.push(tt); |
| } |
| } |
| |
| /// Handles `${count(t, depth)}`. `our_depth` is the recursion depth and `count_depth` is the depth |
| /// defined by the metavar expression. |
| fn count( |
| ctx: &ExpandCtx<'_>, |
| binding: &Binding, |
| our_depth: usize, |
| count_depth: Option<usize>, |
| ) -> Result<usize, CountError> { |
| match binding { |
| Binding::Nested(bs) => match count_depth { |
| None => bs.iter().map(|b| count(ctx, b, our_depth + 1, None)).sum(), |
| Some(0) => Ok(bs.len()), |
| Some(d) => bs.iter().map(|b| count(ctx, b, our_depth + 1, Some(d - 1))).sum(), |
| }, |
| Binding::Empty => Ok(0), |
| Binding::Fragment(_) | Binding::Missing(_) => { |
| if our_depth == 0 { |
| // `${count(t)}` is placed inside the innermost repetition. This includes cases |
| // where `t` is not a repeated fragment. |
| Err(CountError::Misplaced) |
| } else if count_depth.is_none() { |
| Ok(1) |
| } else { |
| // We've reached at the innermost repeated fragment, but the user wants us to go |
| // further! |
| Err(CountError::OutOfBounds) |
| } |
| } |
| } |
| } |
