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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
|
extern crate askama_shared as shared;
#[macro_use]
extern crate nom;
extern crate proc_macro;
extern crate proc_macro2;
#[macro_use]
extern crate quote;
extern crate syn;
mod generator;
mod input;
mod parser;
use input::{Print, Source, TemplateInput};
use parser::{Expr, Macro, Node};
use proc_macro::TokenStream;
use shared::path;
use std::collections::HashMap;
use std::path::PathBuf;
#[proc_macro_derive(Template, attributes(template))]
pub fn derive_template(input: TokenStream) -> TokenStream {
let ast: syn::DeriveInput = syn::parse(input).unwrap();
match ast.data {
syn::Data::Struct(ref data) => data,
_ => panic!("#[derive(Template)] can only be used with structs"),
};
build_template(&ast).parse().unwrap()
}
/// Takes a `syn::DeriveInput` and generates source code for it
///
/// Reads the metadata from the `template()` attribute to get the template
/// metadata, then fetches the source from the filesystem. The source is
/// parsed, and the parse tree is fed to the code generator. Will print
/// the parse tree and/or generated source according to the `print` key's
/// value as passed to the `template()` attribute.
fn build_template(ast: &syn::DeriveInput) -> String {
let input = input::TemplateInput::new(ast);
let source: String = match input.source {
Source::Source(ref s) => s.clone(),
Source::Path(_) => path::get_template_source(&input.path),
};
let mut sources = HashMap::new();
find_used_templates(&mut sources, input.path.clone(), source);
let mut parsed = HashMap::new();
for (path, src) in &sources {
parsed.insert(path, parser::parse(src));
}
let mut contexts = HashMap::new();
for (path, nodes) in &parsed {
contexts.insert(*path, Context::new(path, nodes));
}
if input.print == Print::Ast || input.print == Print::All {
println!("{:?}", parsed[&input.path]);
}
let code = generator::generate(&input, &contexts);
if input.print == Print::Code || input.print == Print::All {
println!("{}", code);
}
code
}
fn find_used_templates(map: &mut HashMap<PathBuf, String>, path: PathBuf, source: String) {
let mut check = vec![(path, source)];
while let Some((path, source)) = check.pop() {
for n in parser::parse(&source) {
match n {
Node::Extends(Expr::StrLit(extends)) => {
let extends = path::find_template_from_path(extends, Some(&path));
let source = path::get_template_source(&extends);
check.push((extends, source));
}
Node::Import(_, import, _) => {
let import = path::find_template_from_path(import, Some(&path));
let source = path::get_template_source(&import);
check.push((import, source));
}
_ => {}
}
}
map.insert(path, source);
}
}
pub(crate) struct Context<'a> {
nodes: &'a [Node<'a>],
extends: Option<PathBuf>,
blocks: HashMap<&'a str, &'a Node<'a>>,
macros: HashMap<&'a str, &'a Macro<'a>>,
imports: HashMap<&'a str, PathBuf>,
}
impl<'a> Context<'a> {
fn new<'n>(path: &PathBuf, nodes: &'n [Node<'n>]) -> Context<'n> {
let mut extends = None;
let mut blocks = Vec::new();
let mut macros = HashMap::new();
let mut imports = HashMap::new();
for n in nodes {
match n {
Node::Extends(Expr::StrLit(extends_path)) => match extends {
Some(_) => panic!("multiple extend blocks found"),
None => {
extends = Some(path::find_template_from_path(extends_path, Some(path)));
}
},
def @ Node::BlockDef(_, _, _, _) => {
blocks.push(def);
}
Node::Macro(name, m) => {
macros.insert(*name, m);
}
Node::Import(_, import_path, scope) => {
let path = path::find_template_from_path(import_path, Some(path));
imports.insert(*scope, path);
}
_ => {}
}
}
let mut check_nested = 0;
let mut nested_blocks = Vec::new();
while check_nested < blocks.len() {
if let Node::BlockDef(_, _, ref nodes, _) = blocks[check_nested] {
for n in nodes {
if let def @ Node::BlockDef(_, _, _, _) = n {
nested_blocks.push(def);
}
}
} else {
panic!("non block found in list of blocks");
}
blocks.append(&mut nested_blocks);
check_nested += 1;
}
let blocks: HashMap<_, _> = blocks
.iter()
.map(|def| {
if let Node::BlockDef(_, name, _, _) = def {
(*name, *def)
} else {
unreachable!()
}
})
.collect();
Context {
nodes,
extends,
blocks,
macros,
imports,
}
}
}
|
