Syn is a parsing library for parsing a stream of Rust tokens into a syntax tree of Rust source code.
Currently this library is geared toward use in Rust procedural macros, but contains some APIs that may be useful more generally.
Data structures — Syn provides a complete syntax tree that can
represent any valid Rust source code. The syntax tree is rooted at
syn::File
which represents a full source file, but there are other
entry points that may be useful to procedural macros including
syn::Item
, syn::Expr
and syn::Type
.
Derives — Of particular interest to derive macros is
syn::DeriveInput
which is any of the three legal input items to a
derive macro. An example below shows using this type in a library that can
derive implementations of a user-defined trait.
Parsing — Parsing in Syn is built around parser functions with the
signature fn(ParseStream) -> Result<T>
. Every syntax tree node defined
by Syn is individually parsable and may be used as a building block for
custom syntaxes, or you may dream up your own brand new syntax without
involving any of our syntax tree types.
Location information — Every token parsed by Syn is associated with a
Span
that tracks line and column information back to the source of that
token. These spans allow a procedural macro to display detailed error
messages pointing to all the right places in the user’s code. There is an
example of this below.
Feature flags — Functionality is aggressively feature gated so your procedural macros enable only what they need, and do not pay in compile time for all the rest.
The canonical derive macro using Syn looks like this. We write an ordinary
Rust function tagged with a proc_macro_derive
attribute and the name of
the trait we are deriving. Any time that derive appears in the user’s code,
the Rust compiler passes their data structure as tokens into our macro. We
get to execute arbitrary Rust code to figure out what to do with those
tokens, then hand some tokens back to the compiler to compile into the
user’s crate.
[dependencies]
syn = "2.0"
quote = "1.0"
[lib]
proc-macro = true
use proc_macro::TokenStream;
use quote::quote;
use syn::{parse_macro_input, DeriveInput};
#[proc_macro_derive(MyMacro)]
pub fn my_macro(input: TokenStream) -> TokenStream {
// Parse the input tokens into a syntax tree
let input = parse_macro_input!(input as DeriveInput);
// Build the output, possibly using quasi-quotation
let expanded = quote! {
// ...
};
// Hand the output tokens back to the compiler
TokenStream::from(expanded)
}
The heapsize
example directory shows a complete working implementation
of a derive macro. The example derives a HeapSize
trait which computes an
estimate of the amount of heap memory owned by a value.
pub trait HeapSize {
/// Total number of bytes of heap memory owned by `self`.
fn heap_size_of_children(&self) -> usize;
}
The derive macro allows users to write #[derive(HeapSize)]
on data
structures in their program.
#[derive(HeapSize)]
struct Demo<'a, T: ?Sized> {
a: Box<T>,
b: u8,
c: &'a str,
d: String,
}
The token-based procedural macro API provides great control over where the
compiler’s error messages are displayed in user code. Consider the error the
user sees if one of their field types does not implement HeapSize
.
#[derive(HeapSize)]
struct Broken {
ok: String,
bad: std::thread::Thread,
}
By tracking span information all the way through the expansion of a
procedural macro as shown in the heapsize
example, token-based macros in
Syn are able to trigger errors that directly pinpoint the source of the
problem.
error[E0277]: the trait bound `std::thread::Thread: HeapSize` is not satisfied
--> src/main.rs:7:5
|
7 | bad: std::thread::Thread,
| ^^^^^^^^^^^^^^^^^^^^^^^^ the trait `HeapSize` is not implemented for `Thread`
The lazy-static
example directory shows the implementation of a
functionlike!(...)
procedural macro in which the input tokens are parsed
using Syn’s parsing API.
The example reimplements the popular lazy_static
crate from crates.io as a
procedural macro.
lazy_static! {
static ref USERNAME: Regex = Regex::new("^[a-z0-9_-]{3,16}$").unwrap();
}
The implementation shows how to trigger custom warnings and error messages on the macro input.
warning: come on, pick a more creative name
--> src/main.rs:10:16
|
10 | static ref FOO: String = "lazy_static".to_owned();
| ^^^
When testing macros, we often care not just that the macro can be used
successfully but also that when the macro is provided with invalid input it
produces maximally helpful error messages. Consider using the trybuild
crate to write tests for errors that are emitted by your macro or errors
detected by the Rust compiler in the expanded code following misuse of the
macro. Such tests help avoid regressions from later refactors that
mistakenly make an error no longer trigger or be less helpful than it used
to be.
When developing a procedural macro it can be helpful to look at what the
generated code looks like. Use cargo rustc -- -Zunstable-options --pretty=expanded
or the cargo expand
subcommand.
To show the expanded code for some crate that uses your procedural macro,
run cargo expand
from that crate. To show the expanded code for one of
your own test cases, run cargo expand --test the_test_case
where the last
argument is the name of the test file without the .rs
extension.
This write-up by Brandon W Maister discusses debugging in more detail: Debugging Rust’s new Custom Derive system.
Syn puts a lot of functionality behind optional features in order to optimize compile time for the most common use cases. The following features are available.
derive
(enabled by default) — Data structures for representing the
possible input to a derive macro, including structs and enums and types.full
— Data structures for representing the syntax tree of all valid
Rust source code, including items and expressions.parsing
(enabled by default) — Ability to parse input tokens into
a syntax tree node of a chosen type.printing
(enabled by default) — Ability to print a syntax tree
node as tokens of Rust source code.visit
— Trait for traversing a syntax tree.visit-mut
— Trait for traversing and mutating in place a syntax
tree.fold
— Trait for transforming an owned syntax tree.clone-impls
(enabled by default) — Clone impls for all syntax tree
types.extra-traits
— Debug, Eq, PartialEq, Hash impls for all syntax tree
types.proc-macro
(enabled by default) — Runtime dependency on the
dynamic library libproc_macro from rustc toolchain.Attribute
.Span
of the complete contents of a syntax
tree node.quote!
macro but uses
type inference to figure out a return type for those tokens.parse_quote!
+ quote_spanned!
.extern "C"
.<K, V>
in HashMap<K, V>
.match
expression: 0..=10 => { return true; }
.PANIC = false
in
Trait<PANIC = false>
.Item = u8
in Iterator<Item = u8>
.#[repr(transparent)]
.usize
in fn(usize) -> bool
.fn(usize, ...)
.for<'a, 'b, 'c>
.const LENGTH: usize
.Iterator<Item: Display>
.proc_macro_derive
macro.proc_macro_derive
macro.proc_macro_derive
macro.proc_macro_derive
macro.[a, b, c, d]
.a = compute()
.async { ... }
.fut.await
.a + b
, a += b
.{ ... }
.break
, with an optional label to break and an optional
expression.invoke(a, b)
.foo as f64
.|a, b| a + b
.const { ... }
.continue
, with an optional label.obj.k
) or unnamed tuple struct
field (obj.0
).for pat in expr { ... }
.if
expression with an optional else
block: if expr { ... } else { ... }
.vector[2]
._
.let
guard: let Some(x) = opt
.1
, "foo"
.loop { ... }
.format!("{}", q)
.match
expression: match n { Some(n) => {}, None => {} }
.x.foo::<T>(a, b)
.(a + b)
.std::mem::replace
possibly containing generic
parameters and a qualified self-type.1..2
, 1..
, ..2
, 1..=2
, ..=2
.&a
or &mut a
.[0u8; N]
.return
, with an optional value to be returned.Point { x: 1, y: 1 }
.expr?
.try { ... }
.(a, b, c, d)
.!x
, *x
.unsafe { ... }
.while expr { ... }
.yield expr
.Point { x: f64, y: f64 }
.Some(T)
.extern
block.extern
block: static ext: u8
.extern
block: type void
.Generics::split_for_impl
.const MAX: u16 = 65535
.enum Foo<A, B> { A(A), B(B) }
.extern crate
item: extern crate serde
.fn process(n: usize) -> Result<()> { ... }
.extern "C" { ... }
.impl<A> Trait for Data<A> { ... }
.macro_rules!
definitions.mod m
or mod m { ... }
.static BIKE: Shed = Shed(42)
.struct Foo<A> { x: A }
.pub trait Iterator { ... }
.pub trait SharableIterator = Iterator + Sync
.type Result<T> = std::result::Result<T, MyError>
.union Foo<A, B> { x: A, y: B }
.use std::collections::HashMap
.for
, while
, or loop
.'a
.'a: 'b + 'c + 'd
.true
or false
.b'f'
.b"foo"
.'a'
.1f64
or 1.0e10f64
.1
or 1u16
."foo"
.let
binding: let x: u64 = s.parse()?
.let
binding, including optional
diverging else
block.println!("{}", mac)
.derive(Copy, Clone)
.feature = "nightly"
.(A, B) -> C
in Fn(A,B) -> C
.const { ... }
.ref mut binding @ SUBPATTERN
.1
, "foo"
.format!("{}", q)
.(A | B)
.std::mem::replace
possibly containing generic
parameters and a qualified self-type.1..2
, 1..
, ..2
, 1..=2
, ..=2
.&mut var
.[0, 1, ..]
.[a, b, ref i @ .., y, z]
.Variant { x, y, .. }
.(a, b)
.Variant(x, y, .., z)
.foo: f64
._
.std::collections::HashMap
).where
clause: 'a: 'b + 'c
.where
clause: for<'c> Foo<'c>: Trait<'c>
.T
in <T as Display>::fmt
.self
argument of an associated method.unsafe fn initialize(&self)
.TypeGenerics::as_turbofish
.[T; n]
.fn(usize) -> bool
.Generics::split_for_impl
.impl Bound1 + Bound2 + Bound3
type where Bound
is a trait or
a lifetime._
.!
.T: Into<String>
.std::slice::Iter
, optionally qualified with a
self-type as in <Vec<T> as SomeTrait>::Associated
.*const T
or *mut T
.&'a T
or &'a mut T
.[T]
.dyn Bound1 + Bound2 + Bound3
where Bound
is a
trait or a lifetime.(A, B, C, String)
.use
item: *
.use
item: {A, B, C}
.use
item: HashMap
.use
item: std::...
.use
item: HashMap as Map
.pub(self)
or
pub(super)
or pub(crate)
or pub(in some::module)
.where
clause in a definition: where T: Deserialize<'de>, D: 'static
.+
, +=
, &
.n: usize
in fn f(n: usize)
.extern
block.'a
, T
, or Item = T
.T: Into<String>
,
'a: 'b
, const LEN: usize
.m!(...)
or m!{...}
or m![...]
.Item::Static
or ForeignItem::Static
.r##"data"##
.?
in
?Sized
.*
, !
, -
.use
item: Type as Renamed
or *
.pub
or
pub(restricted)
.where
clause: T: Deserialize<'de>
.